175 lines
61 KiB
Plaintext
175 lines
61 KiB
Plaintext
|
rust
|
|||
|
|
¯ò #rustc 1.96.0 (ac68faa20 2026-05-25)ÁíàÄTËŸ ÜJîÄ)'ß\¥! -3d1337db07d0b3aeÁ ¤°ð ¾ä-±($²ï=©Ã -7e98a21bfd32b0edÁ‰W globalÁ4§J ó�¼ˆJ ̇J convenienceÁ\¤&»À|Ž& í fastÁ
|
|||
|
|
with_seedÁ write_numÁ ¥ writeÁ write_u8Á write_u16Á write_u32Á write_u64Á
|
|||
|
|
write_u128Á write_usizeÁ finishÁ > ‘ build_hasherÁ #> % randomÁ % fixedÁ %Ÿ )‘ )Ú ,Ÿ .> 0‘ 0Ú qualityÁ 3 333333333 =Ÿ 3?Ê ?Ö ?å ?õ ?… ?• ?¦ ?¸ 3H‘ HÚ 3Kû Kˆ KŸ 3O‘ OÚ 3RŸ 3T‘ TÚ seedÁ W WWWWWWWWW W FIXED_GLOBAL_SEEDÁ W gen_per_hasher_seedÁ c ccc PER_HASHER_NONDETERMINISMÁ W h
|
|||
|
|
global_randomÁ h global_fixedÁ h from_u64Á k mixÁ k FORCED_ONESÁ WŠ n nnnnn generate_global_seedÁ t n GlobalSeedStorageÁ vº v§ n UNINITÁ n LOCKEDÁ n INITÁ n n GLOBAL_SEED_STORAGEÁ } næ init_slowÁ getÁ W
|
|||
|
|
|
|||
|
|
ARBITRARY0Á
|
|||
|
|
ARBITRARY1Á
|
|||
|
|
ARBITRARY2Á
|
|||
|
|
ARBITRARY3Á
|
|||
|
|
ARBITRARY4Á
|
|||
|
|
ARBITRARY5Á
|
|||
|
|
ARBITRARY6Á
|
|||
|
|
ARBITRARY7Á
|
|||
|
|
ARBITRARY8Á
|
|||
|
|
ARBITRARY9Á folded_multiplyÁ š hash_bytes_mediumÁ hash_bytes_longÁ
|
|||
|
|
FoldHasherÁ “ accumulatorÁ “ spongeÁ “
|
|||
|
|
sponge_lenÁ “ fold_seedÁ “ expand_seedÁ “ expand_seed2Á “ expand_seed3Á
|
|||
|
|
›ƒ RandomStateÁ � per_hasher_seedÁ � global_seedÁ
|
|||
|
|
¢ƒ ¤× SeedableRandomStateÁ ¦†
|
|||
|
|
¦ shared_seedÁ «ƒ ×
|
|||
|
|
FixedStateÁ ¯†
|
|||
|
|
³ƒ µ× 3× · innerÁ 3¹ƒ 3ó »å 33 3
|
|||
|
|
¿ƒ 3 Á> 3 Ã× 3Ï
|
|||
|
|
Åå 3
|
|||
|
|
33Ƀ 3Ë> 3Í× 3¤ Ïå 333Óƒ 3Õ> 3×× W
|
|||
|
|
SharedSeedÁ Ù seedsÁ Ú W܃ WÞ× n
|
|||
|
|
GlobalSeedÁ à _no_accidental_unsafe_initÁ nnnäƒ næ×
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
"
|
|||
|
|
+
|
|||
|
|
2
|
|||
|
|
>
|
|||
|
|
@
|
|||
|
|
@
|
|||
|
|
A
|
|||
|
|
B
|
|||
|
|
C
|
|||
|
|
D
|
|||
|
|
E
|
|||
|
|
F
|
|||
|
|
G
|
|||
|
|
J
|
|||
|
|
Q
|
|||
|
|
V
|
|||
|
|
‘
|
|||
|
|
’
|
|||
|
|
œ
|
|||
|
|
£
|
|||
|
|
¥
|
|||
|
|
¥
|
|||
|
|
¥
|
|||
|
|
¬
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
´
|
|||
|
|
¶
|
|||
|
|
¶
|
|||
|
|
¶
|
|||
|
|
º
|
|||
|
|
À
|
|||
|
|
Ä
|
|||
|
|
Ä
|
|||
|
|
Ä
|
|||
|
|
Ê
|
|||
|
|
Î
|
|||
|
|
Î
|
|||
|
|
Î
|
|||
|
|
Ô
|
|||
|
|
Ø
|
|||
|
|
Ø
|
|||
|
|
Ø
|
|||
|
|
Ý
|
|||
|
|
ß
|
|||
|
|
ß
|
|||
|
|
ß
|
|||
|
|
å
|
|||
|
|
ç
|
|||
|
|
ç
|
|||
|
|
ç
|
|||
|
|
Ø “ “ × ”é •ü –Š —œ ˜ ™À šÔ ¿tø¹‰2% ¢eÚ Š � � ó ž†
|
|||
|
|
Ÿ�
|
|||
|
|
Yhª»˜ d ÛÚ ØÚ ¿cÚ ³ Ú ÅeÚ Š ¦ ¦ Ï
|
|||
|
|
§†
|
|||
|
|
¨ò
|
|||
|
|
X¢8Öß ÛË ØË ¿cË ³ Ë ÅeË Š ¯ ¯ ¤ °†
|
|||
|
|
ÊÙF¹ŠJ¬ Û¼ ؼ ¿c¼ ³ ¼ Åe¼ Ø · · × ¸å —øØXÚ ¢e¢ Š » » ó ¼å 3 µ ’••Ô Ûà Øà ³ à ¿cà Åeà Š Å Å Ï
|
|||
|
|
Æå 3 @Õ–@`$j ÛÆ ØÆ ³ Æ ¿cÆ ÅeÆ Š Ï Ï ¤ Ðå 3 ðºŒJ–}³Ð Û¬ ج ³ ¬ ¿c¬ Åe¬ Ø Ù Ù « Ú½ ZÙÁì?“RŠ ¿c’ � v v È wº n x§ n æRm¨›bT Š à à æ áø n ÇÒ .ýGËa Û‹ Ø‹ ¿c‹ › “¢ �« ¦³ ¯¹ ·¿ »É ÅÓ ÏÜ Ùä à “? · �© ¦± ¯½ »Ç ÅÑ Ïâ à¡ �ª ¦² ¯¾ »È ÅÒ Ïã ठ� ¦µ ¯Ã »Í Å× ÏÞ Ùæ à �# ¦. ¯Á »Ë ÅÕ Ï �) ¦0 ¯H »O ÅT Ï| vØ
|
|||
|
|
¼¢eFŠ Û1¿c1³ 8Åe'� $ä§= |§= T¹= ˆ Â= üƒ=K ¯ Í= Ô= - üý;× ¼ $< ñ |”< ñ Ž ñ � †
|
|||
|
|
<† ˆ ñ üÖ#I üò#, |‚$
|
|||
|
|
# |ò#
|
|||
|
|
� /T“$ � ñ
|
|||
|
|
P �$ e
|
|||
|
|
l ÜÖ#
|
|||
|
|
- w ˆ ž$ ü¨!‚ Ï ©$ °$ S üé Ç ¬ $™! ñ |€! ¼ æ ñ ä ñ â †
|
|||
|
|
! CÈ � ñ üê0 ñ Të ‰ ñ T÷ Š ñ Tƒ ‹ ñ T� Œ ñ üÒK Ù œ ü¬r b ’ TÅ ñ 9– ‰ ñ “ Š ñ � ‹ ñ � Œ ñ _Á ³$ 4Á”ý j ’ , ” • j üÀU ´% œß ´% i ’ Œþ ´% y . b ’ ' / b ’ ª ¸ j t ´% Ñ ’ h ßs b ’
|
|||
|
|
4â ø+œ ø,œ $ú
|
|||
|
|
$ x,œ ¸! -P,° Ž ñ P ,º g
|
|||
|
|
n x+œ ¸! wP+° Ž ñ š +º ø*œ
|
|||
|
|
x*œ ¸! ÅP*° Ž ñ 7 *º 4� ø.œ ø/œ 4§
|
|||
|
|
$x/œ ¸! -P/° Ž ñ P /º g
|
|||
|
|
nx.œ ¸! wP.° Ž ñ š .º ø-œ
|
|||
|
|
x-œ ¸! ÅP-° Ž ñ 7 -º 4¾
|
|||
|
|
ø1œ ø2œ 4Ö
|
|||
|
|
|
|||
|
|
|
|||
|
|
$x2œ ¸!
|
|||
|
|
-P2° Ž ñ P 2º
|
|||
|
|
g
|
|||
|
|
nx1œ ¸! wP1° Ž ñ š 1º ø0œ
|
|||
|
|
x0œ ¸! ÅP0° Ž ñ
|
|||
|
|
7 0º 4í ø4œ ø5œ 4…
|
|||
|
|
|
|||
|
|
$x5œ ¸! -P5° Ž ñ
|
|||
|
|
P 5º g
|
|||
|
|
nx4œ ¸! wP4° Ž ñ š 4º ø3œ
|
|||
|
|
x3œ ¸! ÅP3° Ž ñ 7 !3º ü´#§ ¤Æ# 4Æ#
|
|||
|
|
\Ï# m ñ Ù# ¤ì# 4ì#
|
|||
|
|
\õ# m ñ ÿ# ¤’$ 4’$
|
|||
|
|
|
|||
|
|
\›$ m ñ ¥$ ¤¸$ 4¸$
|
|||
|
|
\Á$ m ñ Ë$ ú ñ Ú$ üš#Ì Ù å$ ë$
|
|||
|
|
ì$ k üª  üÞ Ž ü‹ á üº ² üé ƒ ’ $Î ñ $À ñ Œ ñ Œ ñ Š ñ ˆ ñ ¹ñ ¹ ñ · ñ µ ñ æñ æ ñ ä ñ â ñ ñ ñ ñ ¯$ @ ñ > ñ > ñ ñ ñ æ ñ æ ñ º ñ º §Ô seed_aÁj seed_bÁ‰ seed_cÁ¨
|
|||
|
|
seed_dÁÇ fb Ž ñ . Ž ñ ö Ž ñ “ Ž ñ _ Ž ñ ' Ž ñ Ä Ž ñ � Ž ñ X Ž ñ õ Ž ñ Á Ž ñ ‰ Ž ñ A m ñ m ñ ß m ñ ® m ñ ¬÷" L÷" ý" ? # / @ «6 ? ø" ñ M ? ©6 o . ñ y ? ©6 Lƒ# ‰# ©6«6 # / @ «6 ? „# ñ M ©6 o . ñ y ©6 8
|
|||
|
|
‹# Ì÷"
|
|||
|
|
�# ñ üÞ"3 m ñ ñ" ñ ¤ ñ ¤ «6 ¬ ³ ñ # «6 + 2 Z _Á 0Á ó9 1Á ó9 2Á ³$ 4Á Ó£…ˆj?$ñ 0x243f6a8885a308d3Á Dsp.Šñ 0x13198a2e03707344Á Ð1Ÿ)"8 ¤ñ 0xa4093822299f31d0Á ‰lNì˜ú.ñ 0x082efa98ec4e6c89Á wÐ8æ!(Eñ 0x452821e638d01377Á l é4ÏfT¾ñ 0xbe5466cf34e90c6cÁ ÝP|É·)¬Àñ 0xc0ac29b7c97c50ddÁ GµµÕ„?ñ 0x3f84d5b5b5470917Á ûy‰ÙÕ’ñ 0x9216d5d98979fb1bÁ ¬µß˜¦ 1Ññ 0xd1310ba698dfb5acÁ $¥3 \¬3 3 ¶3 LÅ3 Å3 Ì= Í3 ü¬3#
|
|||
|
|
|
|||
|
|
d¸3
|
|||
|
|
ÈÔ ‚ V ¼¸3
|
|||
|
|
Î3 Ý3 $â3 \â3 ñ ì3 û3
|
|||
|
|
d€4 $�4
|
|||
|
|
‰4 @ ©6«6 6
|
|||
|
|
B € «6 R < @ ©6 q Y @ ©6 ‹4 œ€4
|
|||
|
|
ñ ’4 Â6 Ç6
|
|||
|
|
<Â6 È6 Î6
|
|||
|
|
ß? � üû*ä ü¡3® üÙ3ö ü÷3Ø ñ §+ ñ ”+ ñ œ+ Ì= D Ì= D ñ D Ì= # ñ # ñ ÁÌ= Á ñ žÌ= ž Ì= ž «6 ® µ ñ ñ Ä Ĉ …Ð loÁ3 hiÁ
|
|||
|
|
ù ÍA ÜA ŒÍA
|
|||
|
|
dÏA
|
|||
|
|
×Ò E 7 |ÏA ÝA ™E � üó?¦ ñ œ@ ñ ‰@ «6 ‘@ ñ ¢ «6 – Ã# ½' R 3W…†‡ˆ‰Š‹Œ�Ž��‘’í «Tû% Ù „ü ƒX ü F C This crate provides foldhash, a fast, non-cryptographic, minimallyÁ üGK H DoS-resistant hashing algorithm designed for computational uses such asÁ ü“2 / hashmaps, bloom filters, count sketching, etc.Á Æú üÊ) & When should you **not** use foldhash:Á ôú üøL I - You are afraid of people studying your long-running program's behaviorÁ üÅO L to reverse engineer its internal random state and using this knowledge toÁ ü•H E create many colliding inputs for computational complexity attacks.Á Þú üâH E - You expect foldhash to have a consistent output across versions orÁ ü«P M platforms, such as for persistent file formats or communication protocols.Á 4ü Á üƒH E - You are relying on foldhash's properties for any kind of security.Á üÌD A Foldhash is **not appropriate for any cryptographic purpose**.Á ‘ú ü•N K Foldhash has two variants, one optimized for speed which is ideal for dataÁ üäI F structures such as hash maps and bloom filters, and one optimized forÁ ü®= : statistical quality which is ideal for algorithms such asÁ üì@ = [HyperLogLog](https://en.wikipedia.org/wiki/HyperLogLog) andÁ ü5 2 [MinHash](https://en.wikipedia.org/wiki/MinHash).Á ãú üçO L Foldhash can be used in a `#![no_std]` environment by disabling its defaultÁ ¤· `"std"` feature.Á Ì ú \Ð # UsageÁ Ü ú üà N K The easiest way to use this crate with the standard library [`HashMap`] orÁ ü¯
|
|||
|
|
I F [`HashSet`] is to import them from `foldhash` instead, along with theÁ üù
|
|||
|
|
L I extension traits to make [`HashMap::new`] and [`HashMap::with_capacity`]Á ÄÆ work out-of-the-box:Á ß ú \ã ```rustÁ üï ( % use foldhash::{HashMap, HashMapExt};Á ˜ ú üœ let mut hm = HashMap::new();Á ܽ hm.insert(42, "hello");Á <Ù ```Á á ú üå O L You can also avoid the convenience types and do it manually by initializingÁ üµ
|
|||
|
|
[ X a [`RandomState`](fast::RandomState), for example if you are using a different hash mapÁ ü‘B ? implementation like [`hashbrown`](https://docs.rs/hashbrown/):Á Ôú \غR Üä use hashbrown::HashMap;Á ü€$ ! use foldhash::fast::RandomState;Á ¥ú ü©> ; let mut hm = HashMap::with_hasher(RandomState::default());Á äè hm.insert("foo", "bar");Á <…ÚS �ú ü‘I F The above methods are the recommended way to use foldhash, which willÁ üÛO L automatically generate a randomly generated hasher instance for you. If youÁ ü«Q N absolutely must have determinism you can use [`FixedState`](fast::FixedState)Á üýI F instead, but note that this makes you trivially vulnerable to HashDoSÁ üÇI F attacks and might lead to quadratic runtime when moving data from oneÁ ì‘ hashmap/set into another:Á ¯ú \³ºR ü¿" use std::collections::HashSet;Á üâ# use foldhash::fast::FixedState;Á †ú üŠA > let mut hm = HashSet::with_hasher(FixedState::with_seed(42));Á äÌ hm.insert([1, 10, 100]);Á <éÚS ñú üõL I If you rely on statistical properties of the hash for the correctness ofÁ üÂX U your algorithm, such as in [HyperLogLog](https://en.wikipedia.org/wiki/HyperLogLog),Á ü›D A it is suggested to use the [`RandomState`](quality::RandomState)Á üàN K or [`FixedState`](quality::FixedState) from the [`quality`] module insteadÁ ü¯L I of the [`fast`] module. The latter is optimized purely for speed in hashÁ üü3 0 tables and has known statistical imperfections.Á °ú ü´P M Finally, you can also directly use the [`RandomState`](quality::RandomState)Á ü…K H or [`FixedState`](quality::FixedState) to manually hash items using theÁ üÑ2 / [`BuildHasher`](std::hash::BuildHasher) trait:Á \„ºR ü� use std::hash::BuildHasher;Á ü°' $ use foldhash::quality::RandomState;Á Øú üÜ. + let random_state = RandomState::default();Á ü‹4 1 let hash = random_state.hash_one("hello world");Á <ÀÚS Èú tÌ ## SeedingÁ Ûú üßN K Foldhash relies on a single 8-byte per-hasher seed which should be ideallyÁ ü® B ? be different from each instance to instance, and also a largerÁ üñ C @ [`SharedSeed`] which may be shared by many different instances.Á µ ú ü¹ M J To reduce overhead, this [`SharedSeed`] is typically initialized once andÁ ü‡ P M stored. To prevent each hashmap unnecessarily containing a reference to thisÁ üØ L I value there are three kinds of [`BuildHasher`](core::hash::BuildHasher)sÁ ü¥ : 7 foldhash provides (both for [`fast`] and [`quality`]):Á à ú üä C @ 1. [`RandomState`](fast::RandomState), which always generates aÁ ü¨ a ^ random per-hasher seed and implicitly stores a reference to [`SharedSeed::global_random`].Á üŠ!F C 2. [`FixedState`](fast::FixedState), which by default uses a fixedÁ üÑ!Y V per-hasher seed and implicitly stores a reference to [`SharedSeed::global_fixed`].Á ü«"K H 3. [`SeedableRandomState`](fast::SeedableRandomState), which works likeÁ ü÷"U R [`RandomState`](fast::RandomState) by default but can be seeded in any manner.Á üÍ#R O This state must include an explicit reference to a [`SharedSeed`], and thusÁ ü $O L this struct is 16 bytes as opposed to just 8 bytes for the previous two.Á 3W…†‡ˆ‰Š‹Œ�Ž��‘’í «
|
|||
|
|
Ù „+.1dÄ% ü 4 1 The foldhash implementation optimized for speed.Á $Ì% “�¦¯\\G Åe ‘4T
|
|||
|
|
Œ |ª � Á |» ’
|
|||
|
|
© ŒÌ ‘ š dß � •
|
|||
|
|
Tí ˆ T:¿Á±³\b¦¨™›†ˆ,¢{}ln]_NP?A|Å Ú üÌN üÛF C Initializes this [`FoldHasher`] with the given per-hasher seed andÁ œ¦ [`SharedSeed`].ÁLÓ èñ è’ Ú €
|
|||
|
|
†
|
|||
|
|
|Ýò
|
|||
|
|
\óüõ ,Lø é éÚ ¥ ¥ ‘
|
|||
|
|
Íì™v ‚
|
|||
|
|
æ ™vÌ= T…
|
|||
|
|
|
|||
|
|
™v$–
|
|||
|
|
à œ
|
|||
|
|
,. Ô› Ú ¤e ¥e ¦e §e ¨e ©e ªe £e üÒ!,Õ ê ë êÚ ë
|
|||
|
|
ó9 žv Û
|
|||
|
|
$à bytesÁ,æìê Dí ì ìÚó9žv ö
|
|||
|
|
$û ´ � üÆ LÉ í íÚžv Ó
|
|||
|
|
$Ø ´ Þ ü¤ L§ î îÚ«6žv ±
|
|||
|
|
$¶ ´ ¼ ü‚ L… ï ïÚñ žv �
|
|||
|
|
$” ´ š üà !Tã ð ðÚÌ=žv î
|
|||
|
|
$ó ´ ù ü»"#\¾" ñ ñÚ³$žv Ê"
|
|||
|
|
$Ï"´ Õ"¼Í$4Ð$ ò òÚ ñ ×$
|
|||
|
|
$Ø$äµ( Ú ´ ¤î(<ñ( Ú
|
|||
|
|
ü‡* Ú!" Æe Çe " \®*4³* Úüã*$dæ* ó óÚ Ú ó*
|