Searched refs:hash (Results 101 - 125 of 1823) sorted by relevance

1234567891011>>

/external/libcxx/test/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
H A Dhash.pass.cpp14 // long hash(const charT* low, const charT* high) const;
29 assert(f.hash(x1.data(), x1.data() + x1.size())
30 != f.hash(x2.data(), x2.data() + x2.size()));
36 assert(f.hash(x1.data(), x1.data() + x1.size())
37 != f.hash(x2.data(), x2.data() + x2.size()));
/external/libcxx/test/localization/locale.categories/category.collate/locale.collate.byname/
H A Dhash.pass.cpp14 // long hash(const charT* low, const charT* high) const;
31 assert(f.hash(x1.data(), x1.data() + x1.size())
32 != f.hash(x2.data(), x2.data() + x2.size()));
38 assert(f.hash(x1.data(), x1.data() + x1.size())
39 != f.hash(x2.data(), x2.data() + x2.size()));
/external/libcxx/test/utilities/type.index/type.index.synopsis/
H A Dhash_type_index.pass.cpp12 // struct hash<type_index>
24 std::hash<std::type_index> >::value), "");
/external/chromium_org/chrome/common/
H A Dspellcheck_result.h33 : decoration(d), location(loc), length(len), replacement(rep), hash(h) {
40 uint32 hash; member in struct:SpellCheckResult
/external/chromium_org/chrome_elf/dll_hash/
H A Ddll_hash_main.cc24 int hash = DllNameToHash(std::string(argv[i])); local
25 printf("<int value=\"%d\" label=\"%s\"/>\n", hash, argv[i]);
/external/chromium_org/components/metrics/
H A Dmetrics_hashes_unittest.cc25 uint64 hash = HashMetricName(cases[i].input); local
26 std::string hash_hex = base::StringPrintf("0x%016" PRIx64, hash);
/external/chromium_org/ppapi/tools/
H A Dpepper_hash_for_uma.cc16 #include "base/hash.h"
33 int hash = static_cast<int>(data & 0x7fffffff); local
34 printf("<int value=\"%d\" label=\"%s\"/>\n", hash, argv[i]);
/external/chromium_org/third_party/WebKit/Source/platform/weborigin/
H A DKURLHash.h36 static unsigned hash(const KURL& key) function in struct:blink::KURLHash
38 return key.string().impl()->hash();
/external/chromium_org/third_party/WebKit/Source/web/
H A DWebTextCheckingResult.cpp45 result.hash = hash;
/external/libcxx/test/utilities/function.objects/unord.hash/
H A Dpointer.pass.cpp13 // struct hash
31 std::hash<T> >::value), "");
32 std::hash<T> h;
/external/libnl/lib/route/
H A Dpktloc.c50 unsigned long hash = 5381; local
54 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
56 return hash % PKTLOC_NAME_HT_SIZ;
144 int hash, err; local
149 hash = pktloc_hash(name);
150 nl_list_for_each_entry(loc, &pktloc_name_ht[hash], list) {
/external/apache-http/src/org/apache/http/auth/
H A DNTUserPrincipal.java93 int hash = LangUtils.HASH_SEED;
94 hash = LangUtils.hashCode(hash, this.username);
95 hash = LangUtils.hashCode(hash, this.domain);
96 return hash;
/external/apache-http/src/org/apache/http/message/
H A DBasicNameValuePair.java184 int hash = LangUtils.HASH_SEED;
185 hash = LangUtils.hashCode(hash, this.name);
186 hash = LangUtils.hashCode(hash, this.value);
187 return hash;
/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dprog_cache.c39 GLuint hash; member in struct:cache_item
55 * Compute hash index from state key.
61 GLuint hash = 0, i; local
65 /* Make a slightly better attempt at a hash function:
69 hash += ikey[i];
70 hash += (hash << 10);
71 hash ^= (hash >> 6);
74 return hash;
182 const GLuint hash = hash_key(key, keysize); local
203 const GLuint hash = hash_key(key, keysize); local
231 const GLuint hash = hash_key(key, keysize); local
[all...]
/external/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/
H A Dsize_hash.pass.cpp12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<NotConstructible> >,
36 test_hash<std::hash<NotConstructible> >(8)
39 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
51 test_hash<std::hash<NotConstructible> >,
56 test_hash<std::hash<NotConstructible> >(8)
59 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
/external/libcxx/test/containers/unord/unord.set/unord.set.cnstr/
H A Dsize_hash.pass.cpp12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<NotConstructible> >,
36 test_hash<std::hash<NotConstructible> >(8)
39 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
51 test_hash<std::hash<NotConstructible> >,
56 test_hash<std::hash<NotConstructible> >(8)
59 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
/external/mesa3d/src/mesa/program/
H A Dprog_cache.c39 GLuint hash; member in struct:cache_item
55 * Compute hash index from state key.
61 GLuint hash = 0, i; local
65 /* Make a slightly better attempt at a hash function:
69 hash += ikey[i];
70 hash += (hash << 10);
71 hash ^= (hash >> 6);
74 return hash;
182 const GLuint hash = hash_key(key, keysize); local
203 const GLuint hash = hash_key(key, keysize); local
231 const GLuint hash = hash_key(key, keysize); local
[all...]
/external/chromium_org/third_party/smhasher/src/
H A DKeysetTest.h2 // Keyset tests generate various sorts of difficult-to-hash keysets and compare
3 // the distribution and collision frequency of the hash results against an
20 bool VerificationTest ( pfHash hash, const int hashbits, uint32_t expected, bool verbose );
21 bool SanityTest ( pfHash hash, const int hashbits );
22 void AppendedZeroesTest ( pfHash hash, const int hashbits );
30 pfHash hash, std::vector<hashtype> & hashes )
41 hash(key,(len+1) * sizeof(uint32_t),0,&h);
47 CombinationKeygenRecurse(key,len+1,maxlen,blocks,blockcount,hash,hashes);
53 bool CombinationKeyTest ( hashfunc<hashtype> hash, int maxlen, uint32_t * blocks, int blockcount, bool testColl, bool testDist, bool drawDiagram ) argument
63 CombinationKeygenRecurse<hashtype>(key,0,maxlen,blocks,blockcount,hash,hashe
28 CombinationKeygenRecurse( uint32_t * key, int len, int maxlen, uint32_t * blocks, int blockcount, pfHash hash, std::vector<hashtype> & hashes ) argument
85 PermutationKeygenRecurse( pfHash hash, uint32_t * blocks, int blockcount, int k, std::vector<hashtype> & hashes ) argument
109 PermutationKeyTest( hashfunc<hashtype> hash, uint32_t * blocks, int blockcount, bool testColl, bool testDist, bool drawDiagram ) argument
136 SparseKeygenRecurse( pfHash hash, int start, int bitsleft, bool inclusive, keytype & k, std::vector<hashtype> & hashes ) argument
165 SparseKeyTest( hashfunc<hashtype> hash, const int setbits, bool inclusive, bool testColl, bool testDist, bool drawDiagram ) argument
203 WindowedKeyTest( hashfunc<hashtype> hash, const int windowbits, bool testCollision, bool testDistribution, bool drawDiagram ) argument
250 CyclicKeyTest( pfHash hash, int cycleLen, int cycleReps, const int keycount, bool drawDiagram ) argument
299 TwoBytesTest2( pfHash hash, int maxlen, bool drawDiagram ) argument
321 TextKeyTest( hashfunc<hashtype> hash, const char * prefix, const char * coreset, const int corelen, const char * suffix, bool drawDiagram ) argument
377 ZeroKeyTest( pfHash hash, bool drawDiagram ) argument
412 SeedTest( pfHash hash, int keycount, bool drawDiagram ) argument
[all...]
/external/guava/guava-tests/test/com/google/common/hash/
H A DHashCodesTest.java3 package com.google.common.hash;
46 // expectedHashCodes must contain at least one hash code with 4 bytes
56 // expectedHashCodes must contain at least one hash code with 8 bytes
73 private void assertExpectedHashCode(ExpectedHashCode expected, HashCode hash) { argument
74 assertTrue(Arrays.equals(expected.bytes, hash.asBytes()));
75 byte[] bb = new byte[hash.bits() / 8];
76 hash.writeBytesTo(bb, 0, bb.length);
78 assertEquals(expected.asInt, hash.asInt());
81 hash.asLong();
85 assertEquals(expected.asLong.longValue(), hash
92 assertSideEffectFree(HashCode hash) argument
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/
H A Dcso_cache.c51 unsigned hash = 0, i; local
58 hash ^= ikey[i];
60 return hash;
85 struct cso_hash *hash; local
86 hash = sc->hashes[type];
87 return hash;
156 struct cso_hash *hash,
161 sc->sanitize_cb(hash, type, max_size, sc->sanitize_data);
165 static INLINE void sanitize_cb(struct cso_hash *hash, enum cso_cache_type type, argument
170 int hash_size = cso_hash_size(hash);
155 sanitize_hash(struct cso_cache *sc, struct cso_hash *hash, enum cso_cache_type type, int max_size) argument
190 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
200 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
206 cso_hash_find_data_from_template( struct cso_hash *hash, unsigned hash_key, void *templ, int size ) argument
242 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
266 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_cache.c51 uint32_t hash; member in struct:util_cache_entry
68 uint32_t (*hash)(const void *key); member in struct:util_cache
90 util_cache_create(uint32_t (*hash)(const void *key),
101 cache->hash = hash;
123 uint32_t hash,
127 uint32_t index = hash % cache->size;
142 if (current->hash == hash &&
186 uint32_t hash local
122 util_cache_entry_get(struct util_cache *cache, uint32_t hash, const void *key) argument
221 uint32_t hash = cache->hash(key); local
292 uint32_t hash; local
[all...]
H A Du_surfaces.c42 if(!us->u.hash)
43 us->u.hash = cso_hash_create();
45 ps = cso_hash_iter_data(cso_hash_find(us->u.hash, (layer << 8) | level));
71 cso_hash_insert(us->u.hash, (layer << 8) | level, ps);
85 cso_hash_erase(us->u.hash, cso_hash_find(us->u.hash, (ps->u.tex.first_layer << 8) | ps->u.tex.level));
96 if(us->u.hash)
99 iter = cso_hash_first_node(us->u.hash);
105 cso_hash_delete(us->u.hash);
106 us->u.hash
[all...]
/external/mesa3d/src/gallium/auxiliary/cso_cache/
H A Dcso_cache.c51 unsigned hash = 0, i; local
58 hash ^= ikey[i];
60 return hash;
85 struct cso_hash *hash; local
86 hash = sc->hashes[type];
87 return hash;
156 struct cso_hash *hash,
161 sc->sanitize_cb(hash, type, max_size, sc->sanitize_data);
165 static INLINE void sanitize_cb(struct cso_hash *hash, enum cso_cache_type type, argument
170 int hash_size = cso_hash_size(hash);
155 sanitize_hash(struct cso_cache *sc, struct cso_hash *hash, enum cso_cache_type type, int max_size) argument
190 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
200 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
206 cso_hash_find_data_from_template( struct cso_hash *hash, unsigned hash_key, void *templ, int size ) argument
242 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
266 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_cache.c51 uint32_t hash; member in struct:util_cache_entry
68 uint32_t (*hash)(const void *key); member in struct:util_cache
90 util_cache_create(uint32_t (*hash)(const void *key),
101 cache->hash = hash;
123 uint32_t hash,
127 uint32_t index = hash % cache->size;
142 if (current->hash == hash &&
186 uint32_t hash local
122 util_cache_entry_get(struct util_cache *cache, uint32_t hash, const void *key) argument
221 uint32_t hash = cache->hash(key); local
292 uint32_t hash; local
[all...]
H A Du_surfaces.c42 if(!us->u.hash)
43 us->u.hash = cso_hash_create();
45 ps = cso_hash_iter_data(cso_hash_find(us->u.hash, (layer << 8) | level));
71 cso_hash_insert(us->u.hash, (layer << 8) | level, ps);
85 cso_hash_erase(us->u.hash, cso_hash_find(us->u.hash, (ps->u.tex.first_layer << 8) | ps->u.tex.level));
96 if(us->u.hash)
99 iter = cso_hash_first_node(us->u.hash);
105 cso_hash_delete(us->u.hash);
106 us->u.hash
[all...]

Completed in 1897 milliseconds

1234567891011>>