Lines Matching defs:words
100 // List size, limited by the maximum number of words in the dictionary
194 // How many words in a row are "good enough"?
213 // Minimum number of characters for two words
251 return 0; // Not enough characters for two words
258 PossibleWord words[THAI_LOOKAHEAD];
266 // Look for candidate words at the current position
267 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
271 wordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
274 // If there was more than one, see which one can take us forward the most words
282 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
285 words[wordsFound%THAI_LOOKAHEAD].markCurrent();
294 // See if any of the possible second words is followed by a third word
297 if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
298 words[wordsFound % THAI_LOOKAHEAD].markCurrent();
302 while (words[(wordsFound + 1) % THAI_LOOKAHEAD].backUp(text));
305 while (words[wordsFound % THAI_LOOKAHEAD].backUp(text));
307 wordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
320 if (words[wordsFound % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
322 || words[wordsFound%THAI_LOOKAHEAD].longestPrefix() < THAI_PREFIX_COMBINE_THRESHOLD)) {
343 int candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
378 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
431 // How many words in a row are "good enough"?
444 // Minimum number of characters for two words
479 return 0; // Not enough characters for two words
486 PossibleWord words[LAO_LOOKAHEAD];
494 // Look for candidate words at the current position
495 int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
499 wordLength = words[wordsFound % LAO_LOOKAHEAD].acceptMarked(text);
502 // If there was more than one, see which one can take us forward the most words
510 if (words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
513 words[wordsFound%LAO_LOOKAHEAD].markCurrent();
522 // See if any of the possible second words is followed by a third word
525 if (words[(wordsFound + 2) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
526 words[wordsFound % LAO_LOOKAHEAD].markCurrent();
530 while (words[(wordsFound + 1) % LAO_LOOKAHEAD].backUp(text));
533 while (words[wordsFound % LAO_LOOKAHEAD].backUp(text));
535 wordLength = words[wordsFound % LAO_LOOKAHEAD].acceptMarked(text);
548 if (words[wordsFound % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
550 || words[wordsFound%LAO_LOOKAHEAD].longestPrefix() < LAO_PREFIX_COMBINE_THRESHOLD)) {
567 int candidates = words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
623 // How many words in a row are "good enough"?
636 // Minimum number of characters for two words
680 return 0; // Not enough characters for two words
687 PossibleWord words[KHMER_LOOKAHEAD];
695 // Look for candidate words at the current position
696 int candidates = words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
700 wordLength = words[wordsFound%KHMER_LOOKAHEAD].acceptMarked(text);
704 // If there was more than one, see which one can take us forward the most words
712 if (words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
715 words[wordsFound % KHMER_LOOKAHEAD].markCurrent();
724 // See if any of the possible second words is followed by a third word
727 if (words[(wordsFound + 2) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
728 words[wordsFound % KHMER_LOOKAHEAD].markCurrent();
732 while (words[(wordsFound + 1) % KHMER_LOOKAHEAD].backUp(text));
735 while (words[wordsFound % KHMER_LOOKAHEAD].backUp(text));
737 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(text);
750 if (words[wordsFound % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
752 || words[wordsFound % KHMER_LOOKAHEAD].longestPrefix() < KHMER_PREFIX_COMBINE_THRESHOLD)) {
769 int candidates = words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
804 // if (words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0