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.

Exact lookup

1. reverse :: forall (n :: Nat) a . SNatI n => Vec n a -> Vec n a

   vec	Data.Vec.Lazy.Inline

   Reverse Vec.

   >>> reverse ('a' ::: 'b' ::: 'c' ::: VNil)
   'c' ::: 'b' ::: 'a' ::: VNil
   

2. reverse :: forall (n :: Nat) a . SNatI n => Vec n a -> Vec n a

   vec	Data.Vec.Pull

   Reverse Vec.

3. reverse :: forall (v :: Type -> Type) a . Rotcev v a -> Rotcev v a

   vector-rotcev	Data.Vector.Rotcev

   Reverse an immutable vector in O(1) time and space.

   >>> vec = Data.Vector.Generic.fromList [0..100] :: Rotcev Data.Vector.Vector Int
   
   >>> reverse vec Data.Vector.Generic.! 10
   90
   

4. reverse :: Group r => BasisCoblade m -> Comultivector r m

   algebra	Numeric.Coalgebra.Geometric

   No documentation available.

5. reverse :: BV -> BV

   bv	Data.BitVector

   reverse == fromBits . reverse . toBits
   

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

   classy-prelude-yesod	ClassyPrelude.Yesod

   Reverse a sequence

   > reverse "hello world"
   "dlrow olleh"
   

7. reverse :: AnimationDirection

   clay	Clay.Animation

   No documentation available.

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

   constrained-categories	Control.Category.Constrained.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 :: [a] -> [a]

   constrained-categories	Control.Category.Hask

   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]

    copilot-language	Copilot.Language.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 18 of many | Previous | Next