Skip to content

HORIZON HASKELL Docs lts/ghc-10.0.x8fef28d2026-11-02Search packagesCtrl K

Theme: |

GHC 10.0.0.20260917 · lts/ghc-10.0.x · 8fef28d · 2026-11-02

Modulemultiset-0.3.4.3Haskell2010

Data.IntMultiSet

An efficient implementation of multisets of integers, also sometimes called bags.

A multiset is like a set, but it can contain multiple copies of the same element.

Since many function names (but not the type name) clash with Prelude names, this module is usually imported qualified, e.g.

 import Data.IntMultiSet (IntMultiSet)
 import qualified Data.IntMultiSet as IntMultiSet

The implementation of IntMultiSet is based on the Data.IntMap module.

Many operations have a worst-case complexity of O(min(n,W)). This means that the operation can become linear in the number of elements with a maximum of W -- the number of bits in an Int (32 or 64). Here n refers to the number of distinct elements, t is the total number of elements.

Contents

MultiSet type
Operators
Query
Construction
Combine
Filter
Map
Monadic
Fold
Min/Max
Conversion
List
Ordered list
Occurrence lists
Map
Set
Debugging

Synopsis

Packagemultiset-0.3.4.3
Exports67
LanguageHaskell2010
LicenceBSD-3-Clause
SourceIntMultiSet.hs

MultiSet type

newtypenewtype IntMultiSet

A multiset of integers. The same value can occur multiple times.

Instances8Eq, Data, Ord, Read, Show, Semigroup, …

Eq IntMultiSetDefined in multiset-0.3.4.3 · Data.IntMultiSet
Data IntMultiSetDefined in multiset-0.3.4.3 · Data.IntMultiSet
Ord IntMultiSetDefined in multiset-0.3.4.3 · Data.IntMultiSet
Read IntMultiSetDefined in multiset-0.3.4.3 · Data.IntMultiSet
Show IntMultiSetDefined in multiset-0.3.4.3 · Data.IntMultiSet
Semigroup IntMultiSetDefined in multiset-0.3.4.3 · Data.IntMultiSet
Monoid IntMultiSetDefined in multiset-0.3.4.3 · Data.IntMultiSet
NFData IntMultiSetDefined in multiset-0.3.4.3 · Data.IntMultiSet

typetype Key = Int

Key type for IntMultiSet

typetype Occur = Int

The number of occurrences of an element

Operators

value(\\) :: IntMultiSet -> IntMultiSet -> IntMultiSet

O(n+m). See difference.

Query

valuenull :: IntMultiSet -> Bool

O(1). Is this the empty multiset?

valuesize :: IntMultiSet -> Int

O(n). The number of elements in the multiset.

valuedistinctSize :: IntMultiSet -> Int

O(1). The number of distinct elements in the multiset.

valuemember :: Key -> IntMultiSet -> Bool

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

valuenotMember :: Key -> IntMultiSet -> Bool

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

valueoccur :: Key -> IntMultiSet -> Int

O(min(n,W)). The number of occurrences of an element in a multiset.

valueisSubsetOf :: IntMultiSet -> IntMultiSet -> Bool

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

valueisProperSubsetOf :: IntMultiSet -> IntMultiSet -> Bool

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

Construction

valueempty :: IntMultiSet

O(1). The empty mutli set.

valuesingleton :: Key -> IntMultiSet

O(1). Create a singleton mutli set.

valueinsert :: Key -> IntMultiSet -> IntMultiSet

O(min(n,W)). Insert an element in a multiset.

valueinsertMany :: Key -> Occur -> IntMultiSet -> IntMultiSet

O(min(n,W)). Insert an element in a multiset a given number of times.

Negative numbers remove occurrences of the given element.

valuedelete :: Key -> IntMultiSet -> IntMultiSet

O(min(n,W)). Delete a single element from a multiset.

valuedeleteMany :: Key -> Occur -> IntMultiSet -> IntMultiSet

O(min(n,W)). Delete an element from a multiset a given number of times.

Negative numbers add occurrences of the given element.

valuedeleteAll :: Key -> IntMultiSet -> IntMultiSet

O(min(n,W)). Delete all occurrences of an element from a multiset.

Combine

valueunion :: IntMultiSet -> IntMultiSet -> IntMultiSet

O(n+m). The union of two multisets. The union adds the occurrences together.

