stack-2.15.3: The Haskell Tool Stack
Safe HaskellSafe-Inferred
LanguageGHC2021

Data.Monoid.Map

Synopsis

Documentation

newtype MonoidMap k a Source #

Utility newtype wrapper to make Map's Monoid also use the element's Monoid.

Constructors

MonoidMap (Map k a) 

Instances

Instances details
Functor (MonoidMap k) Source # 
Instance details

Defined in Data.Monoid.Map

Methods

fmap :: (a -> b) -> MonoidMap k a -> MonoidMap k b #

(<$) :: a -> MonoidMap k b -> MonoidMap k a #

(Ord k, Semigroup a) => Monoid (MonoidMap k a) Source # 
Instance details

Defined in Data.Monoid.Map

Methods

mempty :: MonoidMap k a #

mappend :: MonoidMap k a -> MonoidMap k a -> MonoidMap k a #

mconcat :: [MonoidMap k a] -> MonoidMap k a #

(Ord k, Semigroup a) => Semigroup (MonoidMap k a) Source # 
Instance details

Defined in Data.Monoid.Map

Methods

(<>) :: MonoidMap k a -> MonoidMap k a -> MonoidMap k a #

sconcat :: NonEmpty (MonoidMap k a) -> MonoidMap k a #

stimes :: Integral b => b -> MonoidMap k a -> MonoidMap k a #

Generic (MonoidMap k a) Source # 
Instance details

Defined in Data.Monoid.Map

Associated Types

type Rep (MonoidMap k a) :: Type -> Type #

Methods

from :: MonoidMap k a -> Rep (MonoidMap k a) x #

to :: Rep (MonoidMap k a) x -> MonoidMap k a #

(Ord k, Read k, Read a) => Read (MonoidMap k a) Source # 
Instance details

Defined in Data.Monoid.Map

(Show k, Show a) => Show (MonoidMap k a) Source # 
Instance details

Defined in Data.Monoid.Map

Methods

showsPrec :: Int -> MonoidMap k a -> ShowS #

show :: MonoidMap k a -> String #

showList :: [MonoidMap k a] -> ShowS #

(Eq k, Eq a) => Eq (MonoidMap k a) Source # 
Instance details

Defined in Data.Monoid.Map

Methods

(==) :: MonoidMap k a -> MonoidMap k a -> Bool #

(/=) :: MonoidMap k a -> MonoidMap k a -> Bool #

(Ord k, Ord a) => Ord (MonoidMap k a) Source # 
Instance details

Defined in Data.Monoid.Map

Methods

compare :: MonoidMap k a -> MonoidMap k a -> Ordering #

(<) :: MonoidMap k a -> MonoidMap k a -> Bool #

(<=) :: MonoidMap k a -> MonoidMap k a -> Bool #

(>) :: MonoidMap k a -> MonoidMap k a -> Bool #

(>=) :: MonoidMap k a -> MonoidMap k a -> Bool #

max :: MonoidMap k a -> MonoidMap k a -> MonoidMap k a #

min :: MonoidMap k a -> MonoidMap k a -> MonoidMap k a #

type Rep (MonoidMap k a) Source # 
Instance details

Defined in Data.Monoid.Map

type Rep (MonoidMap k a) = D1 ('MetaData "MonoidMap" "Data.Monoid.Map" "stack-2.15.3-IiMra1A9vP4fPzeIsQ44c" 'True) (C1 ('MetaCons "MonoidMap" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map k a))))