Home
last modified time | relevance | path

Searched refs:hash (Results 26 - 50 of 2212) sorted by relevance

12345678910>>...89

/third_party/skia/third_party/externals/icu/source/common/
H A Duhash.h34 * functions. These functions hash keys, compare keys, delete keys,
66 * UHashElement pointer. A hash element contains a key, value, and
101 * This is a single hash element.
114 * @return A NON-NEGATIVE hash code for parm.
152 UHashFunction *keyHasher; /* Computes hash from key.
212 * @param size The initial capacity of this hash table.
235 uhash_init(UHashtable *hash,
247 * @param size The initial capacity of this hash table.
253 uhash_initSize(UHashtable *hash,
262 * @param hash Th
[all...]
H A Dhash.h31 UHashtable* hash; member in Hashtable
133 hash = &hashObj; in init()
134 uhash_setKeyDeleter(hash, uprv_deleteUObject); in init()
145 hash = &hashObj; in initSize()
146 uhash_setKeyDeleter(hash, uprv_deleteUObject); in initSize()
151 UErrorCode& status) : hash(0) { in Hashtable()
156 : hash(0) in Hashtable()
167 : hash(0) in Hashtable()
178 : hash(0) in Hashtable()
184 : hash( in Hashtable()
[all...]
/third_party/node/test/fixtures/
H A Dguess-hash-seed.js13 let hash = key;
14 hash = hash ^ 0/*seed*/;
15 hash = ~hash + (hash << 15); // hash = (hash << 15) - hash - 1;
16 hash
[all...]
/third_party/typescript/tests/baselines/reference/
H A DtaggedPrimitiveNarrowing.js4 function getHashLength(hash: Hash): number {
5 if (typeof hash !== "string") {
6 throw new Error("This doesn't look like a hash");
8 return hash.length;
11 function getHashLength2<T extends { __tag__: unknown}>(hash: string & T): number {
12 if (typeof hash !== "string") {
13 throw new Error("This doesn't look like a hash");
15 return hash.length;
21 function getHashLength(hash) {
22 if (typeof hash !
[all...]
/third_party/rust/crates/libc/src/unix/bsd/freebsdlike/freebsd/
H A Daarch64.rs72 impl ::hash::Hash for gpregs {
73 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
74 self.gp_x.hash(state); in hash()
75 self.gp_lr.hash(state); in hash()
76 self.gp_sp.hash(state); in hash()
77 self.gp_elr.hash(state); in hash()
78 self.gp_spsr.hash(state); in hash()
79 self.gp_pad.hash(state); in hash()
103 impl ::hash
104 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
134 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
[all...]
H A Driscv64.rs80 impl ::hash::Hash for gpregs {
81 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
82 self.gp_ra.hash(state); in hash()
83 self.gp_sp.hash(state); in hash()
84 self.gp_gp.hash(state); in hash()
85 self.gp_tp.hash(state); in hash()
86 self.gp_t.hash(state); in hash()
87 self.gp_s.hash(state); in hash()
88 self.gp_a.hash(stat in hash()
113 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
142 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/icu/icu4c/source/common/
H A Dhash.h31 UHashtable* hash; member in Hashtable
133 hash = &hashObj; in init()
134 uhash_setKeyDeleter(hash, uprv_deleteUObject); in init()
145 hash = &hashObj; in initSize()
146 uhash_setKeyDeleter(hash, uprv_deleteUObject); in initSize()
151 UErrorCode& status) : hash(0) { in Hashtable()
156 : hash(0) in Hashtable()
167 : hash(0) in Hashtable()
178 : hash(0) in Hashtable()
184 : hash( in Hashtable()
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dhash.h31 UHashtable* hash; member in Hashtable
133 hash = &hashObj; in init()
134 uhash_setKeyDeleter(hash, uprv_deleteUObject); in init()
145 hash = &hashObj; in initSize()
146 uhash_setKeyDeleter(hash, uprv_deleteUObject); in initSize()
151 UErrorCode& status) : hash(0) { in Hashtable()
156 : hash(0) in Hashtable()
167 : hash(0) in Hashtable()
178 : hash(0) in Hashtable()
184 : hash( in Hashtable()
[all...]
/third_party/vk-gl-cts/framework/delibs/depool/
H A DdePoolHash.c21 * \brief Memory pool hash class.
40 deTestHash* hash = deTestHash_create(pool); in dePoolHash_selfTest() local
47 /* Test find() on empty hash. */ in dePoolHash_selfTest()
48 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 0); in dePoolHash_selfTest()
51 const int* val = deTestHash_find(hash, (deInt16)i); in dePoolHash_selfTest()
58 deTestHash_insert(hash, (deInt16)i, -i); in dePoolHash_selfTest()
61 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 5000); in dePoolHash_selfTest()
64 const int* val = deTestHash_find(hash, (deInt16)i); in dePoolHash_selfTest()
70 deTestHash_delete(hash, (deInt16)i); in dePoolHash_selfTest()
72 DE_TEST_ASSERT(deTestHash_getNumElements(hash) in dePoolHash_selfTest()
[all...]
/third_party/mesa3d/src/freedreno/ir3/
H A Dir3_cse.c35 #define HASH(hash, data) XXH32(&(data), sizeof(data), hash)
41 uint32_t hash = 0; in hash_instr() local
43 hash = HASH(hash, instr->opc); in hash_instr()
44 hash = HASH(hash, instr->dsts[0]->flags); in hash_instr()
48 hash = HASH(hash, src->array.offset); in hash_instr()
50 hash in hash_instr()
[all...]
/third_party/gn/src/gn/
H A Dunique_vector.h18 // The node stores the item's hash value and its index plus 1, in order
37 static uint32_t ToHash32(size_t hash) { return static_cast<uint32_t>(hash); } in ToHash32()
39 // Create new instance from hash value and vector index.
40 static UniqueVectorNode Make(size_t hash, size_t index) { in Make()
41 return {ToHash32(hash), static_cast<uint32_t>(index + 1u)}; in Make()
54 // |hash| is the hash value for |item|.
60 Node* Lookup(size_t hash, const T& item, const std::vector<T>& vector) const { in Lookup() argument
61 uint32_t hash32 = Node::ToHash32(hash); in Lookup()
69 Insert(Node* node, size_t hash, size_t index) Insert() argument
[all...]
H A Dstring_atom.cc44 // A HashTableBase node type that stores one hash value and one string pointer.
46 size_t hash; member
52 size_t hash_value() const { return hash; } in hash_value()
58 // This is a trivial hash table of string pointers, using open addressing.
64 // 1) Compute string hash value.
66 // 2) Call Lookup() with the hash value and the string_view key,
71 // and call Insert(), passing the |node|, |hash| and new string
78 // Compute hash for |str|. Replace with faster hash function if available.
80 return std::hash<st in Hash()
101 Insert(Node* node, size_t hash, KeyType key) Insert() argument
118 size_t hash = set_.Hash(""); StringAtomSet() local
126 size_t hash = set_.Hash(key); find() local
193 size_t hash = local_set_.Hash(key); find() local
[all...]
/third_party/ltp/metadata/
H A Ddata_storage.h53 struct data_node_hash hash; member
66 return "hash"; in data_type_name()
115 node->hash.elems_len = MAX_ELEMS; in data_node_hash()
116 node->hash.elems_used = 0; in data_node_hash()
142 struct data_node_hash *hash = &self->hash; in data_node_hash_add() local
144 if (hash->elems_used == hash->elems_len) in data_node_hash_add()
147 struct data_hash_elem *elem = &hash->elems[hash in data_node_hash_add()
181 struct data_node_hash *hash = &self->hash; data_node_hash_del() local
202 struct data_node_hash *hash = &self->hash; data_node_hash_get() local
[all...]
/third_party/rust/crates/cxx/gen/build/src/syntax/
H A Dimpls.rs4 use std::hash::{Hash, Hasher};
43 fn hash<H: Hasher>(&self, state: &mut H) { in hash() functions
44 mem::discriminant(self).hash(state); in hash()
46 Type::Ident(t) => t.hash(state), in hash()
47 Type::RustBox(t) => t.hash(state), in hash()
48 Type::UniquePtr(t) => t.hash(state), in hash()
49 Type::SharedPtr(t) => t.hash(state), in hash()
50 Type::WeakPtr(t) => t.hash(state), in hash()
51 Type::Ref(t) => t.hash(state), in hash()
52 Type::Ptr(t) => t.hash(stat in hash()
105 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
139 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
178 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
218 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
256 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
294 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
366 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
432 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/rust/crates/cxx/gen/lib/src/syntax/
H A Dimpls.rs4 use std::hash::{Hash, Hasher};
43 fn hash<H: Hasher>(&self, state: &mut H) { in hash() functions
44 mem::discriminant(self).hash(state); in hash()
46 Type::Ident(t) => t.hash(state), in hash()
47 Type::RustBox(t) => t.hash(state), in hash()
48 Type::UniquePtr(t) => t.hash(state), in hash()
49 Type::SharedPtr(t) => t.hash(state), in hash()
50 Type::WeakPtr(t) => t.hash(state), in hash()
51 Type::Ref(t) => t.hash(state), in hash()
52 Type::Ptr(t) => t.hash(stat in hash()
105 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
139 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
178 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
218 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
256 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
294 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
366 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
432 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/rust/crates/cxx/macro/src/syntax/
H A Dimpls.rs4 use std::hash::{Hash, Hasher};
43 fn hash<H: Hasher>(&self, state: &mut H) { in hash() functions
44 mem::discriminant(self).hash(state); in hash()
46 Type::Ident(t) => t.hash(state), in hash()
47 Type::RustBox(t) => t.hash(state), in hash()
48 Type::UniquePtr(t) => t.hash(state), in hash()
49 Type::SharedPtr(t) => t.hash(state), in hash()
50 Type::WeakPtr(t) => t.hash(state), in hash()
51 Type::Ref(t) => t.hash(state), in hash()
52 Type::Ptr(t) => t.hash(stat in hash()
105 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
139 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
178 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
218 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
256 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
294 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
366 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
432 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/rust/crates/cxx/syntax/
H A Dimpls.rs4 use std::hash::{Hash, Hasher};
43 fn hash<H: Hasher>(&self, state: &mut H) { in hash() functions
44 mem::discriminant(self).hash(state); in hash()
46 Type::Ident(t) => t.hash(state), in hash()
47 Type::RustBox(t) => t.hash(state), in hash()
48 Type::UniquePtr(t) => t.hash(state), in hash()
49 Type::SharedPtr(t) => t.hash(state), in hash()
50 Type::WeakPtr(t) => t.hash(state), in hash()
51 Type::Ref(t) => t.hash(state), in hash()
52 Type::Ptr(t) => t.hash(stat in hash()
105 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
139 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
178 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
218 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
256 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
294 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
366 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
432 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/rust/crates/cxx/gen/cmd/src/syntax/
H A Dimpls.rs4 use std::hash::{Hash, Hasher};
43 fn hash<H: Hasher>(&self, state: &mut H) { in hash() functions
44 mem::discriminant(self).hash(state); in hash()
46 Type::Ident(t) => t.hash(state), in hash()
47 Type::RustBox(t) => t.hash(state), in hash()
48 Type::UniquePtr(t) => t.hash(state), in hash()
49 Type::SharedPtr(t) => t.hash(state), in hash()
50 Type::WeakPtr(t) => t.hash(state), in hash()
51 Type::Ref(t) => t.hash(state), in hash()
52 Type::Ptr(t) => t.hash(stat in hash()
105 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
139 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
178 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
218 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
256 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
294 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
366 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
432 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/node/deps/v8/src/base/
H A Dhashmap-entry.h20 // HashMap entries are (key, value, hash) triplets, with a boolean indicating if
30 uint32_t hash; // The full hash value for key member
32 TemplateHashMapEntry(Key key, Value value, uint32_t hash) in TemplateHashMapEntry()
33 : key(key), value(value), hash(hash), exists_(true) {} in TemplateHashMapEntry()
50 uint32_t hash; // The full hash value for key member
52 TemplateHashMapEntry(Key* key, Value value, uint32_t hash) in TemplateHashMapEntry()
53 : key(key), value(value), hash(has in TemplateHashMapEntry()
67 uint32_t hash; // The full hash value for key global() member
87 uint32_t hash; // The full hash value for key global() member
[all...]
/third_party/skia/third_party/externals/tint/src/utils/
H A Dhash.h48 /// HashCombine "hashes" together an existing hash and hashable values.
50 void HashCombine(size_t* hash, const T& value) { in HashCombine() argument
52 *hash ^= std::hash<T>()(value) + offset + (*hash << 6) + (*hash >> 2); in HashCombine()
55 /// HashCombine "hashes" together an existing hash and hashable values.
57 void HashCombine(size_t* hash, const std::vector<T>& vector) { in HashCombine() argument
58 HashCombine(hash, vector.size()); in HashCombine()
60 HashCombine(hash, e in HashCombine()
66 HashCombine(size_t* hash, const T& value, const ARGS&... args) HashCombine() argument
75 size_t hash = 102931; // seed with an arbitrary prime Hash() local
[all...]
/third_party/rust/crates/libc/src/unix/bsd/freebsdlike/freebsd/x86_64/
H A Dmod.rs139 impl ::hash::Hash for fpreg32 {
140 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
141 self.fpr_env.hash(state); in hash()
142 self.fpr_acc.hash(state); in hash()
143 self.fpr_ex_sw.hash(state); in hash()
144 self.fpr_pad.hash(state); in hash()
167 impl ::hash::Hash for fpreg {
168 fn hash<H: ::hash functions
199 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
290 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
[all...]
/foundation/graphic/graphic_3d/lume/LumeBase/api/base/util/
H A Dhash.h31 uint64_t hash(const T& value);
34 inline uint64_t hash(const uint8_t& value) in hash() function
39 inline uint64_t hash(const uint16_t& value) in hash() function
44 inline uint64_t hash(const uint32_t& value) in hash() function
49 inline uint64_t hash(const uint64_t& value) in hash() function
55 inline uint64_t hash(const unsigned long& value) in hash() function
61 inline uint64_t hash(const int8_t& value) in hash() function
66 inline uint64_t hash(const int16_t& value) in hash() function
71 inline uint64_t hash(const int32_t& value) in hash() function
76 inline uint64_t hash(cons function
81 inline uint64_t hash(void* const& value) hash() function
86 inline uint64_t hash(T* const& value) hash() function
94 uint32_t hash = FNV_OFFSET_BASIS_32; FNV1a32Hash() local
118 uint64_t hash = FNV_OFFSET_BASIS; FNV1aHash() local
[all...]
/third_party/mbedtls/tests/src/drivers/
H A Dtest_driver_signature.c20 #include "test/drivers/hash.h"
22 #include "test/drivers/hash.h"
46 const uint8_t *hash, in sign_hash()
61 alg, hash, hash_length, in sign_hash()
68 alg, hash, hash_length, in sign_hash()
82 alg, hash, hash_length, in sign_hash()
89 alg, hash, hash_length, in sign_hash()
101 (void) hash; in sign_hash()
114 const uint8_t *hash, in verify_hash()
128 alg, hash, hash_lengt in verify_hash()
41 sign_hash( const psa_key_attributes_t *attributes, const uint8_t *key_buffer, size_t key_buffer_size, psa_algorithm_t alg, const uint8_t *hash, size_t hash_length, uint8_t *signature, size_t signature_size, size_t *signature_length) sign_hash() argument
109 verify_hash( const psa_key_attributes_t *attributes, const uint8_t *key_buffer, size_t key_buffer_size, psa_algorithm_t alg, const uint8_t *hash, size_t hash_length, const uint8_t *signature, size_t signature_length) verify_hash() argument
188 uint8_t hash[PSA_HASH_MAX_SIZE]; mbedtls_test_transparent_signature_sign_message() local
267 uint8_t hash[PSA_HASH_MAX_SIZE]; mbedtls_test_transparent_signature_verify_message() local
320 mbedtls_test_transparent_signature_sign_hash( const psa_key_attributes_t *attributes, const uint8_t *key_buffer, size_t key_buffer_size, psa_algorithm_t alg, const uint8_t *hash, size_t hash_length, uint8_t *signature, size_t signature_size, size_t *signature_length) mbedtls_test_transparent_signature_sign_hash() argument
348 mbedtls_test_opaque_signature_sign_hash( const psa_key_attributes_t *attributes, const uint8_t *key, size_t key_length, psa_algorithm_t alg, const uint8_t *hash, size_t hash_length, uint8_t *signature, size_t signature_size, size_t *signature_length) mbedtls_test_opaque_signature_sign_hash() argument
368 mbedtls_test_transparent_signature_verify_hash( const psa_key_attributes_t *attributes, const uint8_t *key_buffer, size_t key_buffer_size, psa_algorithm_t alg, const uint8_t *hash, size_t hash_length, const uint8_t *signature, size_t signature_length) mbedtls_test_transparent_signature_verify_hash() argument
386 mbedtls_test_opaque_signature_verify_hash( const psa_key_attributes_t *attributes, const uint8_t *key, size_t key_length, psa_algorithm_t alg, const uint8_t *hash, size_t hash_length, const uint8_t *signature, size_t signature_length) mbedtls_test_opaque_signature_verify_hash() argument
[all...]
/third_party/node/test/pummel/
H A Dtest-webcrypto-derivebits-pbkdf2.js16 function getDeriveKeyInfo(name, length, hash, ...usages) {
17 return [{ name, length, hash }, usages];
417 hash,
422 hash,
431 kDerivations[size][saltSize][hash][iterations]);
438 hash,
444 hash,
474 hash,
484 hash: hash
[all...]
/third_party/rust/crates/syn/src/
H A Dtt.rs2 use std::hash::{Hash, Hasher};
49 fn hash<H: Hasher>(&self, h: &mut H) { in hash() functions
54 0u8.hash(h); in hash()
56 Delimiter::Parenthesis => 0u8.hash(h), in hash()
57 Delimiter::Brace => 1u8.hash(h), in hash()
58 Delimiter::Bracket => 2u8.hash(h), in hash()
59 Delimiter::None => 3u8.hash(h), in hash()
63 TokenTreeHelper(&item).hash(h); in hash()
65 0xffu8.hash(h); // terminator w/ a variant we don't normally hash in hash()
100 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
[all...]

Completed in 10 milliseconds

12345678910>>...89