| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/cache/ |
| ftccache.h | 62 FT_Offset hash; /* used for hashing too */ member in struct:FTC_NodeRec_
76 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
78 ( ( ( ( hash ) & ( cache )->mask ) < ( cache )->p ) \
79 ? ( ( hash ) & ( ( cache )->mask * 2 + 1 ) ) \
80 : ( ( hash ) & ( cache )->mask ) ) )
84 FT_Offset hash );
85 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
86 ftc_get_top_node_for_hash( ( cache ), ( hash ) )
142 /* each cache really implements a dynamic hash table to manage its nodes */
182 FT_Offset hash,
[all...] |
| /external/mesa3d/src/glx/ |
| glxhash.c | 1 /* glxhash.c -- Small hash table support for integer -> integer mapping
33 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
42 * 2) The hash computation uses a table of random integers [Hanson97,
50 * dynamic hash tables was postponed until the need arises. A common (and
51 * naive) approach to dynamic hash table implementation simply creates a
52 * new hash table when necessary, rehashes all the data into the new table,
68 * [Larson88] Per-Ake Larson. "Dynamic Hash Tables". CACM 31(4), April
129 unsigned long hash = 0; local
145 hash = (hash << 1) + scatter[tmp & 0xff]
203 unsigned long hash = HashHash(key); local
251 unsigned long hash; local
276 unsigned long hash; local
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| AbstractStreamingHashFunction.java | 15 package com.google.common.hash;
28 * {@link Hasher#hash}.
37 return newHasher().putObject(instance, funnel).hash();
41 return newHasher().putUnencodedChars(input).hash();
45 return newHasher().putString(input, charset).hash();
49 return newHasher().putInt(input).hash();
53 return newHasher().putLong(input).hash();
57 return newHasher().putBytes(input).hash();
61 return newHasher().putBytes(input, off, len).hash();
78 /** Buffer via which we pass data to the hash algorithm (the implementor) *
228 public final HashCode hash() { method in class:AbstractStreamingHashFunction.AbstractStreamingHasher
[all...] |
| /external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
| copy.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8),
58 assert(c.hash_function() == test_hash<std::hash<int> >(8));
70 test_hash<std::hash<int> >,
86 test_hash<std::hash<int> >(8),
97 assert(c.hash_function() == test_hash<std::hash<int> >(8));
110 test_hash<std::hash<int> >,
126 test_hash<std::hash<int> >(8)
[all...] |
| /frameworks/base/tools/aapt2/process/ |
| SymbolTable.h | 37 std::hash<std::u16string> strHash;
38 android::hash_t hash = 0; local
39 hash = android::JenkinsHashMix(hash, (uint32_t) strHash(name.package));
40 hash = android::JenkinsHashMix(hash, (uint32_t) name.type);
41 hash = android::JenkinsHashMix(hash, (uint32_t) strHash(name.entry));
42 return hash;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| copy.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8),
58 assert(c.hash_function() == test_hash<std::hash<int> >(8));
70 test_hash<std::hash<int> >,
86 test_hash<std::hash<int> >(8),
97 assert(c.hash_function() == test_hash<std::hash<int> >(8));
110 test_hash<std::hash<int> >,
126 test_hash<std::hash<int> >(8)
[all...] |
| /art/runtime/ |
| utf.cc | 174 uint32_t hash = 0; local
176 hash = hash * 31 + *chars++;
178 return static_cast<int32_t>(hash);
182 uint32_t hash = 0; local
186 hash = hash * 31 + first;
190 hash = hash * 31 + second;
195 return static_cast<int32_t>(hash);
199 uint32_t hash = 0; local
[all...] |
| /external/apache-harmony/x-net/src/test/impl/java.injected/org/apache/harmony/xnet/provider/jsse/ |
| ServerKeyExchangeTest.java | 36 byte[] hash = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5,
39 null, hash);
43 assertTrue("incorrect ServerKeyExchange", Arrays.equals(message.hash,
44 hash));
60 assertTrue("incorrect message decoding", Arrays.equals(message.hash,
61 message_2.hash));
90 byte[] hash = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5,
93 hash);
97 assertTrue("incorrect ServerKeyExchange", Arrays.equals(message.hash,
98 hash));
[all...] |
| /external/boringssl/src/crypto/lhash/ |
| lhash.c | 69 * average chain length exceeds this value, the hash table will be resized. */
73 _LHASH *lh_new(lhash_hash_func hash, lhash_cmp_func comp) {
94 ret->hash = hash;
95 if (ret->hash == NULL) {
96 ret->hash = (lhash_hash_func) lh_strhash;
129 * is not NULL, then it also puts the hash value of |data| in |*out_hash|. */
132 const uint32_t hash = lh->hash(data); local
136 *out_hash = hash;
226 uint32_t hash; local
[all...] |
| /external/ipsec-tools/src/racoon/ |
| vendorid.c | 132 lookup_vendor_id_by_hash (const char *hash)
135 unsigned char *h = (unsigned char *)hash;
138 if (strncmp(all_vendor_ids[i].hash->v, hash,
139 all_vendor_ids[i].hash->l) == 0)
154 all_vendor_ids[i].hash = vmalloc(sizeof(vendorid_dpd_hash));
155 if (all_vendor_ids[i].hash == NULL) {
157 "unable to get memory for VID hash\n");
160 memcpy(all_vendor_ids[i].hash->v, vendorid_dpd_hash,
168 all_vendor_ids[i].hash = eay_md5_one(&vid)
[all...] |
| /frameworks/opt/bitmap/src/com/android/bitmap/ |
| ContiguousFIFOAggregator.java | 100 final int hash = key.hashCode(); local
103 mTasks.remove(hash);
107 mTasks.put(hash, new Value(callback, null));
167 final int hash = key.hashCode(); local
168 final Value value = mTasks.get(hash);
201 final int hash = first.hashCode(); local
202 final Value value = mTasks.get(hash);
209 mTasks.delete(hash);
224 final int hash = key.hashCode(); local
225 final Value value = mTasks.get(hash);
257 final int hash = key.hashCode(); local
[all...] |
| /device/google/contexthub/lib/nanohub/ |
| nanoapp.c | 101 static void doPrintHash(FILE *out, const char *pfx, const uint32_t *hash, size_t size, int increment)
107 fprintf(out, "%08" PRIx32, hash[pos]);
111 void printHash(FILE *out, const char *pfx, const uint32_t *hash, size_t size)
113 doPrintHash(out, pfx, hash, size, 1);
116 void printHashRev(FILE *out, const char *pfx, const uint32_t *hash, size_t size)
118 doPrintHash(out, pfx, hash + size - 1, size, -1);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/ |
| StatisticalSummaryValues.java | 149 * Returns hash code based on values of statistics
151 * @return hash code
155 int result = 31 + MathUtils.hash(getMax());
156 result = result * 31 + MathUtils.hash(getMean());
157 result = result * 31 + MathUtils.hash(getMin());
158 result = result * 31 + MathUtils.hash(getN());
159 result = result * 31 + MathUtils.hash(getSum());
160 result = result * 31 + MathUtils.hash(getVariance());
|
| /external/apache-http/src/org/apache/http/auth/ |
| NTCredentials.java | 154 int hash = LangUtils.HASH_SEED; local
155 hash = LangUtils.hashCode(hash, this.principal);
156 hash = LangUtils.hashCode(hash, this.workstation);
157 return hash;
|
| /external/caliper/caliper/src/main/java/com/google/caliper/model/ |
| VmSpec.java | 24 import com.google.common.hash.Funnel;
25 import com.google.common.hash.PrimitiveSink;
41 @ExcludeFromJson private int hash; field in class:VmSpec
74 if (hash == 0) {
75 this.hash = getPersistentHashFunction().hashObject(this, VmSpecFunnel.INSTANCE).asInt();
81 return hash;
|
| /external/fio/lib/ |
| bloom.c | 5 #include "../hash.h"
94 uint32_t hash[N_HASHES]; local
98 hash[i] = hashes[i].fn(data, nwords, hashes[i].seed);
99 hash[i] = hash[i] % b->nentries;
104 const unsigned int index = hash[i] / BITS_PER_INDEX;
105 const unsigned int bit = hash[i] & BITS_INDEX_MASK;
|
| /external/guava/guava-tests/test/com/google/common/hash/ |
| AbstractByteHasherTest.java | 15 package com.google.common.hash;
74 new TestHasher().putUnencodedChars(s).hash(),
75 new TestHasher().putBytes(s.getBytes(UTF_16LE)).hash());
77 new TestHasher().putUnencodedChars(s).hash(),
78 new TestHasher().putString(s, UTF_16LE).hash());
136 public HashCode hash() { method in class:AbstractByteHasherTest.TestHasher
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| init_size_hash.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
33 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8)
55 assert(c.hash_function() == test_hash<std::hash<int> >(8));
68 test_hash<std::hash<int> >,
82 test_hash<std::hash<int> >(8)
90 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| init_size_hash_equal.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
34 test_hash<std::hash<int> >,
48 test_hash<std::hash<int> >(8),
57 assert(c.hash_function() == test_hash<std::hash<int> >(8));
70 test_hash<std::hash<int> >,
84 test_hash<std::hash<int> >(8),
93 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| /external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| init_size_hash.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8)
55 assert(c.hash_function() == test_hash<std::hash<int> >(8));
67 test_hash<std::hash<int> >,
81 test_hash<std::hash<int> >(8)
89 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| init_size_hash_equal.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8),
56 assert(c.hash_function() == test_hash<std::hash<int> >(8));
68 test_hash<std::hash<int> >,
82 test_hash<std::hash<int> >(8),
91 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| init_size_hash_equal_allocator.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8),
57 assert(c.hash_function() == test_hash<std::hash<int> >(8));
69 test_hash<std::hash<int> >,
83 test_hash<std::hash<int> >(8),
93 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| range_size_hash.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
34 test_hash<std::hash<int> >,
50 test_hash<std::hash<int> >(8)
58 assert(c.hash_function() == test_hash<std::hash<int> >(8));
70 test_hash<std::hash<int> >,
86 test_hash<std::hash<int> >(8)
94 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| range_size_hash_equal.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
34 test_hash<std::hash<int> >,
50 test_hash<std::hash<int> >(8),
59 assert(c.hash_function() == test_hash<std::hash<int> >(8));
71 test_hash<std::hash<int> >,
87 test_hash<std::hash<int> >(8),
96 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
| range_size_hash_equal_allocator.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
35 test_hash<std::hash<int> >,
51 test_hash<std::hash<int> >(8),
61 assert(c.hash_function() == test_hash<std::hash<int> >(8));
73 test_hash<std::hash<int> >,
89 test_hash<std::hash<int> >(8),
99 assert(c.hash_function() == test_hash<std::hash<int> >(8));
|
