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 :: (forall t . Typeable t => Proxy t -> Item x t -> Item y t) -> TypeMap x -> TypeMap y

   type-map	Data.TypeMap.Dynamic

   Map a function on all elements.

2. map :: (forall t . Typeable t => Item x t -> Item y t) -> TypeMap x -> TypeMap y

   type-map	Data.TypeMap.Dynamic.Alt

   Map a function on all elements.

3. map :: (forall t . Typeable t => Proxy t -> Item x t -> Item y t) -> TypeMap x -> TypeMap y

   type-map	Data.TypeMap.Internal.Dynamic

   Map a function on all elements.

4. map :: (forall t . Typeable t => Item x t -> Item y t) -> TypeMap x -> TypeMap y

   type-map	Data.TypeMap.Internal.Dynamic.Alt

   Map a function on all elements.

5. map :: (Unboxable a, Unboxable b) => (a -> b) -> Vector a -> Vector b

   unboxing-vector	Data.Vector.Unboxing

   No documentation available.

6. map :: forall a b (n :: Nat) . SNatI n => (a -> b) -> Vec n a -> Vec n b

   vec	Data.Vec.DataFamily.SpineStrict

   >>> map not $ True ::: False ::: VNil
   False ::: True ::: VNil
   

7. map :: forall a b (n :: Nat) . (a -> b) -> Vec n a -> Vec n b

   vec	Data.Vec.Lazy

   >>> map not $ True ::: False ::: VNil
   False ::: True ::: VNil
   

8. map :: forall a b (n :: Nat) . SNatI n => (a -> b) -> Vec n a -> Vec n b

   vec	Data.Vec.Lazy.Inline

   >>> map not $ True ::: False ::: VNil
   False ::: True ::: VNil
   

9. map :: forall a b (n :: Nat) . (a -> b) -> Vec n a -> Vec n b

   vec	Data.Vec.Pull

   >>> L.fromPull $ map not $ L.toPull $ True L.::: False L.::: L.VNil
   False ::: True ::: VNil
   

10. map :: (branch0 -> branch1) -> (leaf0 -> leaf1) -> T branch0 leaf0 -> T branch1 leaf1

    wraxml	Data.Tree.BranchLeaf

    No documentation available.

Page 43 of many | Previous | Next