Strategies for working with bit sets.
BitSet itself, this also defines strategies for all the primitive
integer types. These strategies are appropriate for integers which are used
as bit flags, etc; e.g., where the most reasonable simplification of
0 (clearing one bit) and not
63 (clearing one bit but setting 6
others). For integers treated as numeric values, see the corresponding
modules of the
num module instead.
- Generates values as a set of bits between the two bounds.
- Value tree produced by
- Generates bit sets with a particular number of bits set.
- A bit set is a set of bit flags.
- Trait for types which can be handled with