Searched refs:hash (Results 276 - 300 of 1823) sorted by relevance

<<11121314151617181920>>

/external/chromium_org/net/quic/crypto/
H A Dcommon_cert_set.h31 // set identified by |hash|. If no such certificate is known, an empty
33 virtual base::StringPiece GetCert(uint64 hash, uint32 index) const = 0;
36 // identified by |common_set_hashes|. On success it puts the hash of the
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_cache.h56 * @param hash hash function
62 util_cache_create(uint32_t (*hash)(const void *key),
/external/chromium_org/third_party/smhasher/src/
H A DAvalancheTest.h3 // the hash function's output. Ideally, each output bits should flip 50% of
7 // hash function to fail to create an even, random distribution of hash values.
28 void calcBias ( pfHash hash, std::vector<int> & counts, int reps, Rand & r ) argument
45 hash(&K,keybytes,0,&A);
52 hash(&K,keybytes,0,&B);
69 bool AvalancheTest ( pfHash hash, const int reps ) argument
85 calcBias<keytype,hashtype>(hash,bins,reps,r);
111 void BicTest ( pfHash hash, const int keybit, const int reps, double & maxBias, int & maxA, int & maxB, bool verbose ) argument
132 hash(
197 BicTest( pfHash hash, const int reps ) argument
239 BicTest3( pfHash hash, const int reps, bool verbose = true ) argument
347 BicTest2( pfHash hash, const int reps, bool verbose = true ) argument
[all...]
/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Dheap-profile-stats.h10 // trace and counts of (de)allocation. Buckets are stored in a hash table
13 // A hash value is computed from a stack trace. Collision in the hash table
17 // A structure of a hash table HeapProfileBucket** bucket_table would be like:
46 uintptr_t hash; // Hash value of the stack trace. member in struct:HeapProfileBucket
49 HeapProfileBucket* next; // Next entry in hash-table.
/external/dexmaker/src/dx/java/com/android/dx/dex/code/
H A DCatchTable.java133 int hash = (start * 31) + end;
134 hash = (hash * 31) + handlers.hashCode();
135 return hash;
/external/jsilver/src/com/google/clearsilver/jsilver/adaptor/
H A DLoadPathToFileCache.java96 * hash as the key and throw away the loadpath list
99 * @return a long representing a hash of the loadpaths.
102 long hash = 17;
104 hash = 37 * hash + path.hashCode();
106 return hash;
/external/libcxx/test/containers/unord/unord.map/
H A Dcompare.pass.cpp12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
29 struct hash<Key> struct in namespace:std
/external/libcxx/test/containers/unord/unord.map/unord.map.cnstr/
H A Dassign_move.pass.cpp12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
34 test_hash<std::hash<int> >,
50 test_hash<std::hash<int> >(8),
56 test_hash<std::hash<int> >(2),
67 assert(c.hash_function() == test_hash<std::hash<int> >(8));
79 test_hash<std::hash<int> >,
95 test_hash<std::hash<int> >(8),
101 test_hash<std::hash<int> >(2),
112 assert(c.hash_function() == test_hash<std::hash<int> >(8));
125 test_hash<std::hash<in
[all...]
H A Ddefault.pass.cpp12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 test_hash<std::hash<NotConstructible> >,
38 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
51 test_hash<std::hash<NotConstructible> >,
58 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
H A Dsize.fail.cpp12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 test_hash<std::hash<NotConstructible> >,
38 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
51 test_hash<std::hash<NotConstructible> >,
58 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
H A Dsize.pass.cpp12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 test_hash<std::hash<NotConstructible> >,
38 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
51 test_hash<std::hash<NotConstructible> >,
58 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/
H A Ddefault.pass.cpp12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 test_hash<std::hash<NotConstructible> >,
38 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
51 test_hash<std::hash<NotConstructible> >,
58 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
H A Dsize.fail.cpp12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 test_hash<std::hash<NotConstructible> >,
38 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
51 test_hash<std::hash<NotConstructible> >,
58 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
H A Dsize.pass.cpp12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 test_hash<std::hash<NotConstructible> >,
38 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
51 test_hash<std::hash<NotConstructible> >,
58 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
/external/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/
H A Ddefault.pass.cpp12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<NotConstructible> >,
37 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
49 test_hash<std::hash<NotConstructible> >,
55 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
/external/libcxx/test/containers/unord/unord.set/unord.set.cnstr/
H A Ddefault.pass.cpp12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<NotConstructible> >,
37 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
49 test_hash<std::hash<NotConstructible> >,
55 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
/external/libcxx/test/diagnostics/syserr/syserr.hash/
H A Derror_code.pass.cpp13 // struct hash
29 typedef std::hash<T> H;
/external/libcxx/test/utilities/template.bitset/bitset.hash/
H A Dbitset.pass.cpp13 // struct hash
30 typedef std::hash<T> H;
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_cache.h56 * @param hash hash function
62 util_cache_create(uint32_t (*hash)(const void *key),
/external/guava/guava/src/com/google/common/cache/
H A DLocalCache.java83 * The concurrent hash map implementation built by {@link CacheBuilder}.
96 * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
158 * Mask value for indexing into segments. The upper bits of a key's hash code are used to choose
169 /** The segments, each of which is a specialized hash table. */
427 * Returns the default equivalence strategy used to compare and hash keys or values referenced
441 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
442 return new StrongEntry<K, V>(key, hash, next);
448 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
449 return new StrongAccessEntry<K, V>(key, hash, next);
463 Segment<K, V> segment, K key, int hash,
577 newEntry( Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1059 StrongEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1136 final int hash; field in class:LocalCache.StrongEntry
1163 StrongAccessEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1210 StrongWriteEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1257 StrongAccessWriteEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1346 WeakEntry(ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1423 final int hash; field in class:LocalCache.WeakEntry
1450 WeakAccessEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1498 WeakWriteEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1546 WeakAccessWriteEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1863 newEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1887 int hash(Object key) { method in class:LocalCache
1918 segmentFor(int hash) argument
2177 newEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
2207 get(K key, int hash, CacheLoader<? super K, V> loader) argument
2242 lockedGetOrLoad(K key, int hash, CacheLoader<? super K, V> loader) argument
2348 loadSync(K key, int hash, LoadingValueReference<K, V> loadingValueReference, CacheLoader<? super K, V> loader) argument
2354 loadAsync(final K key, final int hash, final LoadingValueReference<K, V> loadingValueReference, CacheLoader<? super K, V> loader) argument
2377 getAndRecordStats(K key, int hash, LoadingValueReference<K, V> loadingValueReference, ListenableFuture<V> newValue) argument
2396 scheduleRefresh(ReferenceEntry<K, V> entry, K key, int hash, V oldValue, long now, CacheLoader<? super K, V> loader) argument
2414 refresh(K key, int hash, CacheLoader<? super K, V> loader) argument
2437 insertLoadingValueReference(final K key, final int hash) argument
2671 enqueueNotification(@ullable K key, int hash, ValueReference<K, V> valueReference, RemovalCause cause) argument
2717 getFirst(int hash) argument
2726 getEntry(Object key, int hash) argument
2747 getLiveEntry(Object key, int hash, long now) argument
2781 get(Object key, int hash) argument
2803 containsKey(Object key, int hash) argument
2851 put(K key, int hash, V value, boolean onlyIfAbsent) argument
2994 replace(K key, int hash, V oldValue, V newValue) argument
3047 replace(K key, int hash, V newValue) argument
3093 remove(Object key, int hash) argument
3138 storeLoadedValue(K key, int hash, LoadingValueReference<K, V> oldValueReference, V newValue) argument
3190 remove(Object key, int hash, Object value) argument
3267 removeValueFromChain(ReferenceEntry<K, V> first, ReferenceEntry<K, V> entry, @Nullable K key, int hash, ValueReference<K, V> valueReference, RemovalCause cause) argument
3310 reclaimKey(ReferenceEntry<K, V> entry, int hash) argument
3340 reclaimValue(K key, int hash, ValueReference<K, V> valueReference) argument
3375 removeLoadingValue(K key, int hash, LoadingValueReference<K, V> valueReference) argument
3408 removeEntry(ReferenceEntry<K, V> entry, int hash, RemovalCause cause) argument
[all...]
/external/chromium_org/chrome/browser/spellchecker/
H A Dfeedback_sender_unittest.cc102 return results[0].hash;
163 uint32 hash = AddPendingFeedback(); local
166 feedback_->SelectedSuggestion(hash, kSuggestionIndex);
173 uint32 hash = AddPendingFeedback(); local
175 std::vector<uint32>(1, hash));
190 uint32 hash = AddPendingFeedback(); local
192 feedback_->SelectedSuggestion(hash, kSuggestionIndex);
202 uint32 hash = AddPendingFeedback(); local
203 feedback_->AddedToDictionary(hash);
212 uint32 hash local
222 uint32 hash = AddPendingFeedback(); local
232 uint32 hash = AddPendingFeedback(); local
242 uint32 hash = AddPendingFeedback(); local
277 uint32 hash = AddPendingFeedback(); local
503 uint32 hash = AddPendingFeedback(); local
[all...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/rsa/
H A DDigestSignatureSpi.java137 byte[] hash = new byte[digest.getDigestSize()];
139 digest.doFinal(hash, 0);
143 byte[] bytes = derEncode(hash);
161 byte[] hash = new byte[digest.getDigestSize()];
163 digest.doFinal(hash, 0);
172 expected = derEncode(hash);
191 int sigOffset = sig.length - hash.length - 2;
192 int expectedOffset = expected.length - hash.length - 2;
197 for (int i = 0; i < hash.length; i++)
199 if (sig[sigOffset + i] != expected[expectedOffset + i]) // check hash
251 derEncode( byte[] hash) argument
[all...]
/external/chromium_org/chrome/browser/chromeos/policy/
H A Dcloud_external_data_manager_base_test_util.cc33 const std::string hash = crypto::SHA256HashString(data); local
36 metadata->SetStringWithoutPathExpansion("hash", base::HexEncode(hash.c_str(),
37 hash.size()));
/external/chromium_org/content/test/data/indexeddb/
H A Dversion_change_crash.js7 if (document.location.hash === '#part1') {
9 } else if (document.location.hash === '#part2') {
11 } else if (document.location.hash === '#part3') {
14 result('fail - unexpected hash');
/external/chromium_org/extensions/browser/
H A Dcontent_hash_tree.cc31 // Iterate over the current level of hashes, computing the hash of up to
32 // |branch_factor| elements to form the hash of each parent node.
35 scoped_ptr<crypto::SecureHash> hash(
39 hash->Update(i->data(), i->size());
44 hash->Finish(string_as_array(output), output->size());

Completed in 389 milliseconds

<<11121314151617181920>>