Safe Haskell | None |
---|
- data Map k a
- updateM :: forall k a b. Ord k => k -> State (Maybe a) b -> State (Map k a) b
- empty :: Map k a
- null :: Map k a -> Bool
- lookup :: Ord k => k -> Map k a -> Maybe a
- insert :: Ord k => k -> a -> Map k a -> Map k a
- insertWith :: Ord k => (a -> a -> a) -> k -> a -> Map k a -> Map k a
- delete :: Ord k => k -> Map k a -> Map k a
- foldlWithKey :: forall z k a. (z -> k -> a -> z) -> z -> Map k a -> z
- foldrWithKey :: forall z k a. (k -> a -> z -> z) -> z -> Map k a -> z
- fromList :: Ord k => [(k, a)] -> Map k a
- toList :: Map k a -> [(k, a)]
- assocs :: Map k a -> [(k, a)]
- elems :: Map k a -> [a]
- maxKey :: Map k a -> Maybe k
- scan :: forall k a z. (k -> a -> z) -> (k -> z -> z -> z) -> Map k a -> Maybe z
- mapLens :: Ord k => k -> Lens (Map k a) (Maybe a)
Documentation
Unlike Data.Map, this Map does not support constant time size computation
Typeable2 Map | |
Functor (Map k) | |
(Eq k, Eq a) => Eq (Map k a) | |
(Show k, Show a) => Show (Map k a) | |
Structured (Map k0 a0) | |
(Persistent a, Persistent k, Typeable k, Typeable a) => Persistent (Map k a) |
updateM :: forall k a b. Ord k => k -> State (Maybe a) b -> State (Map k a) bSource
General update/lookup at a single key. The State monad used supports non-modification. Nothing denotes the absence of a value.
insertWith :: Ord k => (a -> a -> a) -> k -> a -> Map k a -> Map k aSource
foldlWithKey :: forall z k a. (z -> k -> a -> z) -> z -> Map k a -> zSource
foldrWithKey :: forall z k a. (k -> a -> z -> z) -> z -> Map k a -> zSource