| /external/freetype/src/cache/ |
| ftccmap.c | 51 /* compute a query/node hash */
241 FT_Offset hash; local
266 hash = FTC_CMAP_HASH( face_id, (FT_UInt)cmap_index, char_code );
269 FTC_CACHE_LOOKUP_CMP( cache, ftc_cmap_node_compare, hash, &query,
272 error = FTC_Cache_Lookup( cache, hash, &query, &node );
|
| /external/guava/guava/src/com/google/common/base/ |
| Equivalence.java | 85 * Returns a hash code for {@code t}.
87 * <p>The {@code hash} has the following properties:
90 * {@code hash(x}} consistently return the same value provided {@code x} remains unchanged
91 * according to the definition of the equivalence. The hash need not remain consistent from
94 * if {@code equivalent(x, y)}, then {@code hash(x) == hash(y)}. It is <i>not</i> necessary
95 * that the hash be distributable across <i>inequivalence</i>. If {@code equivalence(x, y)}
96 * is false, {@code hash(x) == hash(y)} may still be true.
97 * <li>{@code hash(null)} is {@code 0}
100 public final int hash(@Nullable T t) { method in class:Equivalence
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| Murmur3_128HashFunction.java | 26 package com.google.common.hash;
|
| Murmur3_32HashFunction.java | 26 package com.google.common.hash;
139 // Finalization mix - force all bits of a hash block to avalanche
|
| SipHashFunction.java | 20 package com.google.common.hash;
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| CollectionBenchmarkSampleData.java | 113 final int hash; field in class:CollectionBenchmarkSampleData.Element
114 Element(int hash) {
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);
[all...] |
| /external/guava/guava-tests/test/com/google/common/hash/ |
| HashFunctionEnum.java | 17 package com.google.common.hash;
20 * An enum that contains all of the known hash functions.
39 // Hash functions found in //javatests for comparing against current implementation of CityHash.
|
| HashingInputStreamTest.java | 15 package com.google.common.hash;
124 assertEquals(expectedHash, in.hash());
136 assertEquals(expectedHash, in.hash());
150 assertEquals(expectedHash, in.hash());
|
| /external/icu/icu4c/source/common/unicode/ |
| stringtriebuilder.h | 185 // Hash set of nodes, maps from nodes to integer 1.
194 Node(int32_t initialHash) : hash(initialHash), offset(0) {}
195 inline int32_t hashCode() const { return hash; }
245 int32_t hash; member in class:StringTrieBuilder::Node
279 hash=hash*37u+v;
345 hash=(hash*37u+c)*37u+value;
353 hash=(hash*37u+c)*37u+hashCode(node)
[all...] |
| /external/icu/icu4c/source/i18n/ |
| 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 == kBogusHashCode)
[all...] |
| /external/icu/icu4c/source/test/cintltst/ |
| 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, omega, 24, 0)
156 UHashtable *hash; local
290 UHashtable *hash; local
[all...] |
| /external/iproute2/lib/ |
| 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/ |
| vendorid.h | 97 vchar_t *hash; member in struct:vendor_id
|
| /external/javassist/src/main/javassist/ |
| SerialVersionUID.java | 185 // calculate hash.
189 long hash = 0; local
191 hash = (hash << 8) | (digested[i] & 0xFF);
193 return hash;
|
| /external/jemalloc/include/jemalloc/internal/ |
| 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/ |
| 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/ |
| optional.h | 498 struct hash<base::Optional<T>> { struct in namespace:std
500 return opt == base::nullopt ? 0 : std::hash<T>()(*opt);
|
| 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);
|
| /external/libchrome/base/trace_event/ |
| memory_usage_estimator.h | 437 size_t hash; member in struct:base::trace_event::Node
|
| /external/libconstrainedcrypto/test/ |
| 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/libcups/cups/ |
| ppd-localize.c | 621 * '_ppdHashName()' - Generate a hash value for a device or profile name.
627 unsigned /* O - Hash value */
628 _ppdHashName(const char *name) /* I - Name to hash */
631 hash = 0; /* Hash value */ local
635 hash += (*name & 255) * mult;
637 return (hash);
|
| /external/libmojo/mojo/public/cpp/bindings/ |
| struct_ptr.h | 84 // TODO(tibell): Get rid of Equals in favor of the operator. Same for Hash.
92 size_t Hash(size_t seed) const {
95 return ptr_->Hash(seed);
187 size_t Hash(size_t seed) const {
190 return value_.Hash(seed);
268 struct hash<mojo::StructPtr<T>> { struct in namespace:std
270 return value.Hash(mojo::internal::kHashSeed);
275 struct hash<mojo::InlinedStructPtr<T>> { struct in namespace:std
277 return value.Hash(mojo::internal::kHashSeed);
|
| /external/libnetfilter_conntrack/src/conntrack/ |
| labels.c | 43 unsigned int hash = 0; local
46 hash = (hash << 5) - hash + *name;
49 return hash & (HASH_SIZE - 1);
|
| /external/libnfnetlink/src/ |
| 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], head)
187 unsigned int hash; local
[all...] |
| /external/libnl/tests/ |
| test-complex-HTB-with-hash-filters.c | 2 * test/test-complex-HTB-with-hash-filters.c Add HTB qdisc, HTB classes and creates some hash filters
48 __u32 htid=0, hash=0, nodeid=0; local
63 hash = strtoul(str, &tmp, 16);
66 if (hash>=0x100)
77 *handle = (htid<<20)|(hash<<12)|nodeid;
91 printf("\"link\" must be a hash table.\n");
134 * Function that adds a new filter and attach it to a hash table
185 * Function that adds a new filter and attach it to a hash table
186 * and set next hash table link with hash mas
[all...] |
