Searched refs:fromPos (Results 1 – 9 of 9) sorted by relevance
45 UBool RuleBasedBreakIterator::DictionaryCache::following(int32_t fromPos, int32_t *result, int32_t … in following() argument46 if (fromPos >= fLimit || fromPos < fStart) { in following()54 …che >= 0 && fPositionInCache < fBreaks.size() && fBreaks.elementAti(fPositionInCache) == fromPos) { in following()61 U_ASSERT(r > fromPos); in following()71 if (r > fromPos) { in following()83 UBool RuleBasedBreakIterator::DictionaryCache::preceding(int32_t fromPos, int32_t *result, int32_t … in preceding() argument84 if (fromPos <= fStart || fromPos > fLimit) { in preceding()89 if (fromPos == fLimit) { in preceding()92 U_ASSERT(fBreaks.elementAti(fPositionInCache) == fromPos); in preceding()97 …ache > 0 && fPositionInCache < fBreaks.size() && fBreaks.elementAti(fPositionInCache) == fromPos) { in preceding()[all …]
41 UBool following(int32_t fromPos, int32_t *pos, int32_t *statusIndex);42 UBool preceding(int32_t fromPos, int32_t *pos, int32_t *statusIndex);
82 int String::find(const String& substring, int fromPos) const { in find()83 return find(substring.c_str(), fromPos); in find()86 int String::find(const char* substring, int fromPos) const { in find()87 SkASSERT(fromPos >= 0); in find()91 size_t found = INHERITED::find(substring, (size_t) fromPos); in find()102 if (fromPos >= size() - sublen) { in find()106 return SkStrFind(c_str() + fromPos, substring); in find()
95 int find(const char* substring, int fromPos = 0) const;96 int find(const String& substring, int fromPos = 0) const;
1103 boolean following(int fromPos) {1104 if (fromPos >= fLimit || fromPos < fStart) {1112 …ache >= 0 && fPositionInCache < fBreaks.size() && fBreaks.elementAt(fPositionInCache) == fromPos) {1119 assert(r > fromPos);1129 if (r > fromPos) {1142 boolean preceding(int fromPos) { in preceding() argument1143 if (fromPos <= fStart || fromPos > fLimit) { in preceding()1148 if (fromPos == fLimit) { in preceding()1151 assert(fBreaks.elementAt(fPositionInCache) == fromPos); in preceding()1156 …Cache > 0 && fPositionInCache < fBreaks.size() && fBreaks.elementAt(fPositionInCache) == fromPos) { in preceding()[all …]
1082 boolean following(int fromPos) {1083 if (fromPos >= fLimit || fromPos < fStart) {1091 …ache >= 0 && fPositionInCache < fBreaks.size() && fBreaks.elementAt(fPositionInCache) == fromPos) {1098 assert(r > fromPos);1108 if (r > fromPos) {1121 boolean preceding(int fromPos) { in preceding() argument1122 if (fromPos <= fStart || fromPos > fLimit) { in preceding()1127 if (fromPos == fLimit) { in preceding()1130 assert(fBreaks.elementAt(fPositionInCache) == fromPos); in preceding()1135 …Cache > 0 && fPositionInCache < fBreaks.size() && fBreaks.elementAt(fPositionInCache) == fromPos) { in preceding()[all …]
META-INF/ META-INF/MANIFEST.MF com/ com/ibm/ com/ ...