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. (+-) :: CanPlusMinus t1 t2 => t1 -> t2 -> PlusMinusType t1 t2

   aern2-mp	AERN2.MP.Enclosure

   Operator for constructing or enlarging enclosures such as balls or intervals

2. (+.) :: MPFloat -> MPFloat -> MPFloat

   aern2-mp	AERN2.MP.Float.Operators

   No documentation available.

3. (+^) :: MPFloat -> MPFloat -> MPFloat

   aern2-mp	AERN2.MP.Float.Operators

   No documentation available.

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

   backprop	Numeric.Backprop.Op

   Op for addition

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

   cabal-install-solver	Distribution.Solver.Compat.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. (++) :: forall (n :: Nat) a (m :: Nat) . Vec n a -> Vec m a -> Vec (n + m) a

   clash-prelude	Clash.Explicit.Prelude

   Append two vectors.

   >>> (1:>2:>3:>Nil) ++ (7:>8:>Nil)
   1 :> 2 :> 3 :> 7 :> 8 :> Nil
   

7. (+>>) :: forall (n :: Nat) a . KnownNat n => a -> Vec n a -> Vec n a

   clash-prelude	Clash.Explicit.Prelude

   Add an element to the head of a vector, and extract all but the last element.

   >>> 1 +>> (3:>4:>5:>Nil)
   1 :> 3 :> 4 :> Nil
   
   >>> 1 +>> Nil
   Nil
   

8. (++) :: forall (n :: Nat) a (m :: Nat) . Vec n a -> Vec m a -> Vec (n + m) a

   clash-prelude	Clash.Explicit.Prelude.Safe

   Append two vectors.

   >>> (1:>2:>3:>Nil) ++ (7:>8:>Nil)
   1 :> 2 :> 3 :> 7 :> 8 :> Nil
   

9. (+>>) :: forall (n :: Nat) a . KnownNat n => a -> Vec n a -> Vec n a

   clash-prelude	Clash.Explicit.Prelude.Safe

   Add an element to the head of a vector, and extract all but the last element.

   >>> 1 +>> (3:>4:>5:>Nil)
   1 :> 3 :> 4 :> Nil
   
   >>> 1 +>> Nil
   Nil
   

10. (++) :: forall (n :: Nat) a (m :: Nat) . Vec n a -> Vec m a -> Vec (n + m) a

    clash-prelude	Clash.Prelude

    Append two vectors.

    >>> (1:>2:>3:>Nil) ++ (7:>8:>Nil)
    1 :> 2 :> 3 :> 7 :> 8 :> Nil
    

Page 25 of many | Previous | Next