Hoogle Search
Within LTS Haskell 24.28 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
toAscList :: IntMultiSet -> [Key]multiset Data.IntMultiSet O(t). Convert the multiset to an ascending list of elements.
toAscOccurList :: IntMultiSet -> [(Int, Int)]multiset Data.IntMultiSet O(n). Convert the multiset to an ascending list of element/occurrence pairs.
toList :: IntMultiSet -> [Key]multiset Data.IntMultiSet O(t). Convert the multiset to a list of elements.
toOccurList :: IntMultiSet -> [(Int, Int)]multiset Data.IntMultiSet O(n). Convert the multiset to a list of element/occurrence pairs.
fromAscList :: Eq a => [a] -> MultiSet amultiset Data.MultiSet O(t). Build a multiset from an ascending list in linear time. The precondition (input list is ascending) is not checked.
fromAscOccurList :: Eq a => [(a, Occur)] -> MultiSet amultiset Data.MultiSet 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.
fromDistinctAscList :: [a] -> MultiSet amultiset Data.MultiSet 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.
fromDistinctAscOccurList :: [(a, Occur)] -> MultiSet amultiset Data.MultiSet 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.
fromList :: Ord a => [a] -> MultiSet amultiset Data.MultiSet O(t*log t). Create a multiset from a list of elements.
fromOccurList :: Ord a => [(a, Occur)] -> MultiSet amultiset Data.MultiSet O(n*log n). Create a multiset from a list of element/occurrence pairs. Occurrences must be positive. The precondition (all occurrences > 0) is not checked.