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
- empty :: MonoidalMap k a
- null :: MonoidalMap k a -> Bool
- delete :: Ord k => k -> MonoidalMap k a -> MonoidalMap k a
- newtype MonoidalMap k a = MonoidalMap {
- getMonoidalMap :: Map k a
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 #
empty :: MonoidalMap k a #
null :: MonoidalMap k a -> Bool #
delete :: Ord k => k -> MonoidalMap k a -> MonoidalMap k a #
O(log n). Delete a key and its value from the map. When the key is not a member of the map, the original map is returned.
newtype MonoidalMap k a #
A Map
with monoidal accumulation
MonoidalMap | |
|
Instances
Orphan instances
Filterable (MonoidalMap k) Source # | |
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 # | |
def :: MonoidalMap k a # |