| /external/libabigail/src/ |
| D | abg-hash.cc | 22 namespace hashing namespace
101 v = hashing::combine_hashes(v, size_t_hash(t.get_size_in_bits())); in operator ()()
102 v = hashing::combine_hashes(v, size_t_hash(t.get_alignment_in_bits())); in operator ()()
134 v = hashing::combine_hashes(v, str_hash(d.get_linkage_name())); in operator ()()
136 v = hashing::combine_hashes(v, str_hash(d.get_qualified_name())); in operator ()()
139 v = hashing::combine_hashes(v, get_member_access_specifier(d)); in operator ()()
140 v = hashing::combine_hashes(v, get_member_is_static(d)); in operator ()()
156 v = hashing::combine_hashes(v, decl_hash(t)); in operator ()()
157 v = hashing::combine_hashes(v, type_hash(t)); in operator ()()
177 v = hashing::combine_hashes(v, (*i)->get_hash()); in operator ()()
[all …]
|
| /external/rust/crates/fxhash/ |
| D | README.md | 3 …hashing algorithm was extracted from the Rustc compiler. This is the same hashing algoirthm used …
7 …you do not use this hash for cryptographic purproses. Furthermore, this hashing algorithm was not…
37 …u64`, or any byte sequence with length >= 5. However, keep in mind that hashing speed is not the …
|
| D | METADATA | 2 description: "A fast, non-secure, hashing algorithm derived from an internal hasher used in FireFox…
|
| D | Cargo.toml.orig | 4 description = "A fast, non-secure, hashing algorithm derived from an internal hasher used in FireFo…
|
| /external/llvm/lib/Support/ |
| D | Hashing.cpp | 23 size_t llvm::hashing::detail::fixed_seed_override = 0;
28 hashing::detail::fixed_seed_override = fixed_value; in set_fixed_execution_hash_seed()
|
| /external/swiftshader/third_party/llvm-subzero/lib/Support/ |
| D | Hashing.cpp | 23 size_t llvm::hashing::detail::fixed_seed_override = 0;
28 hashing::detail::fixed_seed_override = fixed_value; in set_fixed_execution_hash_seed()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | Hashing.cpp | 22 uint64_t llvm::hashing::detail::fixed_seed_override = 0;
27 hashing::detail::fixed_seed_override = fixed_value; in set_fixed_execution_hash_seed()
|
| /external/python/cpython3/Doc/library/ |
| D | hashlib.rst | 88 blocked hashing algorithms in restricted environments. ``False`` indicates
89 that the hashing algorithm is not used in a security context, e.g. as a
235 hashing. Naive algorithms such as ``sha1(password)`` are not resistant against
236 brute-force attacks. A good password hashing function must be tunable, slow, and
315 **salted hashing**, **personalization**, and **tree hashing**.
346 * *key*: key for keyed hashing (up to 64 bytes for BLAKE2b, up to 32 bytes for
349 * *salt*: salt for randomized hashing (up to 16 bytes for BLAKE2b, up to 8
375 Constructor functions also accept the following tree hashing parameters:
401 hashing.
434 Simple hashing
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | Hashing.h | 142 namespace hashing {
481 return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
486 namespace hashing {
604 ::llvm::hashing::detail::hash_combine_recursive_helper helper;
610 namespace hashing {
634 return ::llvm::hashing::detail::hash_integer_value(
641 return ::llvm::hashing::detail::hash_integer_value(
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | Hashing.h | 142 namespace hashing {
481 return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
486 namespace hashing {
604 ::llvm::hashing::detail::hash_combine_recursive_helper helper;
610 namespace hashing {
634 return ::llvm::hashing::detail::hash_integer_value(
641 return ::llvm::hashing::detail::hash_integer_value(
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | Hashing.h | 141 namespace hashing {
479 return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
484 namespace hashing {
602 ::llvm::hashing::detail::hash_combine_recursive_helper helper;
608 namespace hashing {
632 return ::llvm::hashing::detail::hash_integer_value(
639 return ::llvm::hashing::detail::hash_integer_value(
|
| /external/tensorflow/tensorflow/python/keras/layers/preprocessing/benchmarks/ |
| D | category_hash_varlen_benchmark.py | 22 from tensorflow.python.keras.layers.preprocessing import hashing
47 model.add(hashing.Hashing(num_buckets))
|
| D | category_hash_dense_benchmark.py | 23 from tensorflow.python.keras.layers.preprocessing import hashing
46 model.add(hashing.Hashing(num_buckets))
|
| D | category_cross_hash_dense_benchmark.py | 23 from tensorflow.python.keras.layers.preprocessing import hashing
49 hashed_data = hashing.Hashing(num_buckets)(crossed_data)
|
| /external/deqp-deps/amber/ |
| D | DEPS | 81 'third_party/robin-hood-hashing': Var('martinus_git') + '/robin-hood-hashing.git@' +
|
| D | .gitignore | 20 third_party/robin-hood-hashing
|
| /external/libabigail/include/ |
| D | abg-hash.h | 18 namespace hashing
|
| /external/rust/beto-rust/nearby/crypto/crypto_provider/src/testdata/ |
| D | README.md | 2 https://csrc.nist.gov/projects/cryptographic-algorithm-validation-program/secure-hashing#shavs,
|
| /external/iptables/extensions/ |
| D | libxt_HMARK.man | 1 Like MARK, i.e. set the fwmark, but the mark is calculated from hashing
4 and used to calculate the hashing.
|
| /external/llvm/test/Linker/ |
| D | unique-fwd-decl-order.ll | 4 ; This test exercises MDNode hashing. For the nodes to be correctly uniqued,
|
| /external/python/cpython2/Doc/library/ |
| D | persistence.rst | 13 module also provides such disk-based string-to-string mappings based on hashing,
|
| /external/cronet/base/third_party/superfasthash/ |
| D | README.chromium | 11 A fast string hashing algorithm.
|
| /external/libwebsockets/READMEs/ |
| D | README.lws_map.md | 22 simple bytewise key comparison, and xor / shift key hashing. These are often
26 and object hashing, allowing custom objects to be keys if desired.
|
| /external/guava/guava-tests/benchmark/com/google/common/hash/ |
| D | MessageDigestAlgorithmBenchmark.java | 113 byte hashing(int reps) { in hashing() method in MessageDigestAlgorithmBenchmark
|
| /external/guava/android/guava-tests/benchmark/com/google/common/hash/ |
| D | MessageDigestAlgorithmBenchmark.java | 113 byte hashing(int reps) { in hashing() method in MessageDigestAlgorithmBenchmark
|