Hoogle Search

Within LTS Haskell 24.34 (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)) => (k -> Builder) -> (v -> Builder) -> t -> Builder

   fmt	Fmt

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

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

   fmt	Fmt

   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
   ]
   }
   

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

   fmt	Fmt

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

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

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

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

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

8. data InsOrdHashMap k v

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

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

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

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

   No documentation available.

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

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

    No documentation available.

Page 519 of many | Previous | Next