| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| max_bucket_count.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
32 typedef std::unordered_set<int, std::hash<int>,
|
| max_size.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 std::unordered_set<int, std::hash<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| assign_move.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
49 test_hash<std::hash<int> >(8),
55 test_hash<std::hash<int> >(2),
66 assert(c.hash_function() == test_hash<std::hash<int> >(8));
78 test_hash<std::hash<int> >,
94 test_hash<std::hash<int> >(8),
100 test_hash<std::hash<int> >(2),
111 assert(c.hash_function() == test_hash<std::hash<int> >(8))
[all...] |
| size.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<NotConstructible> >,
37 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
49 test_hash<std::hash<NotConstructible> >,
55 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.threads/thread.thread.class/thread.thread.id/ |
| thread_id.pass.cpp | 13 // struct hash
28 typedef std::hash<std::thread::id> H;
|
| /system/core/include/mincrypt/ |
| rsa.h | 51 const uint8_t* hash,
|
| /system/core/metricsd/uploader/mock/ |
| sender_mock.cc | 23 bool SenderMock::Send(const std::string& content, const std::string& hash) {
|
| /system/core/metricsd/uploader/ |
| sender_http.h | 31 // Sends |content| whose SHA1 hash is |hash| to server_url with a synchronous
33 bool Send(const std::string& content, const std::string& hash) override;
|
| /art/runtime/ |
| type_lookup_table.h | 28 * Implementation of TypeLookupTable is based on hash table.
42 // Method search class_def_idx by class descriptor and it's hash.
44 ALWAYS_INLINE uint32_t Lookup(const char* str, uint32_t hash) const {
45 uint32_t pos = hash & GetSizeMask();
50 if (CmpHashBits(entry->data, hash) && IsStringsEquals(str, entry->str_offset)) {
86 * But we have no full hash of element of table. But we can use 2 ideas.
87 * 1. All minor bits of hash inside one bucket are equals.
88 * 2. If dex file contains N classes and size of hash table is 2^n (where N <= 2^n)
89 * then 16-n bits are free. So we can encode part of element's hash into these bits.
90 * So hash of element can be divided on three parts
[all...] |
| /external/caliper/caliper/src/main/java/com/google/caliper/model/ |
| Host.java | 26 import com.google.common.hash.Funnel;
27 import com.google.common.hash.HashFunction;
28 import com.google.common.hash.PrimitiveSink;
45 @ExcludeFromJson private int hash; field in class:Host
53 // eagerly initialize hash to allow for the test-only hash function
73 if (hash == 0) {
74 this.hash = hashFunction.hashObject(this, HostFunnel.INSTANCE).asInt();
84 return hash;
116 * This only exists for tests to induce hash collisions. Only use this in test code as changin
[all...] |
| /libcore/ojluni/src/main/java/sun/security/x509/ |
| DistributionPointName.java | 209 * Returns the hash code for this distribution point name.
211 * @return the hash code.
214 int hash = hashCode; local
215 if (hash == 0) {
216 hash = 1;
218 hash += fullName.hashCode();
221 hash += relativeName.hashCode();
223 hashCode = hash;
225 return hash;
|
| /toolchain/binutils/binutils-2.25/bfd/ |
| hash.c | 0 /* hash.c -- hash table routines for BFD
30 Hash Tables
32 @cindex Hash tables
33 BFD provides a simple set of hash table functions. Routines
34 are provided to initialize a hash table, to free a hash table,
35 to look up a string in a hash table and optionally create an
36 entry for it, and to traverse a hash table. There is
37 currently no routine to delete an string from a hash table
434 unsigned long hash; local
462 unsigned long hash; local
[all...] |
| /external/apache-http/src/org/apache/http/auth/ |
| AuthScope.java | 290 int hash = LangUtils.HASH_SEED; local
291 hash = LangUtils.hashCode(hash, this.host);
292 hash = LangUtils.hashCode(hash, this.port);
293 hash = LangUtils.hashCode(hash, this.realm);
294 hash = LangUtils.hashCode(hash, this.scheme);
295 return hash;
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| ext_attr.c | 32 * Compute the hash of an extended attribute.
36 __u32 hash = 0; local
41 hash = (hash << NAME_HASH_SHIFT) ^
42 (hash >> (8*sizeof(hash) - NAME_HASH_SHIFT)) ^
46 /* The hash needs to be calculated on the data in little-endian. */
51 hash = (hash << VALUE_HASH_SHIFT) ^
52 (hash >> (8*sizeof(hash) - VALUE_HASH_SHIFT))
[all...] |
| /external/fio/ |
| hash.h | 35 unsigned long hash = val; local
39 unsigned long n = hash;
41 hash -= n;
43 hash -= n;
45 hash += n;
47 hash -= n;
49 hash += n;
51 hash += n;
54 hash *= GOLDEN_RATIO_PRIME;
57 return hash;
[all...] |
| /external/iproute2/tc/ |
| f_tcindex.c | 20 fprintf(stderr," Usage: ... tcindex [ hash SIZE ] [ mask MASK ]"
45 if (!strcmp(*argv,"hash")) {
46 int hash; local
49 hash = strtoul(*argv,&end,0);
50 if (*end || !hash || hash > 0x10000) {
54 addattr_l(n,4096,TCA_TCINDEX_HASH,&hash,sizeof(hash));
141 __u16 hash; local
143 if (RTA_PAYLOAD(tb[TCA_TCINDEX_HASH]) < sizeof(hash))
[all...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/scene/ |
| ViewNode.java | 160 int hash = 5; local
161 hash = 67 * hash + (this.name != null ? this.name.hashCode() : 0);
162 return hash;
192 int hash = 5; local
193 hash = 61 * hash + (this.name != null ? this.name.hashCode() : 0);
194 hash = 61 * hash + (this.value != null ? this.value.hashCode() : 0);
195 return hash;
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MapMakerInternalMapTest.java | 368 int hash = map.hash(one); local
369 ReferenceEntry<Object, Object> entry = segment.getEntry(one, hash);
415 int hashOne = map.hash(keyOne);
428 int hashTwo = map.hash(keyTwo);
447 int hashOne = map.hash(keyOne);
453 int hashTwo = map.hash(keyTwo);
497 int hash = map.hash(key); local
500 int index = hash & (table.length() - 1)
572 int hash = map.hash(key); local
616 int hash = map.hash(key); local
655 int hash = map.hash(key); local
687 int hash = map.hash(key); local
722 int hash = map.hash(key); local
755 int hash = map.hash(key); local
794 int hash = map.hash(key); local
847 int hash = map.hash(key); local
980 int hash = map.hash(key); local
1038 int hash = map.hash(key); local
1070 int hash = map.hash(key); local
1104 int hash = map.hash(key); local
1151 int hash = map.hash(key); local
1266 int hash = map.hash(key); local
1307 int hash = map.hash(key); local
1349 int hash = map.hash(key); local
1450 int hash = map.hash(key); local
1700 private final int hash; field in class:MapMakerInternalMapTest.DummyEntry
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| assign_move.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
49 test_hash<std::hash<int> >(8),
55 test_hash<std::hash<int> >(2),
74 assert(c.hash_function() == test_hash<std::hash<int> >(8));
86 test_hash<std::hash<int> >,
102 test_hash<std::hash<int> >(8),
108 test_hash<std::hash<int> >(2),
119 assert(c.hash_function() == test_hash<std::hash<int> >(8))
[all...] |
| /external/v8/src/base/ |
| hashmap.h | 5 // The reason we write our own hash map instead of using unordered_map in STL,
36 // initial_capacity is the size of the initial hash map;
44 // HashMap entries are (key, value, hash) triplets.
50 uint32_t hash; // The full hash value for key member in struct:v8::base::TemplateHashMapImpl::Entry
56 Entry* Lookup(void* key, uint32_t hash) const;
60 // corresponding key, key hash, and NULL value.
61 Entry* LookupOrInsert(void* key, uint32_t hash,
67 void* Remove(void* key, uint32_t hash);
69 // Empties the hash map (occupancy() == 0)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| assign_move.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
49 test_hash<std::hash<int> >(8),
55 test_hash<std::hash<int> >(2),
74 assert(c.hash_function() == test_hash<std::hash<int> >(8));
86 test_hash<std::hash<int> >,
102 test_hash<std::hash<int> >(8),
108 test_hash<std::hash<int> >(2),
119 assert(c.hash_function() == test_hash<std::hash<int> >(8))
[all...] |
| /system/bt/btcore/src/ |
| bdaddr.c | 96 hash_index_t hash = 5381; local
99 hash = ((hash << 5) + hash) + bytes[i];
100 return hash;
|
| /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/freetype/src/cache/ |
| ftccache.h | 62 FT_Offset hash; /* used for hashing too */ member in struct:FTC_NodeRec_
76 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
78 ( ( ( ( hash ) & ( cache )->mask ) < ( cache )->p ) \
79 ? ( ( hash ) & ( ( cache )->mask * 2 + 1 ) ) \
80 : ( ( hash ) & ( cache )->mask ) ) )
84 FT_Offset hash );
85 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
86 ftc_get_top_node_for_hash( ( cache ), ( hash ) )
142 /* each cache really implements a dynamic hash table to manage its nodes */
182 FT_Offset hash,
[all...] |
| /external/libchrome/base/containers/ |
| 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,
63 // The pre-standard hash behaves like C++11's std::hash, except around pointers.
64 // const char* is specialized to hash the C string and hash functions for
65 // general T* are missing. Define a BASE_HASH_NAMESPACE::hash which aligns with
69 struct hash { struct in namespace:BASE_HASH_NAMESPACE
71 return BASE_HASH_IMPL_NAMESPACE::hash<T>()(value);
76 struct hash<T*> struct in namespace:BASE_HASH_NAMESPACE
270 struct hash<std::pair<Type1, Type2> > { struct in namespace:BASE_HASH_NAMESPACE
[all...] |
