| /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...] |
| /external/jemalloc/include/jemalloc/internal/ |
| ckh.h | 17 * There are 2^LG_CKH_BUCKET_CELLS cells in each hash table bucket. Try to fit
26 /* Hash table cell. */
49 * Minimum and current number of hash table buckets. There are
55 /* Hash and comparison functions. */
56 ckh_hash_t *hash; member in struct:ckh_s
59 /* Hash table with 2^lg_curbuckets buckets. */
67 bool ckh_new(tsd_t *tsd, ckh_t *ckh, size_t minitems, ckh_hash_t *hash,
|
| /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/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...] |
| /prebuilts/go/darwin-x86/pkg/darwin_amd64/ |
| hash.a | 7 package hash
10 type @"".Hash interface { BlockSize() (? int); Reset(); Size() (? int); Sum(@"".b []byte) (? []byte); Write(@"io".p []byte) (@"io".n int, @"io".err error) }
27 (( Tgclocals·33cdeccccebe80329f1fdbee7f5874cb Tgclocals·33cdeccccebe80329f1fdbee7f5874cb Pprebuilts/go/darwin-x86/src/hash/hash.go?""".Hash.BlockSize ? ?eH? % H;av=H??H?Y H??t
H?|$H9;uH?#H?\$ H? $H?\$H?[ ??H?\$H?\$(H???? ?
32 0runtime.morestack_noctxt 0 "".~r0 type.int ""..this type."".Hash 8 ` `
33 ;% Tgclocals·3bb21ca8fe1d99a3e492463bd711418a Tgclocals·33cdeccccebe80329f1fdbee7f5874cb <autogenerated>?"".Hash.Reset ? ?eH? % H;av3H??H?Y H??t
H?|$H9;uH?#H?\$H? $H?\$H?[(??H???? ?
37 0runtime.morestack_noctxt ""..this type."".Hash . P P
38 ; Tgclocals·2a1dd1e1e59d0a384c26951e316cd7e6 Tgclocals·33cdeccccebe80329f1fdbee7f5874cb <autogenerated>?"".Hash.Size ? ?eH? % H;av=H??H?Y H??t
H?|$H9;uH?#H?\$ H? $H?\$H?[0??H?\$H?\$(H???? ?
43 0runtime.morestack_noctxt 0 "".~r0 type.int ""..this type."".Hash 8 ` `
[all...] |
| /prebuilts/go/darwin-x86/pkg/darwin_amd64_race/ |
| hash.a | 7 package hash
10 type @"".Hash interface { BlockSize() (? int); Reset(); Size() (? int); Sum(@"".b []byte) (? []byte); Write(@"io".p []byte) (@"io".n int, @"io".err error) }
35 0runtime.morestack_noctxt OC ? X? ? Tgclocals·33cdeccccebe80329f1fdbee7f5874cb Tgclocals·33cdeccccebe80329f1fdbee7f5874cb Pprebuilts/go/darwin-x86/src/hash/hash.go?""".Hash.BlockSize ? ?eH? % H;avPH??H?Y H??t
H?|$H9;uH?#H?\$H? $? H?\$ H? $H?\$H?[ ??H?\$H?\$(? H???? ?
43 0runtime.morestack_noctxt 0 "".~r0 type.int ""..this type."".Hash K p p
44 2> Tgclocals·3bb21ca8fe1d99a3e492463bd711418a Tgclocals·33cdeccccebe80329f1fdbee7f5874cb <autogenerated>?"".Hash.Reset ? ?eH? % H;avFH??H?Y H??t
H?|$H9;uH?#H?\$H? $? H?\$H? $H?\$H?[(??? H???? ?
51 0runtime.morestack_noctxt ""..this type."".Hash A ` `
53 2. Tgclocals·2a1dd1e1e59d0a384c26951e316cd7e6 Tgclocals·33cdeccccebe80329f1fdbee7f5874cb <autogenerated>?"".Hash.Size ? ?eH? % H;avPH??H?Y H??t
H?|$H9;uH?#H?\$H? $? H?\$ H? $H?\$H?[0??H?\$H?\$(? H???? ?
61 0runtime.morestack_noctxt 0 "".~r0 type.int ""..this type."".Hash K p p
[all...] |
| /prebuilts/go/linux-x86/pkg/linux_amd64/ |
| hash.a | 7 package hash
10 type @"".Hash interface { BlockSize() (? int); Reset(); Size() (? int); Sum(@"".b []byte) (? []byte); Write(@"io".p []byte) (@"io".n int, @"io".err error) }
27 (( Tgclocals·33cdeccccebe80329f1fdbee7f5874cb Tgclocals·33cdeccccebe80329f1fdbee7f5874cb Nprebuilts/go/linux-x86/src/hash/hash.go?""".Hash.BlockSize ? ?dH? % H;av=H??H?Y H??t
H?|$H9;uH?#H?\$ H? $H?\$H?[ ??H?\$H?\$(H???? ?
32 0runtime.morestack_noctxt 0 "".~r0 type.int ""..this type."".Hash 8 ` `
33 ;% Tgclocals·3bb21ca8fe1d99a3e492463bd711418a Tgclocals·33cdeccccebe80329f1fdbee7f5874cb <autogenerated>?"".Hash.Reset ? ?dH? % H;av3H??H?Y H??t
H?|$H9;uH?#H?\$H? $H?\$H?[(??H???? ?
37 0runtime.morestack_noctxt ""..this type."".Hash . P P
38 ; Tgclocals·2a1dd1e1e59d0a384c26951e316cd7e6 Tgclocals·33cdeccccebe80329f1fdbee7f5874cb <autogenerated>?"".Hash.Size ? ?dH? % H;av=H??H?Y H??t
H?|$H9;uH?#H?\$ H? $H?\$H?[0??H?\$H?\$(H???? ?
43 0runtime.morestack_noctxt 0 "".~r0 type.int ""..this type."".Hash 8 ` `
[all...] |
| /prebuilts/go/linux-x86/pkg/linux_amd64_race/ |
| hash.a | 7 package hash
10 type @"".Hash interface { BlockSize() (? int); Reset(); Size() (? int); Sum(@"".b []byte) (? []byte); Write(@"io".p []byte) (@"io".n int, @"io".err error) }
35 0runtime.morestack_noctxt OC ? X? ? Tgclocals·33cdeccccebe80329f1fdbee7f5874cb Tgclocals·33cdeccccebe80329f1fdbee7f5874cb Nprebuilts/go/linux-x86/src/hash/hash.go?""".Hash.BlockSize ? ?dH? % H;avPH??H?Y H??t
H?|$H9;uH?#H?\$H? $? H?\$ H? $H?\$H?[ ??H?\$H?\$(? H???? ?
43 0runtime.morestack_noctxt 0 "".~r0 type.int ""..this type."".Hash K p p
44 2> Tgclocals·3bb21ca8fe1d99a3e492463bd711418a Tgclocals·33cdeccccebe80329f1fdbee7f5874cb <autogenerated>?"".Hash.Reset ? ?dH? % H;avFH??H?Y H??t
H?|$H9;uH?#H?\$H? $? H?\$H? $H?\$H?[(??? H???? ?
51 0runtime.morestack_noctxt ""..this type."".Hash A ` `
53 2. Tgclocals·2a1dd1e1e59d0a384c26951e316cd7e6 Tgclocals·33cdeccccebe80329f1fdbee7f5874cb <autogenerated>?"".Hash.Size ? ?dH? % H;avPH??H?Y H??t
H?|$H9;uH?#H?\$H? $? H?\$ H? $H?\$H?[0??H?\$H?\$(? H???? ?
61 0runtime.morestack_noctxt 0 "".~r0 type.int ""..this type."".Hash K p p
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| CollectionBenchmarkSampleData.java | 113 final int hash; field in class:CollectionBenchmarkSampleData.Element
114 Element(int hash) {
115 this.hash = hash;
119 || (obj instanceof Element && ((Element) obj).hash == hash);
122 return hash;
126 return Ints.compare(hash, that.hash);
129 return String.valueOf(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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/backward/ |
| hash_fun.h | 1 // 'struct hash' from SGI -*- C++ -*-
68 struct hash { }; struct
80 struct hash<char*> struct
88 struct hash<const char*> struct
96 struct hash<char> struct
104 struct hash<unsigned char> struct
112 struct hash<signed char> struct
120 struct hash<short> struct
128 struct hash<unsigned short> struct
136 struct hash<int struct
144 struct hash<unsigned int> struct
152 struct hash<long> struct
160 struct hash<unsigned long> struct
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/backward/ |
| hash_fun.h | 1 // 'struct hash' from SGI -*- C++ -*-
68 struct hash { }; struct
80 struct hash<char*> struct
88 struct hash<const char*> struct
96 struct hash<char> struct
104 struct hash<unsigned char> struct
112 struct hash<signed char> struct
120 struct hash<short> struct
128 struct hash<unsigned short> struct
136 struct hash<int struct
144 struct hash<unsigned int> struct
152 struct hash<long> struct
160 struct hash<unsigned long> struct
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/backward/ |
| hash_fun.h | 1 // 'struct hash' from SGI -*- C++ -*-
68 struct hash { }; struct
80 struct hash<char*> struct
88 struct hash<const char*> struct
96 struct hash<char> struct
104 struct hash<unsigned char> struct
112 struct hash<signed char> struct
120 struct hash<short> struct
128 struct hash<unsigned short> struct
136 struct hash<int struct
144 struct hash<unsigned int> struct
152 struct hash<long> struct
160 struct hash<unsigned long> struct
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/backward/ |
| hash_fun.h | 1 // 'struct hash' from SGI -*- C++ -*-
68 struct hash { }; struct
80 struct hash<char*> struct
88 struct hash<const char*> struct
96 struct hash<char> struct
104 struct hash<unsigned char> struct
112 struct hash<signed char> struct
120 struct hash<short> struct
128 struct hash<unsigned short> struct
136 struct hash<int struct
144 struct hash<unsigned int> struct
152 struct hash<long> struct
160 struct hash<unsigned long> struct
[all...] |
| /system/update_engine/common/ |
| hash_calculator.h | 30 // Omaha uses base64 encoded SHA-256 as the hash. This class provides a simple
31 // wrapper around OpenSSL providing such a formatted hash of data passed in.
34 // or more calls to hash().
47 // Updates the hash with up to |length| bytes of data from |file|. If |length|
49 // of bytes that the hash was updated with, or -1 on error.
54 // hash.
58 // Gets the hash. Finalize() must have been called.
59 const std::string& hash() const { function in class:chromeos_update_engine::HashCalculator
69 // Gets the current hash context. Note that the string will contain binary
73 // Sets the current hash context. |context| must the string returned by
[all...] |
| /external/icu/icu4c/source/common/ |
| uhash.h | 32 * functions. These functions hash keys, compare keys, delete keys,
57 * UHashElement pointer. A hash element contains a key, value, and
92 * This is a single hash element.
105 * @return A NON-NEGATIVE hash code for parm.
143 UHashFunction *keyHasher; /* Computes hash from key.
203 * @param size The initial capacity of this hash table.
226 uhash_init(UHashtable *hash,
234 * @param hash The UHashtable to close. If hash is NULL no operation is performed.
237 uhash_close(UHashtable *hash);
[all...] |
| /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/clang/test/CodeGen/ |
| ubsan-blacklist.c | 2 // RUN: echo "fun:hash" > %t-func.blacklist
13 // DEFAULT: @hash
14 // FUNC: @hash
15 // FILE: @hash
16 unsigned hash() { function
|
| /external/e2fsprogs/lib/e2p/ |
| hashstr.c | 20 struct hash { struct
25 static struct hash hash_list[] = {
34 struct hash *p;
46 * Returns the hash algorithm, or -1 on error
50 struct hash *p;
|
| /external/libvpx/libvpx/third_party/libyuv/source/ |
| compare_common.cc | 28 // hash seed of 5381 recommended.
31 uint32 hash = seed; local
34 hash += (hash << 5) + src[i];
36 return hash;
|
