127 lines
12 KiB
Plaintext
127 lines
12 KiB
Plaintext
|
!<arch>
|
|||
|
|
/ 0 0 0 0 8 `
|
|||
|
|
// 56 `
|
|||
|
|
fnv-f08e09094dee699d.fnv.ca2005aab9f1f99-cgu.0.rcgu.o/
|
|||
|
|
|
|||
|
|
lib.rmeta/ 0 0 0 644 12224 `
|
|||
|
|
asm linking ª_.rmetarust
|
|||
|
|
$. #rustc 1.90.0 (1159e78c4 2025-09-14)Á®‘K:k VQÛ‘å÷Ú†
|
|||
|
|
-896f64118b892ee1Á ˜ø½E—y88àìOg[ -a0f3a77406fcd134Á Ù$î„xÁLòd ƒCøm Q1 -d07b5e2c2a0f2336Á ÒµÅL ®Ùp,ØnWš÷*�Ó -eed239b623db52f0Á’ Êï#|Ø°*�ªuz�¥zÑ -22622f072d82cf02Á rustc_std_workspace_coreÁ¡Lˆ"'WycÈú®¨Ç?˜ -62776efff7f53db8Á �/»óoÊ•�Ú<ã] õ -c656a6ce8faf7d92Á cfg_ifÁNgpÝiä5R-z#ë~· -a28c175c29d7456aÁ miniz_oxideÁ'&=ÝTÒ4B1K8Ý=ïx -99a9ab44d6ca7927Á adler2ÁdR¯Š³Y^Ø÷v˜z¸ê -6814a63e25073aa9Á hashbrownÁøOvtÊ(äSÿídRœi è -a938d680cd164e6dÁ rustc_std_workspace_allocÁ”–«cÒXdŸEÁ¨:dn, -60b329376530a3eeÁ
|
|||
|
|
std_detectÁÌÆ0 >g×Äv U�„X -d0198f5966fd6781Á rustc_demangleÁùDw'$Oõú‚·:Ä -f9a3916c8c8bb672Á dlmallocÁßÊ '›U}ÌG#' w -d6bed5b52996429dÁ Ù,¨ Ž<� ®,‹ |� Œ€ „<š Ž<ô ®,þ |ô Œó ¨4Ñ Ž< ®,· | Œ¬ BuildHasherDefaultÁ”Ù Ž5®31/1 ú$Ú ú$Ï ® FnvHasherÁ
|
|||
|
|
|
|||
|
|
|
|||
|
|
ò
|
|||
|
|
> with_keyÁ finishÁ writeÁ FnvBuildHasherÁ
|
|||
|
|
FnvHashMapÁ KÁ VÁ
|
|||
|
|
FnvHashSetÁ ” 8 8 8î
|
|||
|
|
|
|||
|
|
æ ò ^}qê#cZç í^œ
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
î
|
|||
|
|
í^ì‰ %#"„äœòËœ
|
|||
|
|
¬ üåG œ
|
|||
|
|
Lõ tà
|
|||
|
|
ô ü¯E œ
|
|||
|
|
LÌ ¿ keyÁ 0 4È ò Ô ü¦. ò º œ
|
|||
|
|
,° / D¢ ò }Šœ(
|
|||
|
|
]æY
|
|||
|
|
|
|||
|
|
×U! ½“˜!
|
|||
|
|
|
|||
|
|
ý€˜,!
|
|||
|
|
¿ Ñ
|
|||
|
|
|
|||
|
|
«˜!
|
|||
|
|
ÍÌYeÎYý˜~$! Ñ
|
|||
|
|
ýæÑ D
|
|||
|
|
|
|||
|
|
âY> Ð
|
|||
|
|
|
|||
|
|
äY¹¾
|
|||
|
|
`Ê ø¾ƒ $).A¢2w ù§;Cwù®;<w ¿¿ Ë Á÷ § ɪs »¤Ñ
|
|||
|
|
mÞ’!à —uï’!ö —ýÞ’ !
|
|||
|
|
ü’! — ®<wïôùÀ |Ó $Ý
|
|||
|
|
á ¼Ë è é (xQý=wý™Ì(! m¬Ì! Ð
|
|||
|
|
y
|
|||
|
|
ÀÌ! ý†Ì=! ¿ Ñ
|
|||
|
|
|
|||
|
|
ÂÌ! ©ò=w †>wÕ’ˆ! MÐ'D" Ð
|
|||
|
|
�!
|
|||
|
|
«ˆ! ¹—@w Œ· Ñ
|
|||
|
|
:@F$Â Š „$ì tó ,ô ò € äå ü– $–
|
|||
|
|
|
|||
|
|
ù À¢# #
|
|||
|
|
Ë ³ ò µ
|
|||
|
|
ü�' À $üè� ü”Õ 2 ü×j ýØ›G( ¿mÑ
|
|||
|
|
4Ð ý¢�Y �f Ñ
|
|||
|
|
CýÜÖY ýû·Y ýý¯Y ýÝT‘! Ó
|
|||
|
|
Ñ
|
|||
|
|
Å‘Yýõ–¿! âŽÑ
|
|||
|
|
5ªYýÉ{û!
|
|||
|
|
ÝŽE˜˜!
|
|||
|
|
ý¯Æ`C äÑ
|
|||
|
|
½Yý±ÓÙC èÑ
|
|||
|
|
åñÆC N ÝÑ
|
|||
|
|
EÒYý•Çø
|
|||
|
|
D –Ñ
|
|||
|
|
EÛYýÊM,X öGýeýe IterÁ €f§ Òe �f
|
|||
|
|
end_or_lenÁÒe ‚f _markerÁÒe ~çáƒX Ç Ñ
|
|||
|
|
É ùÙ0õw ÅÆ Ñ
|
|||
|
|
ã ù˜2¶w ù¼2’w ùÓ4µw ýª:çN ŽÑ
|
|||
|
|
1è4wý˜@N ‡Ñ
|
|||
|
|
eü=NùÇñ¡ ±Ë �à8wýŒ*�A Õ 9Î$AùÞÉ[ ÓÐ ù³Ì4| èÑ
|
|||
|
|
ùÅ8,wý±’R! §Ñ
|
|||
|
|
wÝ ÝÑ
|
|||
|
|
Eã’!ó ÝÑ
|
|||
|
|
Eõ’!ýøÈÓ! èÑ
|
|||
|
|
1�>w$ ÝÑ
|
|||
|
|
E±Ì! ý¢†’! ÞÑ
|
|||
|
|
Y¢@wW ÝÑ
|
|||
|
|
E—ˆ! ýœ'CD õÑ
|
|||
|
|
e ˆ! ù ÿ¡n ÇÉ Ü› � ‰ œ
|
|||
|
|
Lñ Ž ,ü ò ü Œ·Ž·�·Í �· ‘·Š’·ò Æ/2uB<Ì „ Õ „ «ò ˜ ò � Ñ
|
|||
|
|
� ò X ò X œ
|
|||
|
|
ò ù àY ° ÿY Ð
|
|||
|
|
U�Y— x— € Ž m×U! Ð
|
|||
|
|
<
|
|||
|
|
° œ2w ° ° 0 „ ‰œ@w— — Ð
|
|||
|
|
J Ð
|
|||
|
|
H Ð
|
|||
|
|
Ü ° Õ J bytesÁQ ùü ôÕÀ ° ôÕÀÐ
|
|||
|
|
ôÕÀÃ Ã Ä PhantomDataÁ ±öµ ,±ÀU„ô Š byteÁ, OM¡Y œÑ
|
|||
|
|
I¯4w œÑ
|
|||
|
|
|
|||
|
|
ülÑ
|
|||
|
|
|
|||
|
|
›Ì éè$A ¤™
|
|||
|
|
! œ
|
|||
|
|
, ò 3 : H
|
|||
|
|
[ g œ
|
|||
|
|
r ò y €
|
|||
|
|
®ô „<Ú î „ ð ¨4‹ í^ ø”“ •_ ¥<× þ §<à í ü ê• ü H E An implementation of the [Fowler–Noll–Vo hash function][chongo].Á I © dM ## AboutÁ Z © ü^J G The FNV hash function is a custom `Hasher` implementation that is moreÁ ü©$ ! efficient for smaller hash keys.Á Î © üÒN K [The Rust FAQ states that][faq] while the default `Hasher` implementation,Á ü¡N K SipHash, is good in many cases, it is notably slower than other algorithmsÁ üðM J with short keys, such as when you have a map of integers to other values.Á ü¾> ; In cases like these, [FNV is demonstrably faster][graphs].Á ý © ü�F C Its disadvantages are that it performs badly on larger inputs, andÁ üÈL I provides no protection against collision attacks, where a malicious userÁ ü•G D can craft specific keys designed to slow a hasher down. Thus, it isÁ üÝM J important to profile your program to ensure that you are using small hashÁ ü«L I keys, and be certain that your program could not be exposed to maliciousÁ üø0 - inputs (including being a networked server).Á © © üA > The Rust compiler itself uses FNV, as it is not worried aboutÁ üïM J denial-of-service attacks, and can assume that its inputs are going to beÁ ü½' $ small—a perfect use case for FNV.Á å ©ÿ † Š ä
|
|||
|
|
|
|||
|
|
## Using FNV in a `HashMap`
|
|||
|
|
|
|||
|
|
The `FnvHashMap` type alias is the easiest way to use the standard library’s
|
|||
|
|
`HashMap` with FNV.
|
|||
|
|
|
|||
|
|
```rust
|
|||
|
|
use fnv::FnvHashMap;
|
|||
|
|
|
|||
|
|
let mut map = FnvHashMap::default();
|
|||
|
|
map.insert(1, "one");
|
|||
|
|
map.insert(2, "two");
|
|||
|
|
|
|||
|
|
map = FnvHashMap::with_capacity_and_hasher(10, Default::default());
|
|||
|
|
map.insert(1, "one");
|
|||
|
|
map.insert(2, "two");
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
Note, the standard library’s `HashMap::new` and `HashMap::with_capacity`
|
|||
|
|
are only implemented for the `RandomState` hasher, so using `Default` to
|
|||
|
|
get the hasher is the next best option.
|
|||
|
|
|
|||
|
|
## Using FNV in a `HashSet`
|
|||
|
|
|