Hoogle Search

Within LTS Haskell 23.22 (ghc-9.8.4)

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

Exact lookup

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

   base	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 *
   

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

   base	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 *
   

3. reverse :: NonEmpty a -> NonEmpty a

   base	Data.List.NonEmpty

   reverse a finite NonEmpty stream.

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

   base	GHC.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 *
   

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

   base	GHC.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 *
   

6. reverse :: ByteString -> ByteString

   bytestring	Data.ByteString

   O(n) reverse xs efficiently returns the elements of xs in reverse order.

7. reverse :: ByteString -> ByteString

   bytestring	Data.ByteString.Char8

   O(n) reverse xs efficiently returns the elements of xs in reverse order.

8. reverse :: ByteString -> ByteString

   bytestring	Data.ByteString.Lazy

   O(n) reverse xs returns the elements of xs in reverse order.

9. reverse :: ByteString -> ByteString

   bytestring	Data.ByteString.Lazy.Char8

   O(n) reverse xs returns the elements of xs in reverse order.

10. reverse :: ShortByteString -> ShortByteString

    bytestring	Data.ByteString.Short

    O(n) reverse xs efficiently returns the elements of xs in reverse order.

Page 1 of many | Next