Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.SemiMap

Synopsis

newtype SemiMap k v = SemiMap {
- unSemiMap :: Map k v
}

Documentation

newtype SemiMap k v Source #

A newtype around Map which uses unionWith (<>) for the semigroup and monoid instance.

Since: 0.1.0.0

Constructors

SemiMap
Fields unSemiMap :: Map k v

Instances

Instances details

MonadWriter SchemaDocs EntityDoc' Source #
Instance details Defined in Database.Persist.Documentation.Internal Methods writer :: (a, SchemaDocs) -> EntityDoc' a # tell :: SchemaDocs -> EntityDoc' () # listen :: EntityDoc' a -> EntityDoc' (a, SchemaDocs) # pass :: EntityDoc' (a, SchemaDocs -> SchemaDocs) -> EntityDoc' a #
(Ord k, Semigroup v) => Monoid (SemiMap k v) Source #
Instance details Defined in Data.SemiMap Methods mempty :: SemiMap k v # mappend :: SemiMap k v -> SemiMap k v -> SemiMap k v # mconcat :: [SemiMap k v] -> SemiMap k v #
(Ord k, Semigroup v) => Semigroup (SemiMap k v) Source #
Instance details Defined in Data.SemiMap Methods (<>) :: SemiMap k v -> SemiMap k v -> SemiMap k v # sconcat :: NonEmpty (SemiMap k v) -> SemiMap k v # stimes :: Integral b => b -> SemiMap k v -> SemiMap k v #
(Show k, Show v) => Show (SemiMap k v) Source #
Instance details Defined in Data.SemiMap Methods showsPrec :: Int -> SemiMap k v -> ShowS # show :: SemiMap k v -> String # showList :: [SemiMap k v] -> ShowS #
(Eq k, Eq v) => Eq (SemiMap k v) Source #
Instance details Defined in Data.SemiMap Methods (==) :: SemiMap k v -> SemiMap k v -> Bool # (/=) :: SemiMap k v -> SemiMap k v -> Bool #
(Ord k, Ord v) => Ord (SemiMap k v) Source #
Instance details Defined in Data.SemiMap Methods compare :: SemiMap k v -> SemiMap k v -> Ordering # (<) :: SemiMap k v -> SemiMap k v -> Bool # (<=) :: SemiMap k v -> SemiMap k v -> Bool # (>) :: SemiMap k v -> SemiMap k v -> Bool # (>=) :: SemiMap k v -> SemiMap k v -> Bool # max :: SemiMap k v -> SemiMap k v -> SemiMap k v # min :: SemiMap k v -> SemiMap k v -> SemiMap k v #