Home
last modified time | relevance | path

Searched refs:fHashTable (Results 1 – 10 of 10) sorted by relevance

/external/icu/icu4c/source/common/
Drbbistbl.cpp46 fHashTable = NULL; in RBBISymbolTable()
49 fHashTable = uhash_open(uhash_hashUnicodeString, uhash_compareUnicodeString, NULL, &status); in RBBISymbolTable()
54 uhash_setValueDeleter(fHashTable, RBBISymbolTableEntry_deleter); in RBBISymbolTable()
61 uhash_close(fHashTable); in ~RBBISymbolTable()
81 el = (RBBISymbolTableEntry *)uhash_get(fHashTable, &s); in lookup()
173 el = (RBBISymbolTableEntry *)uhash_get(fHashTable, &key); in lookupNode()
193 e = (RBBISymbolTableEntry *)uhash_get(fHashTable, &key); in addEntry()
206 uhash_put( fHashTable, &e->key, e, &err); in addEntry()
238 e = uhash_nextElement(fHashTable, &pos); in rbbiSymtablePrint()
251 e = uhash_nextElement(fHashTable, &pos); in rbbiSymtablePrint()
Drbbirb.h65 UHashtable *fHashTable; variable
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DRBBISymbolTable.java18 HashMap<String, RBBISymbolTableEntry> fHashTable; field in RBBISymbolTable
37 fHashTable = new HashMap<String, RBBISymbolTableEntry>(); in RBBISymbolTable()
56 el = fHashTable.get(s); in lookup()
143 el = fHashTable.get(key); in lookupNode()
158 e = fHashTable.get(key); in addEntry()
167 fHashTable.put(e.key, e); in addEntry()
180 RBBISymbolTableEntry[] syms = fHashTable.values().toArray(new RBBISymbolTableEntry[0]); in rbbiSymtablePrint()
/external/icu/android_icu4j/src/main/java/android/icu/text/
DRBBISymbolTable.java19 HashMap<String, RBBISymbolTableEntry> fHashTable; field in RBBISymbolTable
38 fHashTable = new HashMap<String, RBBISymbolTableEntry>(); in RBBISymbolTable()
57 el = fHashTable.get(s); in lookup()
144 el = fHashTable.get(key); in lookupNode()
159 e = fHashTable.get(key); in addEntry()
168 fHashTable.put(e.key, e); in addEntry()
181 RBBISymbolTableEntry[] syms = fHashTable.values().toArray(new RBBISymbolTableEntry[0]); in rbbiSymtablePrint()
/external/skia/src/gpu/ccpr/
DGrCCPathCache.cpp103 SkASSERT(0 == fHashTable.count()); // Ensure the hash table and LRU list were coherent. in ~GrCCPathCache()
179 if (HashNode* node = fHashTable.find(*fScratchKey)) { in find()
200 if (fHashTable.count() >= kMaxCacheCount) { in find()
201 SkDEBUGCODE(HashNode* node = fHashTable.find(*fLRU.tail()->fCacheKey)); in find()
210 SkASSERT(!fHashTable.find(*permanentKey)); in find()
211 entry = fHashTable.set(HashNode(this, std::move(permanentKey), m, shape))->entry(); in find()
213 SkASSERT(fHashTable.count() <= kMaxCacheCount); in find()
218 SkDEBUGCODE(HashNode* node = fHashTable.find(*fScratchKey)); in find()
250 HashNode* node = fHashTable.find(key); in evict()
259 fHashTable.remove(key); in evict()
DGrCCPathCache.h169 SkTHashTable<HashNode, const Key&> fHashTable; variable
/external/skqp/src/gpu/ccpr/
DGrCCPathCache.cpp103 SkASSERT(0 == fHashTable.count()); // Ensure the hash table and LRU list were coherent. in ~GrCCPathCache()
179 if (HashNode* node = fHashTable.find(*fScratchKey)) { in find()
200 if (fHashTable.count() >= kMaxCacheCount) { in find()
201 SkDEBUGCODE(HashNode* node = fHashTable.find(*fLRU.tail()->fCacheKey)); in find()
210 SkASSERT(!fHashTable.find(*permanentKey)); in find()
211 entry = fHashTable.set(HashNode(this, std::move(permanentKey), m, shape))->entry(); in find()
213 SkASSERT(fHashTable.count() <= kMaxCacheCount); in find()
218 SkDEBUGCODE(HashNode* node = fHashTable.find(*fScratchKey)); in find()
250 HashNode* node = fHashTable.find(key); in evict()
259 fHashTable.remove(key); in evict()
DGrCCPathCache.h169 SkTHashTable<HashNode, const Key&> fHashTable; variable
/external/skia/tools/gpu/
DGrTest.cpp152 return fHashTable; in testingOnly_getHashTable()
/external/skqp/tools/gpu/
DGrTest.cpp325 return fHashTable; in testingOnly_getHashTable()