Hoogle Search

Within LTS Haskell 24.5 (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 . Vec n a -> Vec n a

   clash-prelude	Clash.Explicit.Prelude

   The elements in a vector in reverse order.

   >>> reverse (1:>2:>3:>4:>Nil)
   4 :> 3 :> 2 :> 1 :> Nil
   

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

   clash-prelude	Clash.Explicit.Prelude.Safe

   The elements in a vector in reverse order.

   >>> reverse (1:>2:>3:>4:>Nil)
   4 :> 3 :> 2 :> 1 :> Nil
   

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

   clash-prelude	Clash.Prelude

   The elements in a vector in reverse order.

   >>> reverse (1:>2:>3:>4:>Nil)
   4 :> 3 :> 2 :> 1 :> Nil
   

4. reverse :: forall (n :: Nat) a . Vec n a -> Vec n a

   clash-prelude	Clash.Prelude.Safe

   The elements in a vector in reverse order.

   >>> reverse (1:>2:>3:>4:>Nil)
   4 :> 3 :> 2 :> 1 :> Nil
   

5. reverse :: forall (n :: Nat) a . Vec n a -> Vec n a

   clash-prelude	Clash.Sized.Vector

   The elements in a vector in reverse order.

   >>> reverse (1:>2:>3:>4:>Nil)
   4 :> 3 :> 2 :> 1 :> Nil
   

6. reverse :: (Integral n, Floating a) => Vector (ZeroBased n) a -> Vector (ZeroBased n) a

   comfort-blas	Numeric.BLAS.Vector

   Vector.autoFromList [] == (Vector.reverse $ Vector.autoFromList [] :: Vector Number_)
   

   Vector.autoFromList [1] == (Vector.reverse $ Vector.autoFromList [1] :: Vector Number_)
   

   Vector.autoFromList [3,2,1] == (Vector.reverse $ Vector.autoFromList [1,2,3] :: Vector Number_)
   

   forVector number_ $ \xs -> reverse (Vector.toList xs) == Vector.toList (Vector.reverse xs)
   

   forVector number_ $ \xs -> xs == Vector.reverse (Vector.reverse xs)
   

   forVector number_ $ \xs -> forVector number_ $ \ys -> Vector.reverse (xs <> ys) == Vector.reverse ys <> Vector.reverse xs
   

7. reverse :: forall (e :: Type -> Type) n el nl . (Reverse e, Ord n) => Graph e n el nl -> Graph e n el nl

   comfort-graph	Data.Graph.Comfort

   \(TestGraph gr) -> Graph.isConsistent (Graph.reverse gr)
   

   \(TestGraph gr) -> Graph.reverse (Graph.reverse gr) == gr
   

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

   dimensional	Numeric.Units.Dimensional.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]

   distribution-opensuse	OpenSuse.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 *
   

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

    faktory	Faktory.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 15 of many | Previous | Next