Expand description
§Simple BitSet
Basically a HashSet<u8> but faster. Even though for a HashSet operations run in O(1) time, for a T that has a limited number of possible
values, there’s faster approaches than hashing. A BitSet works by storing each element in a single bit, then using very fast bitwise
operations in order to perform set functions on those bits.
Simple BitSet is an implementation of BitSet that is purposefully not generic. It only stores u8s. This means less and easier to read code, and it allows optimization work to be more focused.
For storage BitSet uses 256 bits. This allows all single byte values to be stored. By default for convenience bitset is Copy, but this can be changed via feature flags.
If your use case involves some type that can be represented internally in a single byte, such as a enum with Repr u8, or ASCII chars, and you wish to use Simple BitSet, then I’d recommend you make a Newtype of bitset.
If you need to store a type that has more than 256 possible values, this crate isn’t a good match for that use case.
§Features
copy- Enabled by default. Causes BitSet to implement the Copy trait.compatibility-methods- Disabled by default. Include methods that don’t do anything other than improve compatability with HashMap.