map -package:unordered-containers -package:containers -package:ghc -package:integration -package:base-prelude -package:Cabal-syntax package:insert-ordered-containers

map :: (v1 -> v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2
insert-ordered-containers Data.HashMap.Strict.InsOrd
map :: (Hashable b, Eq b) => (a -> b) -> InsOrdHashSet a -> InsOrdHashSet b
insert-ordered-containers Data.HashSet.InsOrd
mapKeys :: (Eq k', Hashable k') => (k -> k') -> InsOrdHashMap k v -> InsOrdHashMap k' v
insert-ordered-containers Data.HashMap.Strict.InsOrd
Order preserving mapping of keys.
mapMaybe :: (v1 -> Maybe v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2
insert-ordered-containers Data.HashMap.Strict.InsOrd
mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2
insert-ordered-containers Data.HashMap.Strict.InsOrd
mapWithKey :: (k -> v1 -> v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2
insert-ordered-containers Data.HashMap.Strict.InsOrd
data InsOrdHashMap k v
insert-ordered-containers Data.HashMap.Strict.InsOrd
HashMap which tries its best to remember insertion order of elements.
foldMapWithKey :: Monoid m => (k -> a -> m) -> InsOrdHashMap k a -> m
insert-ordered-containers Data.HashMap.Strict.InsOrd
fromHashMap :: HashMap k v -> InsOrdHashMap k v
insert-ordered-containers Data.HashMap.Strict.InsOrd
hashMap :: Iso (InsOrdHashMap k a) (InsOrdHashMap k b) (HashMap k a) (HashMap k b)
insert-ordered-containers Data.HashMap.Strict.InsOrd
This is a slight lie, as roundtrip doesn't preserve ordering.
toHashMap :: InsOrdHashMap k v -> HashMap k v
insert-ordered-containers Data.HashMap.Strict.InsOrd
unorderedFoldMap :: Monoid m => (a -> m) -> InsOrdHashMap k a -> m
insert-ordered-containers Data.HashMap.Strict.InsOrd
More efficient than foldMap, when folding in insertion order is not important.
unorderedFoldMapWithKey :: Monoid m => (k -> a -> m) -> InsOrdHashMap k a -> m
insert-ordered-containers Data.HashMap.Strict.InsOrd
More efficient than foldMapWithKey, when folding in insertion order is not important.