| /external/vboot_reference/firmware/lib/cryptolib/include/ |
| rsa.h | 34 * against an expected [hash] using [key]. Returns 0 on failure, 1 on success.
40 const uint8_t* hash);
|
| /frameworks/base/core/java/android/util/ |
| ArrayMap.java | 28 * It keeps its mappings in an array data structure -- an integer array of hash
33 * a hash map).
71 * list; the second entry is a pointer to the int[] hash code array for it.
79 * Special hash array value that indicates the container is immutable.
88 int indexOf(Object key, int hash) {
96 int index = ContainerHelpers.binarySearch(mHashes, N, hash);
98 // If the hash code wasn't found, then we have no entry for this key.
110 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
115 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
121 // hash chain to reduce the number of array entries that wil
434 final int hash; local
491 final int hash = key == null ? 0 : key.hashCode(); local
528 int hash = mHashes[i]; local
[all...] |
| /frameworks/rs/api/ |
| Utilities.cpp | 126 long hash = 0; local
128 hash = hash * 43 + s[i];
131 stream << "0x" << std::hex << hash << "l"; local
|
| /libcore/luni/src/main/java/java/nio/ |
| DoubleBuffer.java | 294 * Calculates this buffer's hash code from the remaining chars. The
295 * position, limit, capacity and mark don't affect the hash code.
297 * @return the hash code calculated from the remaining chars.
302 int hash = 0; local
306 hash = hash + ((int) l) ^ ((int) (l >> 32));
308 return hash;
|
| FloatBuffer.java | 295 * Calculates this buffer's hash code from the remaining chars. The
296 * position, limit, capacity and mark don't affect the hash code.
298 * @return the hash code calculated from the remaining floats.
303 int hash = 0; local
305 hash = hash + Float.floatToIntBits(get(myPosition++));
307 return hash;
|
| IntBuffer.java | 281 * Calculates this buffer's hash code from the remaining chars. The
282 * position, limit, capacity and mark don't affect the hash code.
284 * @return the hash code calculated from the remaining ints.
289 int hash = 0; local
291 hash = hash + get(myPosition++);
293 return hash;
|
| LongBuffer.java | 283 * Calculates this buffer's hash code from the remaining chars. The
284 * position, limit, capacity and mark don't affect the hash code.
286 * @return the hash code calculated from the remaining longs.
291 int hash = 0; local
295 hash = hash + ((int) l) ^ ((int) (l >> 32));
297 return hash;
|
| ShortBuffer.java | 284 * Calculates this buffer's hash code from the remaining chars. The
285 * position, limit, capacity and mark don't affect the hash code.
287 * @return the hash code calculated from the remaining shorts.
292 int hash = 0; local
294 hash = hash + get(myPosition++);
296 return hash;
|
| /libcore/luni/src/main/java/java/security/ |
| Identity.java | 319 * Returns the hash code value for this {@code Identity}. Returns the same
320 * hash code for {@code Identity}s that are equal to each other as required
323 * @return the hash code value for this {@code Identity}.
329 int hash = 0; local
331 hash += name.hashCode();
334 hash += scope.hashCode();
336 return hash;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/ |
| MoveOnly.h | 40 struct hash<MoveOnly> struct in namespace:std
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
| db_iterators_7.pass.cpp | 41 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
|
| db_iterators_8.pass.cpp | 39 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
|
| db_local_iterators_8.pass.cpp | 38 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
| clear.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
44 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| db_iterators_7.pass.cpp | 41 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
|
| db_iterators_8.pass.cpp | 39 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
|
| db_local_iterators_8.pass.cpp | 38 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| clear.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
44 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| count.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
48 typedef std::unordered_multiset<int, std::hash<int>,
|
| insert_init.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
49 typedef std::unordered_multiset<int, std::hash<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| count.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
48 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
| insert_init.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
49 typedef std::unordered_set<int, std::hash<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string.hash/ |
| strings.pass.cpp | 13 // struct hash
29 typedef std::hash<T> H;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/tuple/tuple.tuple/ |
| MoveOnly.h | 40 struct hash<MoveOnly> struct in namespace:std
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/functional/hash/ |
| hash_fwd.hpp | 23 template <class T> struct hash;
|
