Bit sets
Factor handbook > The language > Collections > Sets > Set implementations

Prev:Hash sets

The bit-sets vocabulary implements bit-array-backed sets. Bitsets are efficient for implementing relatively dense sets whose members are in a contiguous range of integers starting from 0. One bit is required for each integer in this range in the underlying representation.

Bit sets form a class:

Constructing new bit sets:
<bit-set> ( capacity -- bit-set )