Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. reverse :: forall ty (n :: Nat) . PrimType ty => BlockN n ty -> BlockN n ty

   basement	Basement.Sized.Block

   No documentation available.

2. reverse :: forall (n :: Nat) a . ListN n a -> ListN n a

   basement	Basement.Sized.List

   Reverse a list

3. reverse :: forall ty (n :: Nat) . PrimType ty => UVect n ty -> UVect n ty

   basement	Basement.Sized.UVect

   No documentation available.

4. reverse :: forall (n :: Nat) ty . Vect n ty -> Vect n ty

   basement	Basement.Sized.Vect

   No documentation available.

5. reverse :: String -> String

   basement	Basement.String

   Reverse a string

6. reverse :: PrimType ty => UArray ty -> UArray ty

   basement	Basement.UArray

   No documentation available.

7. reverse :: Chunks -> Chunks

   byteslice	Data.Bytes.Chunks

   Reverse chunks but not the bytes within each chunk.

8. reverse :: [a] -> [a]

   ghc-internal	GHC.Internal.Data.List

   reverse xs returns the elements of xs in reverse order. xs must be finite.

   Laziness

   reverse is lazy in its elements.

   >>> head (reverse [undefined, 1])
   1
   

   >>> reverse (1 : 2 : undefined)
   *** Exception: Prelude.undefined
   

   Examples

   >>> reverse []
   []
   

   >>> reverse [42]
   [42]
   

   >>> reverse [2,5,7]
   [7,5,2]
   

   >>> reverse [1..]
   * Hangs forever *
   

9. reverse :: [a] -> [a]

   ghc-internal	GHC.Internal.Data.OldList

   reverse xs returns the elements of xs in reverse order. xs must be finite.

   Laziness

   reverse is lazy in its elements.

   >>> head (reverse [undefined, 1])
   1
   

   >>> reverse (1 : 2 : undefined)
   *** Exception: Prelude.undefined
   

   Examples

   >>> reverse []
   []
   

   >>> reverse [42]
   [42]
   

   >>> reverse [2,5,7]
   [7,5,2]
   

   >>> reverse [1..]
   * Hangs forever *
   

10. reverse :: [a] -> [a]

    ghc-internal	GHC.Internal.List

    reverse xs returns the elements of xs in reverse order. xs must be finite.

    Laziness

    reverse is lazy in its elements.

    >>> head (reverse [undefined, 1])
    1
    

    >>> reverse (1 : 2 : undefined)
    *** Exception: Prelude.undefined
    

    Examples

    >>> reverse []
    []
    

    >>> reverse [42]
    [42]
    

    >>> reverse [2,5,7]
    [7,5,2]
    

    >>> reverse [1..]
    * Hangs forever *
    

Page 7 of many | Previous | Next