Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. reverse :: forall (u :: Type -> Type) a (v :: Type -> Type) b . (Vector u a, Vector v b) => Vector u v (a, b) -> Vector u v (a, b)

    hybrid-vectors Data.Vector.Hybrid

    O(n) Reverse a vector

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

    listsafe Data.List.Safe

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

    nonempty-zipper Data.List.NonEmpty.Zipper

    Reverse the zipper keeping the cursor focus intact 

    >>> reverse . fromNonEmpty $ NE.fromList [1, 2, 3]
Zipper [2,3] 1 []

  4. reverse :: ReaderT Handle IO ()

    reactive-balsa Reactive.Banana.ALSA.Example

    No documentation available.

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

    verset Verset

    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 :: [a] -> [a]

    xmonad-contrib XMonad.Config.Prime

    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 :: [a] -> [a]

    xmonad-contrib XMonad.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 *

  8. module Data.Functor.Reverse

    Making functors whose elements are notionally in the reverse order from the original functor.

  9. newtype Reverse (f :: k -> Type) (a :: k)

    transformers Data.Functor.Reverse

    The same functor, but with Foldable and Traversable instances that process the elements in the reverse order.

  10. Reverse :: f a -> Reverse (f :: k -> Type) (a :: k)

    transformers Data.Functor.Reverse

    No documentation available.

Page 19 of many | Previous | Next