| /external/icu4c/i18n/ |
| sortkey.cpp | 41 // A hash code of kInvalidHashCode indicates that the hash code needs
42 // to be computed. A hash code of kEmptyHashCode is used for empty keys
43 // and for any key whose computed hash code is kInvalidHashCode.
46 // The "bogus hash code" replaces a separate fBogus flag.
247 int32_t hash; local
249 hash = kEmptyHashCode;
251 hash = ustr_hashCharsN(s, length);
252 if (hash == kInvalidHashCode || hash == kBogusHashCode)
[all...] |
| /external/llvm/include/llvm/Support/ |
| MD5.h | 52 /// \brief Updates the hash for the byte stream provided.
55 /// \brief Updates the hash for the StringRef provided.
58 /// \brief Finishes off the hash and puts the result in result.
|
| /external/markdown/MarkdownTest/Tests_2004/ |
| Backslash escapes.html | 25 <p>Hash: #</p>
59 Hash: \#
94 <p>Hash: <code>\#</code></p>
|
| Backslash escapes.text-out | 21 <p>Hash: #</p>
50 Hash: \#
73 <p>Hash: <code>\#</code></p>
|
| Backslash escapes.text-res | 21 <p>Hash: #</p>
50 Hash: \#
73 <p>Hash: <code>\#</code></p>
|
| /external/markdown/tests/markdown-test/ |
| backlash-escapes.html | 13 <p>Hash: #</p>
41 Hash: \#
63 <p>Hash: <code>\#</code></p>
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_cache.h | 56 * @param hash hash function
62 util_cache_create(uint32_t (*hash)(const void *key),
|
| /external/oprofile/libdb/ |
| db_stat.c | 22 odb_index_t hash_table_size; /**< hash table entry number */
46 /* FIXME: I'm dubious if this do right statistics for hash table
79 printf("hash table size: %d\n", stat->hash_table_size);
|
| /external/robolectric/src/test/java/com/xtremelabs/robolectric/shadows/ |
| DialogPreferenceTest.java | 33 HashMap<String, String> hash = new HashMap<String, String>(); local
34 hash.put("dialogMessage", TEST_DIALOG_MESSAGE);
36 attrs = new TestAttributeSet(hash);
|
| /external/v8/src/ |
| preparse-data.h | 170 int hash = vector_hash(literal); local
171 LogSymbol(start, hash, true, Vector<const byte>::cast(literal));
176 int hash = vector_hash(literal); local
177 LogSymbol(start, hash, false, Vector<const byte>::cast(literal));
192 int hash,
198 int hash = 0; local
201 hash += c;
202 hash += (hash << 10);
203 hash ^= (hash >> 6)
[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);
|
| /frameworks/compile/mclinker/include/mcld/Support/ |
| PathCache.h | 27 hash::StringCompare<llvm::StringRef> > HashEntryType;
30 typedef HashTable<HashEntryType, hash::StringHash<hash::BKDR>, EntryFactory<HashEntryType> > PathCache;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
| compare.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
29 struct hash<Key> struct in namespace:std
|
| max_bucket_count.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
35 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
|
| max_size.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 std::unordered_map<int, int, std::hash<int>, std::equal_to<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| max_bucket_count.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
35 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
|
| max_size.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
31 std::unordered_multimap<int, int, std::hash<int>, std::equal_to<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| clear.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
43 typedef std::unordered_multiset<int, std::hash<int>,
|
| max_bucket_count.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
32 typedef std::unordered_multiset<int, std::hash<int>,
|
| max_size.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 std::unordered_multiset<int, std::hash<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| clear.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
43 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
| 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/utilities/function.objects/unord.hash/ |
| integral.pass.cpp | 13 // struct hash
31 std::hash<T> >::value), "");
32 std::hash<T> h;
|
| pointer.pass.cpp | 13 // struct hash
31 std::hash<T> >::value), "");
32 std::hash<T> h;
|
