Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

1. reverse :: forall (f :: Type -> Type) a . (Traversable f, Reverse f) => T f a -> T f a

   non-empty	Data.NonEmpty

   No documentation available.

2. reverse :: Reverse f => f a -> f a

   non-empty	Data.NonEmpty.Class

   No documentation available.

3. reverse :: SemiSequence seq => seq -> seq

   mono-traversable	Data.Sequences

   Reverse a sequence

   > reverse "hello world"
   "dlrow olleh"
   

4. reverse :: ByteString -> ByteString

   rio	RIO.ByteString

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

5. reverse :: ByteString -> ByteString

   rio	RIO.ByteString.Lazy

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

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

   rio	RIO.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 *
   

7. reverse :: NonEmpty a -> NonEmpty a

   rio	RIO.NonEmpty

   reverse a finite NonEmpty stream.

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

   rio	RIO.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 *
   

9. reverse :: Seq a -> Seq a

   rio	RIO.Seq

   The reverse of a sequence.

10. reverse :: Text -> Text

    rio	RIO.Text

    No documentation available.

Page 3 of many | Previous | Next