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 (m :: Type -> Type) a . Monad m => Stream m a -> Stream m a

   streamly-core	Streamly.Data.Stream

   Returns the elements of the stream in reverse order. The stream must be finite. Note that this necessarily buffers the entire stream in memory. Definition:

   >>> reverse m = Stream.concatEffect $ Stream.fold Fold.toListRev m >>= return . Stream.fromList
   

2. reverse :: forall (m :: Type -> Type) a . StreamK m a -> StreamK m a

   streamly-core	Streamly.Data.StreamK

   No documentation available.

3. reverse :: (MonadIO m, Unbox a) => MutArray a -> m ()

   streamly-core	Streamly.Internal.Data.MutArray

   You may not need to reverse an array because you can consume it in reverse using readerRev. To reverse large arrays you can read in reverse and write to another array. However, in-place reverse can be useful to take adavantage of cache locality and when you do not want to allocate additional memory.

4. reverse :: forall (m :: Type -> Type) a . Monad m => Stream m a -> Stream m a

   streamly-core	Streamly.Internal.Data.Stream

   Returns the elements of the stream in reverse order. The stream must be finite. Note that this necessarily buffers the entire stream in memory. Definition:

   >>> reverse m = Stream.concatEffect $ Stream.fold Fold.toListRev m >>= return . Stream.fromList
   

5. reverse :: forall (m :: Type -> Type) a . StreamK m a -> StreamK m a

   streamly-core	Streamly.Internal.Data.StreamK

   No documentation available.

6. reverse :: NonEmpty a -> NonEmpty a

   Agda	Agda.Utils.List1

   reverse a finite NonEmpty stream.

7. reverse :: Chunks a -> Chunks a

   array-chunks	Data.Chunks

   Reverse chunks but not the elements within each chunk.

   >>> reverse [[42,17,94],[6,12],[3,14]]
   [[3,14],[6,12],[42,17,94]]
   

8. reverse :: Nat w => T w -> T w

   battleship-combinatorics	Combinatorics.Battleship.Count.Frontier

   No documentation available.

9. reverse :: BinList a -> BinList a

   binary-list	Data.BinaryList

   O(n). Reverse a binary list.

10. reverse :: BQueue a -> BQueue a

    bounded-queue	Data.Queue.Bounded

Page 14 of many | Previous | Next