Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. map :: Selector

   clay	Clay.Elements

   No documentation available.

2. map :: (a -> b) -> [a] -> [b]

   constrained-categories	Control.Category.Constrained.Prelude

   map f xs is the list obtained by applying f to each element of xs, i.e.,

   map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
   map f [x1, x2, ...] == [f x1, f x2, ...]
   

   this means that map id == id

   Examples

   >>> map (+1) [1, 2, 3]
   [2,3,4]
   

   >>> map id [1, 2, 3]
   [1,2,3]
   

   >>> map (\n -> 3 * n + 1) [1, 2, 3]
   [4,7,10]
   

3. map :: (a -> b) -> [a] -> [b]

   constrained-categories	Control.Category.Hask

   map f xs is the list obtained by applying f to each element of xs, i.e.,

   map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
   map f [x1, x2, ...] == [f x1, f x2, ...]
   

   this means that map id == id

   Examples

   >>> map (+1) [1, 2, 3]
   [2,3,4]
   

   >>> map id [1, 2, 3]
   [1,2,3]
   

   >>> map (\n -> 3 * n + 1) [1, 2, 3]
   [4,7,10]
   

4. map :: (a -> b) -> [a] -> [b]

   copilot-language	Copilot.Language.Prelude

   map f xs is the list obtained by applying f to each element of xs, i.e.,

   map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
   map f [x1, x2, ...] == [f x1, f x2, ...]
   

   this means that map id == id

   Examples

   >>> map (+1) [1, 2, 3]
   [2,3,4]
   

   >>> map id [1, 2, 3]
   [1,2,3]
   

   >>> map (\n -> 3 * n + 1) [1, 2, 3]
   [4,7,10]
   

5. map :: ToElem a => a -> Perch

   ghcjs-perch	GHCJS.Perch

   No documentation available.

6. map :: JsonSchema_Variant -> Maybe [JsonSchema_Variant_MapItem]

   gogol-discovery	Gogol.Discovery

   The map of discriminant value to schema to use for parsing..

7. map :: JsonSchema_Variant -> Maybe [JsonSchema_Variant_MapItem]

   gogol-discovery	Gogol.Discovery.Types

   The map of discriminant value to schema to use for parsing..

8. map :: Parameter -> Maybe [Parameter]

   gogol-tagmanager	Gogol.TagManager

   This map parameter's parameters (must have keys; keys must be unique). @mutable tagmanager.accounts.containers.workspaces.variables.create @mutable tagmanager.accounts.containers.workspaces.variables.update @mutable tagmanager.accounts.containers.workspaces.triggers.create @mutable tagmanager.accounts.containers.workspaces.triggers.update @mutable tagmanager.accounts.containers.workspaces.tags.create @mutable tagmanager.accounts.containers.workspaces.tags.update

9. map :: Parameter -> Maybe [Parameter]

   gogol-tagmanager	Gogol.TagManager.Types

   This map parameter's parameters (must have keys; keys must be unique). @mutable tagmanager.accounts.containers.workspaces.variables.create @mutable tagmanager.accounts.containers.workspaces.variables.update @mutable tagmanager.accounts.containers.workspaces.triggers.create @mutable tagmanager.accounts.containers.workspaces.triggers.update @mutable tagmanager.accounts.containers.workspaces.tags.create @mutable tagmanager.accounts.containers.workspaces.tags.update

10. map :: forall (u :: Type -> Type) a (v :: Type -> Type) b c d . (Vector u a, Vector v b, Vector u c, Vector v d) => ((a, b) -> (c, d)) -> Vector u v (a, b) -> Vector u v (c, d)

    hybrid-vectors	Data.Vector.Hybrid

    O(n) Map a function over a vector

Page 45 of many | Previous | Next