120 lines
12 KiB
Plaintext
120 lines
12 KiB
Plaintext
|
!<arch>
|
|||
|
|
#1/12 0 0 0 0 28 `
|
|||
|
|
__.SYMDEF #1/12 0 0 0 644 11092 `
|
|||
|
|
lib.rmeta Ïúíþ ˜ * 8 * .rmeta __DWARF * 8 2 @+ @+ P rust
|
|||
|
|
‚( #rustc 1.93.0 (254b59607 2026-01-19)Á“õ…·fÊvŠ ¦%g- -c48c539199cbc88bÁ ³VOÐêùÿ²?ÑL¼�§Ì± -a7a40eb546f9e2b0Á á\ƒ¦è3$|]åŒ[IÚ tæ -14b12edc9f8cd90bÁ ë&Gf·Ã ¬ëñq:¤»b -bb76018b1173caf6Áà 9m Ù„«ÐÒþá•c‘B; -030c5b0bba47cc8fÁ rustc_std_workspace_coreÁÛ¹þÓ7>H%¸ÚÉ’› -4b81d37a5530864dÁ üÃùs<Uß7VyóHr#QÏ -c66cc7807550ce25Á miniz_oxideÁõFÖˆÚ™ª‹"ÞXzLVª -62cbc7af83058505Á adler2Á—wÉD‘嵯�|6¨%Œ
|
|||
|
|
+ -2f171dd2394b4b62Á hashbrownÁ,ïcV¼¨ø¢:Ê\'È߈ -9571ba9e0f6c7a90Á rustc_std_workspace_allocÁ%¥Èxµù·¼5Ä3Bœ -aac566ad65903fa4Á
|
|||
|
|
std_detectÁMmáýZ^9õ Îà§e˜÷e -2edb296e590136d8Á rustc_demangleÁ@¼§VÉNb˜æ¨fHÌ+V3 -53b132e4a2fa6e26Á cfg_ifÁfÝv�.Å"ÒÜuPp¹ˆ¶ -f76b385d7d4d7f3eÁ addr2lineÁÕú-WiúQVÓ¬
|
|||
|
|
µT§�5 -fe25100bd73e48e4Á gimliÁ¹xLáÇí÷‘o ±Ñ8£Å -265ba9e6e4f70b3fÁ objectÁÔ³ÝzÓÿ¶ò°öM›¼òü` -9ae0d1f8ea52a318Á memchrÁRÎ÷׎™te~QÓ¿ØC\Ò -0bff3c8e8f4e489eÁ –©H�tGNÏ ·ˆ!á -d69228d077d46f36Á á,¨ ¶<� “,‹ |� Œ€ …<š ¶<ô “,þ |ô Œó ª4Ñ ¶< “,· | Œ¬ BuildHasherDefaultÁ”Ù ¶5“31/1 à$Ú à$Ï “ FnvHasherÁ
|
|||
|
|
|
|||
|
|
|
|||
|
|
ì
|
|||
|
|
> with_keyÁ finishÁ writeÁ FnvBuildHasherÁ
|
|||
|
|
FnvHashMapÁ KÁ VÁ
|
|||
|
|
FnvHashSetÁ ™
|
|||
|
|
|
|||
|
|
|
|||
|
|
Ä
|
|||
|
|
|
|||
|
|
œ ì ¥�°3˜53 ÃbÌ
|
|||
|
|
|
|||
|
|
|
|||
|
|
Ä
|
|||
|
|
Ãbì‰
|
|||
|
|
|
|||
|
|
”“ %#"„äœòË ¬ üåG Ì Lõ tà
|
|||
|
|
|
|||
|
|
ô ü¯E Ì LÌ ½ ¿ keyÁ 0 4È ½ Ô ü¦. ½ º Ì ,° / D¢ ½ dÊ $Ð
|
|||
|
|
–q ,Ê 4Ð `Ê
|
|||
|
|
±JÙiÙi IterÁ Üi÷ ®i Ýi
|
|||
|
|
end_or_lenÁ®i Þi _markerÁ®i t¸%ýN( å ¡ } � ø¾ƒ š ©®
|
|||
|
|
àK� ¿ Ç Ë × é $Â
|
|||
|
|
� å $ì ,ô
|
|||
|
|
|
|||
|
|
tó
|
|||
|
|
½ äå $– ü– d›
|
|||
|
|
÷Ë (l¨ ³ ½ Ü› $Ý |Ó
|
|||
|
|
|
|||
|
|
¼Ë é ü�' M üè� ü”Õ o ü×j ‰ Ì Lñ
|
|||
|
|
å ,ü ½ u � = � q � Mø°ú°û°Ð ü° ý°�þ°ì H�ˈXêE>€ ™ � ¤ € Ž ³ ½ å ¶ ½ € ½ — Ì F ½ [ × bytesÁÜ ¢U £ ! byteÁB
|
|||
|
|
P ßp ŠJ °P à ¤™
|
|||
|
|
|
|||
|
|
# Ì . ½ 5 < J
|
|||
|
|
|
|||
|
|
_ k Ì v ½ } „
|
|||
|
|
“ …<Ú Ä … Æ ª4‹ Ãb ®”“ ëb §<× Æ ©<à ´ ü ê• ü 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`
|
|||
|
|
|
|||
|
|
Similarly, `FnvHashSet` is a type alias for the standard library’s `HashSet`
|
|||
|
|
with FNV.
|
|||
|
|
|
|||
|
|
```rust
|
|||
|
|
use fnv::FnvHashSet;
|
|||
|
|
|
|||
|
|
let mut set = FnvHashSet::default();
|
|||
|
|
set.insert(1);
|
|||
|
|
set.insert(2);
|
|||
|
|
|
|||
|
|
set = FnvHashSet::with_capacity_and_hasher(10, Default::default());
|
|||
|
|
set.insert(1);
|
|||
|
|
set.insert(2);
|
|||
|
|
```
|
|||
|
|
Á !üŒ é ü† ï ø Ë üüB ? [chongo]: http://www.isthe.com/chongo/tech/comp/fnv/index.htmlÁ ü¿O L [faq]: https://www.rust-lang.org/en-US/faq.html#why-are-rusts-hashmaps-slowÁ ü�6 3 [graphs]: https://cglab.ca/~abeinges/blah/hash-rs/Á
|
|||
|
|
“
|
|||
|
|
…
|
|||
|
|
Ä …0
|
|||
|
|
Æ ª
|
|||
|
|
Ãb ®
|
|||
|
|
ëb §
|
|||
|
|
Æ ©
|
|||
|
|
´ ¬Ì ’
|
|||
|
|
üÿ' u
|
|||
|
|
x
|
|||
|
|
h
|
|||
|
|
k
|
|||
|
|
üÄ$ `
|
|||
|
|
c
|
|||
|
|
S
|
|||
|
|
V
|
|||
|
|
_
|
|||
|
|
üï> ; An implementation of the Fowler–Noll–Vo hash function.Á ® Ë ü²? < See the [crate documentation](index.html) for more details.Á L¤ Ì ¥�°3˜53 ½ Ì _
|
|||
|
|
1 ½ Ì
|
|||
|
|
|
|||
|
|
|
|||
|
|
®
|
|||
|
|
|
|||
|
|
½ Ôµ Ì Å Ìå <è Ì
|
|||
|
|
|
|||
|
|
|
|||
|
|
t° Ì ü¯& üÅ< 9 Create an FNV hasher starting with a state correspondingÁ ´† to the hash `key`.ÁD¶ ½ Ì
|
|||
|
|
¾ 4Ìø Ì Äb Åb ¼¦ 4© Ì ½ °
|
|||
|
|
$± üè! ,ë Ì ¤ � ñ
|
|||
|
|
$ö þ) ¼” üí& # A builder for default FNV hashers.Át� ëbëb ìb® îbì‡b Cþãð9Ì Ì’ üÎ + ( A `HashMap` using a default FNV hasher.Á» ü ÿ � 8¶ <€ ˆ 7“ ,Š ¼ú T› —
|
|||
|
|
Ÿ
|
|||
|
|
©â —
|
|||
|
|
¦ ©âŸ
|
|||
|
|
© ÆÆ § Ê baseÁµ ®`§L]ýB¸4Ë4ä2PR JL ´’ üÎ + ( A `HashSet` using a default FNV hasher.Á» ü ÿ � 8¶ <€ ˆ 7“ ,Š ¼ú T› ™ ©â ™ ¦ ´ ´ © · è3¢ >D“Úüx«
|
|||
|
|
¼6ä268 ×÷
|
|||
|
|
�÷
|