Lines Matching defs:words
97 // List size, limited by the maximum number of words in the dictionary
186 // How many words in a row are "good enough"?
205 // Minimum number of characters for two words
243 return 0; // Not enough characters for two words
250 PossibleWord words[THAI_LOOKAHEAD];
258 // Look for candidate words at the current position
259 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
263 wordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
266 // If there was more than one, see which one can take us forward the most words
274 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
277 words[wordsFound%THAI_LOOKAHEAD].markCurrent();
286 // See if any of the possible second words is followed by a third word
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);
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);
370 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
418 // How many words in a row are "good enough"?
431 // Minimum number of characters for two words
475 return 0; // Not enough characters for two words
482 PossibleWord words[KHMER_LOOKAHEAD];
490 // Look for candidate words at the current position
491 int candidates = words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
495 wordLength = words[wordsFound%KHMER_LOOKAHEAD].acceptMarked(text);
499 // If there was more than one, see which one can take us forward the most words
507 if (words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
510 words[wordsFound % KHMER_LOOKAHEAD].markCurrent();
519 // See if any of the possible second words is followed by a third word
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);
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);
599 // if (words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
