Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. blockMapF :: (IsList t, Item t ~ (k, v), Buildable k, Buildable v) => t -> Builder

   fmt	Fmt.Internal.Formatters

   A YAML-like map formatter:

   >>> fmt $ blockMapF [("Odds", blockListF [1,3]), ("Evens", blockListF [2,4])]
   Odds:
   - 1
   - 3
   Evens:
   - 2
   - 4
   

2. blockMapF' :: (IsList t, Item t ~ (k, v)) => (k -> Builder) -> (v -> Builder) -> t -> Builder

   fmt	Fmt.Internal.Formatters

   A version of blockMapF that lets you supply your own building function for keys and values.

3. jsonMapF :: (IsList t, Item t ~ (k, v), Buildable k, Buildable v) => t -> Builder

   fmt	Fmt.Internal.Formatters

   A JSON-like map formatter (unlike mapF, always multiline):

   >>> fmt $ jsonMapF [("Odds", jsonListF [1,3]), ("Evens", jsonListF [2,4])]
   {
   Odds:
   [
   1
   , 3
   ]
   , Evens:
   [
   2
   , 4
   ]
   }
   

4. jsonMapF' :: (IsList t, Item t ~ (k, v)) => (k -> Builder) -> (v -> Builder) -> t -> Builder

   fmt	Fmt.Internal.Formatters

   A version of jsonMapF that lets you supply your own building function for keys and values.

5. data InsOrdHashMap k v

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

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

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

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

   No documentation available.

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

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

   No documentation available.

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

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

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

   No documentation available.

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

Page 520 of many | Previous | Next