Std.BloomFilter

12 public declarations

• bitCount&Std.BloomFilter.BloomFilter -> Int

  Total number of bits allocated.

  fn
• BloomFilter

  An immutable space-efficient probabilistic set filter.

  type
• contains&Std.BloomFilter.BloomFilter -> Str -> Bool

  Tests if a string item may be present in the filter.

  fn
• containsBytes&Std.BloomFilter.BloomFilter -> &Bytes -> Bool

  Tests if raw bytes may be present in the filter.

  fn
• createInt -> Int -> Std.BloomFilter.BloomFilter

  Constructs a raw BloomFilter with specified bit capacity and hash function count.

  fn
• estimatedCount&Std.BloomFilter.BloomFilter -> Int

  Approximates the number of distinct items inserted.

  fn
• hashCount&Std.BloomFilter.BloomFilter -> Int

  Number of independent hash functions used per item.

  fn
• insert&Std.BloomFilter.BloomFilter -> Str -> Std.BloomFilter.BloomFilter

  Inserts a string item into the filter.

  fn
• insertBytes&Std.BloomFilter.BloomFilter -> &Bytes -> Std.BloomFilter.BloomFilter

  Inserts raw bytes into the filter.

  fn
• intersect&Std.BloomFilter.BloomFilter -> &Std.BloomFilter.BloomFilter -> Option[Std.BloomFilter.BloomFilter]

  Intersects two compatible filters via bitwise AND.

  fn
• merge&Std.BloomFilter.BloomFilter -> &Std.BloomFilter.BloomFilter -> Option[Std.BloomFilter.BloomFilter]

  Merges two compatible filters via bitwise OR.

  fn
• optimalInt -> Float64 -> Std.BloomFilter.BloomFilter

  Constructs an optimal BloomFilter for expected items and target false-positive probability.

  fn