Lines Matching refs:wordsFound
246 uint32_t wordsFound = 0;
259 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
263 wordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
264 wordsFound += 1;
274 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
277 words[wordsFound%THAI_LOOKAHEAD].markCurrent();
289 if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
290 words[wordsFound % THAI_LOOKAHEAD].markCurrent();
294 while (words[(wordsFound + 1) % THAI_LOOKAHEAD].backUp(text));
297 while (words[wordsFound % THAI_LOOKAHEAD].backUp(text));
299 wordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
300 wordsFound += 1;
312 if (words[wordsFound % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
314 || words[wordsFound%THAI_LOOKAHEAD].longestPrefix() < THAI_PREFIX_COMBINE_THRESHOLD)) {
335 int candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
346 wordsFound += 1;
370 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
412 wordsFound -= 1;
415 return wordsFound;
478 uint32_t wordsFound = 0;
491 int candidates = words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
495 wordLength = words[wordsFound%KHMER_LOOKAHEAD].acceptMarked(text);
496 wordsFound += 1;
507 if (words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
510 words[wordsFound % KHMER_LOOKAHEAD].markCurrent();
522 if (words[(wordsFound + 2) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
523 words[wordsFound % KHMER_LOOKAHEAD].markCurrent();
527 while (words[(wordsFound + 1) % KHMER_LOOKAHEAD].backUp(text));
530 while (words[wordsFound % KHMER_LOOKAHEAD].backUp(text));
532 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(text);
533 wordsFound += 1;
545 if (words[wordsFound % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
547 || words[wordsFound % KHMER_LOOKAHEAD].longestPrefix() < KHMER_PREFIX_COMBINE_THRESHOLD)) {
564 int candidates = words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
575 wordsFound += 1;
599 // if (words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
641 wordsFound -= 1;
644 return wordsFound;
