trashmap 0.1.3

A HashMap and HashSet that operate directly on hashes instead of keys, avoiding rehashing
Documentation
  • Coverage
  • 92.31%
    24 out of 26 items documented3 out of 25 items with examples
  • Size
  • Source code size: 26.23 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 2.39 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 13s Average build duration of successful builds.
  • all releases: 13s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • Manishearth/trashmap
    4 0 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • Manishearth

trashmap

Build Status Current Version License: MIT/Apache-2.0

This crate provides TrashMap and TrashSet types, which allow you to directly use the key hash to operate with your entries. This is typically useful for when it's cheap to hold on to the hash value (e.g. within a single stack frame) and you don't want to incur the cost of rehashing on each access (but you can't use Entry as the map may change in the process)

The Trash type is used to represent computed hashes, lookups via Trash are cheap.