Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. 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 *
   

2. 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 *
   

3. reverse :: JSString -> JSString

   jsaddle	Data.JSString

   O(n) Reverse the characters of a string. Subject to fusion.

4. reverse :: Stream Char -> JSString

   jsaddle	Data.JSString.Internal.Fusion

   O(n) Reverse the characters of a string.

5. reverse :: MutableJSArray -> JSM ()

   jsaddle	JavaScript.Array

   No documentation available.

6. reverse :: T a -> T a

   numeric-prelude	MathObj.LaurentPolynomial

   p(z) -> p(1/z)

7. reverse :: C a => T a -> T a

   numeric-prelude	MathObj.Polynomial

   No documentation available.

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

   numeric-prelude	NumericPrelude

   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]

   numeric-prelude	NumericPrelude.Base

   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]

    numhask	NumHask.Prelude

    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 8 of many | Previous | Next