| /external/chromium_org/courgette/ |
| difference_estimator.cc | 26 size_t hash = ((hash1 * 17 + hash2 * 37) + (hash1 >> 17)) ^ (hash2 >> 23); local
27 return hash;
46 size_t hash = HashTuple(p); local
47 hashes_.insert(hash);
103 size_t hash = HashTuple(p); local
104 if (base->hashes_.find(hash) == base->hashes_.end()) {
|
| /external/dropbear/libtomcrypt/src/pk/dsa/ |
| dsa_encrypt_key.c | 28 @param hash The index of the hash you want to use
34 prng_state *prng, int wprng, int hash,
47 /* check that wprng/cipher/hash are not invalid */
52 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
56 if (inlen > hash_descriptor[hash].hashsize) {
102 if ((err = hash_memory(hash, expt, x, skey, &y)) != CRYPT_OK) {
112 LTC_ASN1_OBJECT_IDENTIFIER, hash_descriptor[hash].OIDlen, hash_descriptor[hash].OID,
|
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| ecc_encrypt_key.c | 34 @param hash The index of the hash you want to use
40 prng_state *prng, int wprng, int hash,
53 /* check that wprng/cipher/hash are not invalid */
58 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
62 if (inlen > hash_descriptor[hash].hashsize) {
102 if ((err = hash_memory(hash, ecc_shared, x, skey, &y)) != CRYPT_OK) {
112 LTC_ASN1_OBJECT_IDENTIFIER, hash_descriptor[hash].OIDlen, hash_descriptor[hash].OID,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| copy_alloc.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));
|
| 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));
|
| /external/chromium_org/chrome/browser/spellchecker/ |
| feedback_unittest.cc | 19 // Hash identifier for a misspelling.
31 void AddMisspelling(int renderer_process_id, uint32 hash) {
33 misspelling.hash = hash;
46 EXPECT_EQ(kMisspellingHash, result->hash);
91 EXPECT_EQ(kMisspellingHash, renderer_with_misspellings[0].hash);
166 EXPECT_NE(result[0].hash, result[1].hash);
167 EXPECT_TRUE(result[0].hash == kMisspellingHash ||
168 result[0].hash == kMisspellingHash + 1)
192 uint32 hash = kMisspellingHash; local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| ExpandedNameTable.java | 31 * a simple hash algorithm directly into this class, instead of using the
33 * are combined in getExpandedTypeID() method to share the same hash calculation
35 * expand the hash table.
80 * The initial capacity of the hash table. Use a bigger number
86 * The capacity of the hash table, i.e. the size of the
92 * The threshold of the hash table, which is equal to capacity * loadFactor.
93 * If the number of entries in the hash table is bigger than the threshold,
94 * the hash table needs to be expanded.
99 * The internal array to store the hash entries.
100 * Each array member is a slot for a hash bucket
187 int hash = type + namespace.hashCode() + localName.hashCode(); local
379 int hash; field in class:ExpandedNameTable.HashEntry
[all...] |
| /external/chromium/chrome/browser/sync/util/ |
| nigori.cc | 150 std::vector<unsigned char> hash(kHashSize);
151 if (!hmac.Sign(ciphertext, &hash[0], hash.size()))
156 output.append(hash.begin(), hash.end());
191 std::vector<unsigned char> hash(kHashSize);
192 if (!hmac.Sign(ciphertext, &hash[0], hash.size()))
198 output.append(hash.begin(), hash.end())
[all...] |
| /external/chromium_org/sync/util/ |
| nigori.cc | 145 std::vector<unsigned char> hash(kHashSize);
146 if (!hmac.Sign(ciphertext, &hash[0], hash.size()))
151 output.append(hash.begin(), hash.end());
181 std::vector<unsigned char> hash(kHashSize);
182 if (!hmac.Sign(ciphertext, &hash[0], hash.size()))
188 output.append(hash.begin(), hash.end())
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/lhash/ |
| lhash.c | 59 /* Code for dynamic hash table routines
114 /* The field 'iteration_state' is used to hold data to ensure that a hash
135 /* Returns 1 if the hash table is currently being iterated on, 0 otherwise. */
158 /* This macro returns 1 if the hash table should be expanded due to its current
184 /* This macro returns 1 if the hash table should be contracted due to its
234 ret->hash=((h == NULL)?(LHASH_HASH_FN_TYPE)lh_strhash:h);
290 unsigned long hash; local
301 rn=getrn(lh,data,&hash);
313 nn->hash=hash;
331 unsigned long hash; local
364 unsigned long hash; local
439 unsigned long hash,nni; local
533 unsigned long hash,nn; local
[all...] |
| /external/guava/guava-tests/test/com/google/common/cache/ |
| LocalCacheTest.java | 424 int hash = map.hash(key); local
427 ReferenceEntry<Object, Object> entry = segment.getEntry(key, hash);
480 int hash = map.hash(key); local
482 int index = hash & (table.length() - 1);
484 DummyEntry<Object, Object> entry = DummyEntry.create(key, hash, null);
509 int hash = map.hash(key); local
511 int index = hash & (table.length() - 1)
570 int hash = map.hash(one); local
707 int hash = map.hash(key); local
809 int hash = map.hash(one); local
969 int hash = map.hash(key); local
1044 int hash = map.hash(key); local
1088 int hash = map.hash(key); local
1127 int hash = map.hash(key); local
1159 int hash = map.hash(key); local
1194 int hash = map.hash(key); local
1230 int hash = map.hash(key); local
1305 int hash = map.hash(key); local
1344 int hash = map.hash(key); local
1397 int hash = map.hash(key); local
1529 int hash = map.hash(key); local
1587 int hash = map.hash(key); local
1622 int hash = map.hash(key); local
1657 int hash = map.hash(key); local
1691 int hash = map.hash(key); local
1737 int hash = map.hash(key); local
1860 int hash = map.hash(key); local
1901 int hash = map.hash(key); local
1943 int hash = map.hash(key); local
2144 int hash = map.hash(key); local
2481 private final int hash; field in class:LocalCacheTest.DummyEntry
[all...] |
| /external/chromium/chrome/browser/safe_browsing/ |
| bloom_filter.h | 13 // 4 byte number of hash keys (n)
14 // n * 8 bytes of hash keys
42 void Insert(SBPrefix hash);
43 bool Exists(SBPrefix hash) const;
56 // hash request rate (in bytes).
|
