| /third_party/icu/icu4c/source/common/ |
| H A D | unifiedcache.cpp | 329 const UHashElement *element = uhash_find(fHashtable, &key); in _putIfAbsentAndGet()
354 const UHashElement *element = uhash_find(fHashtable, &key); in _poll()
361 element = uhash_find(fHashtable, &key); in _poll()
|
| H A D | hash.h | 242 return uhash_find(hash, &key); in find()
|
| H A D | uhash.h | 603 uhash_find(const UHashtable *hash, const void* key);
|
| H A D | stringtriebuilder.cpp | 328 const UHashElement *old=uhash_find(nodes, newNode); in registerNode()
334 // registered node, then uhash_find() failed to find that and we will leak newNode. in registerNode()
353 const UHashElement *old=uhash_find(nodes, &key); in registerFinalValue()
363 // registered node, then uhash_find() failed to find that and we will leak newNode. in registerFinalValue()
|
| H A D | uhash.cpp | 864 uhash_find(const UHashtable *hash, const void* key) { in uhash_find() function
|
| /third_party/node/deps/icu-small/source/common/ |
| H A D | unifiedcache.cpp | 329 const UHashElement *element = uhash_find(fHashtable, &key); in _putIfAbsentAndGet()
354 const UHashElement *element = uhash_find(fHashtable, &key); in _poll()
361 element = uhash_find(fHashtable, &key); in _poll()
|
| H A D | hash.h | 242 return uhash_find(hash, &key); in find()
|
| H A D | uhash.h | 603 uhash_find(const UHashtable *hash, const void* key);
|
| H A D | stringtriebuilder.cpp | 328 const UHashElement *old=uhash_find(nodes, newNode); in registerNode()
334 // registered node, then uhash_find() failed to find that and we will leak newNode. in registerNode()
353 const UHashElement *old=uhash_find(nodes, &key); in registerFinalValue()
363 // registered node, then uhash_find() failed to find that and we will leak newNode. in registerFinalValue()
|
| H A D | uhash.cpp | 864 uhash_find(const UHashtable *hash, const void* key) { in uhash_find() function
|
| /third_party/skia/third_party/externals/icu/source/common/ |
| H A D | unifiedcache.cpp | 329 const UHashElement *element = uhash_find(fHashtable, &key); in _putIfAbsentAndGet()
354 const UHashElement *element = uhash_find(fHashtable, &key); in _poll()
361 element = uhash_find(fHashtable, &key); in _poll()
|
| H A D | hash.h | 242 return uhash_find(hash, &key); in find()
|
| H A D | uhash.h | 603 uhash_find(const UHashtable *hash, const void* key);
|
| H A D | stringtriebuilder.cpp | 328 const UHashElement *old=uhash_find(nodes, newNode); in registerNode()
334 // registered node, then uhash_find() failed to find that and we will leak newNode. in registerNode()
353 const UHashElement *old=uhash_find(nodes, &key); in registerFinalValue()
363 // registered node, then uhash_find() failed to find that and we will leak newNode. in registerFinalValue()
|
| H A D | uhash.cpp | 864 uhash_find(const UHashtable *hash, const void* key) { in uhash_find() function
|
| /third_party/icu/icu4c/source/test/cintltst/ |
| H A D | chashtst.c | 237 if(uhash_find(hash, (void*)two) != NULL){ in TestOtherAPI()
238 log_err("FAIL: uhash_find failed\n"); in TestOtherAPI()
253 if(uhash_find(hash, (void*)two2) == NULL){ in TestOtherAPI()
254 log_err("FAIL: uhash_find of \"two\" failed\n"); in TestOtherAPI()
|
| /third_party/icu/icu4c/source/common/unicode/ |
| H A D | urename.h | 990 #define uhash_find U_ICU_ENTRY_POINT_RENAME(uhash_find) macro
|
| /third_party/node/deps/icu-small/source/common/unicode/ |
| H A D | urename.h | 1002 #define uhash_find U_ICU_ENTRY_POINT_RENAME(uhash_find) macro
|
| /third_party/skia/third_party/externals/icu/source/common/unicode/ |
| H A D | urename.h | 973 #define uhash_find U_ICU_ENTRY_POINT_RENAME(uhash_find) macro
|