Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. data InsOrdHashMap k v

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   HashMap which tries its best to remember insertion order of elements.

2. foldMapWithKey :: Monoid m => (k -> a -> m) -> InsOrdHashMap k a -> m

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   No documentation available.

3. fromHashMap :: HashMap k v -> InsOrdHashMap k v

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   No documentation available.

4. hashMap :: forall k a b p f . (Profunctor p, Functor f) => p (HashMap k a) (f (HashMap k b)) -> p (InsOrdHashMap k a) (f (InsOrdHashMap k b))

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   This is a slight lie, as roundtrip doesn't preserve ordering.

5. toHashMap :: InsOrdHashMap k v -> HashMap k v

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   No documentation available.

6. 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.

7. 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.

8. MetaMap :: Map Text MetaValue -> MetaValue

   pandoc-types	Text.Pandoc.Definition

   No documentation available.

9. decodeMapSkel :: (Serialise k, Serialise v) => ([(k, v)] -> m) -> Decoder s m

   serialise	Codec.Serialise.Class

   A utility function to construct a Decoder for maps.

10. encodeMapSkel :: (Serialise k, Serialise v) => (m -> Int) -> ((k -> v -> Encoding -> Encoding) -> Encoding -> m -> Encoding) -> m -> Encoding

    serialise	Codec.Serialise.Class

    A helper function for encoding maps.

Page 520 of many | Previous | Next