Documentation

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

The union of a list of sets.

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

\(O(1)\). The empty set.

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

\(O(1)\). A set of one element.

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

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

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

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

\(O(1)\). Is the set empty?

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

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