std.bitset

bits 0..n-1, 64 per word, in an arena; index past the end panics

BitSet

pub BitSet :: struct {
    words: []u64,
    n: usize,
}

• n: how many bits

BitSet.len

pub len :: fn(self: *Self) -> usize

BitSet.has

pub has :: fn(self: *Self, i: usize) -> bool

BitSet.set

pub set :: fn(self: *Self, i: usize)

BitSet.unset

pub unset :: fn(self: *Self, i: usize)

BitSet.toggle

pub toggle :: fn(self: *Self, i: usize)

BitSet.put

pub put :: fn(self: *Self, i: usize, on: bool)

set or clear bit i

BitSet.count

pub count :: fn(self: *Self) -> usize

number of set bits

BitSet.set_all

pub set_all :: fn(self: *Self)

BitSet.clear_all

pub clear_all :: fn(self: *Self)

BitSet.union_with

pub union_with :: fn(self: *Self, other: *BitSet)

self |= other; same length required

BitSet.intersect_with

pub intersect_with :: fn(self: *Self, other: *BitSet)

self &= other

BitSet.subtract

pub subtract :: fn(self: *Self, other: *BitSet)

self &= ~other

BitSet.ones

pub ones :: fn(self: *Self) -> Ones

set bits, smallest first

Ones

pub Ones :: struct {
    s: *BitSet,
    word: usize,
    rest: u64,
}

iterator from BitSet.ones

• word: the word being looked at
• rest: its bits not given yet

Ones.next

pub next :: fn(self: *Self) -> ?usize

make

pub make :: fn(a: *Arena, n: usize) -> BitSet

n clear bits in a