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. (++) :: forall (n :: Nat) a (m :: Nat) . Vec n a -> Vec m a -> Vec (n + m) a

   clash-prelude	Clash.Sized.Vector

   Append two vectors.

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

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

   clash-prelude	Clash.Sized.Vector

   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
   

3. type family (as :: [k]) ++ (bs :: [k]) :: [k]

   generic-lens-core	Data.Generics.Product.Internal.HList

   No documentation available.

4. (++/) :: DerivPathI t1 -> DerivPathI t2 -> DerivPath

   haskoin-core	Haskoin.Crypto.Keys.Extended

   Append two derivation paths together. The result will be a mixed derivation path.

5. type family (es :: [Effect]) ++ (es' :: [Effect]) :: [Effect]

   heftia	Control.Monad.Hefty

   No documentation available.

6. (+/+) :: String -> String -> String

   http-directory	Network.HTTP.Directory

   This +/+ eats extra slashes.

   "dir//" +/+ "/subdir/" = "dir/subdir/"
   

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

   ihaskell	IHaskellPrelude

   No documentation available.

8. (+##) :: Double# -> Double# -> Double#

   ihaskell	IHaskellPrelude

   No documentation available.

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

   ihaskell	IHaskellPrelude

   (++) 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]
   

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

    incipit-base	Incipit.Base

    (++) 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]
    

Page 27 of many | Previous | Next