| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(key_const_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(key_const_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (key_const_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(const_key_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(const_key_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (const_key_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(const_key_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(const_key_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (const_key_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(const_key_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(const_key_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (const_key_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(const_key_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(const_key_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (const_key_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(const_key_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(const_key_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (const_key_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(key_const_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(key_const_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (key_const_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(const_key_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(const_key_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (const_key_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(key_const_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(key_const_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (key_const_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(key_const_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(key_const_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (key_const_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(key_const_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(key_const_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (key_const_reference r_key, size_type hash) cons
[all...] |
| /external/icu/icu4c/source/i18n/ |
| sortkey.cpp | 41 // A hash code of kInvalidHashCode indicates that the hash code needs
42 // to be computed. A hash code of kEmptyHashCode is used for empty keys
43 // and for any key whose computed hash code is kInvalidHashCode.
46 // The "bogus hash code" replaces a separate fBogus flag.
247 int32_t hash; local
249 hash = kEmptyHashCode;
251 hash = ustr_hashCharsN(s, length);
252 if (hash == kInvalidHashCode || hash == kBogusHashCode)
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_hash_table.c | 30 * General purpose hash table implementation.
33 * probing hash table implementation at some point -- as it is said they have
35 * a lock-free implementation of such hash tables .
54 /** Hash function */
55 unsigned (*hash)(void *key); member in struct:util_hash_table
79 util_hash_table_create(unsigned (*hash)(void *key),
94 ht->hash = hash;
154 key_hash = ht->hash(key);
191 key_hash = ht->hash(key)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
| OpenIntToDoubleHashMap.java | 85 /** Bit mask for hash values. */
180 final int hash = hashOf(key); local
181 int index = hash & mask;
191 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {
210 final int hash = hashOf(key); local
211 int index = hash & mask;
221 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {
245 * Perturb the hash for starting probing.
246 * @param hash initial hash
272 final int hash = hashOf(key); local
354 final int hash = hashOf(key); local
[all...] |
| OpenIntToFieldHashMap.java | 91 /** Bit mask for hash values. */
192 final int hash = hashOf(key); local
193 int index = hash & mask;
203 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {
222 final int hash = hashOf(key); local
223 int index = hash & mask;
233 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {
257 * Perturb the hash for starting probing.
258 * @param hash initial hash
284 final int hash = hashOf(key); local
366 final int hash = hashOf(key); local
[all...] |
| /external/e2fsprogs/debugfs/ |
| htree.c | 2 * htree.c --- hash tree routines
43 ext2_dirhash_t hash, minor_hash; local
89 &hash, &minor_hash);
92 "while calculating hash");
94 dirent->inode, hash, minor_hash, rec_len, name);
122 int hash, i; local
133 hash = i ? ext2fs_le32_to_cpu(ent[i].hash) : 0;
134 fprintf(pager, "Entry #%d: Hash 0x%08x%s, block %u\n", i,
135 hash, (hash & 1) ? " (**)" : ""
271 ext2_dirhash_t hash, minor_hash; local
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| HashMap.java | 87 * The hash table. If this hash map contains a mapping for null, it is
88 * not represented this hash table.
98 * The number of mappings in this hash map.
134 * the initial capacity of this hash map.
166 * the initial capacity of this hash map.
300 int hash = Collections.secondaryHash(key); local
302 for (HashMapEntry<K, V> e = tab[hash & (tab.length - 1)];
305 if (eKey == key || (e.hash == hash && key.equals(eKey)))
325 int hash = Collections.secondaryHash(key); local
385 int hash = Collections.secondaryHash(key); local
448 int hash = Collections.secondaryHash(key); local
616 int hash = Collections.secondaryHash(key); local
721 final int hash; field in class:HashMap.HashMapEntry
836 int hash = Collections.secondaryHash(key); local
864 int hash = Collections.secondaryHash(key); local
[all...] |
| Hashtable.java | 72 * The hash table.
77 * The number of mappings in this hash map.
265 int hash = Collections.secondaryHash(key); local
267 for (HashtableEntry<K, V> e = tab[hash & (tab.length - 1)];
270 if (eKey == key || (e.hash == hash && key.equals(eKey))) {
289 int hash = Collections.secondaryHash(key); local
291 for (HashtableEntry<K, V> e = tab[hash & (tab.length - 1)];
294 if (eKey == key || (e.hash == hash && key.equals(eKey)))
364 int hash = Collections.secondaryHash(key); local
400 int hash = Collections.secondaryHash(key); local
553 int hash = Collections.secondaryHash(key); local
662 final int hash; field in class:Hashtable.HashtableEntry
797 int hash = Collections.secondaryHash(key); local
813 int hash = Collections.secondaryHash(key); local
[all...] |
| /external/fio/t/ |
| dedupe.c | 54 uint32_t hash[MD5_HASH_WORDS]; member in struct:chunk
60 uint32_t hash[MD5_HASH_WORDS]; member in struct:item
207 diff = memcmp(i->hash, c->hash, sizeof(i->hash));
232 memcpy(c->hash, i->hash, sizeof(i->hash));
251 s = sizeof(items[i].hash) / sizeof(uint32_t);
252 r = bloom_set(bloom, items[i].hash, s)
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/encodings/ |
| OAEPEncoding.java | 37 Digest hash)
39 this(cipher, hash, null);
44 Digest hash,
47 this(cipher, hash, hash, encodingParams);
52 Digest hash,
58 this.defHash = new byte[hash.getDigestSize()];
60 hash.reset();
64 hash.update(encodingParams, 0, encodingParams.length);
67 hash.doFinal(defHash, 0)
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| MapMakerInternalMap.java | 62 * The concurrent hash map implementation built by {@link MapMaker}.
76 * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
138 * Mask value for indexing into segments. The upper bits of a key's hash code are used to choose
149 /** The segments, each of which is a specialized hash table. */
341 * Returns the default equivalence strategy used to compare and hash keys or values referenced
355 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
356 return new StrongEntry<K, V>(key, hash, next);
362 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
363 return new StrongExpirableEntry<K, V>(key, hash, next);
377 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next)
984 final int hash; field in class:MapMakerInternalMap.StrongEntry
1238 final int hash; field in class:MapMakerInternalMap.SoftEntry
1496 final int hash; field in class:MapMakerInternalMap.WeakEntry
1836 int hash = original.getHash(); local
1846 int hash = entry.getHash(); local
1850 int hash(Object key) { method in class:MapMakerInternalMap
1857 int hash = entry.getHash(); local
1858 segmentFor(hash).reclaimValue(entry.getKey(), hash, valueReference); local
1862 int hash = entry.getHash(); local
2903 e.getKey(), hash, e.getValueReference().get(), RemovalCause.COLLECTED); local
2998 enqueueNotification(e.getKey(), hash, e.getValueReference().get(), cause); local
[all...] |
| /external/fio/crc/ |
| md5.c | 8 static void md5_transform(uint32_t *hash, uint32_t const *in)
12 a = hash[0];
13 b = hash[1];
14 c = hash[2];
15 d = hash[3];
85 hash[0] += a;
86 hash[1] += b;
87 hash[2] += c;
88 hash[3] += d;
93 mctx->hash[0] = 0x67452301
[all...] |
| /external/freetype/src/cache/ |
| ftccache.c | 87 /* get a top bucket for specified hash from cache,
88 * body for FTC_NODE__TOP_FOR_HASH( cache, hash )
92 FT_Offset hash )
98 idx = hash & cache->mask;
100 idx = hash & ( 2 * cache->mask + 1 );
109 * buckets array appropriately, we simply degrade the hash table's
153 if ( node->hash & ( mask + 1 ) )
215 /* otherwise, the hash table is balanced */
222 /* remove a node from its cache's hash table */
227 FTC_Node *pnode = FTC_NODE__TOP_FOR_HASH( cache, node0->hash );
[all...] |
| /external/libxml2/ |
| dict.c | 32 * it seems that having hash randomization might be a good idea
37 * well but since the attack is based on growing a very big hash
38 * list we will use the BigKey algo as soon as the hash size grows
367 * Calculate a hash key using a good hash function that works well for
368 * larger hash table sizes.
370 * Hash function by "One-at-a-Time Hash" see
371 * http://burtleburtle.net/bob/hash/doobs.html
376 uint32_t hash; local
410 uint32_t hash; local
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/annotation/ |
| Annotation.java | 92 int hash = type.hashCode(); local
93 hash = (hash * 31) + elements.hashCode();
94 hash = (hash * 31) + visibility.hashCode();
95 return hash;
|
