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. mapFailure :: (fail1 -> fail2) -> RetryLog step fail1 done -> RetryLog step fail2 done

   cabal-install-solver	Distribution.Solver.Modular.RetryLog

   O(1). Apply a function to the failure value in a log.

2. mapWeightsWithKey :: Ord w2 => (k -> w1 -> w2) -> WeightedPSQ w1 k v -> WeightedPSQ w2 k v

   cabal-install-solver	Distribution.Solver.Modular.WeightedPSQ

   O(N log N). Update the weights.

3. mapWithKey :: (k -> v1 -> v2) -> WeightedPSQ w k v1 -> WeightedPSQ w k v2

   cabal-install-solver	Distribution.Solver.Modular.WeightedPSQ

   O(N). Update the values.

4. mapDeps :: (Component -> a -> b) -> ComponentDeps a -> ComponentDeps b

   cabal-install-solver	Distribution.Solver.Types.ComponentDeps

   Keep only selected components (and their associated deps info).

5. mapMB :: (Int -> Int) -> Approx -> Approx

   cdar-mBound	Data.CDAR.Approx

   No documentation available.

6. mapSubvectors :: (Vector u a, Vector v b) => (u a -> v b) -> Chimera u a -> Chimera v b

   chimera	Data.Chimera

   Map subvectors of a stream, using a given length-preserving function.

7. mapAccumS :: forall (m :: Type -> Type) a s b . Monad m => (a -> s -> ConduitT b Void m s) -> s -> ConduitT () b m () -> ConduitT a Void m s

   classy-prelude-conduit	ClassyPrelude.Conduit

   Consume a source with a strict accumulator, in a way piecewise defined by a controlling stream. The latter will be evaluated until it terminates.

   >>> let f a s = liftM (:s) $ mapC (*a) =$ CL.take a
   
   >>> reverse $ runIdentity $ yieldMany [0..3] $$ mapAccumS f [] (yieldMany [1..])
   [[],[1],[4,6],[12,15,18]] :: [[Int]]
   

8. mapAccumWhileC :: forall (m :: Type -> Type) a s b . Monad m => (a -> s -> Either s (s, b)) -> s -> ConduitT a b m s

   classy-prelude-conduit	ClassyPrelude.Conduit

   mapWhileC with a break condition dependent on a strict accumulator. Equivalently, mapAccum as long as the result is Right. Instead of producing a leftover, the breaking input determines the resulting accumulator via Left.

9. mapAccumWhileMC :: Monad m => (a -> s -> m (Either s (s, b))) -> s -> ConduitT a b m s

   classy-prelude-conduit	ClassyPrelude.Conduit

   Monadic mapAccumWhileC.

10. mapC :: forall (m :: Type -> Type) a b . Monad m => (a -> b) -> ConduitT a b m ()

    classy-prelude-conduit	ClassyPrelude.Conduit

    Apply a transformation to all values in a stream.

Page 237 of many | Previous | Next