| /dports/lang/racket/racket-8.3/src/expander/common/ |
| H A D | small-hash.rkt | 3 ;; For a hash table that's likely to be small, then a boxed immutable
4 ;; hash table can be more efficient
8 small-hash-ref
9 small-hash-set!
10 small-hash-keys)
18 (define (small-hash-ref small-ht key default)
19 (hash-ref (unbox small-ht) key default))
21 (define (small-hash-set! small-ht key val)
22 (set-box! small-ht (hash-set (unbox small-ht) key val)))
24 (define (small-hash-keys small-ht)
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/src/expander/common/ |
| H A D | small-hash.rkt | 3 ;; For a hash table that's likely to be small, then a boxed immutable
4 ;; hash table can be more efficient
8 small-hash-ref
9 small-hash-set!
10 small-hash-keys)
18 (define (small-hash-ref small-ht key default)
19 (hash-ref (unbox small-ht) key default))
21 (define (small-hash-set! small-ht key val)
22 (set-box! small-ht (hash-set (unbox small-ht) key val)))
24 (define (small-hash-keys small-ht)
[all …]
|
| /dports/databases/redis-devel/redis-0e5b813/tests/unit/type/ |
| H A D | hash.tcl | 17 test {Is the small hash encoded with a listpack?} {
246 test {HGET against the small hash} {
292 test {HSETNX target key missing - small hash} {
297 test {HSETNX target key exists - small hash} {
321 test {HMSET - small hash} {
354 test {HMGET - small hash} {
355 set keys {}
386 test {HKEYS - small hash} {
394 test {HVALS - small hash} {
410 test {HGETALL - small hash} {
[all …]
|
| /dports/databases/redis6/redis-6.0.16/tests/unit/type/ |
| H A D | hash.tcl | 17 test {Is the small hash encoded with a ziplist?} {
40 test {HGET against the small hash} {
86 test {HSETNX target key missing - small hash} {
91 test {HSETNX target key exists - small hash} {
115 test {HMSET - small hash} {
148 test {HMGET - small hash} {
149 set keys {}
180 test {HKEYS - small hash} {
188 test {HVALS - small hash} {
204 test {HGETALL - small hash} {
[all …]
|
| /dports/databases/redis5/redis-5.0.14/tests/unit/type/ |
| H A D | hash.tcl | 17 test {Is the small hash encoded with a ziplist?} {
40 test {HGET against the small hash} {
86 test {HSETNX target key missing - small hash} {
91 test {HSETNX target key exists - small hash} {
115 test {HMSET - small hash} {
148 test {HMGET - small hash} {
149 set keys {}
180 test {HKEYS - small hash} {
188 test {HVALS - small hash} {
204 test {HGETALL - small hash} {
[all …]
|
| /dports/devel/libpeak/libpeak-0.1.2/doc/latex/ |
| H A D | structpeak__dict__key__ops__s.tex | 10 Structure containing the callbacks for keys of a dictionary.
16 \begin{CompactList}\small\item\em Retain callback. \item\end{CompactList}\item
18 \begin{CompactList}\small\item\em Release callback. \item\end{CompactList}\item
20 \begin{CompactList}\small\item\em Equal callback. \item\end{CompactList}\item
21 …hyperlink{group__dict_ga4}{peak\_\-dict\_\-hash\_\-callback} \hyperlink{structpeak__dict__key__ops…
22 \begin{CompactList}\small\item\em Hash callback. \item\end{CompactList}\end{CompactItemize}
35 It's used to compare keys when accessing a value. If {\tt NULL}, pointer equality is used. \hyperta…
36 \index{peak_dict_key_ops_s@{peak\_\-dict\_\-key\_\-ops\_\-s}!hash@{hash}}
37 \index{hash@{hash}!peak_dict_key_ops_s@{peak\_\-dict\_\-key\_\-ops\_\-s}}
38 …hash]{\setlength{\rightskip}{0pt plus 5cm}\hyperlink{group__dict_ga4}{peak\_\-dict\_\-hash\_\-call… subsubsection
[all …]
|
| /dports/math/curv/curv-0.5/ideas/ |
| H A D | Record.md | 6 stored as hash table entries. An Atom is a {hash value, string length, string}.
9 A record is represented by a variant of persistent hash maps, as found in
10 Clojure hash-maps and Erlang maps.
11 * For small records and leaf nodes, a sorted array of {atom,value} pairs
22 * Binary search array. Easy. Good cache locality, efficient if small.
26 * Radix tree. Faster merge than hash table, otherwise comparable.
39 Lookup is O(ln N) instead of O(N), with a small constant.
41 Store the keys contiguously, followed by the values: this improves cache
47 the hash table where possible; otherwise the hash table must be copied,
52 * Hash Array Mapped Trie (HAMT) -- array mapped trie where keys are first
[all …]
|
| /dports/math/gap/gap-4.11.0/pkg/datastructures-0.2.5/tst/ |
| H A D | hashmap.tst | 5 # Test hash map with integer keys
10 # keys and values
23 # check keys and values
24 gap> keys:=Keys(hashmap);;
25 gap> IsDenseList(keys) and SortedList(keys) = [1..1000];
94 # check keys and values
98 gap> Length(keys);
224 Error, <capacity> must be a small positive integer (not a boolean or fail)
260 Error, <capacity> must be a small positive integer (not a boolean or fail)
287 Error, <hashfun> must return a small int (not a list (string))
[all …]
|
| /dports/multimedia/librespot/librespot-0.1.3/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/devel/stylua/StyLua-0.11.0/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/devel/sccache/sccache-0.2.15/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/devel/sentry-cli/sentry-cli-1.71.0/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/multimedia/gstreamer1-plugins-rust/gst-plugins-rs-d0466b3eee114207f851b37cae0015c0e718f021/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/security/vaultwarden/vaultwarden-1.23.1/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/dns/encrypted-dns-server/encrypted-dns-server-0.9.1/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/devel/grex/grex-1.3.0/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/devel/grcov/grcov-0.8.2/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/dns/doh-proxy/doh-proxy-0.9.2/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/net-mgmt/nfs-exporter/freebsd-nfs-exporter-0.3.0/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/net/routinator/routinator-0.10.2/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/devel/git-delta/delta-0.9.2/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/editors/helix/helix-0.5.0/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/lang/spidermonkey60/firefox-60.9.0/third_party/rust/fnv/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: http://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/fnv/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|
| /dports/textproc/angle-grinder/angle-grinder-0.18.0/cargo-crates/fnv-1.0.7/ |
| H A D | README.md | 3 An implementation of the [Fowler–Noll–Vo hash function][chongo].
10 The FNV hash function is a custom `Hasher` implementation that is more
11 efficient for smaller hash keys.
15 with short keys, such as when you have a map of integers to other values.
20 can craft specific keys designed to slow a hasher down. Thus, it is
21 important to profile your program to ensure that you are using small hash
22 keys, and be certain that your program could not be exposed to malicious
27 small—a perfect use case for FNV.
81 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/
|