Lines Matching refs:wordsFound
260 uint32_t wordsFound = 0; in divideUpDictionaryRange() local
274 … int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
278 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
279 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
280 wordsFound += 1; in divideUpDictionaryRange()
290 … if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
293 words[wordsFound%THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
305 … if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
306 words[wordsFound % THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
310 while (words[(wordsFound + 1) % THAI_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
313 while (words[wordsFound % THAI_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
316 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
317 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
318 wordsFound += 1; in divideUpDictionaryRange()
332 if (words[wordsFound % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
334 … || words[wordsFound%THAI_LOOKAHEAD].longestPrefix() < THAI_PREFIX_COMBINE_THRESHOLD)) { in divideUpDictionaryRange()
355 …int32_t candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeE… in divideUpDictionaryRange()
365 wordsFound += 1; in divideUpDictionaryRange()
389 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
433 wordsFound -= 1; in divideUpDictionaryRange()
436 return wordsFound; in divideUpDictionaryRange()
495 uint32_t wordsFound = 0; in divideUpDictionaryRange() local
509 … int32_t candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
513 cuWordLength = words[wordsFound % LAO_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
514 cpWordLength = words[wordsFound % LAO_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
515 wordsFound += 1; in divideUpDictionaryRange()
525 … if (words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
528 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
540 … if (words[(wordsFound + 2) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
541 words[wordsFound % LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
545 while (words[(wordsFound + 1) % LAO_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
548 while (words[wordsFound % LAO_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
550 cuWordLength = words[wordsFound % LAO_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
551 cpWordLength = words[wordsFound % LAO_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
552 wordsFound += 1; in divideUpDictionaryRange()
564 if (words[wordsFound % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
566 … || words[wordsFound%LAO_LOOKAHEAD].longestPrefix() < LAO_PREFIX_COMBINE_THRESHOLD)) { in divideUpDictionaryRange()
585 …int32_t candidates = words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEn… in divideUpDictionaryRange()
595 wordsFound += 1; in divideUpDictionaryRange()
629 wordsFound -= 1; in divideUpDictionaryRange()
632 return wordsFound; in divideUpDictionaryRange()
688 uint32_t wordsFound = 0; in divideUpDictionaryRange() local
702 … int32_t candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
706 cuWordLength = words[wordsFound % BURMESE_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
707 cpWordLength = words[wordsFound % BURMESE_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
708 wordsFound += 1; in divideUpDictionaryRange()
718 … if (words[(wordsFound + 1) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
721 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
733 … if (words[(wordsFound + 2) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
734 words[wordsFound % BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
738 while (words[(wordsFound + 1) % BURMESE_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
741 while (words[wordsFound % BURMESE_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
743 cuWordLength = words[wordsFound % BURMESE_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
744 cpWordLength = words[wordsFound % BURMESE_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
745 wordsFound += 1; in divideUpDictionaryRange()
757 if (words[wordsFound % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
759 … || words[wordsFound%BURMESE_LOOKAHEAD].longestPrefix() < BURMESE_PREFIX_COMBINE_THRESHOLD)) { in divideUpDictionaryRange()
778 …int32_t candidates = words[(wordsFound + 1) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, ran… in divideUpDictionaryRange()
788 wordsFound += 1; in divideUpDictionaryRange()
822 wordsFound -= 1; in divideUpDictionaryRange()
825 return wordsFound; in divideUpDictionaryRange()
893 uint32_t wordsFound = 0; in divideUpDictionaryRange() local
907 … int32_t candidates = words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
911 cuWordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
912 cpWordLength = words[wordsFound % KHMER_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
913 wordsFound += 1; in divideUpDictionaryRange()
924 … if (words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
927 words[wordsFound % KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
939 … if (words[(wordsFound + 2) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
940 words[wordsFound % KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
944 while (words[(wordsFound + 1) % KHMER_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
947 while (words[wordsFound % KHMER_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
949 cuWordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
950 cpWordLength = words[wordsFound % KHMER_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
951 wordsFound += 1; in divideUpDictionaryRange()
963 if (words[wordsFound % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
965 … || words[wordsFound % KHMER_LOOKAHEAD].longestPrefix() < KHMER_PREFIX_COMBINE_THRESHOLD)) { in divideUpDictionaryRange()
983 …int32_t candidates = words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, range… in divideUpDictionaryRange()
993 wordsFound += 1; in divideUpDictionaryRange()
1059 wordsFound -= 1; in divideUpDictionaryRange()
1062 return wordsFound; in divideUpDictionaryRange()