/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/hash_fn/ |
sample_range_hashing.hpp | 71 // Transforms the __hash value hash into a ranged-hash value. 73 operator()(size_type hash) const;
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/hash_fn/ |
sample_range_hashing.hpp | 71 // Transforms the __hash value hash into a ranged-hash value. 73 operator()(size_type hash) const;
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/hash_fn/ |
sample_range_hashing.hpp | 71 // Transforms the __hash value hash into a ranged-hash value. 73 operator()(size_type hash) const;
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/hash_fn/ |
sample_range_hashing.hpp | 71 // Transforms the __hash value hash into a ranged-hash value. 73 operator()(size_type hash) const;
|
/external/jmonkeyengine/engine/src/core/com/jme3/shader/ |
ShaderKey.java | 87 int hash = 7; local 88 hash = 41 * hash + name.hashCode(); 89 hash = 41 * hash + fragName.hashCode(); 90 hash = 41 * hash + (defines != null ? defines.getCompiled().hashCode() : 0); 91 return hash;
|
/external/libcxx/test/std/utilities/type.index/type.index.hash/ |
hash.pass.cpp | 15 // struct hash<type_index> 26 typedef std::hash<std::type_index> H; 31 assert(std::hash<std::type_index>()(t1) == t1.hash_code());
|
/external/libnl/lib/route/ |
pktloc.c | 50 unsigned long hash = 5381; local 54 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */ 56 return hash % PKTLOC_NAME_HT_SIZ; 144 int hash, err; local 149 hash = pktloc_hash(name); 150 nl_list_for_each_entry(loc, &pktloc_name_ht[hash], list) {
|
/frameworks/compile/mclinker/include/mcld/LD/ |
ObjectReader.h | 27 typedef HashTable<ResolveInfo, hash::StringHash<hash::DJB> >
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/function.objects/unord.hash/ |
pointer.pass.cpp | 13 // struct hash 31 std::hash<T> >::value), ""); 32 std::hash<T> h;
|
/external/apache-http/src/org/apache/http/auth/ |
NTUserPrincipal.java | 93 int hash = LangUtils.HASH_SEED; local 94 hash = LangUtils.hashCode(hash, this.username); 95 hash = LangUtils.hashCode(hash, this.domain); 96 return hash;
|
/external/apache-http/src/org/apache/http/message/ |
BasicNameValuePair.java | 184 int hash = LangUtils.HASH_SEED; local 185 hash = LangUtils.hashCode(hash, this.name); 186 hash = LangUtils.hashCode(hash, this.value); 187 return hash;
|
/external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
size_hash.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 31 test_hash<std::hash<NotConstructible> >, 36 test_hash<std::hash<NotConstructible> >(8) 39 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 51 test_hash<std::hash<NotConstructible> >, 56 test_hash<std::hash<NotConstructible> >(8) 59 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
/external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
size_hash.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 31 test_hash<std::hash<NotConstructible> >, 36 test_hash<std::hash<NotConstructible> >(8) 39 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 51 test_hash<std::hash<NotConstructible> >, 56 test_hash<std::hash<NotConstructible> >(8) 59 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
/external/mesa3d/src/mesa/program/ |
prog_cache.c | 39 GLuint hash; member in struct:cache_item 55 * Compute hash index from state key. 61 GLuint hash = 0, i; local 65 /* Make a slightly better attempt at a hash function: 69 hash += ikey[i]; 70 hash += (hash << 10); 71 hash ^= (hash >> 6); 74 return hash; 182 const GLuint hash = hash_key(key, keysize); local 203 const GLuint hash = hash_key(key, keysize); local 231 const GLuint hash = hash_key(key, keysize); local [all...] |
/external/wpa_supplicant_8/src/crypto/ |
sha1-tprf.c | 34 u8 hash[SHA1_MAC_LEN]; local 40 addr[0] = hash; 57 if (hmac_sha1_vector(key, key_len, 5, addr, len, hash)) 60 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN); 63 os_memcpy(&buf[pos], hash, plen); 69 os_memset(hash, 0, SHA1_MAC_LEN);
|
/frameworks/base/core/java/android/view/ |
DisplayAdjustments.java | 76 int hash = 17; local 77 hash = hash * 31 + mCompatInfo.hashCode(); 79 hash = hash * 31 + (mConfiguration == null ? 0 : mConfiguration.hashCode()); 81 return hash;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
size_hash.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 31 test_hash<std::hash<NotConstructible> >, 36 test_hash<std::hash<NotConstructible> >(8) 39 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 51 test_hash<std::hash<NotConstructible> >, 56 test_hash<std::hash<NotConstructible> >(8) 59 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
size_hash.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 31 test_hash<std::hash<NotConstructible> >, 36 test_hash<std::hash<NotConstructible> >(8) 39 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 51 test_hash<std::hash<NotConstructible> >, 56 test_hash<std::hash<NotConstructible> >(8) 59 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
/external/fio/ |
filelock.c | 3 * No hash indexing, just a list, so only works well for < 100 files or 15 #include "hash.h" 19 uint32_t hash; member in struct:fio_filelock 119 static struct fio_filelock *fio_hash_find(uint32_t hash) 126 if (ff->hash == hash) 133 static struct fio_filelock *fio_hash_get(uint32_t hash, int trylock) 137 ff = fio_hash_find(hash); 146 * If we dropped the main lock, re-lookup the hash in case 153 __ff = fio_hash_find(hash); 171 uint32_t hash; local 228 uint32_t hash; local [all...] |
/external/mesa3d/src/gallium/auxiliary/cso_cache/ |
cso_cache.c | 51 unsigned hash = 0, i; local 58 hash ^= ikey[i]; 60 return hash; 85 struct cso_hash *hash; local 86 hash = sc->hashes[type]; 87 return hash; 156 struct cso_hash *hash, 161 sc->sanitize_cb(hash, type, max_size, sc->sanitize_data); 165 static INLINE void sanitize_cb(struct cso_hash *hash, enum cso_cache_type type, 170 int hash_size = cso_hash_size(hash); 190 struct cso_hash *hash = _cso_hash_for_type(sc, type); local 200 struct cso_hash *hash = _cso_hash_for_type(sc, type); local 242 struct cso_hash *hash = _cso_hash_for_type(sc, type); local 266 struct cso_hash *hash = _cso_hash_for_type(sc, type); local [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
u_cache.c | 51 uint32_t hash; member in struct:util_cache_entry 67 /** Hash function */ 68 uint32_t (*hash)(const void *key); member in struct:util_cache 90 util_cache_create(uint32_t (*hash)(const void *key), 101 cache->hash = hash; 123 uint32_t hash, 127 uint32_t index = hash % cache->size; 142 if (current->hash == hash & 186 uint32_t hash = cache->hash(key); local 221 uint32_t hash = cache->hash(key); local 292 uint32_t hash; local [all...] |
u_surfaces.c | 42 if(!us->u.hash) 43 us->u.hash = cso_hash_create(); 45 ps = cso_hash_iter_data(cso_hash_find(us->u.hash, (layer << 8) | level)); 71 cso_hash_insert(us->u.hash, (layer << 8) | level, ps); 85 cso_hash_erase(us->u.hash, cso_hash_find(us->u.hash, (ps->u.tex.first_layer << 8) | ps->u.tex.level)); 96 if(us->u.hash) 99 iter = cso_hash_first_node(us->u.hash); 105 cso_hash_delete(us->u.hash); 106 us->u.hash = NULL [all...] |
/external/skia/src/core/ |
SkTHash.h | 21 // - static uint32_t Hash(K) 48 // Copy val into the hash table, returning a pointer to the copy now in the table. 59 uint32_t hash = Hash(key); local 60 int index = hash & (fCapacity-1); 66 if (!s.removed() && hash == s.hash && key == Traits::GetKey(s.val)) { 75 // Remove the value with this key from the hash table. 79 uint32_t hash = Hash(key) local 118 uint32_t hash = Hash(key); local 170 uint32_t hash = Traits::Hash(key); local 182 uint32_t hash; member in struct:SkTHashTable::Slot [all...] |
/frameworks/base/tools/aapt/ |
ResourceIdCache.cpp | 34 static inline uint32_t hashround(uint32_t hash, int c) { 35 return ((hash << 5) + hash) + c; /* hash * 33 + c */ 38 static uint32_t hash(const android::String16& hashableString) { function 39 uint32_t hash = 5381; local 41 while (int c = *str++) hash = hashround(hash, c); 42 return hash; 63 const uint32_t hashcode = hash(hashedName) [all...] |
/external/icu/icu4c/source/test/perf/unisetperf/draft/ |
bitset.cpp | 17 * Uses a simple hash table for compaction. 26 * Hash table for up to 1k 64-bit words, for 1 bit per BMP code point. 48 int32_t hash=(int32_t)(key>>55)&0x1ff; local 49 hash^=(int32_t)(key>>44)&0x7ff; 50 hash^=(int32_t)(key>>33)&0x7ff; 51 hash^=(int32_t)(key>>22)&0x7ff; 52 hash^=(int32_t)(key>>11)&0x7ff; 53 hash^=(int32_t)key&0x7ff; 55 if(values[hash]==0xffff) { 57 keys[hash]=key [all...] |