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 :: [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 *
   

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

   cabal-install-solver	Distribution.Solver.Compat.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 *
   

3. reverse :: [String] -> [String]

   haha	Graphics.Ascii.Haha.Terminal

   No documentation available.

4. reverse :: Permutation -> Permutation

   hmatrix-gsl-stats	Numeric.GSL.Permutation

   reverse the elements of the permutation

5. reverse :: DocumentedFunction e

   hslua-module-text	HsLua.Module.Text

   Wrapper for reverse.

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

   ihaskell	IHaskellPrelude

   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]

   incipit-base	Incipit.Base

   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. reverse :: Boundary PitchChannel v -> Maybe (Boundary PitchChannel v)

   reactive-midyim	Reactive.Banana.MIDI.Note

   Swap order of keys. Non-note events are returned without modification. If by reversing a note leaves the range of representable MIDI notes, then we return Nothing.

9. reverse :: SymVal a => SList a -> SList a

   sbv	Data.SBV.List

   reverse s reverses the sequence. NB. We can define reverse in terms of foldl as: foldl (soFar elt -> singleton elt ++ soFar) [] But in my experiments, I found that this definition performs worse instead of the recursive definition SBV generates for reverse calls. So we're keeping it intact.

   >>> sat $ \(l :: SList Integer) -> reverse l .== literal [3, 2, 1]
   Satisfiable. Model:
   s0 = [1,2,3] :: [Integer]
   
   >>> prove $ \(l :: SList Word32) -> reverse l .== [] .<=> null l
   Q.E.D.
   

10. reverse :: SString -> SString

    sbv	Data.SBV.String

    reverse s reverses the string. >>> sat $ s -> reverse s .== "abc" Satisfiable. Model: s0 = "cba" :: String >>> prove $ s -> reverse s .== "" .= null s Q.E.D.

Page 13 of many | Previous | Next