Lines Matching defs:fIter
90 public int divideUpDictionaryRange(CharacterIterator fIter, int rangeStart, int rangeEnd,
105 fIter.setIndex(rangeStart);
107 while ((current = fIter.getIndex()) < rangeEnd) {
111 int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
115 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(fIter);
123 if (fIter.getIndex() < rangeEnd) {
126 if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
134 if (fIter.getIndex() >= rangeEnd) {
141 if (words[(wordsFound+2)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
146 } while (words[(wordsFound+1)%KHMER_LOOKAHEAD].backUp(fIter));
148 } while (words[wordsFound%KHMER_LOOKAHEAD].backUp(fIter) && !foundBest);
150 wordLength = words[wordsFound%KHMER_LOOKAHEAD].acceptMarked(fIter);
159 if (fIter.getIndex() < rangeEnd && wordLength < KHMER_ROOT_COMBINE_THRESHOLD) {
163 if (words[wordsFound%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 &&
168 int pc = fIter.current();
171 fIter.next();
172 uc = fIter.current();
179 int candidate = words[(wordsFound + 1) %KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
180 fIter.setIndex(current + wordLength + chars);
197 fIter.setIndex(current+wordLength);
203 while ((currPos = fIter.getIndex()) < rangeEnd && fMarkSet.contains(fIter.current())) {
204 fIter.next();
205 wordLength += fIter.getIndex() - currPos;
