hashindexed 0.1.1

A cache. A set which compares elements in a customisable way without overriding the eq() and hash() functions on the type itself.
Documentation
  • Coverage
  • 100%
    24 out of 24 items documented3 out of 24 items with examples
  • Size
  • Source code size: 23.07 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 2.47 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Links
  • Homepage
  • dhardy/hashindexed
    1 1 2
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • dhardy

Hash-indexed collection

You could call this a cache, or a kind of set. It is a simple wrapper around HashSet to allow values of type T to be stored in a set indexed by some type K, where values of type K can be somehow "extracted" from those of type T.

Check documentation on type HashIndexed for usage.

License

Licensed under either of

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.