Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

  1. fmap :: (Traversable f, Backprop a, Backprop b, Reifies s W) => (BVar s a -> BVar s b) -> BVar s (f a) -> BVar s (f b)

    backprop Prelude.Backprop

    Lifted fmap. Lifts backpropagatable functions to be backpropagatable functions on Traversable Functors.

  2. fmapConst :: (Functor f, Foldable f, Backprop b, Backprop (f a), Reifies s W) => BVar s b -> BVar s (f a) -> BVar s (f b)

    backprop Prelude.Backprop

    Efficient version of fmap when used to "replace" all values in a Functor value. 

    fmapConst x = fmap (const x)
    but much more efficient.

  3. fmap :: (Traversable f, Reifies s W) => AddFunc a -> AddFunc b -> ZeroFunc a -> ZeroFunc b -> (BVar s a -> BVar s b) -> BVar s (f a) -> BVar s (f b)

    backprop Prelude.Backprop.Explicit

    fmap, but taking explicit add and zero.

  4. fmapConst :: (Functor f, Foldable f, Reifies s W) => AddFunc (f a) -> AddFunc b -> ZeroFunc (f a) -> ZeroFunc b -> BVar s b -> BVar s (f a) -> BVar s (f b)

    backprop Prelude.Backprop.Explicit

    fmapConst, but taking explicit add and zero.

  5. fmap :: (Traversable f, Num a, Num b, Reifies s W) => (BVar s a -> BVar s b) -> BVar s (f a) -> BVar s (f b)

    backprop Prelude.Backprop.Num

    fmap, but with Num constraints instead of Backprop constraints.

  6. fmapConst :: (Functor f, Foldable f, Num b, Num (f a), Reifies s W) => BVar s b -> BVar s (f a) -> BVar s (f b)

    backprop Prelude.Backprop.Num

    fmapConst, but with Num constraints instead of Backprop constraints.

  7. c'glfwUpdateGamepadMappings :: CString -> IO CInt

    bindings-GLFW Bindings.GLFW

    No documentation available.

  8. p'glfwUpdateGamepadMappings :: FunPtr (CString -> IO CInt)

    bindings-GLFW Bindings.GLFW

    No documentation available.

  9. amap :: Ix i => (Bool -> Bool) -> BitArray i -> BitArray i

    bitwise Data.Array.BitArray

    Alias for map.

  10. ixmap :: (Ix i, Ix j) => (i, i) -> (i -> j) -> BitArray j -> BitArray i

    bitwise Data.Array.BitArray

    Create a new array by mapping indices into a source array..

Page 1018 of many | Previous | Next