/external/guava/guava/src/com/google/common/hash/ |
H A D | SipHashFunction.java | 20 package com.google.common.hash;
|
/external/guava/guava-testlib/test/com/google/common/testing/ |
H A D | EquivalenceTesterTest.java | 181 "the hash (1) of TestObject{group=1, item=1} [group 1, item 1] must be " 182 + "equal to the hash (2) of TestObject{group=1, item=2} [group 1, item 2]"; 227 void expectHash(Object object, int hash) { argument 229 hashExpectationsBuilder.put(object, hash);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | CollectionBenchmarkSampleData.java | 113 final int hash; field in class:CollectionBenchmarkSampleData.Element 114 Element(int hash) { argument 115 this.hash = hash; 119 || (obj instanceof Element && ((Element) obj).hash == hash); 122 return hash; 126 return Ints.compare(hash, that.hash); 129 return String.valueOf(hash); 134 SlowElement(int hash) argument [all...] |
/external/guava/guava-tests/test/com/google/common/hash/ |
H A D | BloomFilterTest.java | 17 package com.google.common.hash; 20 import static com.google.common.hash.BloomFilterStrategies.BitArray;
|
H A D | HashFunctionEnum.java | 17 package com.google.common.hash; 20 * An enum that contains all of the known hash functions.
|
/external/icu/icu4c/source/common/ |
H A D | hash.h | 31 UHashtable* hash; member in class:Hashtable 127 hash = &hashObj; 128 uhash_setKeyDeleter(hash, uprv_deleteUObject); 139 hash = &hashObj; 140 uhash_setKeyDeleter(hash, uprv_deleteUObject); 145 UErrorCode& status) : hash(0) { 150 : hash(0) 161 : hash(0) 172 : hash(0) 178 : hash( [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | sortkey.cpp | 43 // A hash code of kInvalidHashCode indicates that the hash code needs 44 // to be computed. A hash code of kEmptyHashCode is used for empty keys 45 // and for any key whose computed hash code is kInvalidHashCode. 48 // The "bogus hash code" replaces a separate fBogus flag. 249 int32_t hash; local 251 hash = kEmptyHashCode; 253 hash = ustr_hashCharsN(s, length); 254 if (hash == kInvalidHashCode || hash [all...] |
/external/icu/icu4c/source/test/cintltst/ |
H A D | chashtst.c | 32 static void _put(UHashtable* hash, 37 static void _get(UHashtable* hash, 41 static void _remove(UHashtable* hash, 106 UHashtable *hash; local 108 hash = uhash_open(hashChars, isEqualChars, NULL, &status); 111 u_errorName(status), hash); 114 if (hash == NULL) { 118 log_verbose("Ok: uhash_open returned 0x%08X\n", hash); 120 _put(hash, one, 1, 0); 121 _put(hash, omeg 156 UHashtable *hash; local 290 UHashtable *hash; local 338 _put(UHashtable* hash, const char* key, int32_t value, int32_t expectedOldValue) argument 357 _get(UHashtable* hash, const char* key, int32_t expectedValue) argument 374 _remove(UHashtable* hash, const char* key, int32_t expectedValue) argument [all...] |
/external/icu/icu4c/source/test/perf/unisetperf/draft/ |
H A D | bitset.cpp | 21 * Uses a simple hash table for compaction. 52 int32_t hash=(int32_t)(key>>55)&0x1ff; local 53 hash^=(int32_t)(key>>44)&0x7ff; 54 hash^=(int32_t)(key>>33)&0x7ff; 55 hash^=(int32_t)(key>>22)&0x7ff; 56 hash^=(int32_t)(key>>11)&0x7ff; 57 hash^=(int32_t)key&0x7ff; 59 if(values[hash]==0xffff) { 61 keys[hash]=key; 62 reverse[count]=hash; [all...] |
/external/iproute2/lib/ |
H A D | ll_map.c | 57 unsigned hash = 5381; local 60 hash = ((hash << 5) + hash) + *str++; /* hash * 33 + c */ 62 return hash;
|
/external/ipsec-tools/src/racoon/ |
H A D | vendorid.h | 97 vchar_t *hash; member in struct:vendor_id
|
/external/jemalloc/include/jemalloc/internal/ |
H A D | hash.h | 2 * The following hash function is based on MurmurHash3, placed into the public 27 void hash(const void *key, size_t len, const uint32_t seed, 338 hash(const void *key, size_t len, const uint32_t seed, size_t r_hash[2]) function
|
/external/kmod/libkmod/ |
H A D | libkmod-signature.c | 86 uint8_t hash; /* Digest algorithm [enum pkey_hash_algo] */ member in struct:module_signature 128 modsig->hash >= PKEY_HASH__LAST || 145 sig_info->hash_algo = pkey_hash_algo[modsig->hash];
|
/external/libchrome/base/files/ |
H A D | file_path.h | 473 // Provide a hash function so that hash_sets and maps can contain FilePath 478 struct hash<base::FilePath> { struct in namespace:BASE_HASH_NAMESPACE 480 return hash<base::FilePath::StringType>()(f.value());
|
/external/libchrome/base/ |
H A D | sha1.cc | 25 // while(there is data to hash) 199 char hash[SecureHashAlgorithm::kDigestSizeBytes]; local 201 str.length(), reinterpret_cast<unsigned char*>(hash)); 202 return std::string(hash, SecureHashAlgorithm::kDigestSizeBytes); 206 unsigned char* hash) { 211 memcpy(hash, sha.Digest(), SecureHashAlgorithm::kDigestSizeBytes); 205 SHA1HashBytes(const unsigned char* data, size_t len, unsigned char* hash) argument
|
/external/libconstrainedcrypto/test/ |
H A D | ecdsa_test.c | 227 p256_int hash; local 268 p256_from_bin(hash_buf, &hash); \ 271 if (result) { result = p256_ecdsa_verify(&key_x, &key_y, &hash, &r, &s); } \
|
/external/libnfnetlink/src/ |
H A D | iftable.c | 54 unsigned int hash, found = 0; local 71 hash = ifi_msg->ifi_index & 0xF; 72 list_for_each_entry(this, &h->ifindex_hash[hash], head) { 102 list_add(&this->head, &h->ifindex_hash[hash]); 120 unsigned int hash; local 130 hash = ifi_msg->ifi_index & 0xF; 131 list_for_each_entry_safe(this, tmp, &h->ifindex_hash[hash], head) { 153 unsigned int hash; local 164 hash = index & 0xF; 165 list_for_each_entry(this, &h->ifindex_hash[hash], hea 187 unsigned int hash; local [all...] |
/external/libnl/lib/route/ |
H A D | pktloc.c | 51 unsigned long hash = 5381; local 55 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */ 57 return hash % PKTLOC_NAME_HT_SIZ; 63 int hash; local 65 hash = pktloc_hash(name); 66 nl_list_for_each_entry(loc, &pktloc_name_ht[hash], list) { 212 * Add a packet location to the hash tabl [all...] |
/external/libunwind/include/tdep-ia64/ |
H A D | script.h | 53 unsigned short coll_chain; /* used for hash collisions */ 70 /* hash table that maps instruction pointer to script index: */ 71 unsigned short hash[IA64_UNW_HASH_SIZE]; member in struct:ia64_script_cache
|
/external/mesa3d/src/compiler/nir/ |
H A D | nir_lower_locals_to_regs.c | 35 /* A hash table mapping derefs to registers */ 41 /* The following two functions implement a hash and equality check for 42 * variable dreferences. When the hash or equality function encounters an 49 uint32_t hash = _mesa_fnv32_1a_offset_bias; local 52 hash = _mesa_fnv32_1a_accumulate(hash, deref_var->var); 58 hash = _mesa_fnv32_1a_accumulate(hash, deref_struct->index); 62 return hash; 96 uint32_t hash local [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_keymap.c | 82 * Return 4-byte hash key for a block of bytes. 85 hash(const void *key, unsigned keySize) function 87 unsigned i, hash; local 91 hash = 0; 93 hash ^= (i + 1) * ((const unsigned *) key)[i]; 96 /*hash = hash ^ (hash >> 11) ^ (hash >> 22);*/ 98 return hash; [all...] |
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | r300_fragprog_swizzle.c | 44 unsigned int hash; /**< swizzle value this matches */ member in struct:swizzle_data 80 if (swz != GET_SWZ(sd->hash, comp)) 170 if (swz == GET_SWZ(sd->hash, comp)) {
|
/external/mesa3d/src/gallium/winsys/radeon/drm/ |
H A D | radeon_drm_bo.h | 66 uint32_t hash; member in struct:radeon_bo
|
/external/mesa3d/src/util/ |
H A D | hash_table.h | 42 uint32_t hash; member in struct:hash_entry 80 _mesa_hash_table_insert_pre_hashed(struct hash_table *ht, uint32_t hash, 85 _mesa_hash_table_search_pre_hashed(struct hash_table *ht, uint32_t hash, 116 _mesa_fnv32_1a_accumulate_block(uint32_t hash, const void *data, size_t size) argument 121 hash ^= *bytes; 122 hash = hash * 0x01000193; 126 return hash; 129 #define _mesa_fnv32_1a_accumulate(hash, expr) \ 130 _mesa_fnv32_1a_accumulate_block(hash, [all...] |
H A D | set.c | 43 * From Knuth -- a good choice for hash/rehash values is p, p-2 where 45 * free to avoid exponential performance degradation as the hash table fills 159 * Finds a set entry with the given key and hash of that key. 164 set_search(const struct set *ht, uint32_t hash, const void *key) argument 168 hash_address = hash % ht->size; 176 } else if (entry_is_present(entry) && entry->hash == hash) { 182 double_hash = 1 + hash % ht->rehash; 185 } while (hash_address != hash % ht->size); 198 _mesa_set_search_pre_hashed(const struct set *set, uint32_t hash, argument 251 set_add(struct set *ht, uint32_t hash, const void *key) argument 320 _mesa_set_add_pre_hashed(struct set *set, uint32_t hash, const void *key) argument [all...] |