HomeSort by relevance Sort by last modified time
    Searched refs:hash (Results 76 - 100 of 3742) sorted by null

1 2 34 5 6 7 8 91011>>

  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/hash_fn/
direct_mask_range_hashing_imp.hpp 56 operator()(size_type hash) const
57 { return mask_based_base::range_hash(hash); }
direct_mod_range_hashing_imp.hpp 56 operator()(size_type hash) const
57 { return mod_based_base::range_hash(hash); }
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/hash_fn/
direct_mask_range_hashing_imp.hpp 56 operator()(size_type hash) const
57 { return mask_based_base::range_hash(hash); }
direct_mod_range_hashing_imp.hpp 56 operator()(size_type hash) const
57 { return mod_based_base::range_hash(hash); }
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/hash_fn/
direct_mask_range_hashing_imp.hpp 56 operator()(size_type hash) const
57 { return mask_based_base::range_hash(hash); }
direct_mod_range_hashing_imp.hpp 56 operator()(size_type hash) const
57 { return mod_based_base::range_hash(hash); }
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/hash_fn/
direct_mask_range_hashing_imp.hpp 56 operator()(size_type hash) const
57 { return mask_based_base::range_hash(hash); }
direct_mod_range_hashing_imp.hpp 56 operator()(size_type hash) const
57 { return mod_based_base::range_hash(hash); }
  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-mips-elf/
hash1a.d 2 #ld: -shared --hash-style=sysv
  /external/javassist/src/main/javassist/scopedpool/
SoftValueHashMap.java 52 * Returns a set of the mappings contained in this hash table.
56 return hash.entrySet();
59 /* Hash table mapping WeakKeys to values */
60 private Map hash; field in class:SoftValueHashMap
72 if (ref == (SoftValueRef)hash.get(ref.key)) {
75 hash.remove(ref.key);
97 hash = new HashMap(initialCapacity, loadFactor);
111 hash = new HashMap(initialCapacity);
119 hash = new HashMap();
146 return hash.size()
    [all...]
  /external/wpa_supplicant_8/src/crypto/
sha1-prf.c 35 u8 hash[SHA1_MAC_LEN]; local
57 hash))
59 os_memcpy(&buf[pos], hash, plen);
64 os_memset(hash, 0, sizeof(hash));
  /external/apache-http/src/org/apache/http/conn/scheme/
Scheme.java 214 * Obtains a hash code for this scheme.
216 * @return the hash code
220 int hash = LangUtils.HASH_SEED; local
221 hash = LangUtils.hashCode(hash, this.defaultPort);
222 hash = LangUtils.hashCode(hash, this.name);
223 hash = LangUtils.hashCode(hash, this.layered);
224 hash = LangUtils.hashCode(hash, this.socketFactory)
    [all...]
  /art/compiler/driver/
compiled_method_storage.cc 94 uint32_t hash = 0; local
106 hash ^= k;
107 hash = ((hash << r2) | (hash >> (32 - r2))) * m + n;
126 hash ^= k1;
129 hash ^= len;
130 hash ^= (hash >> 16);
131 hash *= 0x85ebca6b
138 size_t hash = 0x811c9dc5; local
    [all...]
  /external/libdrm/
