| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| hashtable_policy.h | 235 // Default range hashing function: use division to fold a large number
577 // the combination of a hash function and a range-hashing function.
669 // Specialization: hash function and range-hashing function, no
749 // Specialization: hash function and range-hashing function,
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| hashtable_policy.h | 235 // Default range hashing function: use division to fold a large number
577 // the combination of a hash function and a range-hashing function.
669 // Specialization: hash function and range-hashing function, no
749 // Specialization: hash function and range-hashing function,
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/hash_fn/ |
| ranged_hash_fn.hpp | 39 * to deal with a single class for ranged hashing.
|
| /system/core/libcutils/ |
| hashmap.c | 83 // We apply this secondary hashing discovered by Doug Lea to defend
|
| /external/llvm/unittests/CodeGen/ |
| DIEHashTest.cpp | 444 // FIXME: This seems to be a bug in the DWARF type hashing specification that
445 // only uses the brief name hashing for types referenced via DW_AT_type. In
446 // this case the type is referenced via DW_AT_containing_type and full hashing
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| sets.py | 383 # BaseSet + hashing
408 # BaseSet + operations requiring mutability; no hashing
550 # This only supplies hashing and equality comparisons.
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| sets.py | 383 # BaseSet + hashing
408 # BaseSet + operations requiring mutability; no hashing
550 # This only supplies hashing and equality comparisons.
|
| /external/llvm/docs/ |
| MergeFunctions.rst | 138 introduce hashing and other helpers, but it is still just an optimization, and
147 them in special hash-table. Functions with equal hash are equal. Good hashing
150 Lookup-up time would be small, but such approach adds some delay due to hashing
163 surprising, logarithmical search was faster; sometimes up to 15%. Hashing needs
165 cases total "hashing" time was greater than total "logarithmical-search" time.
|
| /external/deqp/framework/delibs/debase/ |
| deString.c | 46 to be robust for symbol hashing. */
|
| /external/deqp/framework/delibs/depool/ |
| dePoolHashSet.h | 156 * \param HASHFUNC Function used for hashing the key.
|
| dePoolMultiSet.h | 113 * \param HASHFUNC Function used for hashing the key.
|
| /external/guava/guava/src/com/google/common/cache/ |
| Striped64.java | 63 * exists, a CAS is tried. Retries proceed by "double hashing",
|
| /external/guava/guava/src/com/google/common/net/ |
| InetAddresses.java | 22 import com.google.common.hash.Hashing;
857 * so by hashing the upper 64 bits into {@code 224.0.0.0/3}
[all...] |
