Std.IntSet

23 public declarations

• delete&Std.IntSet.IntSet -> Int -> Std.IntSet.IntSet

  Deletes an integer element from the set if present.

  fn
• deleteMax&Std.IntSet.IntSet -> Std.IntSet.IntSet

  Deletes the maximum element from the set.

  fn
• deleteMin&Std.IntSet.IntSet -> Std.IntSet.IntSet

  Deletes the minimum element from the set.

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

  Computes the set difference (elements in left not present in right).

  fn
• disjoint&Std.IntSet.IntSet -> &Std.IntSet.IntSet -> Bool

  Tests whether the two sets share no common elements.

  fn
• emptyStd.IntSet.IntSet

  Constructs an empty integer set.

  fn
• filter&Std.IntSet.IntSet -> fn(Int) -> Bool -> Std.IntSet.IntSet

  Filters the set, retaining only elements satisfying the predicate.

  fn
• findMax&Std.IntSet.IntSet -> Option[Int]

  Returns the maximum element present in the set, or None if empty.

  fn
• findMin&Std.IntSet.IntSet -> Option[Int]

  Returns the minimum element present in the set, or None if empty.

  fn
• fromArray&Array[Int] -> Std.IntSet.IntSet

  Constructs a set from an array of integers.

  fn
• insert&Std.IntSet.IntSet -> Int -> Std.IntSet.IntSet

  Inserts an integer element into the set.

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

  Computes the intersection of two integer sets.

  fn
• IntSet

  A purely functional bitwise integer Patricia Trie storing 64-bit integer elements.

  type
• isEmpty&Std.IntSet.IntSet -> Bool

  Whether the set contains no elements.

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

  Tests whether every element of subset is in superset.

  fn
• member&Std.IntSet.IntSet -> Int -> Bool

  Tests whether element is present in the set.

  fn
• singletonInt -> Std.IntSet.IntSet

  Constructs a set with a single element.

  fn
• size&Std.IntSet.IntSet -> Int

  The number of elements contained in the set.

  fn
• split&Std.IntSet.IntSet -> Int -> (Std.IntSet.IntSet, Std.IntSet.IntSet)

  Partitions elements into strictly smaller and strictly greater than pivot.

  fn
• splitMember&Std.IntSet.IntSet -> Int -> (Std.IntSet.IntSet, Bool, Std.IntSet.IntSet)

  Partitions into strictly smaller, presence boolean, and strictly greater.

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

  Computes the symmetric difference of two sets.

  fn
• toArray&Std.IntSet.IntSet -> Array[Int]

  Returns an array of all elements in ascending order.

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

  Computes the union of two integer sets.

  fn