| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-sparc/ |
| vxworks1.ld | 5 .hash : { *(.hash) }
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-vax-elf/ |
| plt-local.ld | 6 .hash : { *(.hash) }
|
| /external/guava/guava/src/com/google/common/hash/ |
| Hashing.java | 15 package com.google.common.hash;
35 * <p>A comparison of the various hash functions can be found
46 * Returns a general-purpose, <b>temporary-use</b>, non-cryptographic hash function. The algorithm
50 * Hashing} class is loaded. <b>Do not use this method</b> if hash codes may escape the current
57 * @return a hash function, described above, that produces hash codes of length {@code
84 * dependent on the hash codes they produce will fail sooner.
89 * Returns a hash function implementing the
101 * Returns a hash function implementing the
120 * Returns a hash function implementing th
461 int hash = bits; local
[all...] |
| HashCode.java | 15 package com.google.common.hash;
32 * An immutable hash code of arbitrary bit length.
43 * Returns the number of bits in this hash code; a positive multiple of 8.
73 * Returns the value of this hash code as a byte array. The caller may modify the byte array;
81 * Copies bytes from this hash code into {@code dest}.
83 * @param dest the byte array into which the hash code will be written
119 public static HashCode fromInt(int hash) {
120 return new IntHashCode(hash);
124 final int hash; field in class:HashCode.IntHashCode
126 IntHashCode(int hash) {
184 final long hash; field in class:HashCode.LongHashCode
[all...] |
| /external/mesa3d/src/gallium/auxiliary/cso_cache/ |
| cso_cache.c | 51 unsigned hash = 0, i; local
58 hash ^= ikey[i];
60 return hash;
85 struct cso_hash *hash; local
86 hash = sc->hashes[type];
87 return hash;
156 struct cso_hash *hash,
161 sc->sanitize_cb(hash, type, max_size, sc->sanitize_data);
165 static INLINE void sanitize_cb(struct cso_hash *hash, enum cso_cache_type type,
170 int hash_size = cso_hash_size(hash);
190 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
200 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
242 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
266 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
[all...] |
| /toolchain/binutils/binutils-2.25/bfd/ |
| genlink.h | 35 /* The generic linker uses a hash table which is a derived class of
36 the standard linker hash table, just as the other backend specific
37 linkers do. Do not confuse the generic linker hash table with the
38 standard BFD linker hash table it is built upon. */
40 /* Generic linker hash table entries. */
51 /* Generic linker hash table. */
58 /* Look up an entry in a generic link hash table. */
64 /* Traverse a generic link hash table. */
72 /* Get the generic link hash table from the info structure. This is
76 ((struct generic_link_hash_table *) ((p)->hash))
[all...] |
| /external/icu/icu4c/source/test/perf/unisetperf/draft/ |
| bitset.cpp | 17 * Uses a simple hash table for compaction.
26 * Hash table for up to 1k 64-bit words, for 1 bit per BMP code point.
48 int32_t hash=(int32_t)(key>>55)&0x1ff; local
49 hash^=(int32_t)(key>>44)&0x7ff;
50 hash^=(int32_t)(key>>33)&0x7ff;
51 hash^=(int32_t)(key>>22)&0x7ff;
52 hash^=(int32_t)(key>>11)&0x7ff;
53 hash^=(int32_t)key&0x7ff;
55 if(values[hash]==0xffff) {
57 keys[hash]=key
[all...] |
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| sparse_weight_vector.h | 36 template<class Key = std::string, class Hash = std::unordered_map<Key, double> >
39 typedef Hash Wmap;
46 explicit SparseWeightVector(const SparseWeightVector<Key, Hash> &other) {
49 void operator=(const SparseWeightVector<Key, Hash> &other) {
52 void CopyFrom(const SparseWeightVector<Key, Hash> &other) {
116 void LoadWeightVector(const SparseWeightVector<Key, Hash> &vec) {
133 const SparseWeightVector<Key, Hash> &w1,
136 const SparseWeightVector<Key, Hash> &w1,
139 const SparseWeightVector<Key, Hash> &w1,
141 void MultWeightUpdate(const SparseWeightVector<Key, Hash> &w1)
[all...] |
| /external/v8/src/base/ |
| functional.h | 21 // base::hash is an implementation of the hash function object specified by
22 // C++11. It was designed to be compatible with std::hash (in C++11) and
23 // boost:hash (which in turn is based on the hash function object specified by
26 // base::hash is implemented by calling the hash_value function. The namespace
31 // If users are asked to implement a hash function for their own types with no
32 // guidance, they generally write bad hash functions. Instead, we provide a
33 // simple function base::hash_combine to pass hash-relevant member variables
34 // into, in order to define a decent hash function. base::hash_combine i
141 struct hash : public std::unary_function<T, size_t> { struct in namespace:v8::base
168 struct hash<T*> : public std::unary_function<T*, size_t> { struct in namespace:v8::base
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multimap/ |
| swap_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 typedef test_hash<std::hash<int> > Hash;
34 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
36 C c1(0, Hash(1), Compare(1), Alloc(1));
37 C c2(0, Hash(2), Compare(2), Alloc(2));
43 assert(c1.hash_function() == Hash(2));
52 assert(c2.hash_function() == Hash(1));
60 typedef test_hash<std::hash<int> > Hash
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.swap/ |
| swap_non_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
30 typedef test_hash<std::hash<int> > Hash;
33 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1));
36 C c2(0, Hash(2), Compare(2), Alloc(2));
42 assert(c1.hash_function() == Hash(2));
51 assert(c2.hash_function() == Hash(1));
59 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| swap_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 typedef test_hash<std::hash<int> > Hash;
34 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
36 C c1(0, Hash(1), Compare(1), Alloc(1));
37 C c2(0, Hash(2), Compare(2), Alloc(2));
43 assert(c1.hash_function() == Hash(2));
52 assert(c2.hash_function() == Hash(1));
60 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.swap/ |
| swap_non_member.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
30 typedef test_hash<std::hash<int> > Hash;
33 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1));
36 C c2(0, Hash(2), Compare(2), Alloc(2));
42 assert(c1.hash_function() == Hash(2));
51 assert(c2.hash_function() == Hash(1));
59 typedef test_hash<std::hash<int> > Hash
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| ExpandedNameTable.java | 31 * a simple hash algorithm directly into this class, instead of using the
33 * are combined in getExpandedTypeID() method to share the same hash calculation
35 * expand the hash table.
80 * The initial capacity of the hash table. Use a bigger number
86 * The capacity of the hash table, i.e. the size of the
92 * The threshold of the hash table, which is equal to capacity * loadFactor.
93 * If the number of entries in the hash table is bigger than the threshold,
94 * the hash table needs to be expanded.
99 * The internal array to store the hash entries.
100 * Each array member is a slot for a hash bucket
187 int hash = type + namespace.hashCode() + localName.hashCode(); local
379 int hash; field in class:ExpandedNameTable.HashEntry
[all...] |
| /external/deqp/framework/delibs/depool/ |
| dePoolHashSet.h | 23 * \brief Memory pool hash-set class.
37 * \brief Declare a template pool hash-set (hash of sets) class interface.
38 * \param TYPENAME Type name of the declared hash-set.
44 * The functions for operating the hash are:
51 * Hash<Set*>* HashSet_getHash (const HashSet* hashSet); TODO: better API
60 DE_DECLARE_POOL_HASH(TYPENAME##Hash, KEYTYPE, TYPENAME##Set*); \
63 TYPENAME##Hash* hash; \
68 DE_INLINE TYPENAME##Hash* TYPENAME##_getHash (const TYPENAME* hashSet) DE_UNUSED_FUNCTION;
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_state_cache.c | 35 * consumers can query the hash table of state using a cache_id,
40 * The inner workings are a simple hash table based on a CRC of the
57 GLuint hash = item->cache_id, i; local
64 hash ^= ikey[i];
65 hash = (hash << 5) | (hash >> 27);
68 return hash;
76 a->hash == b->hash &
141 GLuint hash; local
274 GLuint hash; local
[all...] |
| /external/tpm2/ |
| CpriHash.c | 30 // This function returns the address of the hash server function
75 // This function copies an OpenSSL() hash context into a caller provided buffer.
99 // This function will unmarshal a caller provided buffer into an OpenSSL() hash context. The function returns
106 TPM_ALG_ID algType, // IN: The hash algorithm selector
107 BYTE *buf // IN: Buffer containing marshaled hash data
128 // This function returns a pointer to the hash info for the algorithm. If the algorithm is not supported, function
148 // Hash Functions
152 // Function that is called to initialize the hash service. In this implementation, this function does nothing but
177 // implemented hash and and index of 2 will return the last. All other index values will return
185 // TPM_ALG_xxx() a hash algorith
[all...] |
| /external/boringssl/src/include/openssl/ |
| lhash.h | 68 /* lhash is a traditional, chaining hash table that automatically expands and
72 * A hash table of a specific type of object has type |LHASH_OF(type)|. This
82 * Although note that the hash table will contain /pointers/ to |foo|.
107 /* lhash_item_st is an element of a hash chain. It points to the opaque data
113 /* hash contains the cached, hash value of |data|. */
114 uint32_t hash; member in struct:lhash_item_st
128 /* num_items contains the total number of items in the hash table. */
131 * a chain of LHASH_ITEM objects that have the same hash value, mod
143 lhash_hash_func hash; member in struct:lhash_st
[all...] |
| /external/boringssl/src/ssl/test/runner/ |
| prf.go | 15 "hash"
26 func pHash(result, secret, seed []byte, hash func() hash.Hash) {
27 h := hmac.New(hash, secret)
70 func prf12(hashFunc func() hash.Hash) func(result, secret, label, seed []byte) {
156 // https://tools.ietf.org/html/draft-ietf-tls-session-hash-01
188 // lookupTLSHash looks up the corresponding crypto.Hash for a given
189 // TLS hash identifier
[all...] |
| /bootable/recovery/minzip/ |
| Android.mk | 5 Hash.c \
|
| /development/ndk/platforms/android-3/arch-arm/lib-bootstrap/ |
| libdl.so | |
| /development/ndk/platforms/android-9/arch-x86/lib-bootstrap/ |
| libdl.so | |
| /external/curl/tests/certs/ |
| EdelCurlRoot-ca.prm | 17 subjectKeyIdentifier = hash
|
| /external/e2fsprogs/tests/f_h_badroot/ |
| expect.1 | 7 HTREE directory inode 26689 has an unsupported hash version (240)
20 Problem in HTREE directory inode 80065: block #0 has an unordered hash table
29 Problem in HTREE directory inode 73393: block #1 has bad min hash
30 Problem in HTREE directory inode 73393: block #2 has bad max hash
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| CaseInsensitiveString.java | 22 private int hash = 0; field in class:CaseInsensitiveString
79 if (hash == 0) {
80 hash = folded.hashCode();
83 return hash;
|
