Data.IntSet.Internal

 import Data.IntSet (IntSet)
 import qualified Data.IntSet as IntSet

data IntSet Source

A set of integers.

type Key = Int Source

type Prefix = Int Source

type Mask = Int Source

type BitMap = Word Source

(\\) :: IntSet -> IntSet -> IntSet infixl 9 Source

O(n+m). See difference.

null :: IntSet -> Bool Source

O(1). Is the set empty?

size :: IntSet -> Int Source

O(n). Cardinality of the set.

member :: Key -> IntSet -> Bool Source

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

notMember :: Key -> IntSet -> Bool Source

O(min(n,W)). Is the element not in the set?

lookupLT :: Key -> IntSet -> Maybe Key Source

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

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

lookupGT :: Key -> IntSet -> Maybe Key Source

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

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

lookupLE :: Key -> IntSet -> Maybe Key Source

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

lookupGE :: Key -> IntSet -> Maybe Key Source

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

isSubsetOf :: IntSet -> IntSet -> Bool Source

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

isProperSubsetOf :: IntSet -> IntSet -> Bool Source

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

disjoint :: IntSet -> IntSet -> Bool Source

O(n+m). Check whether two sets are disjoint (i.e. their intersection is empty).

disjoint (fromList [2,4,6])   (fromList [1,3])     == True
disjoint (fromList [2,4,6,8]) (fromList [2,3,5,7]) == False
disjoint (fromList [1,2])     (fromList [1,2,3,4]) == False
disjoint (fromList [])        (fromList [])        == True

Since: containers-0.5.11

empty :: IntSet Source

O(1). The empty set.

singleton :: Key -> IntSet Source

O(1). A set of one element.

insert :: Key -> IntSet -> IntSet Source

O(min(n,W)). Add a value to the set. There is no left- or right bias for IntSets.

delete :: Key -> IntSet -> IntSet Source

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

union :: IntSet -> IntSet -> IntSet Source

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

unions :: Foldable f => f IntSet -> IntSet Source

The union of a list of sets.

difference :: IntSet -> IntSet -> IntSet Source

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

intersection :: IntSet -> IntSet -> IntSet Source

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

filter :: (Key -> Bool) -> IntSet -> IntSet Source

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

partition :: (Key -> Bool) -> IntSet -> (IntSet, IntSet) Source

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

split :: Key -> IntSet -> (IntSet, IntSet) Source

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])

splitMember :: Key -> IntSet -> (IntSet, Bool, IntSet) Source

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

splitRoot :: IntSet -> [IntSet] Source

O(1). Decompose a set into pieces based on the structure of the underlying tree. This function is useful for consuming a set in parallel.

No guarantee is made as to the sizes of the pieces; an internal, but deterministic process determines this. However, it is guaranteed that the pieces returned will be in ascending order (all elements in the first submap less than all elements in the second, and so on).

Examples:

splitRoot (fromList [1..120]) == [fromList [1..63],fromList [64..120]]
splitRoot empty == []

Note that the current implementation does not return more than two subsets, but you should not depend on this behaviour because it can change in the future without notice. Also, the current version does not continue splitting all the way to individual singleton sets -- it stops at some point.

map :: (Key -> Key) -> IntSet -> IntSet Source

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

foldr :: (Key -> b -> b) -> b -> IntSet -> b Source

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

foldl :: (a -> Key -> a) -> a -> IntSet -> a Source

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

foldr' :: (Key -> b -> b) -> b -> IntSet -> b Source

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.

foldl' :: (a -> Key -> a) -> a -> IntSet -> a Source

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.

fold :: (Key -> b -> b) -> b -> IntSet -> b Source

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.

findMin :: IntSet -> Key Source

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

findMax :: IntSet -> Key Source

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

deleteMin :: IntSet -> IntSet Source

O(min(n,W)). Delete the minimal element. Returns an empty set if the set is empty.

Note that this is a change of behaviour for consistency with Set – versions prior to 0.5 threw an error if the IntSet was already empty.

deleteMax :: IntSet -> IntSet Source

O(min(n,W)). Delete the maximal element. Returns an empty set if the set is empty.

Note that this is a change of behaviour for consistency with Set – versions prior to 0.5 threw an error if the IntSet was already empty.

deleteFindMin :: IntSet -> (Key, IntSet) Source

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

deleteFindMin set = (findMin set, deleteMin set)

deleteFindMax :: IntSet -> (Key, IntSet) Source

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

deleteFindMax set = (findMax set, deleteMax set)

maxView :: IntSet -> Maybe (Key, IntSet) Source

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.

minView :: IntSet -> Maybe (Key, IntSet) Source

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.

elems :: IntSet -> [Key] Source

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

toList :: IntSet -> [Key] Source

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

fromList :: [Key] -> IntSet Source

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

toAscList :: IntSet -> [Key] Source

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

toDescList :: IntSet -> [Key] Source

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

fromAscList :: [Key] -> IntSet Source

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

fromDistinctAscList :: [Key] -> IntSet Source

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

showTree :: IntSet -> String Source

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

showTreeWith :: Bool -> Bool -> IntSet -> String Source

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.

match :: Int -> Prefix -> Mask -> Bool Source

suffixBitMask :: Int Source

prefixBitMask :: Int Source

bitmapOf :: Int -> BitMap Source

zero :: Int -> Mask -> Bool Source