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(min(n,W)). Is the element not in the set?

O(log n). Find largest element smaller than the given one.

 lookupLT 3 (fromList [3, 5]) == Nothing
 lookupLT 5 (fromList [3, 5]) == Just 3

O(log n). Find smallest element greater than the given one.

 lookupGT 4 (fromList [3, 5]) == Just 5
 lookupGT 5 (fromList [3, 5]) == Nothing

O(log n). Find largest element smaller or equal to the given one.

 lookupLE 2 (fromList [3, 5]) == Nothing
 lookupLE 4 (fromList [3, 5]) == Just 3
 lookupLE 5 (fromList [3, 5]) == Just 5

O(log n). Find smallest element greater or equal to the given one.

 lookupGE 3 (fromList [3, 5]) == Just 3
 lookupGE 4 (fromList [3, 5]) == Just 5
 lookupGE 6 (fromList [3, 5]) == Nothing

O(n+m). Is this a subset? (s1 isSubsetOf s2) tells whether s1 is a subset of s2.

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. There is no left- or right bias for IntSets.

O(min(n,W)). Delete a value in the set. Returns the original 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(min(n,W)). The expression (split x set) is a pair (set1,set2) where set1 comprises the elements of set less than x and set2 comprises the elements of set greater than x.

 split 3 (fromList [1..5]) == (fromList [1,2], fromList [4,5])

O(min(n,W)). Performs a split but also returns whether the pivot element was found in the original set.

O(n*min(n,W)). map f s is the set obtained by applying f to each element of s.

It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y

O(n). Fold the elements in the set using the given right-associative binary operator, such that foldr f z == foldr f z . toAscList.

For example,

 toAscList set = foldr (:) [] set

O(n). Fold the elements in the set using the given left-associative binary operator, such that foldl f z == foldl f z . toAscList.

For example,

 toDescList set = foldl (flip (:)) [] set

O(n). A strict version of foldr. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

O(n). A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

O(n). Fold the elements in the set using the given right-associative binary operator. This function is an equivalent of foldr and is present for compatibility only.

Please note that fold will be deprecated in the future and removed.

O(min(n,W)). The minimal element of the set.

O(min(n,W)). The maximal element of a set.

O(min(n,W)). Delete the minimal element.

O(min(n,W)). Delete the maximal element.

O(min(n,W)). Delete and find the minimal element.

 deleteFindMin set = (findMin set, deleteMin set)

O(min(n,W)). Delete and find the maximal element.

 deleteFindMax set = (findMax set, deleteMax set)

O(min(n,W)). Retrieves the maximal key of the set, and the set stripped of that element, or Nothing if passed an empty set.

O(min(n,W)). Retrieves the minimal key of the set, and the set stripped of that element, or Nothing if passed an empty set.

O(n). An alias of toAscList. The elements of a set in ascending order. Subject to list fusion.

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

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

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

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

O(n). Build a set from an ascending list of elements. The precondition (input list is ascending) is not checked.

O(n). Build a set from an ascending list of distinct elements. The precondition (input list is strictly ascending) is not checked.

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.