Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

  1. mapMaybe :: List l => (a -> Maybe b) -> l a -> l b

    List Data.List.Class

    No documentation available.

  2. mapInside :: CanMapInside dom e => dom -> e -> e

    aern2-mp AERN2.MP.Enclosure

    Return some value contained in dom. The returned value does not have to equal the given e even if e is already inside dom. All elements of dom should be covered with roughly the same probability when calling this function for evenly distributed e's. This function is intended mainly for generating values inside dom for randomised tests.

  3. mapAll :: All f xs => (forall (x :: k) . f x => Proxy x -> a) -> [a]

    aeson-schemas Data.Aeson.Schema.Utils.All

    No documentation available.

  4. mapReplacement :: (Replacement -> Replacement) -> Replacer -> Replacer

    alfred-margaret Data.Text.AhoCorasick.Replacer

    Modify the replacement of a replacer. It doesn't modify the needles.

  5. mapSearcher :: Hashable b => (a -> b) -> Searcher a -> Searcher b

    alfred-margaret Data.Text.AhoCorasick.Searcher

    Modify the values associated with the needles.

  6. mapAccumL :: (Traversable t, Backprop b, Backprop c, Reifies s W) => (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

    backprop Prelude.Backprop

    Lifted version of mapAccumL. Prior to v0.2.3, required a Backprop constraint on t b.

  7. mapAccumR :: (Traversable t, Backprop b, Backprop c, Reifies s W) => (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

    backprop Prelude.Backprop

    Lifted version of mapAccumR. Prior to v0.2.3, required a Backprop constraint on t b.

  8. mapAccumL :: (Traversable t, Reifies s W) => AddFunc b -> AddFunc c -> ZeroFunc b -> ZeroFunc c -> (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

    backprop Prelude.Backprop.Explicit

    mapAccumL, but taking explicit add and zero.

  9. mapAccumR :: (Traversable t, Reifies s W) => AddFunc b -> AddFunc c -> ZeroFunc b -> ZeroFunc c -> (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

    backprop Prelude.Backprop.Explicit

    mapAccumR, but taking explicit add and zero.

  10. mapAccumL :: (Traversable t, Num b, Num c, Reifies s W) => (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

    backprop Prelude.Backprop.Num

    mapAccumL, but with Num constraints instead of Backprop constraints. Prior to v0.2.3, required a Num constraint on t b.

Page 234 of many | Previous | Next