xf86drmHash.c 1 /* xf86drmHash.c -- Small hash table support for integer -> integer mapping
31 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
40 * 2) The hash computation uses a table of random integers [Hanson97,
48 * dynamic hash tables was postponed until the need arises. A common (and
49 * naive) approach to dynamic hash table implementation simply creates a
50 * new hash table when necessary, rehashes all the data into the new table,
66 * [Larson88] Per-Ake Larson. "Dynamic Hash Tables". CACM 31(4), April
81 unsigned long hash = 0; local
96 hash = (hash << 1) + scatter[tmp & 0xff]
150 unsigned long hash = HashHash(key); local
192 unsigned long hash; local
213 unsigned long hash; local
    [all...]
  /external/protobuf/src/google/protobuf/stubs/
hash.h 59 // Make hash<T> be the same as less<T>. Note that everywhere where custom
60 // hash functions are defined in the protobuf code, they are also defined such
63 struct hash { struct in namespace:google::protobuf
64 // Dummy, just to make derivative hash functions compile.
77 struct hash<const char*> { struct in namespace:google::protobuf
78 // Dummy, just to make derivative hash functions compile.
90 typename HashFcn = hash<Key>,
98 typename HashFcn = hash<Key>,
108 struct hash : public HASH_NAMESPACE::hash_compare<Key> {
121 struct hash<const char*
190 struct hash<string> { struct in namespace:google::protobuf
203 struct hash<pair<First, Second> > { struct in namespace:google::protobuf
    [all...]
  /external/freetype/include/freetype/internal/
fthash.h 96 ft_hash_str_init( FT_Hash hash,
100 ft_hash_num_init( FT_Hash hash,
104 ft_hash_str_free( FT_Hash hash,
112 FT_Hash hash,
118 FT_Hash hash,
123 FT_Hash hash );
127 FT_Hash hash );
  /external/clang/test/CXX/temp/temp.spec/temp.explicit/
p6.cpp 17 template<typename T> struct hash { }; struct
24 hash<T> h;
32 template<> struct hash<S> { struct
  /external/libchrome/base/trace_event/
memory_allocator_dump_guid.cc 16 uint64_t hash[(kSHA1Length + sizeof(uint64_t) - 1) / sizeof(uint64_t)] = {0}; local
18 reinterpret_cast<unsigned char*>(hash));
19 return hash[0];
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/gp_hash_table_map_/
resize_store_hash_fn_imps.hpp 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/gp_hash_table_map_/
resize_store_hash_fn_imps.hpp 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/gp_hash_table_map_/
resize_store_hash_fn_imps.hpp 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/gp_hash_table_map_/
resize_store_hash_fn_imps.hpp 39 * hash value is stored.
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
60 p_new_e->m_hash = hash;
  /system/core/metricsd/uploader/
metrics_hashes.cc 27 // Converts the 8-byte prefix of an MD5 hash into a uint64 value.
28 inline uint64_t HashToUInt64(const std::string& hash) {
30 DCHECK_GE(hash.size(), sizeof(value));
31 memcpy(&value, hash.data(), sizeof(value));
38 // Create an MD5 hash of the given |name|, represented as a byte buffer
  /system/core/libcutils/
hashmap.c 29 int hash; member in struct:Entry
37 int (*hash)(void* key); member in struct:Hashmap
44 int (*hash)(void* key), bool (*equals)(void* keyA, void* keyB)) {
45 assert(hash != NULL);
69 map->hash = hash;
84 int h = map->hash(key);
100 static inline size_t calculateIndex(size_t bucketCount, int hash) {
101 return ((size_t) hash) & (bucketCount - 1);
121 size_t index = calculateIndex(newBucketCount, entry->hash);
197 int hash = hashKey(map, key); local
229 int hash = hashKey(map, key); local
244 int hash = hashKey(map, key); local
260 int hash = hashKey(map, key); local
292 int hash = hashKey(map, key); local
    [all...]
  /external/deqp/framework/delibs/depool/
dePoolHashSet.c 21 * \brief Memory pool hash-set class.
57 /* Test find() on empty hash. */
61 const int* val = deTestHash_find(hash, (deInt16)i);
68 deTestHash_insert(hash, (deInt16)i, -i);
71 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 5000);
74 const int* val = deTestHash_find(hash, (deInt16)i);
80 deTestHash_delete(hash, (deInt16)i);
82 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 4000);
85 const int* val = deTestHash_find(hash, (deInt16)i);
94 deTestHash_insert(hash, (deInt16)i, -i)
    [all...]

Completed in 1125 milliseconds

1 2 34 5 6 7 8 91011>>