Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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. mapAccumL :: forall acc x y (n :: Nat) . (acc -> x -> (acc, y)) -> acc -> Vec n x -> (acc, Vec n y)

   clash-prelude	Clash.Explicit.Prelude

   The mapAccumL function behaves like a combination of map and foldl; it applies a function to each element of a vector, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new vector.

   >>> mapAccumL (\acc x -> (acc + x,acc + 1)) 0 (1 :> 2 :> 3 :> 4 :> Nil)
   (10,1 :> 2 :> 4 :> 7 :> Nil)
   

   "mapAccumL f acc xs" corresponds to the following circuit layout:

8. mapAccumR :: forall acc x y (n :: Nat) . (acc -> x -> (acc, y)) -> acc -> Vec n x -> (acc, Vec n y)

   clash-prelude	Clash.Explicit.Prelude

   The mapAccumR function behaves like a combination of map and foldr; it applies a function to each element of a vector, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new vector.

   >>> mapAccumR (\acc x -> (acc + x,acc + 1)) 0 (1 :> 2 :> 3 :> 4 :> Nil)
   (10,10 :> 8 :> 5 :> 1 :> Nil)
   

   "mapAccumR f acc xs" corresponds to the following circuit layout:

9. mapAccumL :: forall acc x y (n :: Nat) . (acc -> x -> (acc, y)) -> acc -> Vec n x -> (acc, Vec n y)

   clash-prelude	Clash.Explicit.Prelude.Safe

   The mapAccumL function behaves like a combination of map and foldl; it applies a function to each element of a vector, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new vector.

   >>> mapAccumL (\acc x -> (acc + x,acc + 1)) 0 (1 :> 2 :> 3 :> 4 :> Nil)
   (10,1 :> 2 :> 4 :> 7 :> Nil)
   

   "mapAccumL f acc xs" corresponds to the following circuit layout:

10. mapAccumR :: forall acc x y (n :: Nat) . (acc -> x -> (acc, y)) -> acc -> Vec n x -> (acc, Vec n y)

    clash-prelude	Clash.Explicit.Prelude.Safe

    The mapAccumR function behaves like a combination of map and foldr; it applies a function to each element of a vector, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new vector.

    >>> mapAccumR (\acc x -> (acc + x,acc + 1)) 0 (1 :> 2 :> 3 :> 4 :> Nil)
    (10,10 :> 8 :> 5 :> 1 :> Nil)
    

    "mapAccumR f acc xs" corresponds to the following circuit layout:

Page 238 of many | Previous | Next