Searched defs:hash (Results 76 - 100 of 896) sorted by relevance

1234567891011>>

/external/clang/test/CXX/temp/temp.spec/temp.explicit/
H A Dp6.cpp17 template<typename T> struct hash { }; struct
24 hash<T> h;
32 template<> struct hash<S> { struct
/external/deqp/framework/delibs/depool/
H A DdePoolHash.c21 * \brief Memory pool hash class.
40 deTestHash* hash = deTestHash_create(pool); local
47 /* Test find() on empty hash. */
48 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 0);
51 const int* val = deTestHash_find(hash, (deInt16)i);
58 deTestHash_insert(hash, (deInt16)i, -i);
61 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 5000);
64 const int* val = deTestHash_find(hash, (deInt16)i);
70 deTestHash_delete(hash, (deInt16)i);
72 DE_TEST_ASSERT(deTestHash_getNumElements(hash)
[all...]
/external/fio/crc/
H A Dmd5.c8 static void md5_transform(uint32_t *hash, uint32_t const *in) argument
12 a = hash[0];
13 b = hash[1];
14 c = hash[2];
15 d = hash[3];
85 hash[0] += a;
86 hash[1] += b;
87 hash[2] += c;
88 hash[3] += d;
93 mctx->hash[
[all...]
H A Dmd5.h20 uint32_t *hash; member in struct:fio_md5_ctx
/external/guava/guava/src/com/google/common/hash/
H A DAbstractHasher.java15 package com.google.common.hash;
H A DBloomFilterStrategies.java3 package com.google.common.hash;
13 * be mapped to a {@link BloomFilter} of {@code M} bits and {@code k} hash functions. These
23 * performance of a Bloom filter (yet only needs two 32bit hash functions).
29 long hash64 = Hashing.murmur3_128().newHasher().putObject(object, funnel).hash().asLong();
44 long hash64 = Hashing.murmur3_128().newHasher().putObject(object, funnel).hash().asLong();
H A DFunnels.java15 package com.google.common.hash;
H A DHashFunction.java15 package com.google.common.hash;
23 * A hash function is a collision-averse pure function that maps an arbitrary block of
24 * data to a number called a <i>hash code</i>.
31 * <li><b>block of data:</b> the input for a hash function is always, in concept, an
36 * <li><b>hash code:</b> each hash function always yields hash codes of the same fixed bit
39 * {@code long} value is clearly insufficient to hold all hash code values, this API
40 * represents a hash code as an instance of {@link HashCode}.
45 * <li><b>collision-averse:</b> while it can't be helped that a hash functio
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
H A DMapHashCodeTester.java41 expectedHashCode += hash(entry);
69 expectedHashCode += hash(entry);
75 + "a null element in an entry counts as having a hash of zero).",
79 private static int hash(Map.Entry<?, ?> e) { method in class:MapHashCodeTester
/external/guava/guava-tests/test/com/google/common/hash/
H A DBloomFilterTest.java3 package com.google.common.hash;
H A DFunnelsTest.java3 package com.google.common.hash;
5 import com.google.common.hash.AbstractStreamingHashFunction.AbstractStreamingHasher;
H A DHashFunctionsTest.java3 package com.google.common.hash;
46 HashCode hashcode1 = hashFunction.newHasher().putObject(o, HashTestUtils.BAD_FUNNEL).hash();
47 HashCode hashcode2 = hashFunction.newHasher().putObject(o, HashTestUtils.BAD_FUNNEL).hash();
H A DMurmur3Hash128Test.java17 package com.google.common.hash;
19 import static com.google.common.hash.HashTestUtils.ascii;
20 import static com.google.common.hash.HashTestUtils.toBytes;
21 import static com.google.common.hash.Hashing.murmur3_128;
24 import com.google.common.hash.Funnels;
25 import com.google.common.hash.HashTestUtils.HashFn;
55 byte[] hash = murmur3_128(seed).newHasher().putBytes(input).hash().asBytes();
56 assertTrue(Arrays.equals(expectedHash, hash));
61 @Override public byte[] hash(byt
[all...]
/external/libcxx/test/containers/
H A DEmplaceable.h44 struct hash<Emplaceable> struct in namespace:std
H A DMoveOnly.h40 struct hash<MoveOnly> struct in namespace:std
/external/libcxx/test/utilities/tuple/tuple.tuple/
H A DMoveOnly.h40 struct hash<MoveOnly> struct in namespace:std
/external/linux-tools-perf/perf-3.12.0/include/linux/
H A Dhash.h37 u64 hash = val; local
40 u64 n = hash;
42 hash -= n;
44 hash -= n;
46 hash += n;
48 hash -= n;
50 hash += n;
52 hash += n;
55 return hash >> (64 - bits);
61 u32 hash local
[all...]
/external/mesa3d/src/gallium/auxiliary/translate/
H A Dtranslate_cache.c37 struct cso_hash *hash; member in struct:translate_cache
47 cache->hash = cso_hash_create();
54 struct cso_hash *hash = cache->hash; local
55 struct cso_hash_iter iter = cso_hash_first_node(hash);
68 cso_hash_delete(cache->hash);
95 cso_hash_find_data_from_template(cache->hash,
102 cso_hash_insert(cache->hash, hash_key, translate);
/external/oprofile/libutil/
H A Dop_string.c24 size_t hash = 0; local
26 hash ^= (hash << 16) ^ (hash >> 8) ^ *str;
27 return hash;
/external/oprofile/module/
H A Dop_dcache.h36 uint hash=0; local
39 hash = (hash + (name[len] << 4) + (name[len] >> 4)) * 11;
41 return (hash ^ parent) % OP_HASH_MAP_NR;
/external/skia/src/gpu/
H A DGrBinHashKey.h16 * GrBinHashKey is a hash key class that can take a data chunk of any predetermined
17 * length. The hash function used is the One-at-a-Time Hash
18 * (http://burtleburtle.net/bob/hash/doobs.html).
40 uint32_t hash = 0; local
43 hash += *data++;
44 hash += (hash << 10);
45 hash ^= (hash >> 6);
48 hash
[all...]
/external/skia/tests/
H A DChecksumTest.cpp38 const uint32_t hash = algorithm(data, kBytes); local
40 ASSERT(hash == algorithm(data, kBytes));
42 // Changing any single element should change the hash.
47 ASSERT(tweakedHash != hash);
/external/stlport/stlport/stl/
H A D_hash_fun.h40 template <class _Key> struct hash { }; struct
56 struct hash<char*> { struct
64 struct hash<const char*> { struct
71 _STLP_TEMPLATE_NULL struct hash<char> { struct
74 _STLP_TEMPLATE_NULL struct hash<unsigned char> { struct
78 _STLP_TEMPLATE_NULL struct hash<signed char> { struct
82 _STLP_TEMPLATE_NULL struct hash<short> { struct
85 _STLP_TEMPLATE_NULL struct hash<unsigned short> { struct
88 _STLP_TEMPLATE_NULL struct hash<int> { struct
93 _STLP_TEMPLATE_NULL struct hash<unsigne struct
103 _STLP_TEMPLATE_NULL struct hash<size_t> { struct
108 _STLP_TEMPLATE_NULL struct hash<long> { struct
111 _STLP_TEMPLATE_NULL struct hash<unsigned long> { struct
116 _STLP_TEMPLATE_NULL struct hash<_STLP_LONG_LONG> { struct
119 _STLP_TEMPLATE_NULL struct hash<unsigned _STLP_LONG_LONG> { struct
125 struct hash<void *> struct
[all...]
/external/wpa_supplicant_8/hostapd/src/crypto/
H A Dsha1-prf.c35 u8 hash[SHA1_MAC_LEN]; local
57 hash))
59 os_memcpy(&buf[pos], hash, plen);
H A Dsha1-tprf.c34 u8 hash[SHA1_MAC_LEN]; local
40 addr[0] = hash;
57 if (hmac_sha1_vector(key, key_len, 5, addr, len, hash))
60 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN);
63 os_memcpy(&buf[pos], hash, plen);

Completed in 5087 milliseconds

1234567891011>>