An efficient hash map for node IDs
| FnvHasher |
A speedy hash algorithm for node ids and def ids. The hashmap in
libcollections by default uses SipHash which isn't quite as speedy as we
want. In the compiler we're not really worried about DOS attempts, so we
just default to a non-cryptographic hash.
|
Keyboard shortcuts
- ?
- Show this help dialog
- S
- Focus the search field
- ⇤
- Move up in search results
- ⇥
- Move down in search results
- ⏎
- Go to active search result
Search tricks
Prefix searches with a type followed by a colon (e.g.
fn:) to restrict the search to a given type.
Accepted types are: fn, mod,
struct, enum,
trait, typedef (or
tdef).
