OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:hash2
(Results
1 - 20
of
20
) sorted by null
/external/libyuv/files/util/
compare.cc
35
uint32
hash2
= 5381;
local
45
if (amt2 > 0)
hash2
= libyuv::HashDjb2(buf2, amt2,
hash2
);
54
printf(",
hash2
%x",
hash2
);
/external/guava/guava/src/com/google/common/hash/
BloomFilterStrategies.java
31
int
hash2
= (int) (hash64 >>> 32);
local
33
int nextHash = hash1 + i *
hash2
;
46
int
hash2
= (int) (hash64 >>> 32);
local
48
int nextHash = hash1 + i *
hash2
;
/external/apache-harmony/math/src/test/java/tests/api/java/math/
BigDecimalTest.java
356
BigDecimal
hash2
= new BigDecimal(1.00D);
local
358
hash.hashCode() !=
hash2
.hashCode() && !hash.equals(
hash2
));
359
hash2
= new BigDecimal("1.0");
361
hash.hashCode() !=
hash2
.hashCode() && !hash.equals(
hash2
));
363
hash2
= new BigDecimal(val, 2);
365
.hashCode() ==
hash2
.hashCode()
366
&& hash.equals(
hash2
));
368
hash2
= new BigDecimal("-1233456.0000")
[
all
...]
/external/v8/src/
store-buffer.cc
691
uintptr_t
hash2
= (int_addr - (int_addr >> kHashSetLengthLog2));
local
692
hash2
^=
hash2
>> (kHashSetLengthLog2 * 2);
693
hash2
&= (kHashSetLength - 1);
694
if (hash_set_2_[
hash2
] == int_addr) continue;
697
} else if (hash_set_2_[
hash2
] == 0) {
698
hash_set_2_[
hash2
] = int_addr;
703
hash_set_2_[
hash2
] = 0;
/external/webkit/Source/WebKit/mac/Misc/
WebIconDatabase.mm
459
UInt32
hash2
;
474
hash2
= len;
476
hash2
= (37 *
hash2
) ^ s[cnt];
480
snprintf(buffer, UniqueFilePathSize, "%.2u/%.2u/%.10u-%.10u.cache", ((hash1 & 0xff) >> 4), ((
hash2
& 0xff) >> 4), hash1,
hash2
);
482
snprintf(buffer, UniqueFilePathSize, "%.2lu/%.2lu/%.10lu-%.10lu.cache", ((hash1 & 0xff) >> 4), ((
hash2
& 0xff) >> 4), hash1,
hash2
);
/external/icu4c/common/
uhash.c
855
uhash_equals(const UHashtable* hash1, const UHashtable*
hash2
){
858
if(hash1==
hash2
){
870
if (hash1==NULL ||
hash2
==NULL ||
871
hash1->keyComparator !=
hash2
->keyComparator ||
872
hash1->valueComparator !=
hash2
->valueComparator ||
883
count2 = uhash_count(
hash2
);
894
* value from
hash2
. If the hashes are equal then then both hashes should
897
const UHashElement* elem2 = _uhash_find(
hash2
, key1,
hash2
->keyHasher(key1));