Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. reverseBits :: Vector Bit -> Vector Bit

   bitvec	Data.Bit

   Reverse the order of bits.

   >>> :set -XOverloadedLists
   
   >>> reverseBits [1,1,0,1,0]
   [0,1,0,1,1]
   

   Consider using the vector-rotcev package to reverse vectors in O(1) time.

2. reverseInPlace :: PrimMonad m => MVector (PrimState m) Bit -> m ()

   bitvec	Data.Bit

   Reverse the order of bits in-place.

   >>> :set -XOverloadedLists
   
   >>> Data.Vector.Unboxed.modify reverseInPlace [1,1,0,1,0]
   [0,1,0,1,1]
   

   Consider using the vector-rotcev package to reverse vectors in O(1) time.

3. reverseBits :: Vector Bit -> Vector Bit

   bitvec	Data.Bit.ThreadSafe

   Reverse the order of bits.

   >>> :set -XOverloadedLists
   
   >>> reverseBits [1,1,0,1,0]
   [0,1,0,1,1]
   

   Consider using the vector-rotcev package to reverse vectors in O(1) time.

4. reverseInPlace :: PrimMonad m => MVector (PrimState m) Bit -> m ()

   bitvec	Data.Bit.ThreadSafe

   Reverse the order of bits in-place.

   >>> :set -XOverloadedLists
   
   >>> Data.Vector.Unboxed.modify reverseInPlace [1,1,0,1,0]
   [0,1,0,1,1]
   

   Consider using the vector-rotcev package to reverse vectors in O(1) time.

5. reversedOnto :: Int -> Builder -> Chunks -> Chunks

   bytebuild	Data.Bytes.Builder

   Variant of runOnto that conses the additional chunks in reverse order.

6. reverseCommitsOntoChunks :: Chunks -> Commits s -> ST s Chunks

   bytebuild	Data.Bytes.Builder.Unsafe

   Cons the chunks from a list of Commits onto an initial Chunks list (this argument is often ChunksNil). This reverses the order of the chunks, which is desirable since builders assemble Commits with the chunks backwards. This performs an in-place shrink and freezes any mutable byte arrays it encounters. Consequently, these must not be reused.

7. reverseSubforests :: Tree a -> Tree a

   commonmark	Commonmark.Blocks

   No documentation available.

8. reverseMutable :: forall (arr :: Type -> Type) a m . (Contiguous arr, Element arr a, PrimMonad m) => Mutable arr (PrimState m) a -> m ()

   contiguous	Data.Primitive.Contiguous

   Reverse the elements of a mutable array, in-place.

9. reverseSlice :: forall (arr :: Type -> Type) a m . (Contiguous arr, Element arr a, PrimMonad m) => Mutable arr (PrimState m) a -> Int -> Int -> m ()

   contiguous	Data.Primitive.Contiguous

   Reverse the elements of a slice of a mutable array, in-place.

10. reverses :: Dims -> Array a -> Array a

    harpie	Harpie.Array

    Reverses element order along specified dimensions.

    >>> pretty $ reverses [0,1] a
    [[[20,21,22,23],
    [16,17,18,19],
    [12,13,14,15]],
    [[8,9,10,11],
    [4,5,6,7],
    [0,1,2,3]]]
    

Page 29 of many | Previous | Next