wrappinghashset 0.5.0

A HashSet that remembers the last key it returned with its iterator and subsequently will wrap around and only return all of the keys once per call. This is useful if you want to use a set both via hashing, and iterate over the members as a round-robin list.
Documentation
  • Coverage
  • 14.29%
    1 out of 7 items documented0 out of 6 items with examples
  • Size
  • Source code size: 19.26 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 2.3 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Links
  • SpamapS/wrappinghashset
    1 0 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • SpamapS

Greetings! This is a tiny library I created to allow round-robin access to a hashset. It stores an extra offset in the struct to keep track of which offset it returned last time, so that the next call to iter() will return the next item, and then only all of the rest, one time.

Please do report issues if you find them. Apologies for the lack of docs, but it pretty much works like std::collections::HashSet