| /external/chromium_org/net/base/ |
| hash_value.h | 45 // Check for equality of hash values
54 // <hash-name>"/"<base64-hash-value>
69 // is supplied (eg: an unknown hash tag), returns "unknown"/<base64>
117 // IsSHA1HashInSortedArray returns true iff |hash| is in |array|, a sorted
119 bool IsSHA1HashInSortedArray(const SHA1HashValue& hash,
|
| /external/chromium_org/third_party/cld/base/ |
| stl_decl_msvc.h | 75 struct hash;
78 class HashFcn = hash<Key> >
82 class HashFcn = hash<Key> >
86 class HashFcn = hash<Key> >
90 class HashFcn = hash<Key> >
96 using msvchash::hash;
|
| /external/chromium_org/v8/src/ |
| hashmap.h | 48 // initial_capacity is the size of the initial hash map;
56 // HashMap entries are (key, value, hash) triplets.
62 uint32_t hash; // The full hash value for key member in struct:v8::internal::TemplateHashMapImpl::Entry
69 // corresponding key, key hash, and NULL value.
71 Entry* Lookup(void* key, uint32_t hash, bool insert,
77 void* Remove(void* key, uint32_t hash);
79 // Empties the hash map (occupancy() == 0).
108 Entry* Probe(void* key, uint32_t hash);
132 void* key, uint32_t hash, bool insert, AllocationPolicy allocator)
[all...] |
| /external/e2fsprogs/debugfs/ |
| htree.c | 2 * htree.c --- hash tree routines
43 ext2_dirhash_t hash, minor_hash; local
90 &hash, &minor_hash);
93 "while calculating hash");
95 hash, minor_hash, rec_len, name);
123 int hash, i; local
134 hash = i ? ext2fs_le32_to_cpu(ent[i].hash) : 0;
135 fprintf(pager, "Entry #%d: Hash 0x%08x%s, block %u\n", i,
136 hash, (hash & 1) ? " (**)" : ""
297 ext2_dirhash_t hash, minor_hash; local
[all...] |
| /external/llvm/unittests/Support/ |
| MD5Test.cpp | 24 MD5 Hash;
25 Hash.update(Input);
27 Hash.final(MD5Res);
34 MD5 Hash;
35 Hash.update(Input);
37 Hash.final(MD5Res);
|
| /external/v8/src/ |
| hashmap.h | 43 // initial_capacity is the size of the initial hash map;
49 // HashMap entries are (key, value, hash) triplets.
55 uint32_t hash; // the full hash value for key member in struct:v8::internal::TemplateHashMapImpl::Entry
61 // corresponding key, key hash, and NULL value.
63 Entry* Lookup(void* key, uint32_t hash, bool insert);
66 void Remove(void* key, uint32_t hash);
68 // Empties the hash map (occupancy() == 0).
97 Entry* Probe(void* key, uint32_t hash);
120 void* key, uint32_t hash, bool insert)
[all...] |
| /frameworks/compile/mclinker/include/mcld/ |
| LinkerScript.h | 31 hash::StringHash<hash::ELF>,
35 hash::StringHash<hash::ELF>,
39 hash::StringHash<hash::ELF>,
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
| BigIntegerHashCodeTest.java | 33 * Test hash codes for the same object
47 assertTrue("hash codes for the same object differ", code1 == code2);
51 * Test hash codes for equal objects.
61 assertTrue("hash codes for equal objects are unequal", code1 == code2);
66 * Test hash codes for unequal objects.
77 assertTrue("hash codes for unequal objects are equal", code1 != code2);
|
| /libcore/luni/src/main/java/libcore/icu/ |
| CollationKeyICU.java | 25 * Cached hash value.
85 * Creates a hash code for this CollationKey.
86 * Compute the hash by iterating sparsely over about 32 (up to 63) bytes
88 * hash value by a prime number and add the new byte in, like a linear
91 * @return hash value of collation key. Hash value is never 0.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| hash_bytes.h | 1 // Declarations for hash functions. -*- C++ -*-
41 // Hash function implementation for the nontrivial specialization.
43 // byte array. The actual hash algorithm is not guaranteed to stay
45 // improve hash quality or speed.
49 // A similar hash primitive, using the FNV hash algorithm. This
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| hash_bytes.h | 1 // Declarations for hash functions. -*- C++ -*-
41 // Hash function implementation for the nontrivial specialization.
43 // byte array. The actual hash algorithm is not guaranteed to stay
45 // improve hash quality or speed.
49 // A similar hash primitive, using the FNV hash algorithm. This
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| hash_bytes.h | 1 // Declarations for hash functions. -*- C++ -*-
41 // Hash function implementation for the nontrivial specialization.
43 // byte array. The actual hash algorithm is not guaranteed to stay
45 // improve hash quality or speed.
49 // A similar hash primitive, using the FNV hash algorithm. This
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| hash_bytes.h | 1 // Declarations for hash functions. -*- C++ -*-
41 // Hash function implementation for the nontrivial specialization.
43 // byte array. The actual hash algorithm is not guaranteed to stay
45 // improve hash quality or speed.
49 // A similar hash primitive, using the FNV hash algorithm. This
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| hash_bytes.h | 1 // Declarations for hash functions. -*- C++ -*-
41 // Hash function implementation for the nontrivial specialization.
43 // byte array. The actual hash algorithm is not guaranteed to stay
45 // improve hash quality or speed.
49 // A similar hash primitive, using the FNV hash algorithm. This
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| hash_bytes.h | 1 // Declarations for hash functions. -*- C++ -*-
41 // Hash function implementation for the nontrivial specialization.
43 // byte array. The actual hash algorithm is not guaranteed to stay
45 // improve hash quality or speed.
49 // A similar hash primitive, using the FNV hash algorithm. This
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| hash_bytes.h | 1 // Declarations for hash functions. -*- C++ -*-
41 // Hash function implementation for the nontrivial specialization.
43 // byte array. The actual hash algorithm is not guaranteed to stay
45 // improve hash quality or speed.
49 // A similar hash primitive, using the FNV hash algorithm. This
|
| /prebuilts/tools/common/proguard/proguard4.7/docs/manual/ |
| index.html | 11 window.top.location.replace("../index.html#"+window.location.pathname+window.location.hash);
13 var hash="#"+window.location.pathname.replace(window.top.location.pathname.replace("index.html", ""), "");
14 if (window.top.location.hash!=hash)
15 window.top.location.hash=hash;
|
| /prebuilts/tools/common/proguard/proguard4.7/docs/ |
| quality.html | 11 window.top.location.replace("index.html#"+window.location.pathname+window.location.hash);
13 var hash="#"+window.location.pathname.replace(window.top.location.pathname.replace("index.html", ""), "");
14 if (window.top.location.hash!=hash)
15 window.top.location.hash=hash;
|
| /external/chromium_org/third_party/smhasher/src/ |
| KeysetTest.h | 2 // 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 )
63 CombinationKeygenRecurse<hashtype>(key,0,maxlen,blocks,blockcount,hash,hashes)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_hash.py | 2 # iff a==b then hash(a)==hash(b)
4 # Also test that hash implementations are inherited as expected
22 # Hash each object given and fail if
23 # the hash values are not all the same.
24 hashed = map(hash, objlist)
102 self.assertEqual(hash(obj), _default_hash(obj))
106 self.assertEqual(hash(obj), _FIXED_HASH_VALUE)
110 self.assertRaises(TypeError, hash, obj)
143 self.assertEqual(hash(obj), _default_hash(obj)
222 return 'import datetime; print(hash(%s))' % repr_ namespace
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_hash.py | 2 # iff a==b then hash(a)==hash(b)
4 # Also test that hash implementations are inherited as expected
22 # Hash each object given and fail if
23 # the hash values are not all the same.
24 hashed = map(hash, objlist)
102 self.assertEqual(hash(obj), _default_hash(obj))
106 self.assertEqual(hash(obj), _FIXED_HASH_VALUE)
110 self.assertRaises(TypeError, hash, obj)
143 self.assertEqual(hash(obj), _default_hash(obj)
222 return 'import datetime; print(hash(%s))' % repr_ namespace
[all...] |
| /external/chromium_org/chrome/browser/spellchecker/ |
| feedback_sender.h | 8 // Assigns uint32 hash identifiers to spelling suggestions from spelling service
51 // sender.SelectedSuggestion(hash, suggestion_index);
63 // misspelling identified by |hash|.
64 void SelectedSuggestion(uint32 hash, int suggestion_index);
66 // Records that user added the misspelling identified by |hash| to the
68 void AddedToDictionary(uint32 hash);
70 // Records that user right-clicked on the misspelling identified by |hash|,
72 void IgnoredSuggestions(uint32 hash);
75 // misspelling identified by |hash| to string |correction|, which is not in
77 void ManuallyCorrected(uint32 hash, const string16& correction)
[all...] |
| /external/chromium_org/net/quic/ |
| quic_utils.cc | 26 uint64 hash = kOffset; local
29 hash = hash ^ octets[i];
30 hash = hash * kPrime;
33 return hash;
38 // The following two constants are defined as part of the hash algorithm.
48 uint128 hash = kOffset; local
51 hash = hash ^ uint128(0, octets[i])
[all...] |
| /external/chromium_org/third_party/libxml/src/include/libxml/ |
| hash.h | 2 * Summary: Chained hash tables
3 * Description: This module implements the hash table support used in
19 * The hash table.
64 * @payload: the data in the hash
67 * Callback to free data from a hash.
72 * @payload: the data in the hash
75 * Callback to copy data from a hash.
82 * @payload: the data in the hash
86 * Callback when scanning data in a hash with the simple scanner.
91 * @payload: the data in the hash
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| HashCode.java | 15 package com.google.common.hash;
24 * An immutable hash code of arbitrary bit length.
48 * Returns the value of this hash code as a byte array. The caller may modify the byte array;
56 * Copies bytes from this hash code into {@code dest}.
58 * @param dest the byte array into which the hash code will be written
65 byte[] hash = asBytes();
66 maxLength = Ints.min(maxLength, hash.length);
68 System.arraycopy(hash, 0, dest, offset, maxLength);
73 * Returns the number of bits in this hash code; a positive multiple of 32.
81 // hash code, in which case we don't want to leak timing informatio
[all...] |
