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. mapFst3 :: Functor f => (a -> f d) -> (a, b, c) -> f (d, b, c)

   utility-ht	Control.Functor.HT

   No documentation available.

2. mapSnd :: Functor f => (b -> f c) -> (a, b) -> f (a, c)

   utility-ht	Control.Functor.HT

   No documentation available.

3. mapSnd3 :: Functor f => (b -> f d) -> (a, b, c) -> f (a, d, c)

   utility-ht	Control.Functor.HT

   No documentation available.

4. mapThd3 :: Functor f => (c -> f d) -> (a, b, c) -> f (a, b, d)

   utility-ht	Control.Functor.HT

   No documentation available.

5. mapBoth :: (a -> c) -> (b -> d) -> Either a b -> Either c d

   utility-ht	Data.Either.HT

   No documentation available.

6. mapLeft :: (a -> b) -> Either a c -> Either b c

   utility-ht	Data.Either.HT

   No documentation available.

7. mapRight :: (b -> c) -> Either a b -> Either a c

   utility-ht	Data.Either.HT

   No documentation available.

8. mapAdjacent :: (a -> a -> b) -> [a] -> [b]

   utility-ht	Data.List.HT

   This function combines every pair of neighbour elements in a list with a certain function.

   >>> mapAdjacent (<=) ""
   []
   
   >>> mapAdjacent (<=) "a"
   []
   
   >>> mapAdjacent (<=) "aba"
   [True,False]
   
   >>> mapAdjacent (,) "abc"
   [('a','b'),('b','c')]
   

   \x xs -> mapAdjacent subtract (scanl (+) x xs) == (xs::[Integer])
   

9. mapAdjacent1 :: (a -> a -> b -> c) -> a -> [(a, b)] -> [c]

   utility-ht	Data.List.HT

   >>> let f x y z = [x,y]++show(z::Int) in mapAdjacent1 f 'a' [('b',1), ('c',2), ('d',3)]
   ["ab1","bc2","cd3"]
   

10. mapFst :: (a -> c) -> (a, b) -> (c, b)

    utility-ht	Data.Tuple.HT

    first

Page 125 of many | Previous | Next