Agda.Utils.Bag

A simple overlay over Data.Map to manage unordered sets with duplicates.

Documentation

newtype Bag a

A set with duplicates. Faithfully stores elements which are equal with regard to (==).

Constructors

Bag

Fields

• bag :: Map a [a]

  The list contains all occurrences of a (not just the duplicates!). Hence, the invariant: the list is never empty.

Instances

Foldable Bag

Defined in Agda.Utils.Bag

Methods

fold :: Monoid m => Bag m -> m

foldMap :: Monoid m => (a -> m) -> Bag a -> m

foldr :: (a -> b -> b) -> b -> Bag a -> b

foldr' :: (a -> b -> b) -> b -> Bag a -> b

foldl :: (b -> a -> b) -> b -> Bag a -> b

foldl' :: (b -> a -> b) -> b -> Bag a -> b

foldr1 :: (a -> a -> a) -> Bag a -> a

foldl1 :: (a -> a -> a) -> Bag a -> a

toList :: Bag a -> [a]

null :: Bag a -> Bool

length :: Bag a -> Int

elem :: Eq a => a -> Bag a -> Bool

maximum :: Ord a => Bag a -> a

minimum :: Ord a => Bag a -> a

sum :: Num a => Bag a -> a

product :: Num a => Bag a -> a

Eq a => Eq (Bag a)

Defined in Agda.Utils.Bag

Methods

(==) :: Bag a -> Bag a -> Bool

(/=) :: Bag a -> Bag a -> Bool

Ord a => Ord (Bag a)

Defined in Agda.Utils.Bag

Methods

compare :: Bag a -> Bag a -> Ordering

(<) :: Bag a -> Bag a -> Bool

(<=) :: Bag a -> Bag a -> Bool

(>) :: Bag a -> Bag a -> Bool

(>=) :: Bag a -> Bag a -> Bool

max :: Bag a -> Bag a -> Bag a

min :: Bag a -> Bag a -> Bag a

Show a => Show (Bag a)

Defined in Agda.Utils.Bag

Methods

showsPrec :: Int -> Bag a -> ShowS

show :: Bag a -> String

showList :: [Bag a] -> ShowS

Ord a => Semigroup (Bag a)

Defined in Agda.Utils.Bag

Methods

(<>) :: Bag a -> Bag a -> Bag a

sconcat :: NonEmpty (Bag a) -> Bag a

stimes :: Integral b => b -> Bag a -> Bag a

Ord a => Monoid (Bag a)

Defined in Agda.Utils.Bag

Methods

mempty :: Bag a

mappend :: Bag a -> Bag a -> Bag a

mconcat :: [Bag a] -> Bag a

Null (Bag a)

Defined in Agda.Utils.Null

Methods

empty :: Bag a

null :: Bag a -> Bool

Query

null :: Bag a -> Bool

Is the bag empty?

size :: Bag a -> Int

Number of elements in the bag. Duplicates count. O(n).

(!) :: Ord a => Bag a -> a -> [a]

(bag ! a) finds all elements equal to a. O(log n). Total function, returns [] if none are.

member :: Ord a => a -> Bag a -> Bool

O(log n).

notMember :: Ord a => a -> Bag a -> Bool

O(log n).

count :: Ord a => a -> Bag a -> Int

Return the multiplicity of the given element. O(log n + count _ _).

Construction

empty :: Bag a

O(1)

singleton :: a -> Bag a

O(1)

union :: Ord a => Bag a -> Bag a -> Bag a

unions :: Ord a => [Bag a] -> Bag a

insert :: Ord a => a -> Bag a -> Bag a

insert a b = union b (singleton a)

fromList :: Ord a => [a] -> Bag a

fromList = unions . map singleton

Destruction

groups :: Bag a -> [[a]]

Returns the elements of the bag, grouped by equality (==).

toList :: Bag a -> [a]

Returns the bag, with duplicates.

keys :: Bag a -> [a]

Returns the bag without duplicates.

elems :: Bag a -> [a]

Returns the bag, with duplicates.

toAscList :: Bag a -> [a]

Traversal

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)