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 :: MonadState (Deque a) m => m ()

   deque	Deque.Strict.State

   Reverse the deque.

2. reverse :: Vector v a => v a -> v a

   fixed-vector	Data.Vector.Fixed

   Reverse order of elements in the vector

3. reverse :: forall (n :: PeanoNum) a . ArityPeano n => ContVec n a -> ContVec n a

   fixed-vector	Data.Vector.Fixed.Cont

   Reverse order of elements in the vector

4. reverse :: forall (as :: [Type]) . HVect as -> HVect (Reverse as)

   hvect	Data.HVect

   No documentation available.

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

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   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 :: NonEmptyVector a -> NonEmptyVector a

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Reverse a non-empty vector

   >>> reverse $ unsafeFromList [1..3]
   [3,2,1]
   

7. reverse :: SortedList a -> SortedList (Down a)

   sorted-list	Data.SortedList

   O(n). Reverse a sorted list. The result uses Down, thus it is a sorted list as well. The following equality holds for any sorted list xs:

   map Down xs = reverse xs
   

   Only available from base version 4.6.0.0.

8. reverse :: List a -> List a

   strict-list	StrictList

   Reverse the list.

9. reverse :: Transform sig yv => T rate amp (sig yv) -> T rate amp (sig yv)

   synthesizer-dimensional	Synthesizer.Dimensional.Amplitude.Cut

   No documentation available.

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

    LambdaHack	Game.LambdaHack.Core.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 12 of many | Previous | Next