| /external/srec/srec/crec/ |
| astar_pphash.c | 32 /* initialize the hash with no elements defined */
34 void hash_init(FixedSizeHash* hash, srec* rec_debug)
37 hash->hashsize = FSH_HASHSIZE;
38 for (i = 0; i < hash->hashsize; i++)
39 hash->items[i] = FSH_NULL;
40 hash->rec = rec_debug;
94 int hash_get(FixedSizeHash* hash, partial_path* parp, void** hval)
99 hkey_index = hkey_index % hash->hashsize;
100 p_return = hash->items[hkey_index];
105 if (compare_parp(p_return, parp, hash->rec) == 0
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| hashtab.h | 1 /* An expandable hash tables datatype.
20 /* This package implements basic hash table functionality. It is possible
26 grows too high the hash table will be expanded.
29 from Knuth's book "The art of computer programming". Hash table is
30 expanded by creation of new hash table and transferring elements from
46 /* The type for a hash code. */
51 /* Calculate hash of a table entry. */
57 cannot be used; instead the variants that accept a hash value
62 the hash table. */
72 Iff it returns NULL, the hash table implementation will pass an erro
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| hashtab.h | 1 /* An expandable hash tables datatype.
20 /* This package implements basic hash table functionality. It is possible
26 grows too high the hash table will be expanded.
29 from Knuth's book "The art of computer programming". Hash table is
30 expanded by creation of new hash table and transferring elements from
46 /* The type for a hash code. */
51 /* Calculate hash of a table entry. */
57 cannot be used; instead the variants that accept a hash value
62 the hash table. */
72 Iff it returns NULL, the hash table implementation will pass an erro
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| hashtab.h | 1 /* An expandable hash tables datatype.
20 /* This package implements basic hash table functionality. It is possible
26 grows too high the hash table will be expanded.
29 from Knuth's book "The art of computer programming". Hash table is
30 expanded by creation of new hash table and transferring elements from
46 /* The type for a hash code. */
51 /* Calculate hash of a table entry. */
57 cannot be used; instead the variants that accept a hash value
62 the hash table. */
72 Iff it returns NULL, the hash table implementation will pass an erro
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| hashtab.h | 1 /* An expandable hash tables datatype.
20 /* This package implements basic hash table functionality. It is possible
26 grows too high the hash table will be expanded.
29 from Knuth's book "The art of computer programming". Hash table is
30 expanded by creation of new hash table and transferring elements from
46 /* The type for a hash code. */
51 /* Calculate hash of a table entry. */
57 cannot be used; instead the variants that accept a hash value
62 the hash table. */
72 Iff it returns NULL, the hash table implementation will pass an erro
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| ExtendedType.java | 32 private int hash; field in class:ExtendedType
36 * The hash code is calculated from the node type, namespace and local name.
47 this.hash = nodetype + namespace.hashCode() + localName.hashCode();
52 * and a given hash code.
57 * @param hash The given hash code
59 public ExtendedType (int nodetype, String namespace, String localName, int hash)
64 this.hash = hash;
77 this.hash = nodetype + namespace.hashCode() + localName.hashCode()
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
| swap_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_map<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.map/unord.map.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_map<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.multiset/ |
| swap_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
29 typedef test_hash<std::hash<int> > Hash;
32 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C;
34 C c1(0, Hash(1), Compare(1), Alloc(1));
35 C c2(0, Hash(2), Compare(2), Alloc(2));
41 assert(c1.hash_function() == Hash(2));
50 assert(c2.hash_function() == Hash(1));
58 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/ |
| swap_non_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
29 typedef test_hash<std::hash<int> > Hash;
32 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C;
34 C c1(0, Hash(1), Compare(1), Alloc(1));
35 C c2(0, Hash(2), Compare(2), Alloc(2));
41 assert(c1.hash_function() == Hash(2));
50 assert(c2.hash_function() == Hash(1));
58 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| swap_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
29 typedef test_hash<std::hash<int> > Hash;
32 typedef std::unordered_set<int, Hash, Compare, Alloc> C;
34 C c1(0, Hash(1), Compare(1), Alloc(1));
35 C c2(0, Hash(2), Compare(2), Alloc(2));
41 assert(c1.hash_function() == Hash(2));
50 assert(c2.hash_function() == Hash(1));
58 typedef test_hash<std::hash<int> > Hash
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
| swap_non_member.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
29 typedef test_hash<std::hash<int> > Hash;
32 typedef std::unordered_set<int, Hash, Compare, Alloc> C;
34 C c1(0, Hash(1), Compare(1), Alloc(1));
35 C c2(0, Hash(2), Compare(2), Alloc(2));
41 assert(c1.hash_function() == Hash(2));
50 assert(c2.hash_function() == Hash(1));
58 typedef test_hash<std::hash<int> > Hash
[all...] |
| /art/compiler/utils/ |
| dedupe_set_test.cc | 29 size_t hash = 0; local
31 hash += c;
32 hash += hash << 10;
33 hash += hash >> 6;
35 return hash;
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| heap-profile-stats.h | 10 // trace and counts of (de)allocation. Buckets are stored in a hash table
13 // A hash value is computed from a stack trace. Collision in the hash table
17 // A structure of a hash table HeapProfileBucket** bucket_table would be like:
46 uintptr_t hash; // Hash value of the stack trace. member in struct:HeapProfileBucket
49 HeapProfileBucket* next; // Next entry in hash-table.
|
| /frameworks/base/libs/hwui/utils/ |
| TinyHashMap.h | 26 * A very simple hash map that doesn't allow duplicate keys, overwriting the older entry.
36 * Puts an entry in the hash, removing any existing entry with the same key
39 hash_t hash = hash_t(key); local
41 ssize_t index = mTable.find(-1, hash, key);
47 mTable.add(hash, initEntry);
54 hash_t hash = hash_t(key); local
55 ssize_t index = mTable.find(-1, hash, key);
|
| /libcore/crypto/src/main/java/org/conscrypt/ |
| CertificateVerify.java | 37 * @param hash
39 public CertificateVerify(byte[] hash) {
40 if (hash == null || hash.length == 0) {
42 "INTERNAL ERROR: incorrect certificate verify hash");
44 this.signedHash = hash;
45 length = hash.length + 2;
|
| /libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/ |
| SHA1Constants.java | 28 * - a set of constant values, H0-H4, defined in "SECURE HASH STANDARD", FIPS PUB 180-2 ;<BR>
36 * constant defined in "SECURE HASH STANDARD"
42 * constant defined in "SECURE HASH STANDARD"
48 * constant defined in "SECURE HASH STANDARD"
54 * constant defined in "SECURE HASH STANDARD"
60 * constant defined in "SECURE HASH STANDARD"
72 * offset in buffer to store current hash value
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkChecksum.h | 41 * Calculate 32-bit Murmur hash (murmur3).
42 * This should take 2-3x longer than SkChecksum::Compute, but is a considerably better hash.
47 * @param seed Initial hash seed. (optional)
48 * @return hash result
54 uint32_t hash = seed; local
61 hash ^= k;
62 hash = (hash << 13) | (hash >> 19);
63 hash *= 5
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/genperf/ |
| perfect.h | 3 perfect.h: code to generate code for a hash for perfect hashing.
22 #define RETRY_PERFECT 1 /* number of times to try to make a perfect hash */
25 /* the generated code for the final hash, assumes initial hash is done */
31 * and assign it the value of the perfect hash using the function inputs.
42 ub4 len; /* number of lines available for final hash */
43 ub4 used; /* number of lines used by final hash */
52 /* user directives: perfect hash? minimal perfect hash? input is an int? */
57 INLINE_HM, /* user will do initial hash, we must choose salt for them *
[all...] |
| /external/skia/include/core/ |
| SkChecksum.h | 41 * Calculate 32-bit Murmur hash (murmur3).
42 * This should take 2-3x longer than SkChecksum::Compute, but is a considerably better hash.
47 * @param seed Initial hash seed. (optional)
48 * @return hash result
54 uint32_t hash = seed; local
61 hash ^= k;
62 hash = (hash << 13) | (hash >> 19);
63 hash *= 5
[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));
133 __u16 hash; local
135 if (RTA_PAYLOAD(tb[TCA_TCINDEX_HASH]) < sizeof(hash))
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/backward/ |
| hash_fun.h | 1 // 'struct hash' from SGI -*- C++ -*-
66 struct hash { }; struct
78 struct hash<char*> struct
86 struct hash<const char*> struct
94 struct hash<char> struct
102 struct hash<unsigned char> struct
110 struct hash<signed char> struct
118 struct hash<short> struct
126 struct hash<unsigned short> struct
134 struct hash<int struct
142 struct hash<unsigned int> struct
150 struct hash<long> struct
158 struct hash<unsigned long> struct
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/backward/ |
| hash_fun.h | 1 // 'struct hash' from SGI -*- C++ -*-
69 struct hash { }; struct
81 struct hash<char*> struct
89 struct hash<const char*> struct
97 struct hash<char> struct
105 struct hash<unsigned char> struct
113 struct hash<signed char> struct
121 struct hash<short> struct
129 struct hash<unsigned short> struct
137 struct hash<int struct
145 struct hash<unsigned int> struct
153 struct hash<long> struct
161 struct hash<unsigned long> struct
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/backward/ |
| hash_fun.h | 1 // 'struct hash' from SGI -*- C++ -*-
69 struct hash { }; struct
81 struct hash<char*> struct
89 struct hash<const char*> struct
97 struct hash<char> struct
105 struct hash<unsigned char> struct
113 struct hash<signed char> struct
121 struct hash<short> struct
129 struct hash<unsigned short> struct
137 struct hash<int struct
145 struct hash<unsigned int> struct
153 struct hash<long> struct
161 struct hash<unsigned long> struct
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/backward/ |
| hash_fun.h | 1 // 'struct hash' from SGI -*- C++ -*-
66 struct hash { }; struct
78 struct hash<char*> struct
86 struct hash<const char*> struct
94 struct hash<char> struct
102 struct hash<unsigned char> struct
110 struct hash<signed char> struct
118 struct hash<short> struct
126 struct hash<unsigned short> struct
134 struct hash<int struct
142 struct hash<unsigned int> struct
150 struct hash<long> struct
158 struct hash<unsigned long> struct
[all...] |
