Std.Set

39 public declarations

• all&Set[T] -> fn(T) -> Bool -> Bool

  Whether every member satisfies the predicate. True for an empty set.

  fn
• any&Set[T] -> fn(T) -> Bool -> Bool

  Whether any member satisfies the predicate. False for an empty set.

  fn
• at&Set[T] -> Int -> Option[T]

  The member at a position in order, or `None` when there is none.

  fn
• cartesian&Set[A] -> &Set[B] -> Set[(A, B)]

  Every pairing of one set's members with the other's.

  fn
• contains&Set[T] -> T -> Bool

  Whether a value is a member.

  fn
• containsAll&Set[T] -> &Array[T] -> Bool

  Whether every given member is in the set.

  fn
• count&Set[T] -> fn(T) -> Bool -> Int

  How many members the predicate accepts.

  fn
• difference&Set[T] -> &Set[T] -> Set[T]

  Every member of the first set that is not in the second.

  fn
• emptySet[T]

  A set with no members.

  fn
• equals&Set[T] -> &Set[T] -> Bool

  Whether two sets hold the same members.

  fn
• filter&Set[T] -> fn(T) -> Bool -> Set[T]

  Only the members the predicate accepts.

  fn
• find&Set[T] -> fn(T) -> Bool -> Option[T]

  The first member the predicate accepts, or `None`.

  fn
• fold&Set[T] -> fn(A, T) -> A -> A -> A

  Every member combined into one value, in order.

  fn
• fromArray&Array[T] -> Set[T]

  A set built from an array, with duplicates dropped.

  fn
• greatest&Set[T] -> Option[T]

  The largest member, or `None` for an empty set.

  fn
• insert&Set[T] -> T -> Set[T]

  The set with a member added, or unchanged when it is already there.

  fn
• insertAll&Set[T] -> &Array[T] -> Set[T]

  Every given member added.

  fn
• intersectAll&Array[Set[T]] -> Set[T]

  Every member of every set that is in all of them.

  fn
• intersection&Set[T] -> &Set[T] -> Set[T]

  Every member of both sets.

  fn
• intersects&Set[T] -> &Set[T] -> Bool

  Whether the two sets share any member. The complement of `isDisjointFrom`,

  fn
• isDisjointFrom&Set[T] -> &Set[T] -> Bool

  Whether the two sets share no members.

  fn
• isEmpty&Set[T] -> Bool

  Whether the set has no members.

  fn
• isSubsetOf&Set[T] -> &Set[T] -> Bool

  Whether every member of the first set is in the second.

  fn
• isSupersetOf&Set[T] -> &Set[T] -> Bool

  Whether every member of the second set is in the first.

  fn
• least&Set[T] -> Option[T]

  The smallest member, or `None` for an empty set.

  fn
• map&Set[A] -> fn(A) -> B -> Set[B]

  Every member transformed. The result may be smaller when the

  fn
• partition&Set[T] -> fn(T) -> Bool -> (Set[T], Set[T])

  The members the predicate accepts, and the members it rejects.

  fn
• remove&Set[T] -> T -> Set[T]

  The set with a member removed, or unchanged when it is not there.

  fn
• removeAll&Set[T] -> &Array[T] -> Set[T]

  Every given member taken away, in one pass for the same reason.

  fn
• removeGreatest&Set[T] -> Set[T]

  The set without its largest member.

  fn
• removeIf&Set[T] -> fn(T) -> Bool -> Set[T]

  Only the members the predicate rejects.

  fn
• removeLeast&Set[T] -> Set[T]

  The set without its smallest member.

  fn
• singletonT -> Set[T]

  A set with one member.

  fn
• size&Set[T] -> Int

  The number of members.

  fn
• split&Set[T] -> T -> fn(T, T) -> Bool -> (Set[T], Set[T])

  The members a comparison places before a value, and those it places after.

  fn
• symmetricDifference&Set[T] -> &Set[T] -> Set[T]

  Every member of exactly one of the two sets.

  fn
• toArray&Set[T] -> Array[T]

  Every member, in order.

  fn
• union&Set[T] -> &Set[T] -> Set[T]

  Every member of either set.

  fn
• unionAll&Array[Set[T]] -> Set[T]

  Every set combined.

  fn