Adds value to self if it wasn't part of it before.
value to add
Adds all values from start (inclusive) to start + n_items
(exclusive) in self.
first value to add
number of consecutive values to add
Adds the closed range [first, last], so first, last and all
values in between. first must be smaller than last.
first value to add
last value to add
Interprets the values as a 2-dimensional boolean grid with the given stride
and inside that grid, adds a rectangle with the given width and height.
first value to add
width of the rectangle
height of the rectangle
row stride of the grid
Checks if the given value has been added to self
the value to check
Creates a copy of self.
Sets self to be the symmetric difference of self and other.
The symmetric difference is set self to contain all values that
were either contained in self or in other, but not in both.
This operation is also called an XOR.
It is allowed for self and other to be the same bitset. The bitset
will be emptied in that case.
the GtkBitset to compute the difference from
Returns %TRUE if self and other contain the same values.
another GtkBitset
Returns the largest value in self.
If self is empty, 0 is returned.
Returns the smallest value in self.
If self is empty, G_MAXUINT is returned.
Returns the value of the nth item in self.
If nth is >= the size of self, 0 is returned.
index of the item to get
Gets the number of values that were added to the set.
For example, if the set is empty, 0 is returned.
Note that this function returns a guint64, because when all
values are set, the return value is G_MAXUINT + 1. Unless you
are sure this cannot happen (it can't with GListModel), be sure
to use a 64bit type.
Gets the number of values that are part of the set from first to last
(inclusive).
Note that this function returns a guint64, because when all values are
set, the return value is G_MAXUINT + 1. Unless you are sure this cannot
happen (it can't with GListModel), be sure to use a 64bit type.
the first element to include
the last element to include
Sets self to be the intersection of self and other.
In other words, remove all values from self that are not part of other.
It is allowed for self and other to be the same bitset. Nothing will
happen in that case.
the GtkBitset to intersect with
Check if no value is contained in bitset.
Acquires a reference on the given GtkBitset.
Removes value from self if it was part of it before.
value to add
Removes all values from the bitset so that it is empty again.
Removes all values from start (inclusive) to start + n_items (exclusive)
in self.
first value to remove
number of consecutive values to remove
Removes the closed range [first, last], so first, last and all
values in between. first must be smaller than last.
first value to remove
last value to remove
Interprets the values as a 2-dimensional boolean grid with the given stride
and inside that grid, removes a rectangle with the given width and height.
first value to remove
width of the rectangle
height of the rectangle
row stride of the grid
Shifts all values in self to the left by amount.
Values smaller than amount are discarded.
amount to shift all values to the left
Shifts all values in self to the right by amount.
Values that end up too large to be held in a #guint are discarded.
amount to shift all values to the right
This is a support function for GListModel handling, by mirroring
the GlistModel::items-changed signal.
First, it "cuts" the values from position to removed from
the bitset. That is, it removes all those values and shifts
all larger values to the left by removed places.
Then, it "pastes" new room into the bitset by shifting all values
larger than position by added spaces to the right. This frees
up space that can then be filled.
position at which to slice
number of values to remove
number of values to add
Sets self to be the subtraction of other from self.
In other words, remove all values from self that are part of other.
It is allowed for self and other to be the same bitset. The bitset
will be emptied in that case.
the GtkBitset to subtract
Sets self to be the union of self and other.
That is, add all values from other into self that weren't part of it.
It is allowed for self and other to be the same bitset. Nothing will
happen in that case.
the GtkBitset to union with
Releases a reference on the given GtkBitset.
If the reference was the last, the resources associated to the self are
freed.
Creates a new empty bitset.
Creates a bitset with the given range set.
first value to add
number of consecutive values to add
A
GtkBitsetrepresents 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.
GtkBitsetalso 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 [struct
Gtk.BitsetIter].The main use case for
GtkBitsetis implementing complex selections for [ifaceGtk.SelectionModel].