A bitset allows adding a set of integers and provides support for set operations
like unions, intersections and checks for equality or if a value is contained
in the set. gtk.bitset.Bitset also contains various functions to query metadata about
the bitset, such as the minimum or maximum values or its size.
A gtk.bitset.Bitset represents a set of unsigned integers.
Another name for this data structure is "bitmap".
The current implementation is based on roaring bitmaps.
A bitset allows adding a set of integers and provides support for set operations like unions, intersections and checks for equality or if a value is contained in the set. gtk.bitset.Bitset also contains various functions to query metadata about the bitset, such as the minimum or maximum values or its size.
The fastest way to iterate values in a bitset is gtk.bitset_iter.BitsetIter.
The main use case for gtk.bitset.Bitset is implementing complex selections for gtk.selection_model.SelectionModel.