29         fBI(bi), fBreaks(NULL), fPositionInCache(-1),  in DictionaryCache()
31     fBreaks = new UVector32(status);  in DictionaryCache()
35     delete fBreaks;  in ~DictionaryCache()
36     fBreaks = NULL;  in ~DictionaryCache()
45     fBreaks->removeAllElements();  in reset()
57 …if (fPositionInCache >= 0 && fPositionInCache < fBreaks->size() && fBreaks->elementAti(fPositionIn…  in following()
59         if (fPositionInCache >= fBreaks->size()) {  in following()
63         r = fBreaks->elementAti(fPositionInCache);  in following()
72     for (fPositionInCache = 0; fPositionInCache < fBreaks->size(); ++fPositionInCache) {  in following()
73         r= fBreaks->elementAti(fPositionInCache);  in following()
93         fPositionInCache = fBreaks->size() - 1;  in preceding()
95             U_ASSERT(fBreaks->elementAti(fPositionInCache) == fromPos);  in preceding()
100 …if (fPositionInCache > 0 && fPositionInCache < fBreaks->size() && fBreaks->elementAti(fPositionInC…  in preceding()
102         r = fBreaks->elementAti(fPositionInCache);  in preceding()
114     for (fPositionInCache = fBreaks->size()-1; fPositionInCache >= 0; --fPositionInCache) {  in preceding()
115         r = fBreaks->elementAti(fPositionInCache);  in preceding()
171 …         foundBreakCount += lbe->findBreaks(text, rangeStart, rangeEnd, fBI->fBreakType, *fBreaks);  in populateDictionary()
185         U_ASSERT(foundBreakCount == fBreaks->size());  in populateDictionary()
186         if (startPos < fBreaks->elementAti(0)) {  in populateDictionary()
191             fBreaks->insertElementAt(startPos, 0, status);  in populateDictionary()
193         if (endPos > fBreaks->peeki()) {  in populateDictionary()
194             fBreaks->push(endPos, status);  in populateDictionary()
198         fStart = fBreaks->elementAti(0);  in populateDictionary()
199         fLimit = fBreaks->peeki();  in populateDictionary()