Agda-2.6.1: A dependently typed functional programming language and proof assistant
Safe HaskellSafe
LanguageHaskell2010

Agda.Utils.Map

Synopsis
  • filterKeys :: (k -> Bool) -> Map k a -> Map k a
  • mapMaybeKeys :: (Ord k1, Ord k2) => (k1 -> Maybe k2) -> Map k1 a -> Map k2 a

Non-monadic map operations

filterKeys :: (k -> Bool) -> Map k a -> Map k a Source #

Filter a map based on the keys.

mapMaybeKeys :: (Ord k1, Ord k2) => (k1 -> Maybe k2) -> Map k1 a -> Map k2 a Source #

O(n log n). Rebuilds the map from scratch. Not worse than mapKeys.