29         fBI(bi), fBreaks(status), fPositionInCache(-1),  in DictionaryCache()
42     fBreaks.removeAllElements();  in reset()
54 …if (fPositionInCache >= 0 && fPositionInCache < fBreaks.size() && fBreaks.elementAti(fPositionInCa…  in following()
56         if (fPositionInCache >= fBreaks.size()) {  in following()
60         r = fBreaks.elementAti(fPositionInCache);  in following()
69     for (fPositionInCache = 0; fPositionInCache < fBreaks.size(); ++fPositionInCache) {  in following()
70         r= fBreaks.elementAti(fPositionInCache);  in following()
90         fPositionInCache = fBreaks.size() - 1;  in preceding()
92             U_ASSERT(fBreaks.elementAti(fPositionInCache) == fromPos);  in preceding()
97 …if (fPositionInCache > 0 && fPositionInCache < fBreaks.size() && fBreaks.elementAti(fPositionInCac…  in preceding()
99         r = fBreaks.elementAti(fPositionInCache);  in preceding()
111     for (fPositionInCache = fBreaks.size()-1; fPositionInCache >= 0; --fPositionInCache) {  in preceding()
112         r = fBreaks.elementAti(fPositionInCache);  in preceding()
168             foundBreakCount += lbe->findBreaks(text, rangeStart, rangeEnd, fBreaks);  in populateDictionary()
182         U_ASSERT(foundBreakCount == fBreaks.size());  in populateDictionary()
183         if (startPos < fBreaks.elementAti(0)) {  in populateDictionary()
188             fBreaks.insertElementAt(startPos, 0, status);  in populateDictionary()
190         if (endPos > fBreaks.peeki()) {  in populateDictionary()
191             fBreaks.push(endPos, status);  in populateDictionary()
195         fStart = fBreaks.elementAti(0);  in populateDictionary()
196         fLimit = fBreaks.peeki();  in populateDictionary()