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.
reverse :: Vector a -> Vector arrb-vector Data.RRBVector Reverse the vector.
>>> reverse (fromList [1, 2, 3]) fromList [3,2,1]
-
sized Data.Sized Reverse function. Since 0.7.0.0
-
slist Slist O(n). Returns the elements of the slist in reverse order.
>>> reverse $ slist "Hello" Slist {sList = "olleH", sSize = Size 5} >>> reverse $ slist "wow" Slist {sList = "wow", sSize = Size 3}
Note: reverse slist can not be calculated on infinite slists.>> reverse $ infiniteSlist [1..] <hangs>
Use safeReverse to not hang on infinite slists. reverse :: forall t (m :: Type -> Type) a . (IsStream t, Monad m) => t m a -> t m astreamly Streamly.Internal.Data.Stream.IsStream Returns the elements of the stream in reverse order. The stream must be finite. Note that this necessarily buffers the entire stream in memory.
>>> reverse = Stream.foldlT (flip Stream.cons) Stream.nil
Since 0.7.0 (Monad m constraint) Since: 0.1.1reverse :: forall t (m :: Type -> Type) a . (IsStream t, Monad m) => t m a -> t m astreamly Streamly.Internal.Data.Stream.IsStream Returns the elements of the stream in reverse order. The stream must be finite. Note that this necessarily buffers the entire stream in memory.
>>> reverse = Stream.foldlT (flip Stream.cons) Stream.nil
Since 0.7.0 (Monad m constraint) Since: 0.1.1reverse :: forall t (m :: Type -> Type) a . (IsStream t, Monad m) => t m a -> t m astreamly Streamly.Prelude Returns the elements of the stream in reverse order. The stream must be finite. Note that this necessarily buffers the entire stream in memory.
>>> reverse = Stream.foldlT (flip Stream.cons) Stream.nil
Since 0.7.0 (Monad m constraint) Since: 0.1.1reverse :: Zipper a -> Zipper astreams Data.Stream.Infinite.Functional.Zipper No documentation available.
reverse :: Unboxable a => Vector a -> Vector aunboxing-vector Data.Vector.Unboxing No documentation available.
reverse :: forall (n :: Nat) a . SNatI n => Vec n a -> Vec n avec Data.Vec.DataFamily.SpineStrict Reverse Vec.
>>> reverse ('a' ::: 'b' ::: 'c' ::: VNil) 'c' ::: 'b' ::: 'a' ::: VNil
reverse :: forall (n :: Nat) a . Vec n a -> Vec n avec Data.Vec.Lazy Reverse Vec.
>>> reverse ('a' ::: 'b' ::: 'c' ::: VNil) 'c' ::: 'b' ::: 'a' ::: VNil