Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
A simple overlay over Data.Map to manage unordered sets with duplicates.
- newtype Bag a = Bag {}
- null :: Bag a -> Bool
- size :: Bag a -> Int
- (!) :: Ord a => Bag a -> a -> [a]
- member :: Ord a => a -> Bag a -> Bool
- notMember :: Ord a => a -> Bag a -> Bool
- count :: Ord a => a -> Bag a -> Int
- empty :: Bag a
- singleton :: a -> Bag a
- union :: Ord a => Bag a -> Bag a -> Bag a
- unions :: Ord a => [Bag a] -> Bag a
- insert :: Ord a => a -> Bag a -> Bag a
- fromList :: Ord a => [a] -> Bag a
- groups :: Bag a -> [[a]]
- toList :: Bag a -> [a]
- keys :: Bag a -> [a]
- elems :: Bag a -> [a]
- toAscList :: Bag a -> [a]
- map :: Ord b => (a -> b) -> Bag a -> Bag b
- traverse' :: forall a b m. (Applicative m, Ord b) => (a -> m b) -> Bag a -> m (Bag b)
Documentation
A set with duplicates. Faithfully stores elements which are equal with regard to (==).
Query
(!) :: Ord a => Bag a -> a -> [a] Source #
(bag ! a)
finds all elements equal to a
. O(log n).
Total function, returns []
if none are.
count :: Ord a => a -> Bag a -> Int Source #
Return the multiplicity of the given element. O(log n + count _ _).