reflex-0.6.3: Higher-order Functional Reactive Programming

Safe HaskellNone
LanguageHaskell98

Data.AppendMap

Contents

Description

 
Synopsis

Documentation

type AppendMap = MonoidalMap Source #

Deprecated: Use MonoidalMap instead

AppendMap is a synonym for MonoidalMap

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

Deprecated: Use MonoidalMap instead

Pattern synonym for MonoidalMap

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

Deprecated: Use getMonoidalMap instead

A synonym for getMonoidalMap

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 #

Like mapMaybe but indicates whether the resulting container is empty

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

Displays a MonoidalMap as a tree. See showTree for details.

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

Displays a MonoidalMap as a tree, using the supplied function to convert nodes to string.

Orphan instances

Filterable (MonoidalMap k) Source # 
Instance details

Methods

mapMaybe :: (a -> Maybe b) -> MonoidalMap k a -> MonoidalMap k b #

catMaybes :: MonoidalMap k (Maybe a) -> MonoidalMap k a #

filter :: (a -> Bool) -> MonoidalMap k a -> MonoidalMap k a #

Default (MonoidalMap k a) Source # 
Instance details

Methods

def :: MonoidalMap k a #