Hoogle Search

Within LTS Haskell 24.19 (ghc-9.10.3)

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

Exact lookup

1. mapFst3 :: (a -> d) -> (a, b, c) -> (d, b, c)

   utility-ht	Data.Tuple.Strict

   No documentation available.

2. mapPair :: (a -> c, b -> d) -> (a, b) -> (c, d)

   utility-ht	Data.Tuple.Strict

   No documentation available.

3. mapSnd :: (b -> c) -> (a, b) -> (a, c)

   utility-ht	Data.Tuple.Strict

   No documentation available.

4. mapSnd3 :: (b -> d) -> (a, b, c) -> (a, d, c)

   utility-ht	Data.Tuple.Strict

   No documentation available.

5. mapThd3 :: (c -> d) -> (a, b, c) -> (a, b, d)

   utility-ht	Data.Tuple.Strict

   No documentation available.

6. mapTriple :: (a -> d, b -> e, c -> f) -> (a, b, c) -> (d, e, f)

   utility-ht	Data.Tuple.Strict

   No documentation available.

7. mapM_ :: Monad m => (Word8 -> m ()) -> ConduitT ByteString o m ()

   conduit-extra	Data.Conduit.Binary

   Perform a computation on each Word8 in a stream. Since 1.0.10

8. mapMaybe :: forall (m :: Type -> Type) a b . Functor m => (a -> Maybe b) -> SourceT m a -> SourceT m b

   servant	Servant.Types.SourceT

   Filter values.

   >>> toList $ mapMaybe (\x -> if odd x then Just x else Nothing) (source [0..10]) :: [Int]
   [1,3,5,7,9]
   

   >>> mapMaybe (\x -> if odd x then Just x else Nothing) (source [0..2]) :: SourceT Identity Int
   fromStepT (Effect (Identity (Skip (Yield 1 (Skip Stop)))))
   

   Illustrates why we need Skip.

9. mapMaybeStep :: forall (m :: Type -> Type) a b . Functor m => (a -> Maybe b) -> StepT m a -> StepT m b

   servant	Servant.Types.SourceT

   No documentation available.

10. mapStepT :: forall (m :: Type -> Type) a b . (StepT m a -> StepT m b) -> SourceT m a -> SourceT m b

    servant	Servant.Types.SourceT

    No documentation available.

Page 87 of many | Previous | Next