| /external/chromium_org/third_party/icu/source/test/perf/unisetperf/draft/ |
| bitset.cpp | 17 * Uses a simple hash table for compaction.
25 * Hash table for up to 1k 64-bit words, for 1 bit per BMP code point.
47 int32_t hash=(int32_t)(key>>55)&0x1ff; local
48 hash^=(int32_t)(key>>44)&0x7ff;
49 hash^=(int32_t)(key>>33)&0x7ff;
50 hash^=(int32_t)(key>>22)&0x7ff;
51 hash^=(int32_t)(key>>11)&0x7ff;
52 hash^=(int32_t)key&0x7ff;
54 if(values[hash]==0xffff) {
56 keys[hash]=key
[all...] |
| /external/icu/icu4c/source/test/perf/unisetperf/draft/ |
| bitset.cpp | 17 * Uses a simple hash table for compaction.
25 * Hash table for up to 1k 64-bit words, for 1 bit per BMP code point.
47 int32_t hash=(int32_t)(key>>55)&0x1ff; local
48 hash^=(int32_t)(key>>44)&0x7ff;
49 hash^=(int32_t)(key>>33)&0x7ff;
50 hash^=(int32_t)(key>>22)&0x7ff;
51 hash^=(int32_t)(key>>11)&0x7ff;
52 hash^=(int32_t)key&0x7ff;
54 if(values[hash]==0xffff) {
56 keys[hash]=key
[all...] |
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| sparse_weight_vector.h | 35 template<class Key = std::string, class Hash = std::hash_map<Key, double> >
38 typedef Hash Wmap;
45 explicit SparseWeightVector(const SparseWeightVector<Key, Hash> &other) {
48 void operator=(const SparseWeightVector<Key, Hash> &other) {
51 void CopyFrom(const SparseWeightVector<Key, Hash> &other) {
115 void LoadWeightVector(const SparseWeightVector<Key, Hash> &vec) {
132 const SparseWeightVector<Key, Hash> &w1,
135 const SparseWeightVector<Key, Hash> &w1,
138 const SparseWeightVector<Key, Hash> &w1,
140 void MultWeightUpdate(const SparseWeightVector<Key, Hash> &w1)
[all...] |
| /external/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...] |
| /external/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...] |
| /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/chromium_org/third_party/mesa/src/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/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/guava/guava/src/com/google/common/hash/ |
| Hashing.java | 15 package com.google.common.hash;
40 * Returns a general-purpose, <b>non-cryptographic-strength</b>, streaming hash function that
41 * produces hash codes of length at least {@code minimumBits}. Users without specific
42 * compatibility requirements and who do not persist the hash codes are encouraged to
43 * choose this hash function.
68 * Returns a hash function implementing the
77 * Returns a hash function implementing the
88 * Returns a hash function implementing the
98 * Returns a hash function implementing the
110 * Returns a hash function implementing the MD5 hash algorithm by delegating to the MD
[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/chromium_org/third_party/smhasher/src/ |
| main.cpp | 37 pfHash hash; member in struct:HashInfo
55 { FNV, 32, 0xE3CBBE91, "FNV", "Fowler-Noll-Vo hash, 32-bit" },
106 pass &= VerificationTest(info->hash,info->hashbits,info->verification,false);
118 pass &= VerificationTest(info->hash,info->hashbits,info->verification,true);
128 void test ( hashfunc<hashtype> hash, HashInfo * info )
142 VerificationTest(hash,hashbits,info->verification,true);
143 SanityTest(hash,hashbits);
144 AppendedZeroesTest(hash,hashbits);
155 BulkSpeedTest(info->hash,info->verification);
162 TinySpeedTest(hashfunc<hashtype>(info->hash),sizeof(hashtype),i,info->verification,true,cycles)
[all...] |
| /external/chromium_org/third_party/boringssl/src/include/openssl/ |
| lhash.h | 67 /* lhash is a traditional, chaining hash table that automatically expands and
71 * A hash table of a specific type of object has type |LHASH_OF(type)|. This
81 * Although note that the hash table will contain /pointers/ to |foo|.
109 /* lhash_item_st is an element of a hash chain. It points to the opaque data
115 /* hash contains the cached, hash value of |data|. */
116 uint32_t hash; member in struct:lhash_item_st
130 /* num_items contains the total number of items in the hash table. */
133 * a chain of LHASH_ITEM objects that have the same hash value, mod
145 lhash_hash_func hash; member in struct:lhash_st
[all...] |
| /external/chromium_org/third_party/skia/experimental/webtry/ |
| webtry.go | 255 hash CHAR(64) DEFAULT '' NOT NULL,
258 PRIMARY KEY(hash)
274 hash CHAR(64) DEFAULT '' NOT NULL,
342 Hash string
363 // expandCode expands the template into a file and calculates the MD5 hash.
368 hash := fmt.Sprintf("%x", h.Sum(nil))
372 err := expandToFile(fmt.Sprintf("../../../cache/src/%s.cpp", hash), code, codeTemplate)
373 return hash, err
377 func expandGyp(hash string) error {
378 return writeTemplate(fmt.Sprintf("../../../cache/%s.gyp", hash), gypTemplate, struct{ Hash string }{hash}
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/genperf/ |
| perfect.c | 4 perfect.c: code to generate code for a hash for perfect hashing.
10 This generates a minimal perfect hash function. That means, given a
11 set of n keys, this determines a hash function that maps each of
14 The perfect hash function first uses a normal hash function on the key
16 keys, then it computes a^scramble[tab[b]] to get the final perfect hash.
22 perfect hash functions for large databases", Fox, Heath, Chen, and Daoud,
27 0..*blen*-1. A fast hash function determines both a and b
28 simultaneously. Any decent hash function is likely to produce
29 hashes so that (a,b) is distinct for all pairs. I try the hash
233 ub4 hash = phash_lookup(mykey->name_k, mykey->len_k, initlev); local
276 ub4 hash = initval; local
384 ub4 hash; local
491 ub4 hash = mykey->a_k^scramble[i]; local
[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/chromium_org/chrome_elf/dll_hash/ |
| dll_hash.h | 10 // Convert a dll name to a hash that can be sent via UMA.
|
| /external/chromium_org/components/rappor/ |
| bloom_filter.h | 20 // and |hash_function_count| hash functions to set bits in the filter. The
21 // hash functions will be generated by using seeds in the range
44 // A number add to a hash function index to get a seed for that hash function.
|
| /external/chromium_org/crypto/ |
| sha2.h | 19 static const size_t kSHA256Length = 32; // Length in bytes of a SHA-256 hash.
21 // Computes the SHA-256 hash of the input string 'str' and stores the first
22 // 'len' bytes of the hash in the output buffer 'output'. If 'len' > 32,
23 // only 32 bytes (the full hash) are stored in the 'output' buffer.
|
| /external/chromium_org/ppapi/tools/ |
| pepper_hash_for_uma.cc | 16 #include "base/hash.h"
29 uint32 data = base::Hash(argv[i], strlen(argv[i]));
33 int hash = static_cast<int>(data & 0x7fffffff); local
34 printf("<int value=\"%d\" label=\"%s\"/>\n", hash, argv[i]);
|
| /external/chromium_org/third_party/icu/source/common/ |
| uhash_us.cpp | 13 #include "hash.h"
|
| /external/chromium_org/third_party/skia/experimental/webtry/templates/ |
| content.html | 26 <a href='{{if .Hash}}/c/{{.Hash}}{{end}}' target=_blank id=permalink>Share</a>
33 <img touch-action='none' class='zoom' id='img' src='{{if .Hash}}/i/{{.Hash}}.png{{end}}'/>
|
