Std.BitSet

18 public declarations

• BitSet

  Sparse blocks of 64 IDs. Construct through this module to preserve block invariants.

  type
• blocks&Std.BitSet.BitSet -> Map[UInt64, UInt64]

  The words the set is stored as, keyed by where each begins.

  fn
• contains&Std.BitSet.BitSet -> UInt64 -> Bool

  Whether a number is in the set.

  fn
• difference&Std.BitSet.BitSet -> &Std.BitSet.BitSet -> Std.BitSet.BitSet

  Every number in the first set and not the second.

  fn
• emptyStd.BitSet.BitSet

  A set holding nothing.

  fn
• fromArray&Array[UInt64] -> Std.BitSet.BitSet

  A set holding each of these numbers.

  fn
• fromBlocks&Map[UInt64, UInt64] -> Result[Std.BitSet.BitSet, UInt64]

  Validate block addresses and omit empty blocks.

  fn
• insert&Std.BitSet.BitSet -> UInt64 -> Std.BitSet.BitSet

  The set with a number added. Adding one already there changes nothing.

  fn
• intersection&Std.BitSet.BitSet -> &Std.BitSet.BitSet -> Std.BitSet.BitSet

  Every number in both sets.

  fn
• isDisjointFrom&Std.BitSet.BitSet -> &Std.BitSet.BitSet -> Bool

  Whether the two sets share no number.

  fn
• isEmpty&Std.BitSet.BitSet -> Bool

  Whether the set holds nothing.

  fn
• isSubsetOf&Std.BitSet.BitSet -> &Std.BitSet.BitSet -> Bool

  Whether every number in the first set is in the second.

  fn
• remove&Std.BitSet.BitSet -> UInt64 -> Std.BitSet.BitSet

  The set with a number taken out, if it was there.

  fn
• singletonUInt64 -> Std.BitSet.BitSet

  A set holding one number.

  fn
• size&Std.BitSet.BitSet -> UInt128

  UInt128 can count even the entire UInt64 ID domain.

  fn
• symmetricDifference&Std.BitSet.BitSet -> &Std.BitSet.BitSet -> Std.BitSet.BitSet

  Every number in one set but not the other.

  fn
• toArray&Std.BitSet.BitSet -> Array[UInt64]

  Materialize members in ascending order.

  fn
• union&Std.BitSet.BitSet -> &Std.BitSet.BitSet -> Std.BitSet.BitSet

  Every number in either set.

  fn