reflex-0.5: Higher-order Functional Reactive Programming

Safe HaskellNone
LanguageHaskell98

Data.AppendMap

Contents

Description

Map with a better Monoid instance

Map has mappend = union, which is left-biased. AppendMap has mappend = unionWith mappend instead.

Synopsis

Documentation

type AppendMap = MonoidalMap Source #

Deprecated: Use MonoidalMap instead

pattern AppendMap :: Map k v -> MonoidalMap k v Source #

Deprecated: Use MonoidalMap instead

_unAppendMap :: MonoidalMap k v -> Map k v Source #

Deprecated: Use getMonoidalMap instead

nonEmptyDelete :: Ord k => k -> MonoidalMap k a -> Maybe (MonoidalMap k a) Source #

Deletes a key, returning Nothing if the result is empty.

mapMaybeNoNull :: (a -> Maybe b) -> MonoidalMap token a -> Maybe (MonoidalMap token b) Source #

showTree :: forall k a. (Show k, Show a) => MonoidalMap k a -> String Source #

showTreeWith :: forall k a. (k -> a -> String) -> Bool -> Bool -> MonoidalMap k a -> String Source #

Orphan instances

FunctorMaybe (MonoidalMap k) Source # 
Instance details

Methods

fmapMaybe :: (a -> Maybe b) -> MonoidalMap k a -> MonoidalMap k b Source #

Default (MonoidalMap k a) Source # 
Instance details

Methods

def :: MonoidalMap k a #

(Ord k, Additive q) => Additive (MonoidalMap k q) Source # 
Instance details

(Ord k, Group q) => Group (MonoidalMap k q) Source # 
Instance details