/external/icu/icu4c/source/common/ |
uhash.c | 20 /* This hashtable is implemented as a double hash. All elements are 22 * resolution (no linked list, etc.). When there is a hash collision 24 * using a secondary hash. The secondary hash is an increment 25 * computed as a hash function (a different one) of the primary 26 * hashcode. This increment is added to the initial hash value to 27 * obtain further slots assigned to the same hash code. For this to 120 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \ 121 if (hash->keyDeleter != NULL && keypointer != NULL) { \ 122 (*hash->keyDeleter)(keypointer); [all...] |
hash.h | 29 UHashtable* hash; member in class:Hashtable 115 hash = &hashObj; 116 uhash_setKeyDeleter(hash, uprv_deleteUObject); 121 UErrorCode& status) : hash(0) { 125 : hash(0) 136 : hash(0) 142 : hash(0) 149 if (hash != NULL) { 150 uhash_close(hash); 155 return uhash_setValueDeleter(hash, fn) [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
functional_hash.h | 56 /// Primary class template hash. 58 struct hash; 62 struct hash<_Tp*> : public __hash_base<size_t, _Tp*> struct in inherits:__hash_base 72 struct hash<_Tp> : public __hash_base<size_t, _Tp> \ 129 hash(const void* __ptr, size_t __clength, function in struct:_Hash_impl 135 hash(const _Tp& __val) function in struct:_Hash_impl 136 { return hash(&__val, sizeof(__val)); } 141 { return hash(&__val, sizeof(__val), __hash); } 147 hash(const void* __ptr, size_t __clength, function in struct:_Fnv_hash_impl 153 hash(const _Tp& __val function in struct:_Fnv_hash_impl 164 struct hash<float> : public __hash_base<size_t, float> struct in inherits:__hash_base 176 struct hash<double> : public __hash_base<size_t, double> struct in inherits:__hash_base 188 struct hash<long double> struct in inherits:__hash_base [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
functional_hash.h | 56 /// Primary class template hash. 58 struct hash; 62 struct hash<_Tp*> : public __hash_base<size_t, _Tp*> struct in inherits:__hash_base 72 struct hash<_Tp> : public __hash_base<size_t, _Tp> \ 129 hash(const void* __ptr, size_t __clength, function in struct:_Hash_impl 135 hash(const _Tp& __val) function in struct:_Hash_impl 136 { return hash(&__val, sizeof(__val)); } 141 { return hash(&__val, sizeof(__val), __hash); } 147 hash(const void* __ptr, size_t __clength, function in struct:_Fnv_hash_impl 153 hash(const _Tp& __val function in struct:_Fnv_hash_impl 164 struct hash<float> : public __hash_base<size_t, float> struct in inherits:__hash_base 176 struct hash<double> : public __hash_base<size_t, double> struct in inherits:__hash_base 188 struct hash<long double> struct in inherits:__hash_base [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
functional_hash.h | 56 /// Primary class template hash. 58 struct hash; 62 struct hash<_Tp*> : public __hash_base<size_t, _Tp*> struct in inherits:__hash_base 72 struct hash<_Tp> : public __hash_base<size_t, _Tp> \ 129 hash(const void* __ptr, size_t __clength, function in struct:_Hash_impl 135 hash(const _Tp& __val) function in struct:_Hash_impl 136 { return hash(&__val, sizeof(__val)); } 141 { return hash(&__val, sizeof(__val), __hash); } 147 hash(const void* __ptr, size_t __clength, function in struct:_Fnv_hash_impl 153 hash(const _Tp& __val function in struct:_Fnv_hash_impl 164 struct hash<float> : public __hash_base<size_t, float> struct in inherits:__hash_base 176 struct hash<double> : public __hash_base<size_t, double> struct in inherits:__hash_base 188 struct hash<long double> struct in inherits:__hash_base [all...] |
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
functional_hash.h | 56 /// Primary class template hash. 58 struct hash; 62 struct hash<_Tp*> : public __hash_base<size_t, _Tp*> struct in inherits:__hash_base 72 struct hash<_Tp> : public __hash_base<size_t, _Tp> \ 129 hash(const void* __ptr, size_t __clength, function in struct:_Hash_impl 135 hash(const _Tp& __val) function in struct:_Hash_impl 136 { return hash(&__val, sizeof(__val)); } 141 { return hash(&__val, sizeof(__val), __hash); } 147 hash(const void* __ptr, size_t __clength, function in struct:_Fnv_hash_impl 153 hash(const _Tp& __val function in struct:_Fnv_hash_impl 164 struct hash<float> : public __hash_base<size_t, float> struct in inherits:__hash_base 176 struct hash<double> : public __hash_base<size_t, double> struct in inherits:__hash_base 188 struct hash<long double> struct in inherits:__hash_base [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/precompiler/ |
PrecompiledTemplateMapKey.java | 56 int hash = 17; local 58 hash = 31 * hash + templateName.hashCode(); 59 hash = 31 * hash + escapeMode.hashCode(); 60 return hash;
|
/external/elfutils/libelf/ |
elf_hash.c | 0 /* Hash function used in ELF implementations. 37 #include <dl-hash.h>
|
/external/libcxx/test/std/extensions/hash/ |
specializations.fail.cpp | 16 assert(__gnu_cxx::hash<std::string>()(std::string()) == 0); // error
|
/external/libcxx/test/std/utilities/function.objects/unord.hash/ |
enum.fail.cpp | 12 // Hashing a struct w/o a defined hash should fail. 23 size_t h = std::hash<X>{} ( x );
|
/external/libvpx/libvpx/third_party/libyuv/source/ |
compare_common.cc | 28 // hash seed of 5381 recommended. 31 uint32 hash = seed; local 34 hash += (hash << 5) + src[i]; 36 return hash;
|
/external/libyuv/files/source/ |
compare_common.cc | 30 // hash seed of 5381 recommended. 33 uint32 hash = seed; local 36 hash += (hash << 5) + src[i]; 38 return hash;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/extensions/hash/ |
specializations.fail.cpp | 16 assert(__gnu_cxx::hash<std::string>()(std::string()) == 0); // error
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/function.objects/unord.hash/ |
enum.fail.cpp | 12 // Hashing a struct w/o a defined hash should fail. 23 size_t h = std::hash<X>{} ( x );
|
/system/core/metricsd/uploader/ |
sender.h | 26 // Sends a message |content| with its sha1 hash |hash| 27 virtual bool Send(const std::string& content, const std::string& hash) = 0;
|
/device/google/dragon/audio/hal/ |
dictionary.c | 78 @brief Compute the hash key for a string. 82 This hash function has been taken from an Article in Dr Dobbs Journal. 91 unsigned hash ; local 95 for (hash=0, i=0 ; i<len ; i++) { 96 hash += (unsigned)key[i] ; 97 hash += (hash<<10); 98 hash ^= (hash>>6) ; 100 hash += (hash <<3) 177 unsigned hash ; local 224 unsigned hash ; local 290 unsigned hash ; local [all...] |
/external/guava/guava/src/com/google/common/hash/ |
HashCode.java | 15 package com.google.common.hash; 32 * An immutable hash code of arbitrary bit length. 43 * Returns the number of bits in this hash code; a positive multiple of 8. 73 * Returns the value of this hash code as a byte array. The caller may modify the byte array; 81 * Copies bytes from this hash code into {@code dest}. 83 * @param dest the byte array into which the hash code will be written 119 public static HashCode fromInt(int hash) { 120 return new IntHashCode(hash); 124 final int hash; field in class:HashCode.IntHashCode 126 IntHashCode(int hash) { 184 final long hash; field in class:HashCode.LongHashCode [all...] |
/external/deqp/framework/delibs/debase/ |
deString.c | 39 * \brief Compute hash from string. 40 * \param str String to compute hash value for. 41 * \return Computed hash value. 45 /* \note [pyry] This hash is used in DT_GNU_HASH and is proven 48 deUint32 hash = 5381; local 53 hash = (hash << 5) + hash + c; 55 return hash; 60 deUint32 hash = 5381 local 74 deUint32 hash = 5381; local [all...] |
/external/deqp/framework/delibs/depool/ |
dePoolHash.c | 21 * \brief Memory pool hash class. 40 deTestHash* hash = deTestHash_create(pool); local 47 /* Test find() on empty hash. */ 48 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 0); 51 const int* val = deTestHash_find(hash, (deInt16)i); 58 deTestHash_insert(hash, (deInt16)i, -i); 61 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 5000); 64 const int* val = deTestHash_find(hash, (deInt16)i); 70 deTestHash_delete(hash, (deInt16)i); 72 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 4000) [all...] |
/external/guava/guava-tests/test/com/google/common/hash/ |
PackageSanityTests.java | 17 package com.google.common.hash; 19 import com.google.common.hash.BloomFilterStrategies.BitArray;
|
/external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.hash/ |
hash_shared_ptr.pass.cpp | 13 // struct hash<shared_ptr<T>> 27 std::hash<std::shared_ptr<int> > f; 29 assert(h == std::hash<int*>()(ptr));
|
hash_unique_ptr.pass.cpp | 13 // struct hash<unique_ptr<T, D>> 27 std::hash<std::unique_ptr<int> > f; 29 assert(h == std::hash<int*>()(ptr));
|
/external/mesa3d/src/gallium/auxiliary/translate/ |
translate_cache.c | 37 struct cso_hash *hash; member in struct:translate_cache 47 cache->hash = cso_hash_create(); 54 struct cso_hash *hash = cache->hash; local 55 struct cso_hash_iter iter = cso_hash_first_node(hash); 68 cso_hash_delete(cache->hash); 95 cso_hash_find_data_from_template(cache->hash, 102 cso_hash_insert(cache->hash, hash_key, translate);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/util.smartptr/util.smartptr.hash/ |
hash_shared_ptr.pass.cpp | 13 // struct hash<shared_ptr<T>> 27 std::hash<std::shared_ptr<int> > f; 29 assert(h == std::hash<int*>()(ptr));
|
hash_unique_ptr.pass.cpp | 13 // struct hash<unique_ptr<T, D>> 27 std::hash<std::unique_ptr<int> > f; 29 assert(h == std::hash<int*>()(ptr));
|