Hoogle Search

Within LTS Haskell 24.12 (ghc-9.10.3)

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

Exact lookup

1. module Data.Array.Repa.Operators.Mapping

   No documentation available.

2. module Data.TypeLevel.Tuple.MapIndex

   No documentation available.

3. MapSchema :: JSONSchema -> JSONSchema

   autodocodec-schema	Autodocodec.Schema

   No documentation available.

4. MapColumn :: ColumnType -> ColumnType -> ColumnType

   cql	Database.CQL.Protocol

   No documentation available.

5. MapColumn :: ColumnType -> ColumnType -> ColumnType

   cql	Database.CQL.Protocol.Internal

   No documentation available.

6. newtype MapF k1 (f :: k -> Type) (a :: k)

   functor-combinators	Control.Applicative.ListF

   A map of f as, indexed by keys of type k. It can be useful for represeting a product of many different values of type f a, each "at" a different k location. Can be considered a combination of EnvT and ListF, in a way --- a MapF k f a is like a ListF (EnvT k f) a with unique (and ordered) keys. One use case might be to extend a schema with many "options", indexed by some string. For example, if you had a command line argument parser for a single command

   data Command a
   

   Then you can represent a command line argument parser for multiple named commands with

   type Commands = MapF String Command
   

   See NEMapF for a non-empty variant, if you want to enforce that your bag has at least one f a.

7. MapF :: Map k1 (f a) -> MapF k1 (f :: k -> Type) (a :: k)

   functor-combinators	Control.Applicative.ListF

   No documentation available.

8. newtype MapF k1 (f :: k -> Type) (a :: k)

   functor-combinators	Data.Functor.Combinator

   A map of f as, indexed by keys of type k. It can be useful for represeting a product of many different values of type f a, each "at" a different k location. Can be considered a combination of EnvT and ListF, in a way --- a MapF k f a is like a ListF (EnvT k f) a with unique (and ordered) keys. One use case might be to extend a schema with many "options", indexed by some string. For example, if you had a command line argument parser for a single command

   data Command a
   

   Then you can represent a command line argument parser for multiple named commands with

   type Commands = MapF String Command
   

   See NEMapF for a non-empty variant, if you want to enforce that your bag has at least one f a.

9. MapF :: Map k1 (f a) -> MapF k1 (f :: k -> Type) (a :: k)

   functor-combinators	Data.Functor.Combinator

   No documentation available.

10. type MapSyntax k v = MapSyntaxM k v ()

    map-syntax	Data.Map.Syntax

    Convenient type alias that will probably be used most of the time.

Page 62 of many | Previous | Next