The implementation uses the efficient hedge-union algorithm. Hedge-union is more efficient on (bigset union smallset).

valueunions :: [IntMultiSet] -> IntMultiSet

The union of a list of multisets: (unions == foldl union empty).

valuemaxUnion :: IntMultiSet -> IntMultiSet -> IntMultiSet

O(n+m). The union of two multisets. The number of occurrences of each element in the union is the maximum of the number of occurrences in the arguments (instead of the sum).

The implementation uses the efficient hedge-union algorithm. Hedge-union is more efficient on (bigset union smallset).

valuedifference :: IntMultiSet -> IntMultiSet -> IntMultiSet

O(n+m). Difference of two multisets. The implementation uses an efficient hedge algorithm comparable with hedge-union.

valueintersection :: IntMultiSet -> IntMultiSet -> IntMultiSet

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

prints (fromList [A],fromList [B]).

Filter

valuefilter :: (Key -> Bool) -> IntMultiSet -> IntMultiSet

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

valuepartition :: (Key -> Bool) -> IntMultiSet -> (IntMultiSet, IntMultiSet)

O(n). Partition the multiset into two multisets, one with all elements that satisfy the predicate and one with all elements that don't satisfy the predicate. See also split.

valuesplit :: Int -> IntMultiSet -> (IntMultiSet, IntMultiSet)

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. x is not found in neither set1 nor set2.

valuesplitOccur :: Int -> IntMultiSet -> (IntMultiSet, Int, IntMultiSet)

O(log n). Performs a split but also returns the number of occurrences of the pivot element in the original set.

Map

valuemap :: (Key -> Key) -> IntMultiSet -> IntMultiSet

O(n*log n). map f s is the multiset obtained by applying f to each element of s.

valuemapMonotonic :: (Key -> Key) -> IntMultiSet -> IntMultiSet

O(n). mapMonotonic f s == map f s, but works only when f is strictly monotonic. The precondition is not checked. Semi-formally, we have:

and [x < y ==> f x < f y | x <- ls, y <- ls]
                    ==> mapMonotonic f s == map f s
    where ls = toList s

valuemapMaybe :: (Key -> Maybe Key) -> IntMultiSet -> IntMultiSet

O(n). Map and collect the Just results.

valuemapEither

:: Key -> Either Key Key
-> IntMultiSet
-> (IntMultiSet, IntMultiSet)

O(n). Map and separate the Left and Right results.

valueconcatMap :: (Key -> [Key]) -> IntMultiSet -> IntMultiSet

O(n). Apply a function to each element, and take the union of the results

valueunionsMap :: (Key -> IntMultiSet) -> IntMultiSet -> IntMultiSet

O(n). Apply a function to each element, and take the union of the results

Monadic

valuebind :: IntMultiSet -> (Key -> IntMultiSet) -> IntMultiSet

O(n). The monad bind operation, (>>=), for multisets.

valuejoin :: MultiSet IntMultiSet -> IntMultiSet

O(n). The monad join operation for multisets.

Fold

valuefold :: (Key -> b -> b) -> b -> IntMultiSet -> b

O(t). Fold over the elements of a multiset in an unspecified order.

valuefoldOccur :: (Key -> Occur -> b -> b) -> b -> IntMultiSet -> b

O(n). Fold over the elements of a multiset with their occurrences.

Min/Max

valuefindMin :: IntMultiSet -> Key

O(log n). The minimal element of a multiset.

valuefindMax :: IntMultiSet -> Key

O(log n). The maximal element of a multiset.

valuedeleteMin :: IntMultiSet -> IntMultiSet

O(log n). Delete the minimal element.

valuedeleteMax :: IntMultiSet -> IntMultiSet

O(log n). Delete the maximal element.

valuedeleteMinAll :: IntMultiSet -> IntMultiSet

O(log n). Delete all occurrences of the minimal element.

valuedeleteMaxAll :: IntMultiSet -> IntMultiSet

O(log n). Delete all occurrences of the maximal element.

valuedeleteFindMin :: IntMultiSet -> (Key, IntMultiSet)

O(log n). Delete and find the minimal element.

deleteFindMin set = (findMin set, deleteMin set)

valuedeleteFindMax :: IntMultiSet -> (Key, IntMultiSet)

O(log n). Delete and find the maximal element.

