Lines Matching defs:fIter
92 public int divideUpDictionaryRange(CharacterIterator fIter, int rangeStart, int rangeEnd,
108 fIter.setIndex(rangeStart);
109 while ((current = fIter.getIndex()) < rangeEnd) {
113 int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
117 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter);
125 if (fIter.getIndex() < rangeEnd) {
128 if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
136 if (fIter.getIndex() >= rangeEnd) {
143 if (words[(wordsFound+2)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
148 } while (words[(wordsFound+1)%BURMESE_LOOKAHEAD].backUp(fIter));
150 } while (words[wordsFound%BURMESE_LOOKAHEAD].backUp(fIter) && !foundBest);
152 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter);
161 if (fIter.getIndex() < rangeEnd && wordLength < BURMESE_ROOT_COMBINE_THRESHOLD) {
165 if (words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 &&
170 int pc = fIter.current();
173 fIter.next();
174 uc = fIter.current();
181 int candidate = words[(wordsFound + 1) %BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
182 fIter.setIndex(current + wordLength + chars);
199 fIter.setIndex(current+wordLength);
205 while ((currPos = fIter.getIndex()) < rangeEnd && fMarkSet.contains(fIter.current())) {
206 fIter.next();
207 wordLength += fIter.getIndex() - currPos;