Searched refs:fSet (Results 1 - 13 of 13) sorted by relevance

/external/chromium_org/third_party/skia/bench/
H A DGrOrderedSetBench.cpp80 fSet.insert(rand.nextU() % NUM_ELEMENTS);
87 fSet.find(fData[j]);
95 GrOrderedSet<int> fSet; member in class:GrOrderedSetFindBench
120 fSet.insert(rand.nextU() % NUM_ELEMENTS);
128 for (SetIter s = fSet.begin(); fSet.end() != s; ++s) {
139 GrOrderedSet<int> fSet; member in class:GrOrderedSetRemoveBench
/external/skia/bench/
H A DGrOrderedSetBench.cpp80 fSet.insert(rand.nextU() % NUM_ELEMENTS);
87 fSet.find(fData[j]);
95 GrOrderedSet<int> fSet; member in class:GrOrderedSetFindBench
120 fSet.insert(rand.nextU() % NUM_ELEMENTS);
128 for (SetIter s = fSet.begin(); fSet.end() != s; ++s) {
139 GrOrderedSet<int> fSet; member in class:GrOrderedSetRemoveBench
/external/chromium_org/third_party/skia/src/core/
H A DSkPtrRecorder.h67 : fSet(set)
74 return fIndex < fSet.fList.count() ? fSet.fList[fIndex++].fPtr : NULL;
78 const SkPtrSet& fSet; member in class:SkPtrSet::Iter
/external/icu/icu4c/source/i18n/
H A Dfilteredbrk.cpp224 set<UnicodeString> fSet; member in class:SimpleFilteredBreakIteratorBuilder
232 : fSet()
256 : fSet()
264 return fSet.insert(exception).second;
271 return ((fSet.erase(exception)) != 0);
288 int32_t subCount = fSet.size();
296 for ( set<UnicodeString>::iterator i = fSet.begin();
297 i != fSet.end();
/external/chromium_org/third_party/icu/source/common/
H A Ddictbe.h39 UnicodeSet fSet; member in class:DictionaryBreakEngine
H A Ddictbe.cpp39 && fSet.contains(c));
58 UBool isDict = fSet.contains(c);
61 isDict = fSet.contains(c);
67 while((current = (int32_t)utext_getNativeIndex(text)) < endPos && fSet.contains(c)) {
84 fSet = set;
86 fSet.compact();
H A Duniset_props.cpp102 UnicodeSet *fSet; member in struct:Inclusion
137 delete in.fSet;
138 in.fSet = NULL;
163 UnicodeSet * &incl = gInclusions[src].fSet;
257 return i.fSet;
/external/icu/icu4c/source/common/
H A Ddictbe.h39 UnicodeSet fSet; member in class:DictionaryBreakEngine
H A Ddictbe.cpp39 && fSet.contains(c));
61 UBool isDict = fSet.contains(c);
64 isDict = fSet.contains(c);
70 while((current = (int32_t)utext_getNativeIndex(text)) < endPos && fSet.contains(c)) {
87 fSet = set;
89 fSet.compact();
H A Duniset_props.cpp102 UnicodeSet *fSet; member in struct:Inclusion
137 delete in.fSet;
138 in.fSet = NULL;
163 UnicodeSet * &incl = gInclusions[src].fSet;
257 return i.fSet;
/external/chromium_org/third_party/skia/tests/
H A DPathOpsSkpClipTest.cpp540 fSet = false;
578 fSet = true;
582 if (!fSet) {
593 bool fSet; member in class:Dirs
/external/chromium_org/third_party/icu/source/test/intltest/
H A Dusettest.cpp2372 fSet(set), nextStringIndex(0), nextUTF8Start(0) {
2380 if(nextStringIndex<fSet.stringsLength) {
2381 return fSet.strings[nextStringIndex++];
2389 if(nextStringIndex<fSet.stringsLength) {
2390 const char *s8=fSet.utf8+nextUTF8Start;
2391 nextUTF8Start+=length=fSet.utf8Lengths[nextStringIndex++];
2400 const UnicodeSetWithStrings &fSet; member in class:UnicodeSetWithStringsIterator
/external/icu/icu4c/source/test/intltest/
H A Dusettest.cpp2372 fSet(set), nextStringIndex(0), nextUTF8Start(0) {
2380 if(nextStringIndex<fSet.stringsLength) {
2381 return fSet.strings[nextStringIndex++];
2389 if(nextStringIndex<fSet.stringsLength) {
2390 const char *s8=fSet.utf8+nextUTF8Start;
2391 nextUTF8Start+=length=fSet.utf8Lengths[nextStringIndex++];
2400 const UnicodeSetWithStrings &fSet; member in class:UnicodeSetWithStringsIterator

Completed in 336 milliseconds