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.
class
MapM' (f :: k -> k') (ss :: [k])hetero-parameter-list Data.HeteroParList No documentation available.
-
libyaml Text.Libyaml No documentation available.
-
libyaml Text.Libyaml Style for mappings - e.g. block or flow
-
morpheus-graphql-app Data.Morpheus.App No documentation available.
module Data.Array.Repa.Operators.
Mapping No documentation available.
module Data.TypeLevel.Tuple.
MapIndex No documentation available.
MapSchema :: JSONSchema -> JSONSchemaautodocodec-schema Autodocodec.Schema No documentation available.
MapColumn :: ColumnType -> ColumnType -> ColumnTypecql Database.CQL.Protocol No documentation available.
MapColumn :: ColumnType -> ColumnType -> ColumnTypecql Database.CQL.Protocol.Internal No documentation available.
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 withtype 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.