Home
last modified time | relevance | path

Searched refs:hash2 (Results 1 – 25 of 29) sorted by relevance

12

/external/guava/android/guava/src/com/google/common/hash/
DBloomFilterStrategies.java52 int hash2 = (int) (hash64 >>> 32); in MURMUR128_MITZ_32() local
56 int combinedHash = hash1 + (i * hash2); in MURMUR128_MITZ_32()
72 int hash2 = (int) (hash64 >>> 32); in MURMUR128_MITZ_32() local
75 int combinedHash = hash1 + (i * hash2); in MURMUR128_MITZ_32()
100 long hash2 = upperEight(bytes); in MURMUR128_MITZ_64() local
107 combinedHash += hash2; in MURMUR128_MITZ_64()
118 long hash2 = upperEight(bytes); in MURMUR128_MITZ_64() local
126 combinedHash += hash2; in MURMUR128_MITZ_64()
/external/guava/guava/src/com/google/common/hash/
DBloomFilterStrategies.java52 int hash2 = (int) (hash64 >>> 32); in MURMUR128_MITZ_32() local
56 int combinedHash = hash1 + (i * hash2); in MURMUR128_MITZ_32()
72 int hash2 = (int) (hash64 >>> 32); in MURMUR128_MITZ_32() local
75 int combinedHash = hash1 + (i * hash2); in MURMUR128_MITZ_32()
100 long hash2 = upperEight(bytes); in MURMUR128_MITZ_64() local
107 combinedHash += hash2; in MURMUR128_MITZ_64()
118 long hash2 = upperEight(bytes); in MURMUR128_MITZ_64() local
126 combinedHash += hash2; in MURMUR128_MITZ_64()
/external/libyuv/files/util/
Dcompare.cc35 uint32_t hash2 = 5381; in main() local
48 hash2 = libyuv::HashDjb2(buf2, amt2, hash2); in main()
58 printf(", hash2 %x", hash2); in main()
/external/tensorflow/tensorflow/core/kernels/data/
Ddataset_utils_test.cc416 uint64 hash2 = GetHash(gd, *n3); in TEST_F() local
418 EXPECT_EQ(hash1, hash2); in TEST_F()
452 uint64 hash2 = GetHash(gd, *n3); in TEST_F() local
455 EXPECT_NE(hash1, hash2); in TEST_F()
510 uint64 hash2 = GetHash(gd, *shuffle_ds); in TEST_F() local
512 EXPECT_EQ(hash1, hash2); in TEST_F()
560 uint64 hash2 = GetHash(gd, *n3); in TEST_F() local
562 EXPECT_EQ(hash1, hash2); in TEST_F()
596 uint64 hash2 = GetHash(gd, *n3); in TEST_F() local
599 EXPECT_NE(hash1, hash2); in TEST_F()
[all …]
/external/grpc-grpc-java/context/src/main/java/io/grpc/
DPersistentHashArrayMappedTrie.java262 Node<K,V> node1, int hash1, Node<K,V> node2, int hash2, int bitsConsumed) { in combine() argument
263 assert hash1 != hash2; in combine() local
265 int indexBit2 = indexBit(hash2, bitsConsumed); in combine()
267 Node<K,V> node = combine(node1, hash1, node2, hash2, bitsConsumed + BITS); in combine()
273 if (uncompressedIndex(hash1, bitsConsumed) > uncompressedIndex(hash2, bitsConsumed)) { in combine()
/external/guava/android/guava-tests/test/com/google/common/hash/
DHashTestUtils.java297 int hash2 = function.hashInt(key2).asInt(); in checkNoFunnels() local
299 same |= ~(hash1 ^ hash2); in checkNoFunnels()
301 diff |= (hash1 ^ hash2); in checkNoFunnels()
344 int hash2 = function.hashInt(key2).asInt(); in checkAvalanche() local
346 if ((hash1 & (1 << k)) == (hash2 & (1 << k))) { in checkAvalanche()
390 int hash2 = function.hashInt(key2).asInt(); in checkNo2BitCharacteristics() local
394 if ((hash1 ^ hash2) != delta) { in checkNo2BitCharacteristics()
441 int hash2 = function.hashInt(key2).asInt(); in check2BitAvalanche() local
443 if ((hash1 & (1 << k)) == (hash2 & (1 << k))) { in check2BitAvalanche()
DHashCodeTest.java185 HashCode hash2 = HashCode.fromBytes(BaseEncoding.base16().lowerCase().decode(hash1.toString())); in testRoundTripHashCodeUsingBaseEncoding() local
186 assertEquals(hash1, hash2); in testRoundTripHashCodeUsingBaseEncoding()
217 HashCode hash2 = HashCode.fromString(hash1.toString()); in testRoundTripHashCodeUsingFromString() local
218 assertEquals(hash1, hash2); in testRoundTripHashCodeUsingFromString()
/external/guava/guava-tests/test/com/google/common/hash/
DHashTestUtils.java297 int hash2 = function.hashInt(key2).asInt(); in checkNoFunnels() local
299 same |= ~(hash1 ^ hash2); in checkNoFunnels()
301 diff |= (hash1 ^ hash2); in checkNoFunnels()
344 int hash2 = function.hashInt(key2).asInt(); in checkAvalanche() local
346 if ((hash1 & (1 << k)) == (hash2 & (1 << k))) { in checkAvalanche()
390 int hash2 = function.hashInt(key2).asInt(); in checkNo2BitCharacteristics() local
394 if ((hash1 ^ hash2) != delta) { in checkNo2BitCharacteristics()
441 int hash2 = function.hashInt(key2).asInt(); in check2BitAvalanche() local
443 if ((hash1 & (1 << k)) == (hash2 & (1 << k))) { in check2BitAvalanche()
DHashCodeTest.java185 HashCode hash2 = HashCode.fromBytes(BaseEncoding.base16().lowerCase().decode(hash1.toString())); in testRoundTripHashCodeUsingBaseEncoding() local
186 assertEquals(hash1, hash2); in testRoundTripHashCodeUsingBaseEncoding()
217 HashCode hash2 = HashCode.fromString(hash1.toString()); in testRoundTripHashCodeUsingFromString() local
218 assertEquals(hash1, hash2); in testRoundTripHashCodeUsingFromString()
/external/icu/android_icu4j/src/main/java/android/icu/impl/
DCalendarCache.java66 delta = hash2(key); in findIndex()
109 private final int hash2(long key) { in hash2() method in CalendarCache
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
DCalendarCache.java64 delta = hash2(key); in findIndex()
107 private final int hash2(long key) { in hash2() method in CalendarCache
/external/deqp-deps/amber/src/dawn/
Dpipeline_info.h37 auto hash2 = std::hash<T2>{}(p.second); in operator()
38 return hash1 ^ hash2; in operator()
/external/icu/icu4c/source/common/
Duhash.cpp873 uhash_equals(const UHashtable* hash1, const UHashtable* hash2){ in uhash_equals() argument
876 if(hash1==hash2){ in uhash_equals()
888 if (hash1==NULL || hash2==NULL || in uhash_equals()
889 hash1->keyComparator != hash2->keyComparator || in uhash_equals()
890 hash1->valueComparator != hash2->valueComparator || in uhash_equals()
901 count2 = uhash_count(hash2); in uhash_equals()
915 const UHashElement* elem2 = _uhash_find(hash2, key1, hash2->keyHasher(key1)); in uhash_equals()
Duhash.h696 uhash_equals(const UHashtable* hash1, const UHashtable* hash2);
/external/v8/src/objects/
Dtransitions-inl.h254 uint32_t hash2, PropertyKind kind2, in CompareKeys() argument
256 int cmp = CompareNames(key1, hash1, key2, hash2); in CompareKeys()
263 uint32_t hash2) { in CompareNames() argument
266 return hash1 <= hash2 ? -1 : 1; in CompareNames()
Dtransitions.h335 uint32_t hash2, PropertyKind kind2,
341 uint32_t hash2);
Dkeys.cc1171 bool operator()(uint32_t hash1, uint32_t hash2, const Handle<Name>& key1, in operator ()() argument
/external/v8/src/compiler/
Drefs-map.h20 bool operator()(uint32_t hash1, uint32_t hash2, const Address& key1, in operator()
/external/giflib/
Dquantize.c323 int hash2 = entry2->RGB[SortRGBAxis] * 256 * 256 in SortCmpRtn() local
327 return hash1 - hash2; in SortCmpRtn()
/external/elfutils/src/
Delfcmp.c842 const Hash_Word *const hash2 = data2->d_buf; \ in hash_content_equivalent()
846 || hash2[0] != nbucket || hash2[1] != nchain) \ in hash_content_equivalent()
851 const Hash_Word *const bucket2 = &hash2[2]; \ in hash_content_equivalent()
/external/v8/src/ast/
Dast-value-factory.h210 bool operator()(uint32_t hash1, uint32_t hash2, in operator()
213 return hash1 == hash2 && AstRawString::Compare(lookup_key, entry_key); in operator()
/external/v8/src/base/
Dhashmap.h439 bool operator()(uint32_t hash1, uint32_t hash2, const Key& key1, in operator()
441 return hash1 == hash2 && match_(key1, key2); in operator()
485 bool operator()(uint32_t hash1, uint32_t hash2, const Key& key1, in operator()
/external/tensorflow/tensorflow/core/grappler/graph_analyzer/
Dsig_node_test.cc200 size_t hash2 = rhit->second.unique_hash; in TEST_F() local
208 EXPECT_THAT(rhit->second.unique_hash, Ne(hash2)); in TEST_F()
222 EXPECT_THAT(peerit->link_hash, Eq(hash2)); in TEST_F()
/external/icu/icu4c/source/test/intltest/
Dloctest.cpp624 int32_t hash2 = test2.hashCode(); in TestSimpleObjectStuff() local
627 test_assert(hash1 == hash2); in TestSimpleObjectStuff()
629 test_assert(hash2 == hash3); in TestSimpleObjectStuff()
711 int32_t hash2 = test2.hashCode(); in TestPOSIXParsing() local
714 test_assert(hash1 == hash2); in TestPOSIXParsing()
715 test_assert(hash2 == hash3); in TestPOSIXParsing()
/external/python/cpython3/Modules/
D_sre.c2492 Py_hash_t hash, hash2; in pattern_hash() local
2499 hash2 = _Py_HashBytes(self->code, sizeof(self->code[0]) * self->codesize); in pattern_hash()
2500 hash ^= hash2; in pattern_hash()

12