Lines Matching refs:words
112 // 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
253 return 0; // Not enough characters for two words
263 PossibleWord words[THAI_LOOKAHEAD];
271 // Look for candidate words at the current position
272 int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
276 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
277 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength();
280 // If there was more than one, see which one can take us forward the most words
288 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
291 words[wordsFound%THAI_LOOKAHEAD].markCurrent();
300 // See if any of the possible second words is followed by a third word
303 if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
304 words[wordsFound % THAI_LOOKAHEAD].markCurrent();
308 while (words[(wordsFound + 1) % THAI_LOOKAHEAD].backUp(text));
311 while (words[wordsFound % THAI_LOOKAHEAD].backUp(text));
314 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
315 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength();
330 if (words[wordsFound % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
332 || words[wordsFound%THAI_LOOKAHEAD].longestPrefix() < THAI_PREFIX_COMBINE_THRESHOLD)) {
353 int32_t candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
387 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
442 // How many words in a row are "good enough"?
455 // Minimum number of characters for two words
490 return 0; // Not enough characters for two words
498 PossibleWord words[LAO_LOOKAHEAD];
506 // Look for candidate words at the current position
507 int32_t candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
511 cuWordLength = words[wordsFound % LAO_LOOKAHEAD].acceptMarked(text);
512 cpWordLength = words[wordsFound % LAO_LOOKAHEAD].markedCPLength();
515 // If there was more than one, see which one can take us forward the most words
523 if (words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
526 words[wordsFound%LAO_LOOKAHEAD].markCurrent();
535 // See if any of the possible second words is followed by a third word
538 if (words[(wordsFound + 2) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
539 words[wordsFound % LAO_LOOKAHEAD].markCurrent();
543 while (words[(wordsFound + 1) % LAO_LOOKAHEAD].backUp(text));
546 while (words[wordsFound % LAO_LOOKAHEAD].backUp(text));
548 cuWordLength = words[wordsFound % LAO_LOOKAHEAD].acceptMarked(text);
549 cpWordLength = words[wordsFound % LAO_LOOKAHEAD].markedCPLength();
562 if (words[wordsFound % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
564 || words[wordsFound%LAO_LOOKAHEAD].longestPrefix() < LAO_PREFIX_COMBINE_THRESHOLD)) {
583 int32_t candidates = words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
638 // How many words in a row are "good enough"?
651 // Minimum number of characters for two words
683 return 0; // Not enough characters for two words
691 PossibleWord words[BURMESE_LOOKAHEAD];
699 // Look for candidate words at the current position
700 int32_t candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
704 cuWordLength = words[wordsFound % BURMESE_LOOKAHEAD].acceptMarked(text);
705 cpWordLength = words[wordsFound % BURMESE_LOOKAHEAD].markedCPLength();
708 // If there was more than one, see which one can take us forward the most words
716 if (words[(wordsFound + 1) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
719 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent();
728 // See if any of the possible second words is followed by a third word
731 if (words[(wordsFound + 2) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
732 words[wordsFound % BURMESE_LOOKAHEAD].markCurrent();
736 while (words[(wordsFound + 1) % BURMESE_LOOKAHEAD].backUp(text));
739 while (words[wordsFound % BURMESE_LOOKAHEAD].backUp(text));
741 cuWordLength = words[wordsFound % BURMESE_LOOKAHEAD].acceptMarked(text);
742 cpWordLength = words[wordsFound % BURMESE_LOOKAHEAD].markedCPLength();
755 if (words[wordsFound % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
757 || words[wordsFound%BURMESE_LOOKAHEAD].longestPrefix() < BURMESE_PREFIX_COMBINE_THRESHOLD)) {
776 int32_t candidates = words[(wordsFound + 1) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
831 // How many words in a row are "good enough"?
844 // Minimum number of characters for two words
888 return 0; // Not enough characters for two words
896 PossibleWord words[KHMER_LOOKAHEAD];
904 // Look for candidate words at the current position
905 int32_t candidates = words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
909 cuWordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(text);
910 cpWordLength = words[wordsFound % KHMER_LOOKAHEAD].markedCPLength();
914 // If there was more than one, see which one can take us forward the most words
922 if (words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
925 words[wordsFound % KHMER_LOOKAHEAD].markCurrent();
934 // See if any of the possible second words is followed by a third word
937 if (words[(wordsFound + 2) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
938 words[wordsFound % KHMER_LOOKAHEAD].markCurrent();
942 while (words[(wordsFound + 1) % KHMER_LOOKAHEAD].backUp(text));
945 while (words[wordsFound % KHMER_LOOKAHEAD].backUp(text));
947 cuWordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(text);
948 cpWordLength = words[wordsFound % KHMER_LOOKAHEAD].markedCPLength();
961 if (words[wordsFound % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
963 || words[wordsFound % KHMER_LOOKAHEAD].longestPrefix() < KHMER_PREFIX_COMBINE_THRESHOLD)) {
981 int32_t candidates = words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
1015 // if (words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
