| /external/skia/src/core/ |
| D | SkTMultiMap.h | 33 typename SkTDynamicHash<ValueList, Key>::Iter iter(&fHash); in ~SkTMultiMap()
45 ValueList* list = fHash.find(key); in insert()
56 fHash.add(new ValueList(value)); in insert()
63 ValueList* list = fHash.find(key); in remove()
91 ValueList* list = fHash.find(key); in find()
100 ValueList* list = fHash.find(key); in find()
112 ValueList* list = fHash.find(key); in findAndRemove()
133 : fIter(&(mmap->fHash)) in ConstIter()
167 for (ValueList* list = fHash.find(key); list; list = list->fNext) { in has()
178 ValueList* list = fHash.find(key); in countForKey()
[all …]
|
| D | SkTDynamicHash.h | 35 explicit Iter(SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) { in Iter()
40 SkASSERT(fCurrentIndex <= fHash->fCapacity); in done()
41 return fCurrentIndex == fHash->fCapacity; in done()
54 T* current() const { return fHash->fArray[fCurrentIndex]; } in current()
56 SkTDynamicHash* fHash; variable
62 explicit ConstIter(const SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) { in ConstIter()
67 SkASSERT(fCurrentIndex <= fHash->fCapacity); in done()
68 return fCurrentIndex == fHash->fCapacity; in done()
81 const T* current() const { return fHash->fArray[fCurrentIndex]; } in current()
83 const SkTDynamicHash* fHash; variable
|
| D | SkResourceCache.cpp | 59 fHash = SkOpts::hash(this->as32() + kUnhashedLocal32s, in init()
83 fHash = new Hash; in init()
110 delete fHash; in ~SkResourceCache()
118 if (auto found = fHash->find(key)) { in find()
148 if (Rec** preexisting = fHash->find(rec->getKey())) { in add()
162 fHash->set(rec); in add()
183 fHash->remove(rec->getKey()); in remove()
|
| D | SkResourceCache.h | 49 uint32_t hash() const { return fHash; } in hash()
64 uint32_t fHash; member
264 Hash* fHash; variable
|
| /external/skqp/src/core/ |
| D | SkTMultiMap.h | 33 typename SkTDynamicHash<ValueList, Key>::Iter iter(&fHash); in ~SkTMultiMap()
45 ValueList* list = fHash.find(key); in insert()
56 fHash.add(new ValueList(value)); in insert()
63 ValueList* list = fHash.find(key); in remove()
91 ValueList* list = fHash.find(key); in find()
100 ValueList* list = fHash.find(key); in find()
112 ValueList* list = fHash.find(key); in findAndRemove()
133 : fIter(&(mmap->fHash)) in ConstIter()
167 for (ValueList* list = fHash.find(key); list; list = list->fNext) { in has()
178 ValueList* list = fHash.find(key); in countForKey()
[all …]
|
| D | SkTDynamicHash.h | 35 explicit Iter(SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) { in Iter()
40 SkASSERT(fCurrentIndex <= fHash->fCapacity); in done()
41 return fCurrentIndex == fHash->fCapacity; in done()
54 T* current() const { return fHash->fArray[fCurrentIndex]; } in current()
56 SkTDynamicHash* fHash; variable
62 explicit ConstIter(const SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) { in ConstIter()
67 SkASSERT(fCurrentIndex <= fHash->fCapacity); in done()
68 return fCurrentIndex == fHash->fCapacity; in done()
81 const T* current() const { return fHash->fArray[fCurrentIndex]; } in current()
83 const SkTDynamicHash* fHash; variable
|
| D | SkResourceCache.cpp | 59 fHash = SkOpts::hash(this->as32() + kUnhashedLocal32s, in init()
83 fHash = new Hash; in init()
110 delete fHash; in ~SkResourceCache()
118 if (auto found = fHash->find(key)) { in find()
148 if (Rec** preexisting = fHash->find(rec->getKey())) { in add()
162 fHash->set(rec); in add()
183 fHash->remove(rec->getKey()); in remove()
|
| D | SkResourceCache.h | 49 uint32_t hash() const { return fHash; } in hash()
64 uint32_t fHash; member
264 Hash* fHash; variable
|
| /external/skqp/tools/bookmaker/ |
| D | fiddleParser.cpp | 62 if (example->fHash.length() && example->fHash != iter->asString()) { in parseFiddles()
65 example->fHash = iter->asString(); in parseFiddles()
|
| /external/icu/icu4c/source/i18n/ |
| D | uspoof_conf.cpp | 77 SPUStringPool::SPUStringPool(UErrorCode &status) : fVec(NULL), fHash(NULL) { in SPUStringPool()
83 fHash = uhash_open(uhash_hashUnicodeString, // key hash function in SPUStringPool()
97 uhash_close(fHash); in ~SPUStringPool()
138 SPUString *hashedString = static_cast<SPUString *>(uhash_get(fHash, src)); in addString()
147 uhash_put(fHash, src, hashedString, &status); in addString()
|
| D | tznames_impl.cpp | 459 fHash = NULL; in ZNStringPool()
469 fHash = uhash_open(uhash_hashUChars /* keyHash */, in ZNStringPool()
479 if (fHash != NULL) { in ~ZNStringPool()
480 uhash_close(fHash); in ~ZNStringPool()
481 fHash = NULL; in ~ZNStringPool()
499 pooledString = static_cast<UChar *>(uhash_get(fHash, s)); in get()
524 uhash_put(fHash, destString, destString, &status); in get()
540 pooledString = static_cast<UChar *>(uhash_get(fHash, s)); in adopt()
543 uhash_put(fHash, ncs, ncs, &status); in adopt()
563 uhash_close(fHash); in freeze()
[all …]
|
| D | uspoof_conf.h | 80 UHashtable *fHash; // Key: UnicodeString Value: SPUString variable
|
| D | tznames_impl.h | 69 UHashtable *fHash; variable
|
| /external/skia/tools/bookmaker/ |
| D | fiddleParser.cpp | 64 if (example->fHash.length() && example->fHash != sv->begin()) { in parseFiddles()
67 example->fHash = sv->begin(); in parseFiddles()
|
| D | definition.h | 242 string fHash; // generated by fiddle variable
|
| /external/skia/src/pdf/ |
| D | SkPDFGradientShader.h | 33 uint32_t fHash; member
37 uint32_t operator()(const Key& k) const { return k.fHash; } in operator()
|
| D | SkPDFGradientShader.cpp | 825 luminosityState.fHash = hash(luminosityState); in create_smask_graphic_state()
850 opaqueState.fHash = hash(opaqueState); in make_alpha_function_shader()
891 key.fHash = hash(key); in make_key()
|
| /external/skqp/src/pdf/ |
| D | SkPDFGradientShader.h | 33 uint32_t fHash; member
37 uint32_t operator()(const Key& k) const { return k.fHash; } in operator()
|
| D | SkPDFGradientShader.cpp | 825 luminosityState.fHash = hash(luminosityState); in create_smask_graphic_state()
850 opaqueState.fHash = hash(opaqueState); in make_alpha_function_shader()
891 key.fHash = hash(key); in make_key()
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | Trie2.java | 319 if (fHash == 0) { in hashCode()
327 fHash = hash; in hashCode()
329 return fHash; in hashCode()
686 int fHash; // Zero if not yet computed. field in Trie2
|
| D | Trie2Writable.java | 298 fHash = 0; in set()
405 fHash = 0; in setRange()
527 fHash = 0; in setRange()
557 fHash = 0; in setForLeadSurrogateCodeUnit()
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | Trie2.java | 321 if (fHash == 0) { in hashCode()
329 fHash = hash; in hashCode()
331 return fHash; in hashCode()
692 int fHash; // Zero if not yet computed. field in Trie2
|
| D | Trie2Writable.java | 300 fHash = 0; in set()
407 fHash = 0; in setRange()
529 fHash = 0; in setRange()
559 fHash = 0; in setForLeadSurrogateCodeUnit()
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | SpoofChecker.java | 1052 fHash = new Hashtable<>();
1069 SPUString hashedString = fHash.get(src);
1072 fHash.put(src, hashedString);
1084 private Hashtable<String, SPUString> fHash; // Key: Value:
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | SpoofChecker.java | 1097 fHash = new Hashtable<>();
1114 SPUString hashedString = fHash.get(src);
1117 fHash.put(src, hashedString);
1129 private Hashtable<String, SPUString> fHash; // Key: Value:
|