Safe Haskell	None
Language	Haskell2010

Data.HashMap.Strict.InsOrd.Extended

Synopsis

catMaybes :: InsOrdHashMap k (Maybe v) -> InsOrdHashMap k v
partition :: (Eq k, Hashable k) => (v -> Bool) -> InsOrdHashMap k v -> (InsOrdHashMap k v, InsOrdHashMap k v)
alterF :: (Functor f, Eq k, Hashable k) => (Maybe v -> f (Maybe v)) -> k -> InsOrdHashMap k v -> f (InsOrdHashMap k v)

Documentation

catMaybes :: InsOrdHashMap k (Maybe v) -> InsOrdHashMap k v Source #

partition :: (Eq k, Hashable k) => (v -> Bool) -> InsOrdHashMap k v -> (InsOrdHashMap k v, InsOrdHashMap k v) Source #

alterF :: (Functor f, Eq k, Hashable k) => (Maybe v -> f (Maybe v)) -> k -> InsOrdHashMap k v -> f (InsOrdHashMap k v) Source #

Alter a hashmap using a function that can fail, in which case the entire operation fails. (Maybe a version with the key also being passed to the function could be useful.)