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.

  1. (^^..) :: (Num b, Num a, Reifies s W) => BVar s b -> Traversal' b a -> [BVar s a]

    backprop Numeric.Backprop.Num

    ^^.., but with Num constraints instead of Backprop constraints.

  2. (**.) :: Floating a => Op '[a, a] a

    backprop Numeric.Backprop.Op

    Op for exponentiation

  3. (*.) :: Num a => Op '[a, a] a

    backprop Numeric.Backprop.Op

    Op for multiplication

  4. (+.) :: Num a => Op '[a, a] a

    backprop Numeric.Backprop.Op

    Op for addition

  5. (-.) :: Num a => Op '[a, a] a

    backprop Numeric.Backprop.Op

    Op for subtraction

  6. (/.) :: Fractional a => Op '[a, a] a

    backprop Numeric.Backprop.Op

    Op for division

  7. (~.) :: forall (as :: [Type]) b c . RPureConstrained Num as => Op '[b] c -> Op as b -> Op as c

    backprop Numeric.Backprop.Op

    Convenient infix synonym for (flipped) composeOp1. Meant to be used just like .: 

    f :: Op '[b]   c
g :: Op '[a,a] b

f ~. g :: Op '[a, a] c

  8. (<.>) :: Module f => Scalar f -> f a -> f a

    boltzmann-samplers Boltzmann.Species

    Scalar multiplication.

  9. (+>>.) :: forall (n :: Nat) . KnownNat n => Bit -> BitVector n -> BitVector n

    clash-prelude Clash.Sized.BitVector

    Shift in a bit from the MSB side of a BitVector. Equal to right shifting the BitVector by one and replacing the MSB with the bit to be shifted in. 

    >>> 1 +>>. 0b1111_0000 :: BitVector 8
0b1111_1000

>>> 0 +>>. 0b1111_0000 :: BitVector 8
0b0111_1000

  10. (/./) :: forall (xs :: [Type]) (ys :: [Type]) . Many xs -> Many ys -> Many (Append xs ys)

    data-diverse Data.Diverse.Many

    Infix version of append. Mnemonic: consMany ./ with an extra slash (meaning Many) in front.

Page 134 of many | Previous | Next