deleteFindMax set = (findMax set, deleteMax set)

valuemaxView :: IntMultiSet -> Maybe (Key, IntMultiSet)

O(log n). Retrieves the maximal element of the multiset, and the set stripped from that element fails (in the monad) when passed an empty multiset.

Examples:

Example1 expression

>>> maxView $ fromList [100, 100, 200, 300]Just (300,fromOccurList [(100,2),(200,1)])

valueminView :: IntMultiSet -> Maybe (Key, IntMultiSet)

O(log n). Retrieves the minimal element of the multiset, and the set stripped from that element Returns Nothing when passed an empty multiset.

Examples:

Example1 expression

>>> minView $ fromList [100, 100, 200, 300]Just (100,fromOccurList [(100,1),(200,1),(300,1)])

Conversion

List

valueelems :: IntMultiSet -> [Key]

O(t). The elements of a multiset.

valuedistinctElems :: IntMultiSet -> [Key]

O(n). The distinct elements of a multiset, each element occurs only once in the list.

distinctElems = map fst . toOccurList

valuetoList :: IntMultiSet -> [Key]

O(t). Convert the multiset to a list of elements.

valuefromList :: [Int] -> IntMultiSet

O(t*min(n,W)). Create a multiset from a list of elements.

Ordered list

valuetoAscList :: IntMultiSet -> [Key]

O(t). Convert the multiset to an ascending list of elements.

valuefromAscList :: [Int] -> IntMultiSet

O(t). Build a multiset from an ascending list in linear time. The precondition (input list is ascending) is not checked.

valuefromDistinctAscList :: [Int] -> IntMultiSet

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

Occurrence lists

valuetoOccurList :: IntMultiSet -> [(Int, Int)]

O(n). Convert the multiset to a list of element/occurrence pairs.

valuetoAscOccurList :: IntMultiSet -> [(Int, Int)]

O(n). Convert the multiset to an ascending list of element/occurrence pairs.

valuefromOccurList :: [(Int, Int)] -> IntMultiSet

O(n*min(n,W)). Create a multiset from a list of element/occurrence pairs. Occurrences must be positive. The precondition (all occurrences > 0) is not checked.

valuefromAscOccurList :: [(Int, Int)] -> IntMultiSet

O(n). Build a multiset from an ascending list of element/occurrence pairs in linear time. Occurrences must be positive. The precondition (input list is ascending, all occurrences > 0) is not checked.

valuefromDistinctAscOccurList :: [(Int, Int)] -> IntMultiSet

O(n). Build a multiset from an ascending list of elements/occurrence pairs where each elements appears only once. Occurrences must be positive. The precondition (input list is strictly ascending, all occurrences > 0) is not checked.

Map

valuetoMap :: IntMultiSet -> IntMap Int

O(1). Convert a multiset to an IntMap from elements to number of occurrences.

valuefromMap :: IntMap Int -> IntMultiSet

O(n). Convert an IntMap from elements to occurrences to a multiset.

valuefromOccurMap :: IntMap Int -> IntMultiSet

O(1). Convert an IntMap from elements to occurrences to a multiset. Assumes that the IntMap contains only values larger than zero. The precondition (all elements > 0) is not checked.

Set

valuetoSet :: IntMultiSet -> IntSet

O(n). Convert a multiset to an IntMap, removing duplicates.

valuefromSet :: IntSet -> IntMultiSet

O(n). Convert an IntMap to a multiset.

Debugging

valueshowTree :: IntMultiSet -> String

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

valueshowTreeWith :: Bool -> Bool -> IntMultiSet -> String

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.

Set> putStrLn $ showTreeWith True False $ fromDistinctAscList [1,1,2,3,4,5]
(1*) 4
+--(1*) 2
|  +--(2*) 1
|  +--(1*) 3
+--(1*) 5

Set> putStrLn $ showTreeWith True True $ fromDistinctAscList [1,1,2,3,4,5]
(1*) 4
|
+--(1*) 2
|  |
|  +--(2*) 1
|  |
|  +--(1*) 3
|
+--(1*) 5

Set> putStrLn $ showTreeWith False True $ fromDistinctAscList [1,1,2,3,4,5]
+--(1*) 5
|
(1*) 4
|
|  +--(1*) 3
|  |
+--(1*) 2
   |
   +--(2*) 1