| /dports/lang/racket/racket-8.3/src/expander/namespace/ |
| H A D | module.rkt | 3 "../common/small-hash.rkt"
183 (small-hash-set! (namespace-phase-to-namespace m-ns) phase m-ns)
203 (small-hash-set! (namespace-submodule-declarations ns) mod-name m))
222 (define run? (eq? 'started (small-hash-ref states phase #f)))
302 (small-hash-set! (namespace-phase-to-namespace m-ns) 0 m-ns)
303 (small-hash-set! (namespace-phase-level-to-definitions m-ns)
307 (small-hash-set! (namespace-phase-level-to-definitions m-ns)
315 (small-hash-set! (namespace-phase-to-namespace m-ns) 0-phase m-ns)
316 (small-hash-set! (namespace-phase-level-to-definitions m-ns)
339 (small-hash-set! (namespace-phase-to-namespace m-ns) 0-phase m-ns)
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/src/expander/namespace/ |
| H A D | module.rkt | 3 "../common/small-hash.rkt"
183 (small-hash-set! (namespace-phase-to-namespace m-ns) phase m-ns)
203 (small-hash-set! (namespace-submodule-declarations ns) mod-name m))
222 (define run? (eq? 'started (small-hash-ref states phase #f)))
302 (small-hash-set! (namespace-phase-to-namespace m-ns) 0 m-ns)
303 (small-hash-set! (namespace-phase-level-to-definitions m-ns)
307 (small-hash-set! (namespace-phase-level-to-definitions m-ns)
315 (small-hash-set! (namespace-phase-to-namespace m-ns) 0-phase m-ns)
316 (small-hash-set! (namespace-phase-level-to-definitions m-ns)
339 (small-hash-set! (namespace-phase-to-namespace m-ns) 0-phase m-ns)
[all …]
|
| /dports/devel/p5-B-C/B-C-1.57/ramblings/ |
| H A D | next-steps.md | 99 [`perfect`](http://burtleburtle.net/bob/hash/perfect.html) executable
117 anagrams or weird keys), to create optimally fast C libraries or
118 optimally small C libraries for fast hash lookups, and even provide
121 you can only store strings as keys, and integers and strings as
124 Perfect hashes look differently on small 8-bit machines than on fast
126 `-fPIC`, for <1000 keys or for >1.000.000 keys, for keys with NUL
127 characters or not, for 7-bit keys only, for unicode keys, for
129 language to analyze the keys to generate a good perfect hash (in this
145 am able to create good C code. I am still testing optimal hash
147 hash for 100.000 entries in pure perl, with C libraries this goes
[all …]
|
| /dports/x11-toolkits/blt/blt2.5/generic/ |
| H A D | bltHash.h.in | 25 * Bob Jenkins, 1996. hash.c. Public Domain.
88 * Acceptable key types for hash tables:
108 * keys. */
121 * hash bucket, or NULL for end of
139 * bucket's hash chain, or NULL. */
141 /* Bucket array used for small tables
153 * order bits of randomized keys. */
154 size_t keyType; /* Type of keys used in this table.
166 * for entries in this hash table. If
175 * through hash tables:
[all …]
|
| /dports/editors/emacs-devel/emacs-4d1968b/doc/lispref/ |
| H A D | hash.texi | 11 alist (@pxref{Association Lists}) in that it maps keys to
80 Any two distinct Lisp objects are different as keys.
83 Two Lisp objects are the same, as keys, if they are equal
97 then the hash table does not prevent its keys from being collected as
109 the hash table does not protect either keys or values from garbage
125 small a size, the hash table will grow automatically when necessary, but
157 the following specifies a hash table containing the keys
255 other: that is, two keys' hash codes should be the same if the keys
321 This example creates a hash table whose keys are strings that are
362 itself is copied---the keys and values are shared.
[all …]
|
| /dports/editors/emacs/emacs-27.2/doc/lispref/ |
| H A D | hash.texi | 11 alist (@pxref{Association Lists}) in that it maps keys to
80 Any two distinct Lisp objects are different as keys.
83 Two Lisp objects are the same, as keys, if they are equal
97 then the hash table does not prevent its keys from being collected as
109 the hash table does not protect either keys or values from garbage
125 small a size, the hash table will grow automatically when necessary, but
157 the following specifies a new hash table containing the keys
250 other: that is, two keys' hash codes should be the same if the keys
316 This example creates a hash table whose keys are strings that are
357 itself is copied---the keys and values are shared.
[all …]
|
| /dports/lang/racket/racket-8.3/collects/racket/ |
| H A D | fasl.rkt | 106 ;; 100 to 255 is used for small integers:
107 (fasl-small-integer-start 100))
109 (define fasl-lowest-small-integer -10)
110 (define fasl-highest-small-integer (- 255 (- fasl-small-integer-start fasl-lowest-small-integer) 1))
164 [(hash? v)
182 (for ([k (in-list (correlated-property-symbol-keys v))])
222 [(<= fasl-lowest-small-integer v fasl-highest-small-integer)
223 (write-byte (+ fasl-small-integer-start (- v fasl-lowest-small-integer)) o)]
371 (loop (for/list ([k (in-list (correlated-property-symbol-keys v))])
543 [(type . >= . fasl-small-integer-start)
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/collects/racket/ |
| H A D | fasl.rkt | 106 ;; 100 to 255 is used for small integers:
107 (fasl-small-integer-start 100))
109 (define fasl-lowest-small-integer -10)
110 (define fasl-highest-small-integer (- 255 (- fasl-small-integer-start fasl-lowest-small-integer) 1))
164 [(hash? v)
182 (for ([k (in-list (correlated-property-symbol-keys v))])
222 [(<= fasl-lowest-small-integer v fasl-highest-small-integer)
223 (write-byte (+ fasl-small-integer-start (- v fasl-lowest-small-integer)) o)]
371 (loop (for/list ([k (in-list (correlated-property-symbol-keys v))])
543 [(type . >= . fasl-small-integer-start)
[all …]
|
| /dports/devel/p5-Hash-AutoHash/Hash-AutoHash-1.17/ |
| H A D | Changes | 10 Fixed tests that were failing because of hash key randomization
18 INCOMPATIBLE CHANGE: no longer possible to use method notation for keys
34 - Changed create_makefile_pl from deprecated 'passthrough' to 'small'
38 autohash_notempty when operating on a tied hash. these functions test
39 for emptiness by referencing the hash in scalar context. this doesn't
|
| /dports/misc/urbit/urbit-urbit-0.6.0/subprojects/murmur3/ |
| H A D | README.md | 3 C port of Murmur3 hash
6 …ki/MurmurHash3) hash function. Murmur3 is a non-cryptographic hash, designed to be fast and excell…
11 … and be sure to include `murmur3.h` to get the function prototypes. There are three hash functions:
19 …hash; `len`, the length in bytes; `seed`, an arbitrary seed number which you can use to tweak the …
21 The hash functions differ in both their internal mechanisms and in their outputs. They are speciali…
23 …oughput, but also the lowest latency. If you're making a hash table that usually has small keys, t…
26 …s a 128-bit output, and has about 30% higher throughput than the previous hash. Be warned, though,…
30 The hash functions are designed to work efficiently on x86 processors; in particular, they make som…
|
| /dports/devel/glib20/glib-2.70.4/glib/ |
| H A D | ghash.c | 267 gpointer keys; member
428 g_hash_table_hash_to_index (GHashTable *hash_table, guint hash) in g_hash_table_hash_to_index() argument
434 return (hash * 11) % hash_table->mod; in g_hash_table_hash_to_index()
568 gboolean small = FALSE; in g_hash_table_setup_storage() local
576 small = TRUE; in g_hash_table_setup_storage()
580 small = FALSE; in g_hash_table_setup_storage()
586 hash_table->have_big_keys = !small; in g_hash_table_setup_storage()
587 hash_table->have_big_values = !small; in g_hash_table_setup_storage()
590 hash_table->values = hash_table->keys; in g_hash_table_setup_storage()
725 hash_table->values = hash_table->keys; in realloc_arrays()
[all …]
|
| /dports/devel/p5-Hash-AutoHash-Args/Hash-AutoHash-Args-1.18/ |
| H A D | Changes | 9 Fixed a test I missed last time that was failing because of hash key
13 Fixed tests that were failing because of hash key randomization
26 - INCOMPATIBLE CHANGE: no longer possible to use method notation for keys
37 Changed create_makefile_pl from deprecated 'passthrough' to 'small'
|
| /dports/security/vault/vault-1.8.2/ui/app/templates/components/ |
| H A D | transit-form-show.hbs | 56 queryParams=(hash action=supportedAction.name)
89 {{#each-in @key.keys as |version creationTimestamp|}}
100 <small class="help has-text-grey">
102 </small>
119 {{#each-in @key.keys as |version meta|}}
130 <small class="help has-text-grey">
132 </small>
|
| /dports/www/p5-WWW-Salesforce/WWW-Salesforce-0.304/ |
| H A D | README | 111 as input a HASH containing the fields (the keys of the hash) and the
230 The method takes in a hash with two potential keys, "query" and "limit".
237 This is helpful in producing paginated results, or fetching small sets
251 helpful in producing paginated results, or fetch small sets of data
263 helpful in producing paginated results, or fetch small sets of data
305 containing the fields (the keys of the hash) and the values of the
325 the fields (the keys of the hash) and the values of the record that will
348 are needed. Returns a reference to an array of hash refs
351 Returns a reference to an array of hash refs
354 Returns a reference to an array of hash refs
[all …]
|
| /dports/textproc/p5-YAML/YAML-1.30/t/ |
| H A D | load-tests.t | 134 # times for keys (key/value separator is ': ')
137 - !perl/XYZ {small: object}
159 my $i = bless {small => 'object'}, 'XYZ';
167 === a bunch of small top level thingies
355 --- !!perl/hash
361 --- !!perl/hash:
409 === Quoted keys
485 === Nested mappings with non \w keys
|
| /dports/emulators/qemu/qemu-6.2.0/roms/skiboot/doc/secvar/ |
| H A D | secboot_tpm.rst | 15 to SECBOOT, and a hash of the variable data is stored in TPM NV. When the
16 variables are loaded from SECBOOT, this hash is recalculated and compared
51 2. calculate hash of the staging bank
52 3. store the staging bank hash in the TPM NV
59 The bank hashes are a SHA256 hash calculated over the whole region of
80 is kept small by default to preserve the very limited NV index space.
123 - ``clear-os-keys``
124 - ``clear-all-keys``
125 - ``clear-mfg-keys``
173 - 32b: sha256 hash of variable bank 0
[all …]
|
| /dports/security/farmhash/farmhash-0d859a8/ |
| H A D | Understanding_Hash_Functions | 18 example, one might want a list of keys and their hashes to provide no
20 hashes of other keys. Although I cannot prove it, I think I can meet
39 sketch of a string hash is:
71 bad hash functions to construct a higher-quality hash function.
74 that flipping the 19th bit, or any other small change, applied to
75 multiple input keys, causes a seemingly unpredictable difference each
128 It isn't hard to find real-life examples where hash tables or the hash
130 Improvements to hash tables and their hash functions are therefore a
140 risk. For example, hash tables can start with one hash function and then
144 possible performance from a hash table. Against that, those types of hash
[all …]
|
| /dports/security/hashcat/hashcat-6.2.5/deps/xxHash/ |
| H A D | README.md | 1 xxHash - Extremely fast hash algorithm
40 Q.Score is a measure of quality of the hash function.
67 ### New hash algorithms
72 The new algorithm is much faster than its predecessors for both long and small inputs,
96 Inlining functions is beneficial for speed on small keys.
99 …[this article](https://fastcompression.blogspot.com/2018/03/xxhash-for-small-keys-impressive-power…
166 XXH64_hash_t hash = XXH64(buffer, size, seed);
178 /* create a hash state */
199 /* Get the hash */
200 XXH64_hash_t const hash = XXH64_digest(state);
[all …]
|
| /dports/devel/xxhash/xxHash-0.8.0/ |
| H A D | README.md | 1 xxHash - Extremely fast hash algorithm
40 Q.Score is a measure of quality of the hash function.
67 ### New hash algorithms
72 The new algorithm is much faster than its predecessors for both long and small inputs,
96 Inlining functions is beneficial for speed on small keys.
99 …[this article](https://fastcompression.blogspot.com/2018/03/xxhash-for-small-keys-impressive-power…
166 XXH64_hash_t hash = XXH64(buffer, size, seed);
178 /* create a hash state */
199 /* Get the hash */
200 XXH64_hash_t const hash = XXH64_digest(state);
[all …]
|
| /dports/sysutils/fluent-bit/fluent-bit-1.8.11/lib/cmetrics/lib/xxHash-0.8.0/ |
| H A D | README.md | 1 xxHash - Extremely fast hash algorithm
40 Q.Score is a measure of quality of the hash function.
67 ### New hash algorithms
72 The new algorithm is much faster than its predecessors for both long and small inputs,
96 Inlining functions is beneficial for speed on small keys.
99 …[this article](https://fastcompression.blogspot.com/2018/03/xxhash-for-small-keys-impressive-power…
166 XXH64_hash_t hash = XXH64(buffer, size, seed);
178 /* create a hash state */
199 /* Get the hash */
200 XXH64_hash_t const hash = XXH64_digest(state);
[all …]
|
| /dports/sysutils/fluent-bit/fluent-bit-1.8.11/lib/xxHash-0.8.0/ |
| H A D | README.md | 1 xxHash - Extremely fast hash algorithm
40 Q.Score is a measure of quality of the hash function.
67 ### New hash algorithms
72 The new algorithm is much faster than its predecessors for both long and small inputs,
96 Inlining functions is beneficial for speed on small keys.
99 …[this article](https://fastcompression.blogspot.com/2018/03/xxhash-for-small-keys-impressive-power…
166 XXH64_hash_t hash = XXH64(buffer, size, seed);
178 /* create a hash state */
199 /* Get the hash */
200 XXH64_hash_t const hash = XXH64_digest(state);
[all …]
|
| /dports/games/libtmcg/libTMCG-1.3.18/ |
| H A D | NEWS | 13 v5 keys and signatures (see RFC 4880bis-07).
39 like public keys or signatures. The PRNG from Botan is used for as an
42 bugs in libgcrypt. Moreover, the hash function family SHA3 is emulated,
46 indepent hash algorithm (SHA3) has been included for computing the oracle
47 hash function g(). This adds the requirement of libgcrypt >= 1.7.0 for
50 Finally, small bugs (e.g. leading zeros for PKCS#1) are fixed now.
51 1.3.11 Some small enhancements for the OpenPGP interfaces and the library
89 the art. The complexity of hash function g() was improved. Unfortunately,
106 1.1.0 Some interfaces were changed to allow the creation of keys without
|
| /dports/misc/broot/broot-1.7.0/cargo-crates/ahash-0.4.7/ |
| H A D | README.md | 13 AHash is a keyed hash, so two instances initialized with different keys will produce completely dif…
14 resulting hashes cannot be predicted without knowing the keys. [This prevents DOS attacks where an …
15 number of items whose hashes collide that get used as keys in a hashmap.](https://github.com/tkaitc…
98 …* For example in the main algorithm 256bits of state and 256bits of keys are reduced to 64 total b…
111 1. aHash relies on random keys which are assumed to not be observable by an attacker. For a cryptog…
129 ## Why not use a cryptographic hash in a hashmap.
179 any better than the identity function. Any keys that happen to end in the same bit pattern will all…
184 * Integers that have the lower bits as zeros. (IE any multiple of small power of 2, which isn't a r…
186 have a multiple of 1024, if these were used as keys in a map they will collide and end up in the sa…
195 …e, FxHash should never be used as a default. In specialized instances where the keys are understood
[all …]
|
| /dports/databases/ods2sql/ods2sql-aca63183274038487cecb6be17d7f65e92178b8c/cargo-crates/ahash-0.4.6/ |
| H A D | README.md | 13 AHash is a keyed hash, so two instances initialized with different keys will produce completely dif…
14 resulting hashes cannot be predicted without knowing the keys. [This prevents DOS attacks where an …
15 number of items whose hashes collide that get used as keys in a hashmap.](https://github.com/tkaitc…
98 …* For example in the main algorithm 256bits of state and 256bits of keys are reduced to 64 total b…
111 1. aHash relies on random keys which are assumed to not be observable by an attacker. For a cryptog…
129 ## Why not use a cryptographic hash in a hashmap.
179 any better than the identity function. Any keys that happen to end in the same bit pattern will all…
184 * Integers that have the lower bits as zeros. (IE any multiple of small power of 2, which isn't a r…
186 have a multiple of 1024, if these were used as keys in a map they will collide and end up in the sa…
195 …e, FxHash should never be used as a default. In specialized instances where the keys are understood
[all …]
|
| /dports/www/firefox/firefox-99.0/third_party/rust/ahash/ |
| H A D | README.md | 13 AHash is a keyed hash, so two instances initialized with different keys will produce completely dif…
14 resulting hashes cannot be predicted without knowing the keys. [This prevents DOS attacks where an …
15 number of items whose hashes collide that get used as keys in a hashmap.](https://github.com/tkaitc…
98 …* For example in the main algorithm 256bits of state and 256bits of keys are reduced to 64 total b…
111 1. aHash relies on random keys which are assumed to not be observable by an attacker. For a cryptog…
129 ## Why not use a cryptographic hash in a hashmap.
179 any better than the identity function. Any keys that happen to end in the same bit pattern will all…
184 * Integers that have the lower bits as zeros. (IE any multiple of small power of 2, which isn't a r…
186 have a multiple of 1024, if these were used as keys in a map they will collide and end up in the sa…
195 …e, FxHash should never be used as a default. In specialized instances where the keys are understood
[all …]
|