Lines Matching refs:wordsFound
258 uint32_t wordsFound = 0; in divideUpDictionaryRange() local
272 … int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
276 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
277 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
278 wordsFound += 1; in divideUpDictionaryRange()
288 … if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
291 words[wordsFound%THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
303 … if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
304 words[wordsFound % THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
308 while (words[(wordsFound + 1) % THAI_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
311 while (words[wordsFound % THAI_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
314 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
315 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
316 wordsFound += 1; in divideUpDictionaryRange()
330 if (words[wordsFound % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
332 … || words[wordsFound%THAI_LOOKAHEAD].longestPrefix() < THAI_PREFIX_COMBINE_THRESHOLD)) { in divideUpDictionaryRange()
353 …int32_t candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeE… in divideUpDictionaryRange()
363 wordsFound += 1; in divideUpDictionaryRange()
387 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
431 wordsFound -= 1; in divideUpDictionaryRange()
434 return wordsFound; in divideUpDictionaryRange()
493 uint32_t wordsFound = 0; in divideUpDictionaryRange() local
507 … int32_t candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
511 cuWordLength = words[wordsFound % LAO_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
512 cpWordLength = words[wordsFound % LAO_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
513 wordsFound += 1; in divideUpDictionaryRange()
523 … if (words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
526 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
538 … if (words[(wordsFound + 2) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
539 words[wordsFound % LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
543 while (words[(wordsFound + 1) % LAO_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
546 while (words[wordsFound % LAO_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
548 cuWordLength = words[wordsFound % LAO_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
549 cpWordLength = words[wordsFound % LAO_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
550 wordsFound += 1; in divideUpDictionaryRange()
562 if (words[wordsFound % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
564 … || words[wordsFound%LAO_LOOKAHEAD].longestPrefix() < LAO_PREFIX_COMBINE_THRESHOLD)) { in divideUpDictionaryRange()
583 …int32_t candidates = words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEn… in divideUpDictionaryRange()
593 wordsFound += 1; in divideUpDictionaryRange()
627 wordsFound -= 1; in divideUpDictionaryRange()
630 return wordsFound; in divideUpDictionaryRange()
686 uint32_t wordsFound = 0; in divideUpDictionaryRange() local
700 … int32_t candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
704 cuWordLength = words[wordsFound % BURMESE_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
705 cpWordLength = words[wordsFound % BURMESE_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
706 wordsFound += 1; in divideUpDictionaryRange()
716 … if (words[(wordsFound + 1) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
719 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
731 … if (words[(wordsFound + 2) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
732 words[wordsFound % BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
736 while (words[(wordsFound + 1) % BURMESE_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
739 while (words[wordsFound % BURMESE_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
741 cuWordLength = words[wordsFound % BURMESE_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
742 cpWordLength = words[wordsFound % BURMESE_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
743 wordsFound += 1; in divideUpDictionaryRange()
755 if (words[wordsFound % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
757 … || words[wordsFound%BURMESE_LOOKAHEAD].longestPrefix() < BURMESE_PREFIX_COMBINE_THRESHOLD)) { in divideUpDictionaryRange()
776 …int32_t candidates = words[(wordsFound + 1) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, ran… in divideUpDictionaryRange()
786 wordsFound += 1; in divideUpDictionaryRange()
820 wordsFound -= 1; in divideUpDictionaryRange()
823 return wordsFound; in divideUpDictionaryRange()
891 uint32_t wordsFound = 0; in divideUpDictionaryRange() local
905 … int32_t candidates = words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
909 cuWordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
910 cpWordLength = words[wordsFound % KHMER_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
911 wordsFound += 1; in divideUpDictionaryRange()
922 … if (words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
925 words[wordsFound % KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
937 … if (words[(wordsFound + 2) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
938 words[wordsFound % KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
942 while (words[(wordsFound + 1) % KHMER_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
945 while (words[wordsFound % KHMER_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
947 cuWordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
948 cpWordLength = words[wordsFound % KHMER_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
949 wordsFound += 1; in divideUpDictionaryRange()
961 if (words[wordsFound % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
963 … || words[wordsFound % KHMER_LOOKAHEAD].longestPrefix() < KHMER_PREFIX_COMBINE_THRESHOLD)) { in divideUpDictionaryRange()
981 …int32_t candidates = words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, range… in divideUpDictionaryRange()
991 wordsFound += 1; in divideUpDictionaryRange()
1057 wordsFound -= 1; in divideUpDictionaryRange()
1060 return wordsFound; in divideUpDictionaryRange()