| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.AppendMap
Contents
Description
Synopsis
- type AppendMap = MonoidalMap
- pattern AppendMap :: Map k v -> MonoidalMap k v
- showTree :: forall k a. (Show k, Show a) => MonoidalMap k a -> String
- showTreeWith :: forall k a. (k -> a -> String) -> Bool -> Bool -> MonoidalMap k a -> String
- _unAppendMap :: MonoidalMap k v -> Map k v
- nonEmptyDelete :: Ord k => k -> MonoidalMap k a -> Maybe (MonoidalMap k a)
- mapMaybeNoNull :: (a -> Maybe b) -> MonoidalMap token a -> Maybe (MonoidalMap token b)
- module Data.Map.Monoidal
- module Data.Map.Monoidal
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
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.
_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
module Data.Map.Monoidal
module Data.Map.Monoidal
Orphan instances
| Default (MonoidalMap k a) Source # | |
Methods def :: MonoidalMap k a # | |