Data.Vector.Rotcev

A wrapper for an arbitrary Vector with O(1) reverse. Instead of creating a copy, it just flips a flag, which inverts indexing. Imagine it as a vector with a switch between little-endianness and big-endianness.

Documentation

data Rotcev v a

Wrapper for immutable vectors, equipped with a Vector instance.

>>> Forward  (Data.Vector.fromList [0..100]) Data.Vector.Generic.! 10
10
>>> Backward (Data.Vector.fromList [0..100]) Data.Vector.Generic.! 10
90

Constructors

Forward !(v a)

Behaves as an original vector in respect to Vector operations.

Backward !(v a)

Behaves as a reversed vector in respect to Vector operations.

Instances

Vector v a => Vector (Rotcev v) a

Defined in Data.Vector.Rotcev

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable (Rotcev v) (PrimState m) a -> m (Rotcev v a)

basicUnsafeThaw :: PrimMonad m => Rotcev v a -> m (Mutable (Rotcev v) (PrimState m) a)

basicLength :: Rotcev v a -> Int

basicUnsafeSlice :: Int -> Int -> Rotcev v a -> Rotcev v a

basicUnsafeIndexM :: Monad m => Rotcev v a -> Int -> m a

basicUnsafeCopy :: PrimMonad m => Mutable (Rotcev v) (PrimState m) a -> Rotcev v a -> m ()

elemseq :: Rotcev v a -> a -> b -> b

Eq (v a) => Eq (Rotcev v a)

Defined in Data.Vector.Rotcev

Methods

(==) :: Rotcev v a -> Rotcev v a -> Bool

(/=) :: Rotcev v a -> Rotcev v a -> Bool

Ord (v a) => Ord (Rotcev v a)

Defined in Data.Vector.Rotcev

Methods

compare :: Rotcev v a -> Rotcev v a -> Ordering

(<) :: Rotcev v a -> Rotcev v a -> Bool

(<=) :: Rotcev v a -> Rotcev v a -> Bool

(>) :: Rotcev v a -> Rotcev v a -> Bool

(>=) :: Rotcev v a -> Rotcev v a -> Bool

max :: Rotcev v a -> Rotcev v a -> Rotcev v a

min :: Rotcev v a -> Rotcev v a -> Rotcev v a

Show (v a) => Show (Rotcev v a)

Defined in Data.Vector.Rotcev

Methods

showsPrec :: Int -> Rotcev v a -> ShowS

show :: Rotcev v a -> String

showList :: [Rotcev v a] -> ShowS

type Mutable (Rotcev v)

Defined in Data.Vector.Rotcev

type Mutable (Rotcev v) = MRotcev v

reverse :: Rotcev v a -> Rotcev v a

Reverse an immutable vector in O(1) time and space.

>>> vec = Data.Vector.Generic.fromList [0..100] :: Rotcev Data.Vector.Vector Int
>>> reverse vec Data.Vector.Generic.! 10
90

unRotcev :: Vector v a => Rotcev v a -> v a

Unwrap Rotcev, extracting an underlying vector. This takes O(1) for Forward, but full O(n) time for Backward case, so it would rather be avoided in intermediate computations. Instead leverage opportunities, provided by generic Vector and MVector instances.

data MRotcev v s a

Wrapper for mutable vectors, equipped with a MVector instance.

Constructors

MForward !(Mutable v s a)

Behaves as an original vector in respect to MVector operations.

MBackward !(Mutable v s a)

Behaves as a reversed vector in respect to MVector operations.

Instances

MVector (Mutable v) a => MVector (MRotcev v) a

Defined in Data.Vector.Rotcev

Methods

basicLength :: MRotcev v s a -> Int

basicUnsafeSlice :: Int -> Int -> MRotcev v s a -> MRotcev v s a

basicOverlaps :: MRotcev v s a -> MRotcev v s a -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MRotcev v (PrimState m) a)

basicInitialize :: PrimMonad m => MRotcev v (PrimState m) a -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> a -> m (MRotcev v (PrimState m) a)

basicUnsafeRead :: PrimMonad m => MRotcev v (PrimState m) a -> Int -> m a

basicUnsafeWrite :: PrimMonad m => MRotcev v (PrimState m) a -> Int -> a -> m ()

basicClear :: PrimMonad m => MRotcev v (PrimState m) a -> m ()

basicSet :: PrimMonad m => MRotcev v (PrimState m) a -> a -> m ()

basicUnsafeCopy :: PrimMonad m => MRotcev v (PrimState m) a -> MRotcev v (PrimState m) a -> m ()

basicUnsafeMove :: PrimMonad m => MRotcev v (PrimState m) a -> MRotcev v (PrimState m) a -> m ()

basicUnsafeGrow :: PrimMonad m => MRotcev v (PrimState m) a -> Int -> m (MRotcev v (PrimState m) a)

mreverse :: MRotcev v s a -> MRotcev v s a

Reverse a mutable vector in O(1) time and space.