/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 | 50 int hash2 = (int) (hash64 >>> 32); local 54 int combinedHash = hash1 + (i * hash2); 69 int hash2 = (int) (hash64 >>> 32); local 72 int combinedHash = hash1 + (i * hash2); 87 * multiplication in the loop and doing a (much simpler) += hash2. We're also changing the 97 long hash2 = upperEight(bytes); local 104 combinedHash += hash2; 115 long hash2 = upperEight(bytes); local 123 combinedHash += hash2;
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
CalendarCache.java | 64 delta = hash2(key); 107 private final int hash2(long key) { method in class:CalendarCache
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
CalendarCache.java | 62 delta = hash2(key); 105 private final int hash2(long key) { method in class:CalendarCache
|
/external/v8/src/ |
transitions-inl.h | 123 uint32_t hash2, PropertyKind kind2, 125 int cmp = CompareNames(key1, hash1, key2, hash2); 133 uint32_t hash2) { 136 return hash1 <= hash2 ? -1 : 1;
|
transitions.h | 295 uint32_t hash2, PropertyKind kind2, 301 uint32_t hash2);
|
/external/autotest/client/site_tests/login_OwnershipNotRetaken/ |
login_OwnershipNotRetaken.py | 57 hash2 = hashlib.md5(key2.read()) 59 if hash.hexdigest() != hash2.hexdigest():
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/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/guava/guava-tests/test/com/google/common/hash/ |
HashTestUtils.java | 263 int hash2 = function.hashInt(key2).asInt(); local 265 same |= ~(hash1 ^ hash2); 267 diff |= (hash1 ^ hash2); 302 int hash2 = function.hashInt(key2).asInt(); local 304 if ((hash1 & (1 << k)) == (hash2 & (1 << k))) { 348 int hash2 = function.hashInt(key2).asInt(); local 352 if ((hash1 ^ hash2) != delta) { 392 int hash2 = function.hashInt(key2).asInt(); local 394 if ((hash1 & (1 << k)) == (hash2 & (1 << k))) {
|
HashCodeTest.java | 174 HashCode hash2 = local 176 assertEquals(hash1, hash2); 207 HashCode hash2 = HashCode.fromString(hash1.toString()); local 208 assertEquals(hash1, hash2);
|
/external/ltrace/ |
dict.c | 42 size_t (*hash2)(size_t)) 53 dict->hash2 = hash2; 109 source->hash1, source->eq, source->hash2); 190 hash2(struct dict *dict))(size_t) function 192 if (dict->hash2 != NULL) 193 return dict->hash2; 221 size_t d = hash2(dict)(pos); 278 dict->hash1, dict->eq, dict->hash2);
|
dict.h | 38 size_t (*hash2)(size_t); member in struct:dict 42 * size KEY_SIZE and values of the size VALUE_SIZE. HASH1 and HASH2 50 size_t (*hash2)(size_t)); 55 #define DICT_INIT(DICTP, KEY_TYPE, VALUE_TYPE, HASH1, EQ, HASH2) \ 63 HASH2); \
|
/external/libgdx/gdx/src/com/badlogic/gdx/utils/ |
IntSet.java | 106 int index2 = hash2(key); 184 int index2 = hash2(key); 237 index2 = hash2(evictedKey); 291 index = hash2(key); 362 index = hash2(key); 418 private int hash2 (int h) { method in class:IntSet
|
ObjectSet.java | 100 int index2 = hash2(hashCode); 173 int index2 = hash2(hashCode); 226 index2 = hash2(hashCode); 274 index = hash2(hashCode); 343 index = hash2(hashCode); 398 private int hash2 (int h) { method in class:ObjectSet
|
IdentityMap.java | 108 int index2 = hash2(hashCode);
172 int index2 = hash2(hashCode);
236 index2 = hash2(hashCode);
282 index = hash2(hashCode);
295 index = hash2(hashCode);
322 index = hash2(hashCode);
424 index = hash2(hashCode);
494 private int hash2 (int h) {
method in class:IdentityMap
|
IntFloatMap.java | 119 int index2 = hash2(key); 189 int index2 = hash2(key); 252 index2 = hash2(evictedKey); 302 index = hash2(key); 335 index = hash2(key); 374 index = hash2(key); 472 index = hash2(key); 533 private int hash2 (int h) { method in class:IntFloatMap
|
IntIntMap.java | 117 int index2 = hash2(key); 187 int index2 = hash2(key); 250 index2 = hash2(evictedKey); 300 index = hash2(key); 333 index = hash2(key); 372 index = hash2(key); 459 index = hash2(key); 519 private int hash2 (int h) { method in class:IntIntMap
|
IntMap.java | 120 int index2 = hash2(key);
194 int index2 = hash2(key);
258 index2 = hash2(evictedKey);
307 index = hash2(key);
323 index = hash2(key);
358 index = hash2(key);
467 index = hash2(key);
540 private int hash2 (int h) {
method in class:IntMap
|
LongMap.java | 120 int index2 = hash2(key);
194 int index2 = hash2(key);
257 index2 = hash2(evictedKey);
306 index = hash2(key);
322 index = hash2(key);
357 index = hash2(key);
464 index = hash2(key);
537 private int hash2 (long h) {
method in class:LongMap
|
ObjectFloatMap.java | 106 int index2 = hash2(hashCode); 171 int index2 = hash2(hashCode); 235 index2 = hash2(hashCode); 282 index = hash2(hashCode); 304 index = hash2(hashCode); 337 index = hash2(hashCode); 422 index = hash2(hashCode); 482 private int hash2 (int h) { method in class:ObjectFloatMap
|
ObjectIntMap.java | 106 int index2 = hash2(hashCode);
171 int index2 = hash2(hashCode);
235 index2 = hash2(hashCode);
282 index = hash2(hashCode);
304 index = hash2(hashCode);
337 index = hash2(hashCode);
423 index = hash2(hashCode);
483 private int hash2 (int h) {
method in class:ObjectIntMap
|
ObjectMap.java | 112 int index2 = hash2(hashCode);
182 int index2 = hash2(hashCode);
246 index2 = hash2(hashCode);
292 index = hash2(hashCode);
313 index = hash2(hashCode);
340 index = hash2(hashCode);
442 index = hash2(hashCode);
512 private int hash2 (int h) {
method in class:ObjectMap
|
/toolchain/binutils/binutils-2.25/libiberty/ |
hashtab.c | 487 hashval_t hash2; local 494 hash2 = htab_mod_m2 (hash, htab); 497 index += hash2; 588 hashval_t index, hash2; local 601 hash2 = htab_mod_m2 (hash, htab); 605 index += hash2; 638 hashval_t index, hash2; local 663 hash2 = htab_mod_m2 (hash, htab); 667 index += hash2; 848 hash(), hash2(), hash3, and mix() are externally useful functions [all...] |
/external/icu/icu4c/source/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));
|
/external/giflib/ |
quantize.c | 323 int hash2 = entry2->RGB[SortRGBAxis] * 256 * 256 local 327 return hash1 - hash2;
|