Data.HashSet.Multi

newtype MultiSet a

Constructors

• MkMultiSet (HashMap a HashNat)

Instances

• Foldable MultiSet
• (Eq a) => Eq (MultiSet a)
• Eq1 MultiSet
• (Hashable a) => Hashable (MultiSet a)
• (Hashable a) => Monoid (MultiSet a)
• Newtype (MultiSet a) _
• (Hashable a) => Semigroup (MultiSet a)
• Generic (MultiSet a) _
• (Show a) => Show (MultiSet a)

empty :: forall a. MultiSet a

singleton :: forall a. Hashable a => a -> MultiSet a

insert :: forall a. Hashable a => a -> MultiSet a -> MultiSet a

insertN :: forall a. Hashable a => Natural -> a -> MultiSet a -> MultiSet a

member :: forall a. Hashable a => a -> MultiSet a -> Boolean

count :: forall a. Hashable a => a -> MultiSet a -> Natural

delete :: forall a. Hashable a => a -> MultiSet a -> MultiSet a

fromFoldable :: forall a f. Foldable f => Hashable a => f a -> MultiSet a

fromFoldableWithCounts :: forall a f. Foldable f => Hashable a => f (Tuple a Natural) -> MultiSet a

toRepeatingArray :: forall a. MultiSet a -> Array a

toArray :: forall a. MultiSet a -> Array (Tuple a Natural)

toSet :: forall a. MultiSet a -> HashSet a

map :: forall b a. Hashable b => (a -> b) -> MultiSet a -> MultiSet b

mapWithCount :: forall b a. Hashable b => (a -> Natural -> b) -> MultiSet a -> MultiSet b

filter :: forall a. (a -> Boolean) -> MultiSet a -> MultiSet a

filterWithCount :: forall a. (a -> Natural -> Boolean) -> MultiSet a -> MultiSet a

union :: forall a. Hashable a => MultiSet a -> MultiSet a -> MultiSet a

intersection :: forall a. Hashable a => MultiSet a -> MultiSet a -> MultiSet a

difference :: forall a. Hashable a => MultiSet a -> MultiSet a -> MultiSet a

size :: forall a. MultiSet a -> Natural

isEmpty :: forall a. MultiSet a -> Boolean