Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. reverse :: forall (v :: Type -> Type) a (n :: Nat) . Vector v a => Vector v n a -> Vector v n a

   vector-sized	Data.Vector.Generic.Sized

   O(n) Reverse a vector

2. reverse :: forall a (n :: Nat) . Prim a => Vector n a -> Vector n a

   vector-sized	Data.Vector.Primitive.Sized

   O(n) Reverse a vector.

3. reverse :: forall (n :: Nat) a . Vector n a -> Vector n a

   vector-sized	Data.Vector.Sized

   O(n) Reverse a vector.

4. reverse :: forall a (n :: Nat) . Storable a => Vector n a -> Vector n a

   vector-sized	Data.Vector.Storable.Sized

   O(n) Reverse a vector.

5. reverse :: forall a (n :: Nat) . Unbox a => Vector n a -> Vector n a

   vector-sized	Data.Vector.Unboxed.Sized

   O(n) Reverse a vector.

6. reverse :: NonEmpty a -> NonEmpty a

   base-compat-batteries	Data.List.NonEmpty.Compat

   reverse a finite NonEmpty stream.

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