Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. (+) :: Additive x => BackpropFunc (x, x) x

   inf-backprop	InfBackprop

   Summation differentiable binary operation.

   Examples of usage

   >>> import Prelude (Float)
   
   >>> import InfBackprop (call, derivative)
   

   >>> call (+) (2, 3) :: Float
   5.0
   

   >>> import Debug.SimpleExpr.Expr (variable)
   
   >>> x = variable "x"
   
   >>> y = variable "y"
   
   >>> derivative (+) (x, y)
   (1,1)
   

2. (+) :: Additive x => BackpropFunc (x, x) x

   inf-backprop	Prelude.InfBackprop

   Summation differentiable binary operation.

   Examples of usage

   >>> import Prelude (Float)
   
   >>> import InfBackprop (call, derivative)
   

   >>> call (+) (2, 3) :: Float
   5.0
   

   >>> import Debug.SimpleExpr.Expr (variable)
   
   >>> x = variable "x"
   
   >>> y = variable "y"
   
   >>> derivative (+) (x, y)
   (1,1)
   

3. (+) :: Num a => a -> a -> a

   verset	Verset

   No documentation available.

4. (+) :: Num a => a -> a -> a

   xmonad-contrib	XMonad.Config.Prime

   No documentation available.

5. (++) :: [a] -> [a] -> [a]

   base	Prelude

   (++) appends two lists, i.e.,

   [x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
   [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
   

   If the first list is not finite, the result is the first list.

   Performance considerations

   This function takes linear time in the number of elements of the first list. Thus it is better to associate repeated applications of (++) to the right (which is the default behaviour): xs ++ (ys ++ zs) or simply xs ++ ys ++ zs, but not (xs ++ ys) ++ zs. For the same reason concat = foldr (++) [] has linear performance, while foldl (++) [] is prone to quadratic slowdown

   Examples

   >>> [1, 2, 3] ++ [4, 5, 6]
   [1,2,3,4,5,6]
   

   >>> [] ++ [1, 2, 3]
   [1,2,3]
   

   >>> [3, 2, 1] ++ []
   [3,2,1]
   

6. (++) :: [a] -> [a] -> [a]

   base	Data.List

   (++) appends two lists, i.e.,

   [x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
   [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
   

   If the first list is not finite, the result is the first list.

   Performance considerations

   This function takes linear time in the number of elements of the first list. Thus it is better to associate repeated applications of (++) to the right (which is the default behaviour): xs ++ (ys ++ zs) or simply xs ++ ys ++ zs, but not (xs ++ ys) ++ zs. For the same reason concat = foldr (++) [] has linear performance, while foldl (++) [] is prone to quadratic slowdown

   Examples

   >>> [1, 2, 3] ++ [4, 5, 6]
   [1,2,3,4,5,6]
   

   >>> [] ++ [1, 2, 3]
   [1,2,3]
   

   >>> [3, 2, 1] ++ []
   [3,2,1]
   

7. (+++) :: ArrowChoice a => a b c -> a b' c' -> a (Either b b') (Either c c')

   base	Control.Arrow

   Split the input between the two argument arrows, retagging and merging their outputs. Note that this is in general not a functor. The default definition may be overridden with a more efficient version if desired.

8. (+++) :: ReadP a -> ReadP a -> ReadP a

   base	Text.ParserCombinators.ReadP

   Symmetric choice.

9. (+++) :: ReadPrec a -> ReadPrec a -> ReadPrec a

   base	Text.ParserCombinators.ReadPrec

   Symmetric choice.

10. (+#) :: Int# -> Int# -> Int#

    base	GHC.Base

    No documentation available.

Page 8 of many | Previous | Next