Safe Haskell	Safe
Language	Haskell2010

Data.Monoid.Unique

Description

Monoidal witness that all items in a bag are unique.

Synopsis

Documentation

Monoid under every element being unique.

Constructors

AllUnique (Set a)
Duplicated a

Instances

Eq a => Eq (Unique a) Source #
Instance details Defined in Data.Monoid.Unique Methods (==) :: Unique a -> Unique a -> Bool # (/=) :: Unique a -> Unique a -> Bool #
Ord a => Ord (Unique a) Source #
Instance details Defined in Data.Monoid.Unique Methods compare :: Unique a -> Unique a -> Ordering # (<) :: Unique a -> Unique a -> Bool # (<=) :: Unique a -> Unique a -> Bool # (>) :: Unique a -> Unique a -> Bool # (>=) :: Unique a -> Unique a -> Bool # max :: Unique a -> Unique a -> Unique a # min :: Unique a -> Unique a -> Unique a #
Show a => Show (Unique a) Source #
Instance details Defined in Data.Monoid.Unique Methods showsPrec :: Int -> Unique a -> ShowS # show :: Unique a -> String # showList :: [Unique a] -> ShowS #
Ord a => Semigroup (Unique a) Source #
Instance details Defined in Data.Monoid.Unique Methods (<>) :: Unique a -> Unique a -> Unique a # sconcat :: NonEmpty (Unique a) -> Unique a # stimes :: Integral b => b -> Unique a -> Unique a #
Ord a => Monoid (Unique a) Source #
Instance details Defined in Data.Monoid.Unique Methods mempty :: Unique a # mappend :: Unique a -> Unique a -> Unique a # mconcat :: [Unique a] -> Unique a #

Inject a single item into Unique.

Is every element of this foldable unique?