| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Downhill.Linear.Prelude
Synopsis
- pattern T2 :: forall r a b. (BasicVector a, BasicVector b) => BackGrad r a -> BackGrad r b -> BackGrad r (a, b)
- pattern T3 :: forall r a b c. (BasicVector a, BasicVector b, BasicVector c) => BackGrad r a -> BackGrad r b -> BackGrad r c -> BackGrad r (a, b, c)
Documentation
pattern T2 :: forall r a b. (BasicVector a, BasicVector b) => BackGrad r a -> BackGrad r b -> BackGrad r (a, b) Source #
getFst :: (BasicVector (DualOf a), BasicVector (DualOf b)) => BackGrad r (a, b) -> BackGrad r a getFst (T2 x _) = x
mkPair :: (BasicVector (DualOf a), BasicVector (DualOf b)) => BackGrad r a -> BackGrad r b -> BackGrad r (a, b) mkPair x y = (T2 x y)
pattern T3 :: forall r a b c. (BasicVector a, BasicVector b, BasicVector c) => BackGrad r a -> BackGrad r b -> BackGrad r c -> BackGrad r (a, b, c) Source #