| /external/chromium_org/third_party/smhasher/src/ |
| KeysetTest.cpp | 10 // This should hopefully be a thorough and uambiguous test of whether a hash
13 bool VerificationTest ( pfHash hash, const int hashbits, uint32_t expected, bool verbose )
25 // Hash keys of the form {0}, {0,1}, {0,1,2}... up to N=255,using 256-N as
32 hash(key,i,256-i,&hashes[i*hashbytes]);
35 // Then hash the result array
37 hash(hashes,hashbytes*256,0,final);
39 // The first four bytes of that hash, interpreted as a little-endian integer, is our
65 // A hash function should not be reading outside the bounds of the key.
68 // result in a different hash.
72 // The memory alignment of the key should not affect the hash result
276 const hashtype & hash = (*it).first; 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...] |
| /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/chromium_org/content/test/data/dom_storage/ |
| common.js | 13 if (document.location.hash == '#fail')
19 document.location.hash = '#pass';
24 document.location.hash = '#fail';
|
| /external/chromium_org/content/test/data/fileapi/ |
| common.js | 12 if (document.location.hash == '#fail')
18 document.location.hash = '#pass';
24 document.location.hash = '#fail';
|
| /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/chromium_org/third_party/libvpx/ |
| update_libvpx.sh | 69 # Output the current commit hash.
70 hash=$(git log -1 --format="%H")
71 echo "Current HEAD: $hash"
73 # Output log for upstream from current hash.
80 $prev_hash..$hash)"
87 $hash..$prev_hash)"
|
| /external/chromium_org/v8/src/compiler/ |
| node-cache.cc | 60 int hash = NodeCacheHash(old->key_); local
61 int start = hash & (size_ - 1);
79 int32_t hash = NodeCacheHash(key); local
86 Entry* entry = &entries_[hash & (INITIAL_SIZE - 1)];
93 int start = hash & (size_ - 1);
108 Entry* entry = &entries_[hash & (size_ - 1)];
|
| /external/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));
|
| /external/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));
|
| /external/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 | 21 // Hash identifier for a misspelling.
33 void AddMisspelling(int renderer_process_id, uint32 hash) {
35 misspelling.hash = hash;
48 EXPECT_EQ(kMisspellingHash, result->hash);
93 EXPECT_EQ(kMisspellingHash, renderer_with_misspellings[0].hash);
168 EXPECT_NE(result[0].hash, result[1].hash);
169 EXPECT_TRUE(result[0].hash == kMisspellingHash ||
170 result[0].hash == kMisspellingHash + 1)
194 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...] |
