Closed androm3da closed 5 years ago
I can provide the implementation if it's considered useful. Otherwise I think I'll make another crate that's inspired by fixedbitset
.
I think such a data structure would be useful in situations where allocation must be avoided and the size of the set is known at compile time. However such a data structure is fundamentally different from fixedbitset (which allows for dynamically sized sets) so should be contained in a separate crate. I would encourage you to do so!
How about a
FixedBitSet
that uses static size, array representation and providesCopy
trait? Like the standard library, it could probably be limited in the sizes it would support, but up to ~256 bits or so could be pretty useful for a lot of use cases.