Lines Matching refs:bits
53 idx_t _size; // Size of bitmap (in bits)
61 // bitmap words are 32 bits, return a number 0 <= n <= 31).
86 // Utilities for ranges of bits. Ranges are half-open [beg, end).
134 // Zeros any newly-addressable bits.
178 // Update a range of bits. Ranges are half-open [beg, end).
188 // Update a range of bits, using a hint about the size. Currently only
231 // Returns the number of bits set in the bitmap.
235 void set_union(BitMap bits);
236 void set_difference(BitMap bits);
237 void set_intersection(BitMap bits);
238 // Returns true iff "this" is a superset of "bits".
239 bool contains(const BitMap bits) const;
240 // Returns true iff "this and "bits" have a non-empty intersection.
241 bool intersects(const BitMap bits) const;
245 bool set_union_with_result(BitMap bits);
246 bool set_difference_with_result(BitMap bits);
247 bool set_intersection_with_result(BitMap bits);
249 // Requires the submap of "bits" starting at offset to be at least as
251 // current contents and the submap of "bits" starting at "offset" of the
256 void set_intersection_at_offset(BitMap bits, idx_t offset);
258 void set_from(BitMap bits);
260 bool is_same(BitMap bits);
262 // Test if all bits are set or cleared
274 // Convenience class wrapping BitMap which provides multiple bits per slot.