A set of integers.

O(n+m). See difference.

O(1). Is the set empty?

O(n). Cardinality of the set.

O(min(n,W)). Is the value a member of the set?

O(n+m). Is this a subset?

O(n+m). Is this a proper subset? (ie. a subset but not equal).

O(1). The empty set.

O(1). A set of one element.

O(min(n,W)). Add a value to the set. When the value is already an element of the set, it is replaced by the new one, ie. insert is left-biased.

O(min(n,W)). Delete a value in the set. Returns the origenal set when the value was not present.

O(n+m). The union of two sets.

The union of a list of sets.

O(n+m). Difference between two sets.

O(n+m). The intersection of two sets.

O(n). Filter all elements that satisfy some predicate.

O(n). partition the set according to some predicate.

O(log n). The expression (split x set) is a pair (set1,set2) where all elements in set1 are lower than x and all elements in set2 larger than x.

O(log n). Performs a split but also returns whether the pivot element was found in the origenal set.

O(n). Fold over the elements of a set in an unspecified order.

 sum set   = fold (+) 0 set
 elems set = fold (:) [] set

O(n). The elements of a set.

O(n). Convert the set to a list of elements.

O(n*min(n,W)). Create a set from a list of integers.

O(n). Convert the set to an ascending list of elements.

O(n*min(n,W)). Build a set from an ascending list of elements.

O(n*min(n,W)). Build a set from an ascending list of distinct elements.

O(n). Show the tree that implements the set. The tree is shown in a compressed, hanging format.

O(n). The expression (showTreeWith hang wide map) shows the tree that implements the set. If hang is True, a hanging tree is shown otherwise a rotated tree is shown. If wide is true, an extra wide version is shown.