| /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...] |
| package-info.java | 17 * Hash functions and related structures.
20 package com.google.common.hash;
|
| /external/libxml2/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/smack/src/org/xbill/DNS/ |
| NSEC3Record.java | 67 * @param name The ownername of the NSEC3 record (base32'd hash plus zonename).
70 * @param hashAlg The hash algorithm.
72 * @param iterations The number of hash iterations.
74 * @param next The next hash (may not be null).
96 throw new IllegalArgumentException("Invalid next hash");
182 /** Returns the hash algorithm */
207 /** Returns the next hash */
240 byte [] hash = null;
246 digest.update(hash);
249 hash = digest.digest()
[all...] |
| /external/chromium/sdch/open-vcdiff/src/ |
| rolling_hash.h | 29 // Definitions common to all hash window sizes.
65 // Here's the heart of the hash algorithm. Start with a partial_hash value of
67 // hashed. The result will be the hash value for the entire data window. The
68 // Hash() function, below, does exactly this, albeit with some refinements.
74 // Use this function to start computing a new hash value based on the first
108 // instance of this type to use UpdateHash(), but Hash() does not depend on
117 // Compute a hash of the window "ptr[0, window_size - 1]".
118 static uint32_t Hash(const char* ptr) {
126 // Update a hash by removing the oldest byte and adding a new byte.
128 // UpdateHash takes the hash value of buffer[0] ... buffer[window_size -1
[all...] |
| /external/chromium_org/chrome/browser/profile_resetter/ |
| jtl_foundation.h | 28 // NAVIGATE(hash("bar"))
30 // STORE_BOOL(hash("found_foo"), 1)
56 // before being compared to hash values listed in |program|.
60 // notation), or hash string of 32 bytes.
67 // - a 32 byte hash of the target dictionary key.
80 // - a 32 byte hash of the parameter name,
86 // - a 32 byte hash of the parameter name,
91 // Same as STORE_BOOL but takes a hash instead of a boolean value as
94 // Same as COMPARE_STORED_BOOL but takes a hash instead of two boolean values
101 // - a 32 byte hash of the parameter name
[all...] |
| /external/chromium_org/sdch/open-vcdiff/src/ |
| rolling_hash.h | 30 // Definitions common to all hash window sizes.
66 // Here's the heart of the hash algorithm. Start with a partial_hash value of
68 // hashed. The result will be the hash value for the entire data window. The
69 // Hash() function, below, does exactly this, albeit with some refinements.
75 // Use this function to start computing a new hash value based on the first
107 // instance of this type to use UpdateHash(), but Hash() does not depend on
116 // Compute a hash of the window "ptr[0, window_size - 1]".
117 static uint32_t Hash(const char* ptr) {
125 // Update a hash by removing the oldest byte and adding a new byte.
127 // UpdateHash takes the hash value of buffer[0] ... buffer[window_size -1
[all...] |
| /external/open-vcdiff/src/ |
| rolling_hash.h | 30 // Definitions common to all hash window sizes.
66 // Here's the heart of the hash algorithm. Start with a partial_hash value of
68 // hashed. The result will be the hash value for the entire data window. The
69 // Hash() function, below, does exactly this, albeit with some refinements.
75 // Use this function to start computing a new hash value based on the first
107 // instance of this type to use UpdateHash(), but Hash() does not depend on
116 // Compute a hash of the window "ptr[0, window_size - 1]".
117 static uint32_t Hash(const char* ptr) {
125 // Update a hash by removing the oldest byte and adding a new byte.
127 // UpdateHash takes the hash value of buffer[0] ... buffer[window_size -1
[all...] |
| /external/guava/guava-tests/test/com/google/common/cache/ |
| LocalCacheTest.java | 424 int hash = map.hash(key); local
427 ReferenceEntry<Object, Object> entry = segment.getEntry(key, hash);
480 int hash = map.hash(key); local
482 int index = hash & (table.length() - 1);
484 DummyEntry<Object, Object> entry = DummyEntry.create(key, hash, null);
509 int hash = map.hash(key); local
511 int index = hash & (table.length() - 1)
570 int hash = map.hash(one); local
707 int hash = map.hash(key); local
809 int hash = map.hash(one); local
969 int hash = map.hash(key); local
1044 int hash = map.hash(key); local
1088 int hash = map.hash(key); local
1127 int hash = map.hash(key); local
1159 int hash = map.hash(key); local
1194 int hash = map.hash(key); local
1230 int hash = map.hash(key); local
1305 int hash = map.hash(key); local
1344 int hash = map.hash(key); local
1397 int hash = map.hash(key); local
1529 int hash = map.hash(key); local
1587 int hash = map.hash(key); local
1622 int hash = map.hash(key); local
1657 int hash = map.hash(key); local
1691 int hash = map.hash(key); local
1737 int hash = map.hash(key); local
1860 int hash = map.hash(key); local
1901 int hash = map.hash(key); local
1943 int hash = map.hash(key); local
2144 int hash = map.hash(key); local
2481 private final int hash; field in class:LocalCacheTest.DummyEntry
[all...] |
| /art/runtime/ |
| utf.cc | 72 int32_t hash = 0; local
74 hash = hash * 31 + chars->Get(offset + i);
76 return hash;
80 int32_t hash = 0; local
82 hash = hash * 31 + *chars++;
84 return hash;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRPtrStack.h | 38 /* form hash value for string s */
39 - (NSInteger)hash:(NSString *)s;
|
| /external/chromium/base/ |
| hash_tables.h | 14 // NOTE: It is an explicit non-goal of this class to provide a generic hash
15 // function for pointers. If you want to hash a pointers to a particular class,
64 // The GNU C++ library provides identity hash functions for many integral types,
65 // but not for |long long|. This hash function will truncate if |size_t| is
71 struct hash<integral_type> { \
83 // Implement string hash functions so that strings of various flavors can
84 // be used as keys in STL maps and sets. The hash algorithm comes from the
91 struct hash<string_type> { \
|
| /external/chromium_org/remoting/host/ |
| pin_hash_unittest.cc | 17 std::string hash = MakeHostPinHash("Host ID", "1234"); local
18 ASSERT_EQ("hmac:bk6RVRFLpLO89mr4QPHSg8CemUUtI90r2F0VfvTmWLI=", hash);
|
| /external/chromium_org/third_party/WebKit/Source/platform/weborigin/ |
| SecurityOriginHash.h | 39 static unsigned hash(SecurityOrigin* origin) function in struct:WebCore::SecurityOriginHash
42 origin->protocol().impl() ? origin->protocol().impl()->hash() : 0,
43 origin->host().impl() ? origin->host().impl()->hash() : 0,
48 static unsigned hash(const RefPtr<SecurityOrigin>& origin) function in struct:WebCore::SecurityOriginHash
50 return hash(origin.get());
55 // FIXME: The hash function above compares three specific fields.
58 // equal without changing hash to match it.
86 typedef WebCore::SecurityOriginHash Hash;
|
| /external/dropbear/libtomcrypt/src/hashes/sha2/ |
| sha224.c | 36 Initialize the hash state
37 @param md The hash state you wish to initialize
58 Terminate the hash to get the digest
59 @param md The hash state
60 @param out [out] The destination of the hash (28 bytes)
80 Self-test the hash
90 unsigned char hash[28];
114 if (XMEMCMP(tmp, tests[i].hash, 28) != 0) {
|
| /external/jmonkeyengine/engine/src/core/com/jme3/shader/ |
| ShaderKey.java | 87 int hash = 7; local
88 hash = 41 * hash + name.hashCode();
89 hash = 41 * hash + fragName.hashCode();
90 hash = 41 * hash + (defines != null ? defines.getCompiled().hashCode() : 0);
91 return hash;
|
| /external/libsepol/include/sepol/policydb/ |
| symtab.h | 10 * using the hash table type (hashtab).
30 hashtab_t table; /* hash table (keyed on a string) */
|
| /external/oprofile/daemon/ |
| opd_cookie.c | 135 unsigned long hash = hash_cookie(cookie); local
142 list_for_each(pos, &hashes[hash]) {
150 list_add(&entry->list, &hashes[hash]);
158 unsigned long hash = hash_cookie(cookie); local
165 list_for_each(pos, &hashes[hash]) {
172 list_add(&entry->list, &hashes[hash]);
180 unsigned long hash = hash_cookie(cookie); local
190 list_for_each(pos, &hashes[hash]) {
|
| /external/qemu/android/utils/ |
| refset.c | 20 uint32_t hash; local
22 hash = (uint32_t)(ptrdiff_t)item >> 2;
24 hash ^= ((uint64_t)(ptrdiff_t)item >> 32);
26 return hash;
32 uint32_t hash = _arefSet_hashItem(item); local
33 unsigned index = hash & (s->max_buckets-1);
50 uint32_t hash = _arefSet_hashItem(item); local
51 unsigned index = hash & (s->max_buckets-1);
|
| /libcore/luni/src/main/java/java/security/ |
| Timestamp.java | 36 // Cached hash
37 private transient int hash; field in class:Timestamp
109 * Returns the hash code value for this {@code Timestamp}. Returns the same
110 * hash code for {@code Timestamp}s that are equal to each other as
113 * @return the hash code value for this {@code Timestamp}.
119 if (hash == 0) {
120 hash = timestamp.hashCode() ^ signerCertPath.hashCode();
122 return hash;
|
| /libcore/luni/src/main/java/javax/crypto/ |
| package.html | 15 Authentication may be based on MAC (Message Authentication Code) such as HMAC (Hash MAC, i.e. with a SHA-1 hash function).
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
| size_hash.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 test_hash<std::hash<NotConstructible> >,
37 test_hash<std::hash<NotConstructible> >(8)
40 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
53 test_hash<std::hash<NotConstructible> >,
59 test_hash<std::hash<NotConstructible> >(8)
62 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
| size_hash_equal.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 test_hash<std::hash<NotConstructible> >,
37 test_hash<std::hash<NotConstructible> >(8),
41 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
54 test_hash<std::hash<NotConstructible> >,
60 test_hash<std::hash<NotConstructible> >(8),
64 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
| size_hash_equal_allocator.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 test_hash<std::hash<NotConstructible> >,
37 test_hash<std::hash<NotConstructible> >(8),
42 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
55 test_hash<std::hash<NotConstructible> >,
61 test_hash<std::hash<NotConstructible> >(8),
66 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
