Home
last modified time | relevance | path

Searched refs:hashes (Results 1 - 25 of 48) sorted by relevance

12

/third_party/json/tests/src/
H A Dunit-hash.cpp19 // Collect hashes for different JSON values and make sure that they are distinct
23 std::set<std::size_t> hashes; variable
26 hashes.insert(std::hash<json> {}(json(nullptr)));
29 hashes.insert(std::hash<json> {}(json(true)));
30 hashes.insert(std::hash<json> {}(json(false)));
33 hashes.insert(std::hash<json> {}(json("")));
34 hashes.insert(std::hash<json> {}(json("foo")));
37 hashes.insert(std::hash<json> {}(json(0)));
38 hashes.insert(std::hash<json> {}(json(static_cast<unsigned>(0))));
40 hashes
72 std::set<std::size_t> hashes; global() variable
[all...]
/third_party/node/deps/npm/node_modules/@tufjs/models/dist/
H A Dfile.js24 this.hashes = opts.hashes;
33 util_1.default.isDeepStrictEqual(this.hashes, other.hashes) &&
43 // Verifies that the given data matches the supplied hashes.
44 if (this.hashes) {
45 Object.entries(this.hashes).forEach(([key, value]) => {
68 if (this.hashes) {
69 json.hashes = this.hashes;
[all...]
/third_party/ffmpeg/libavformat/
H A Dhashenc.c33 struct AVHashContext **hashes; member
89 c->hashes = av_mallocz(sizeof(*c->hashes)); in hash_init()
90 if (!c->hashes) in hash_init()
92 res = av_hash_alloc(&c->hashes[0], c->hash_name); in hash_init()
95 av_hash_init(c->hashes[0]); in hash_init()
106 c->hashes = av_calloc(s->nb_streams, sizeof(*c->hashes)); in streamhash_init()
107 if (!c->hashes) in streamhash_init()
110 res = av_hash_alloc(&c->hashes[ in streamhash_init()
[all...]
/third_party/ninja/src/
H A Dhash_collision_bench.cc41 pair<uint64_t, int>* hashes = new pair<uint64_t, int>[N]; in main() local
47 hashes[i] = make_pair(BuildLog::LogEntry::HashCommand(commands[i]), i); in main()
50 sort(hashes, hashes + N); in main()
54 if (hashes[i - 1].first == hashes[i].first) { in main()
55 if (strcmp(commands[hashes[i - 1].second], in main()
56 commands[hashes[i].second]) != 0) { in main()
58 commands[hashes[i - 1].second], in main()
59 commands[hashes[ in main()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DCompactByteArray.java69 hashes = new int[INDEXCOUNT]; in CompactByteArray()
75 hashes[i] = 0; in CompactByteArray()
214 if (hashes[i] == hashes[j] && in compact()
226 hashes[j] = hashes[i]; in compact()
243 hashes = null; in compact()
270 hashes[i] = (hashes[i] + (value<<1)) | 1; in touchBlock()
278 return hashes[ in blockTouched()
402 private int[] hashes; global() field in CompactByteArray
[all...]
H A DCompactCharArray.java70 hashes = new int[INDEXCOUNT]; in CompactCharArray()
76 hashes[i] = 0; in CompactCharArray()
217 if (hashes[i] == hashes[j] && in compact()
254 hashes = null; in compact()
294 hashes[i] = (hashes[i] + (value<<1)) | 1; in touchBlock()
302 return hashes[i] != 0; in blockTouched()
342 if (hashes != null) other.hashes in clone()
429 private int[] hashes; global() field in CompactCharArray
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/util/
H A DCompactByteArray.java71 hashes = new int[INDEXCOUNT]; in CompactByteArray()
77 hashes[i] = 0; in CompactByteArray()
216 if (hashes[i] == hashes[j] && in compact()
228 hashes[j] = hashes[i]; in compact()
245 hashes = null; in compact()
272 hashes[i] = (hashes[i] + (value<<1)) | 1; in touchBlock()
280 return hashes[ in blockTouched()
404 private int[] hashes; global() field in CompactByteArray
[all...]
H A DCompactCharArray.java72 hashes = new int[INDEXCOUNT]; in CompactCharArray()
78 hashes[i] = 0; in CompactCharArray()
219 if (hashes[i] == hashes[j] && in compact()
256 hashes = null; in compact()
296 hashes[i] = (hashes[i] + (value<<1)) | 1; in touchBlock()
304 return hashes[i] != 0; in blockTouched()
344 if (hashes != null) other.hashes in clone()
431 private int[] hashes; global() field in CompactCharArray
[all...]
/third_party/node/deps/npm/node_modules/@sigstore/verify/dist/timestamp/
H A Dmerkle.js33 // Figure out which subset of hashes corresponds to the inner and border
36 if (inclusionProof.hashes.length !== inner + border) {
42 const innerHashes = inclusionProof.hashes.slice(0, inner);
43 const borderHashes = inclusionProof.hashes.slice(inner);
46 // Chain the hashes belonging to the inner and border portions
67 // Assumes the provided proof hashes are ordered from lower to higher levels
69 function chainInner(seed, hashes, index) {
70 return hashes.reduce((acc, h, i) => {
80 function chainBorderRight(seed, hashes) {
81 return hashes
[all...]
/third_party/node/deps/npm/node_modules/ssri/lib/
H A Dindex.js41 this.hashes = this.algorithms.map(crypto.createHash)
88 this.hashes.forEach(h => h.update(data))
96 const newSri = parse(this.hashes.map((h, i) => {
224 function integrityHashToString (toString, sep, opts, hashes) {
230 const lastIndex = hashes.length - 1
233 const hashString = Hash.prototype.toString.call(hashes[i], opts)
243 const finalHashString = Hash.prototype.toString.call(hashes[lastIndex], opts)
303 // add additional hashes to an integrity value, but prevent
312 throw new Error('hashes do not match, cannot update integrity')
339 // set of hashes foun
[all...]
/third_party/ffmpeg/libavutil/tests/
H A Dmurmur3.c32 uint8_t *hashes = av_mallocz(256 * 16); in main() local
39 av_murmur3_final(ctx, hashes + 16 * i); in main()
42 av_murmur3_update(ctx, hashes, 256 * 16); in main()
44 av_free(hashes); in main()
/third_party/node/deps/npm/node_modules/@sigstore/protobuf-specs/dist/__generated__/
H A Dsigstore_rekor.js37 return { logIndex: "0", rootHash: Buffer.alloc(0), treeSize: "0", hashes: [], checkpoint: undefined };
45 hashes: Array.isArray(object?.hashes) ? object.hashes.map((e) => Buffer.from(bytesFromBase64(e))) : [],
55 if (message.hashes) {
56 obj.hashes = message.hashes.map((e) => base64FromBytes(e !== undefined ? e : Buffer.alloc(0)));
59 obj.hashes = [];
/third_party/node/deps/openssl/openssl/crypto/x509/
H A Dby_dir.c42 STACK_OF(BY_DIR_HASH) *hashes;
154 sk_BY_DIR_HASH_pop_free(ent->hashes, by_dir_hash_free); in by_dir_entry_free()
210 ent->hashes = sk_BY_DIR_HASH_new(by_dir_hash_cmp); in add_cert_dir()
212 if (ent->dir == NULL || ent->hashes == NULL) { in add_cert_dir()
278 if (type == X509_LU_CRL && ent->hashes) { in get_cert_by_subject_ex()
282 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp); in get_cert_by_subject_ex()
284 hent = sk_BY_DIR_HASH_value(ent->hashes, idx); in get_cert_by_subject_ex()
372 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp); in get_cert_by_subject_ex()
373 hent = sk_BY_DIR_HASH_value(ent->hashes, idx); in get_cert_by_subject_ex()
385 if (!sk_BY_DIR_HASH_push(ent->hashes, hen in get_cert_by_subject_ex()
[all...]
/third_party/openssl/crypto/x509/
H A Dby_dir.c42 STACK_OF(BY_DIR_HASH) *hashes;
154 sk_BY_DIR_HASH_pop_free(ent->hashes, by_dir_hash_free); in by_dir_entry_free()
210 ent->hashes = sk_BY_DIR_HASH_new(by_dir_hash_cmp); in add_cert_dir()
212 if (ent->dir == NULL || ent->hashes == NULL) { in add_cert_dir()
278 if (type == X509_LU_CRL && ent->hashes) { in get_cert_by_subject_ex()
282 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp); in get_cert_by_subject_ex()
284 hent = sk_BY_DIR_HASH_value(ent->hashes, idx); in get_cert_by_subject_ex()
371 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp); in get_cert_by_subject_ex()
372 hent = sk_BY_DIR_HASH_value(ent->hashes, idx); in get_cert_by_subject_ex()
384 if (!sk_BY_DIR_HASH_push(ent->hashes, hen in get_cert_by_subject_ex()
[all...]
/third_party/node/test/pummel/
H A Dtest-crypto-dh-hash.js40 const hashes = {
51 for (const name in hashes) {
54 const hash1 = hashes[name];
/third_party/python/Tools/msi/
H A Dgenerate_md5.py6 filenames, hashes, sizes = [], [], []
17 hashes.append(md5.hexdigest())
21 for f, h, s in zip(filenames, hashes, sizes):
/third_party/node/deps/v8/src/inspector/
H A Dv8-debugger-script.cc32 uint64_t hashes[] = {0, 0, 0, 0, 0}; in calculateHash() local
35 const size_t hashesSize = arraysize(hashes); in calculateHash()
55 hashes[current] = (hashes[current] + zi[current] * xi) % prime[current]; in calculateHash()
75 hashes[current] = (hashes[current] + zi[current] * xi) % prime[current]; in calculateHash()
81 hashes[i] = (hashes[i] + zi[i] * (prime[i] - 1)) % prime[i]; in calculateHash()
85 hash.appendUnsignedAsHex(static_cast<uint32_t>(hashes[i])); in calculateHash()
/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dflat_hash_map_test.cc162 // hashes are only guaranteed in opt mode, we use assertions to track internal in TEST()
165 int hashes = 0; in TEST() local
166 flat_hash_map<size_t, size_t, Hash, Eq> m(0, Hash{&hashes}); in TEST()
173 EXPECT_EQ(hashes, 1); in TEST()
180 EXPECT_EQ(hashes, 2); in TEST()
187 EXPECT_EQ(hashes, 3); in TEST()
194 EXPECT_EQ(hashes, 4); in TEST()
/third_party/node/test/fixtures/crypto/
H A Decdsa.js95 const hashes = ['SHA-1', 'SHA-256', 'SHA-384', 'SHA-512'];
99 hashes.forEach((hash) => {
/third_party/python/Lib/test/
H A Dtest_tuple.py7 # For tuple hashes, we normally only run a test to ensure that we get
104 # We expect tuples whose base components have deterministic hashes to
105 # have deterministic hashes too - and, indeed, the same hashes across
139 def tryone_inner(tag, nbins, hashes, expected=None, zlimit=None):
142 nballs = len(hashes)
144 c = Counter(hashes)
171 hashes = list(map(hash, xs))
174 hashes,
182 [h >> shift for h in hashes],
[all...]
/third_party/mesa3d/src/gallium/auxiliary/cso_cache/
H A Dcso_cache.c41 return &sc->hashes[type]; in _cso_hash_for_type()
165 cso_hash_init(&sc->hashes[i]); in cso_cache_init()
200 cso_hash_deinit(&sc->hashes[i]); in cso_cache_delete()
210 sanitize_hash(sc, &sc->hashes[i], i, sc->max_size); in cso_set_maximum_cache_size()
/third_party/rust/crates/syn/codegen/src/
H A Dhash.rs40 let mut hashes = Vec::new(); in expand_impl_body() variables
57 hashes.push(quote! { in expand_impl_body()
74 #(#hashes)* in expand_impl_body()
/third_party/node/deps/v8/tools/
H A Dfind-commit-for-patch.py45 hashes = line.split()[1]
46 old_hash = hashes.split("..")[0]
/third_party/node/deps/npm/node_modules/@sigstore/sign/dist/witness/tlog/
H A Dindex.js77 hashes: proof.hashes.map((h) => Buffer.from(h, 'hex')),
/third_party/skia/third_party/externals/angle2/scripts/
H A Drun_code_generation.py199 hashes = {}
204 hashes[file] = json.load(hash_file)
207 return hashes
259 # Update the output hashes again since they can be formatted.

Completed in 10 milliseconds

12