Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

    LambdaHack Game.LambdaHack.Core.Prelude

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

    Examples

    mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

  2. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

    LambdaHack Game.LambdaHack.Core.Prelude

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

    Examples

    mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

  3. mapM_ :: (Foldable t, Monad m) => (a -> m ()) -> t a -> m ()

    LambdaHack Game.LambdaHack.Core.Prelude

    This has a more specific type (unit result) than normally, to catch errors.

  4. mappend :: Monoid a => a -> a -> a

    LambdaHack Game.LambdaHack.Core.Prelude

    An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. 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.

  10. mapAccumR :: (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

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

Page 11 of many | Previous | Next