Lines Matching refs:wordsFound
233 uint32_t wordsFound = 0; in divideUpDictionaryRange() local
247 … int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
251 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
252 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
253 wordsFound += 1; in divideUpDictionaryRange()
263 … if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
266 words[wordsFound%THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
278 … if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
279 words[wordsFound % THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
283 while (words[(wordsFound + 1) % THAI_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
286 while (words[wordsFound % THAI_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
289 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
290 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
291 wordsFound += 1; in divideUpDictionaryRange()
305 if (words[wordsFound % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
307 … || words[wordsFound%THAI_LOOKAHEAD].longestPrefix() < THAI_PREFIX_COMBINE_THRESHOLD)) { in divideUpDictionaryRange()
328 …int32_t num_candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, ra… in divideUpDictionaryRange()
338 wordsFound += 1; in divideUpDictionaryRange()
362 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
406 wordsFound -= 1; in divideUpDictionaryRange()
409 return wordsFound; in divideUpDictionaryRange()
468 uint32_t wordsFound = 0; in divideUpDictionaryRange() local
482 … int32_t candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
486 cuWordLength = words[wordsFound % LAO_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
487 cpWordLength = words[wordsFound % LAO_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
488 wordsFound += 1; in divideUpDictionaryRange()
498 … if (words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
501 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
513 … if (words[(wordsFound + 2) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
514 words[wordsFound % LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
518 while (words[(wordsFound + 1) % LAO_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
521 while (words[wordsFound % LAO_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
523 cuWordLength = words[wordsFound % LAO_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
524 cpWordLength = words[wordsFound % LAO_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
525 wordsFound += 1; in divideUpDictionaryRange()
537 if (words[wordsFound % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
539 … || words[wordsFound%LAO_LOOKAHEAD].longestPrefix() < LAO_PREFIX_COMBINE_THRESHOLD)) { in divideUpDictionaryRange()
558 …int32_t num_candidates = words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, ran… in divideUpDictionaryRange()
568 wordsFound += 1; in divideUpDictionaryRange()
602 wordsFound -= 1; in divideUpDictionaryRange()
605 return wordsFound; in divideUpDictionaryRange()
661 uint32_t wordsFound = 0; in divideUpDictionaryRange() local
675 … int32_t candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
679 cuWordLength = words[wordsFound % BURMESE_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
680 cpWordLength = words[wordsFound % BURMESE_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
681 wordsFound += 1; in divideUpDictionaryRange()
691 … if (words[(wordsFound + 1) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
694 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
706 … if (words[(wordsFound + 2) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
707 words[wordsFound % BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
711 while (words[(wordsFound + 1) % BURMESE_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
714 while (words[wordsFound % BURMESE_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
716 cuWordLength = words[wordsFound % BURMESE_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
717 cpWordLength = words[wordsFound % BURMESE_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
718 wordsFound += 1; in divideUpDictionaryRange()
730 if (words[wordsFound % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
732 … || words[wordsFound%BURMESE_LOOKAHEAD].longestPrefix() < BURMESE_PREFIX_COMBINE_THRESHOLD)) { in divideUpDictionaryRange()
751 …int32_t num_candidates = words[(wordsFound + 1) % BURMESE_LOOKAHEAD].candidates(text, fDictionary,… in divideUpDictionaryRange()
761 wordsFound += 1; in divideUpDictionaryRange()
795 wordsFound -= 1; in divideUpDictionaryRange()
798 return wordsFound; in divideUpDictionaryRange()
866 uint32_t wordsFound = 0; in divideUpDictionaryRange() local
880 … int32_t candidates = words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
884 cuWordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
885 cpWordLength = words[wordsFound % KHMER_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
886 wordsFound += 1; in divideUpDictionaryRange()
897 … if (words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
900 words[wordsFound % KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
912 … if (words[(wordsFound + 2) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
913 words[wordsFound % KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
917 while (words[(wordsFound + 1) % KHMER_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
920 while (words[wordsFound % KHMER_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
922 cuWordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
923 cpWordLength = words[wordsFound % KHMER_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
924 wordsFound += 1; in divideUpDictionaryRange()
936 if (words[wordsFound % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
938 … || words[wordsFound % KHMER_LOOKAHEAD].longestPrefix() < KHMER_PREFIX_COMBINE_THRESHOLD)) { in divideUpDictionaryRange()
956 …int32_t num_candidates = words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, r… in divideUpDictionaryRange()
966 wordsFound += 1; in divideUpDictionaryRange()
1032 wordsFound -= 1; in divideUpDictionaryRange()
1035 return wordsFound; in divideUpDictionaryRange()