Safe Haskell | None |
---|---|
Language | Haskell98 |
Synopsis
- type AppendMap = MonoidalMap
- pattern AppendMap :: Map k v -> MonoidalMap k v
- _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)
- 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
- module Data.Map.Monoidal
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 #
showTreeWith :: forall k a. (k -> a -> String) -> Bool -> Bool -> MonoidalMap k a -> String Source #
module Data.Map.Monoidal
Orphan instances
FunctorMaybe (MonoidalMap k) Source # | |
fmapMaybe :: (a -> Maybe b) -> MonoidalMap k a -> MonoidalMap k b Source # | |
Default (MonoidalMap k a) Source # | |
def :: MonoidalMap k a # | |
(Ord k, Additive q) => Additive (MonoidalMap k q) Source # | |
(Ord k, Group q) => Group (MonoidalMap k q) Source # | |
negateG :: MonoidalMap k q -> MonoidalMap k q Source # (~~) :: MonoidalMap k q -> MonoidalMap k q -> MonoidalMap k q Source # |