Lines Matching refs:words
114 // List size, limited by the maximum number of words in the dictionary
196 // How many words in a row are "good enough"?
215 // Minimum number of characters for two words
255 return 0; // Not enough characters for two words
265 PossibleWord words[THAI_LOOKAHEAD];
273 // Look for candidate words at the current position
274 int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
278 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
279 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength();
282 // If there was more than one, see which one can take us forward the most words
290 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
293 words[wordsFound%THAI_LOOKAHEAD].markCurrent();
302 // See if any of the possible second words is followed by a third word
305 if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
306 words[wordsFound % THAI_LOOKAHEAD].markCurrent();
310 while (words[(wordsFound + 1) % THAI_LOOKAHEAD].backUp(text));
313 while (words[wordsFound % THAI_LOOKAHEAD].backUp(text));
316 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
317 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength();
332 if (words[wordsFound % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
334 || words[wordsFound%THAI_LOOKAHEAD].longestPrefix() < THAI_PREFIX_COMBINE_THRESHOLD)) {
355 int32_t candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
389 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
444 // How many words in a row are "good enough"?
457 // Minimum number of characters for two words
492 return 0; // Not enough characters for two words
500 PossibleWord words[LAO_LOOKAHEAD];
508 // Look for candidate words at the current position
509 int32_t candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
513 cuWordLength = words[wordsFound % LAO_LOOKAHEAD].acceptMarked(text);
514 cpWordLength = words[wordsFound % LAO_LOOKAHEAD].markedCPLength();
517 // If there was more than one, see which one can take us forward the most words
525 if (words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
528 words[wordsFound%LAO_LOOKAHEAD].markCurrent();
537 // See if any of the possible second words is followed by a third word
540 if (words[(wordsFound + 2) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
541 words[wordsFound % LAO_LOOKAHEAD].markCurrent();
545 while (words[(wordsFound + 1) % LAO_LOOKAHEAD].backUp(text));
548 while (words[wordsFound % LAO_LOOKAHEAD].backUp(text));
550 cuWordLength = words[wordsFound % LAO_LOOKAHEAD].acceptMarked(text);
551 cpWordLength = words[wordsFound % LAO_LOOKAHEAD].markedCPLength();
564 if (words[wordsFound % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
566 || words[wordsFound%LAO_LOOKAHEAD].longestPrefix() < LAO_PREFIX_COMBINE_THRESHOLD)) {
585 int32_t candidates = words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
640 // How many words in a row are "good enough"?
653 // Minimum number of characters for two words
685 return 0; // Not enough characters for two words
693 PossibleWord words[BURMESE_LOOKAHEAD];
701 // Look for candidate words at the current position
702 int32_t candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
706 cuWordLength = words[wordsFound % BURMESE_LOOKAHEAD].acceptMarked(text);
707 cpWordLength = words[wordsFound % BURMESE_LOOKAHEAD].markedCPLength();
710 // If there was more than one, see which one can take us forward the most words
718 if (words[(wordsFound + 1) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
721 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent();
730 // See if any of the possible second words is followed by a third word
733 if (words[(wordsFound + 2) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
734 words[wordsFound % BURMESE_LOOKAHEAD].markCurrent();
738 while (words[(wordsFound + 1) % BURMESE_LOOKAHEAD].backUp(text));
741 while (words[wordsFound % BURMESE_LOOKAHEAD].backUp(text));
743 cuWordLength = words[wordsFound % BURMESE_LOOKAHEAD].acceptMarked(text);
744 cpWordLength = words[wordsFound % BURMESE_LOOKAHEAD].markedCPLength();
757 if (words[wordsFound % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
759 || words[wordsFound%BURMESE_LOOKAHEAD].longestPrefix() < BURMESE_PREFIX_COMBINE_THRESHOLD)) {
778 int32_t candidates = words[(wordsFound + 1) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
833 // How many words in a row are "good enough"?
846 // Minimum number of characters for two words
890 return 0; // Not enough characters for two words
898 PossibleWord words[KHMER_LOOKAHEAD];
906 // Look for candidate words at the current position
907 int32_t candidates = words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
911 cuWordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(text);
912 cpWordLength = words[wordsFound % KHMER_LOOKAHEAD].markedCPLength();
916 // If there was more than one, see which one can take us forward the most words
924 if (words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) {
927 words[wordsFound % KHMER_LOOKAHEAD].markCurrent();
936 // See if any of the possible second words is followed by a third word
939 if (words[(wordsFound + 2) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) {
940 words[wordsFound % KHMER_LOOKAHEAD].markCurrent();
944 while (words[(wordsFound + 1) % KHMER_LOOKAHEAD].backUp(text));
947 while (words[wordsFound % KHMER_LOOKAHEAD].backUp(text));
949 cuWordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(text);
950 cpWordLength = words[wordsFound % KHMER_LOOKAHEAD].markedCPLength();
963 if (words[wordsFound % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
965 || words[wordsFound % KHMER_LOOKAHEAD].longestPrefix() < KHMER_PREFIX_COMBINE_THRESHOLD)) {
983 int32_t candidates = words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
1017 // if (words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0
