úÎ1.Ï#      !"#Jannis Harder <jannis@harderweb.de>+#$%&'()*O(???). See  . O(1). Is the set empty? O(1). Cardinality of the set.  O(log(n))$. Is the value a member of the set? O(log(n)!. Is the element not in the set? O(1). The empty set. O(1). A set of one element.  O(log(n)). Add a value to the set.  O(log(n))). Delete a value in the set. Returns the . original set when the value was not present.  O(m log(n / m)) where m<=n. The union of two sets. O(log m) @ if all elements of one set are larger than all elements of the  other set. The union of a list of sets. O(???). Difference between two sets. O(???) . The intersection of two sets. O(n)3. Filter all elements that satisfy some predicate. O(n)F. Partition the set into two sets, one with all elements that satisfy 1 the predicate and one with all elements that don't satisfy the predicate.  See also . O(log(min(i,n-i))). The expression ( 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(log(min(i,n-i))) . Performs a $ but also returns whether the pivot ( element was found in the original set. O(1)". The minimal element of the set. O(1) . The maximal element of a set. O(1). Delete the minimal element. O(1). Delete the maximal element. O(1)'. Delete and find the minimal element. 2 deleteFindMin set = (findMin set, deleteMin set) O(1)'. Delete and find the maximal element. 2 deleteFindMax set = (findMax set, deleteMax set) O(1)4. Retrieves the maximal key of the set, and the set  stripped of that element, or + if passed an empty set. O(1)4. Retrieves the minimal key of the set, and the set  stripped of that element, or + if passed an empty set.  O(n*log(n)).   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(1)3. Add a constant value to all elements of the set.  translate x s == map (+x) s O(n);. Fold over the elements of a set in an unspecified order.  sum set == fold (+) 0 set  elems set == fold (:) [] set O(n)B. The elements of a set. (For sets, this is equivalent to toList) O(n)). Convert the set to a list of elements.  O(n*log(n))(. Create a set from a list of integers. O(n)4. Convert the set to an ascending list of elements. !O(n)2. 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.  CThe precondition (input list is strictly ascending) is not checked. #  !"#  !"#  !",      !"#$%%&'(()*+,-translatable-intset-0.1Data.IntSet.TranslatableIntSet\\nullsizemember notMemberempty singletoninsertdeleteunionunions difference intersectionfilter partitionsplit splitMemberfindMinfindMax deleteMin deleteMax deleteFindMin deleteFindMaxmaxViewminViewmap translatefoldelemstoListfromList toAscList fromAscListfromDistinctAscListDiffSumgetSumgetSizeDiffgetDiffbase Data.MaybeNothing