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.

  1. reverse :: FMList a -> FMList a

    fmlist Data.FMList

    No documentation available.

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

    hledger-web Hledger.Web.Import

    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 :: forall (n :: Nat) a . NList n a -> NList n a

    indexed-containers Data.NList

    Reverse a list. 

    reverse (mk3 'a' 'b' 'c') === mk3 'c' 'b' 'a'

  4. reverse :: [a] <-> [a]

    invertible Data.Invertible.List

    reverse the order of a (finite) list.

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

    invertible Data.Invertible.Prelude

    reverse the order of a (finite) list.

  6. reverse :: (Functor m, Monad m) => Stream m a -> m (Stream m a)

    leveldb-haskell Data.Stream.Monadic

    No documentation available.

  7. reverse :: Text -> Text

    miso Miso.String

    No documentation available.

  8. reverse :: forall (n :: Nat) a . Tree n a -> Tree n a

    ral Data.RAVec.Tree

    Reverse Tree. 

    >>> let t = Node (Node (Leaf 'a') (Leaf 'b')) (Node (Leaf 'c') (Leaf 'd'))

>>> reverse t
Node (Node (Leaf 'd') (Leaf 'c')) (Node (Leaf 'b') (Leaf 'a'))

  9. reverse :: forall (n :: Nat) a . SNatI n => Tree n a -> Tree n a

    ral Data.RAVec.Tree.DF

    Reverse Tree. 

    >>> let t = Node (Node (Leaf 'a') (Leaf 'b')) (Node (Leaf 'c') (Leaf 'd'))

>>> reverse t
Node (Node (Leaf 'd') (Leaf 'c')) (Node (Leaf 'b') (Leaf 'a'))

  10. reverse :: ByteString -> ByteString

    rawfilepath Data.ByteString.RawFilePath

    O(n) reverse xs efficiently returns the elements of xs in reverse order.

Page 16 of many | Previous | Next