Data.Edison.Seq.RevSeq

This module defines a sequence adaptor Rev s. If s is a sequence type constructor, then Rev s is a sequence type constructor that is identical to s, except that it is kept in the opposite order. Also keeps explicit track of the size of the sequence, similar to the Sized adaptor in Data.Edison.Seq.SizedSeq.

This module is most useful when s is a sequence type that offers fast access to the front but slow access to the rear, and your application needs the opposite (i.e., fast access to the rear but slow access to the front).

All time complexities are determined by the underlying sequence, except that the complexities for accessing the left and right sides of the sequence are exchanged, and size becomes O( 1 ).

Rev Sequence Type

data Rev s a

Instances

Sequence s => Sequence (Rev s)

Defined in Data.Edison.Seq.RevSeq

Methods

lcons :: a -> Rev s a -> Rev s a

rcons :: a -> Rev s a -> Rev s a

fromList :: [a] -> Rev s a

copy :: Int -> a -> Rev s a

lview :: MonadFail m => Rev s a -> m (a, Rev s a)

lhead :: Rev s a -> a

lheadM :: MonadFail m => Rev s a -> m a

ltail :: Rev s a -> Rev s a

ltailM :: MonadFail m => Rev s a -> m (Rev s a)

rview :: MonadFail m => Rev s a -> m (a, Rev s a)

rhead :: Rev s a -> a

rheadM :: MonadFail m => Rev s a -> m a

rtail :: Rev s a -> Rev s a

rtailM :: MonadFail m => Rev s a -> m (Rev s a)

null :: Rev s a -> Bool

size :: Rev s a -> Int

toList :: Rev s a -> [a]

concat :: Rev s (Rev s a) -> Rev s a

reverse :: Rev s a -> Rev s a

reverseOnto :: Rev s a -> Rev s a -> Rev s a

fold :: (a -> b -> b) -> b -> Rev s a -> b

fold' :: (a -> b -> b) -> b -> Rev s a -> b

fold1 :: (a -> a -> a) -> Rev s a -> a

fold1' :: (a -> a -> a) -> Rev s a -> a

foldr :: (a -> b -> b) -> b -> Rev s a -> b

foldr' :: (a -> b -> b) -> b -> Rev s a -> b

foldl :: (b -> a -> b) -> b -> Rev s a -> b

foldl' :: (b -> a -> b) -> b -> Rev s a -> b

foldr1 :: (a -> a -> a) -> Rev s a -> a

foldr1' :: (a -> a -> a) -> Rev s a -> a

foldl1 :: (a -> a -> a) -> Rev s a -> a

foldl1' :: (a -> a -> a) -> Rev s a -> a

reducer :: (a -> a -> a) -> a -> Rev s a -> a

reducer' :: (a -> a -> a) -> a -> Rev s a -> a

reducel :: (a -> a -> a) -> a -> Rev s a -> a

reducel' :: (a -> a -> a) -> a -> Rev s a -> a

reduce1 :: (a -> a -> a) -> Rev s a -> a

reduce1' :: (a -> a -> a) -> Rev s a -> a

take :: Int -> Rev s a -> Rev s a

drop :: Int -> Rev s a -> Rev s a

splitAt :: Int -> Rev s a -> (Rev s a, Rev s a)

subseq :: Int -> Int -> Rev s a -> Rev s a

filter :: (a -> Bool) -> Rev s a -> Rev s a

partition :: (a -> Bool) -> Rev s a -> (Rev s a, Rev s a)

takeWhile :: (a -> Bool) -> Rev s a -> Rev s a

dropWhile :: (a -> Bool) -> Rev s a -> Rev s a

splitWhile :: (a -> Bool) -> Rev s a -> (Rev s a, Rev s a)

inBounds :: Int -> Rev s a -> Bool

lookup :: Int -> Rev s a -> a

lookupM :: MonadFail m => Int -> Rev s a -> m a

lookupWithDefault :: a -> Int -> Rev s a -> a

update :: Int -> a -> Rev s a -> Rev s a

adjust :: (a -> a) -> Int -> Rev s a -> Rev s a

mapWithIndex :: (Int -> a -> b) -> Rev s a -> Rev s b

foldrWithIndex :: (Int -> a -> b -> b) -> b -> Rev s a -> b

foldrWithIndex' :: (Int -> a -> b -> b) -> b -> Rev s a -> b

foldlWithIndex :: (b -> Int -> a -> b) -> b -> Rev s a -> b

foldlWithIndex' :: (b -> Int -> a -> b) -> b -> Rev s a -> b

zip :: Rev s a -> Rev s b -> Rev s (a, b)

zip3 :: Rev s a -> Rev s b -> Rev s c -> Rev s (a, b, c)

zipWith :: (a -> b -> c) -> Rev s a -> Rev s b -> Rev s c

zipWith3 :: (a -> b -> c -> d) -> Rev s a -> Rev s b -> Rev s c -> Rev s d

unzip :: Rev s (a, b) -> (Rev s a, Rev s b)

unzip3 :: Rev s (a, b, c) -> (Rev s a, Rev s b, Rev s c)

unzipWith :: (a -> b) -> (a -> c) -> Rev s a -> (Rev s b, Rev s c)

unzipWith3 :: (a -> b) -> (a -> c) -> (a -> d) -> Rev s a -> (Rev s b, Rev s c, Rev s d)

strict :: Rev s a -> Rev s a

strictWith :: (a -> b) -> Rev s a -> Rev s a

structuralInvariant :: Rev s a -> Bool

instanceName :: Rev s a -> String

Sequence s => Alternative (Rev s)

Defined in Data.Edison.Seq.RevSeq

Methods

empty :: Rev s a

(<|>) :: Rev s a -> Rev s a -> Rev s a

some :: Rev s a -> Rev s [a]

many :: Rev s a -> Rev s [a]

Sequence s => Applicative (Rev s)

Defined in Data.Edison.Seq.RevSeq

Methods

pure :: a -> Rev s a

(<*>) :: Rev s (a -> b) -> Rev s a -> Rev s b

liftA2 :: (a -> b -> c) -> Rev s a -> Rev s b -> Rev s c

(*>) :: Rev s a -> Rev s b -> Rev s b

(<*) :: Rev s a -> Rev s b -> Rev s a

Sequence s => Functor (Rev s)

Defined in Data.Edison.Seq.RevSeq

Methods

fmap :: (a -> b) -> Rev s a -> Rev s b

(<$) :: a -> Rev s b -> Rev s a

Sequence s => Monad (Rev s)

Defined in Data.Edison.Seq.RevSeq

Methods

(>>=) :: Rev s a -> (a -> Rev s b) -> Rev s b

(>>) :: Rev s a -> Rev s b -> Rev s b

return :: a -> Rev s a

Sequence s => MonadPlus (Rev s)

Defined in Data.Edison.Seq.RevSeq

Methods

mzero :: Rev s a

mplus :: Rev s a -> Rev s a -> Rev s a

(Sequence s, Arbitrary (s a)) => Arbitrary (Rev s a)

Defined in Data.Edison.Seq.RevSeq

Methods

arbitrary :: Gen (Rev s a)

shrink :: Rev s a -> [Rev s a]

(Sequence s, CoArbitrary (s a)) => CoArbitrary (Rev s a)

Defined in Data.Edison.Seq.RevSeq

Methods

coarbitrary :: Rev s a -> Gen b -> Gen b

Sequence s => Monoid (Rev s a)

Defined in Data.Edison.Seq.RevSeq

Methods

mempty :: Rev s a

mappend :: Rev s a -> Rev s a -> Rev s a

mconcat :: [Rev s a] -> Rev s a

Sequence s => Semigroup (Rev s a)

Defined in Data.Edison.Seq.RevSeq

Methods

(<>) :: Rev s a -> Rev s a -> Rev s a

sconcat :: NonEmpty (Rev s a) -> Rev s a

stimes :: Integral b => b -> Rev s a -> Rev s a

(Sequence s, Read (s a)) => Read (Rev s a)

Defined in Data.Edison.Seq.RevSeq

Methods

readsPrec :: Int -> ReadS (Rev s a)

readList :: ReadS [Rev s a]

readPrec :: ReadPrec (Rev s a)

readListPrec :: ReadPrec [Rev s a]

(Sequence s, Show (s a)) => Show (Rev s a)

Defined in Data.Edison.Seq.RevSeq

Methods

showsPrec :: Int -> Rev s a -> ShowS

show :: Rev s a -> String

showList :: [Rev s a] -> ShowS

Eq (s a) => Eq (Rev s a)

Defined in Data.Edison.Seq.RevSeq

Methods

(==) :: Rev s a -> Rev s a -> Bool

(/=) :: Rev s a -> Rev s a -> Bool

(Sequence s, Ord a, Eq (s a)) => Ord (Rev s a)

Defined in Data.Edison.Seq.RevSeq

Methods

compare :: Rev s a -> Rev s a -> Ordering

(<) :: Rev s a -> Rev s a -> Bool

(<=) :: Rev s a -> Rev s a -> Bool

(>) :: Rev s a -> Rev s a -> Bool

(>=) :: Rev s a -> Rev s a -> Bool

max :: Rev s a -> Rev s a -> Rev s a

min :: Rev s a -> Rev s a -> Rev s a

Sequence Operations

empty :: Sequence s => Rev s a

singleton :: Sequence s => a -> Rev s a

lcons :: Sequence s => a -> Rev s a -> Rev s a

rcons :: Sequence s => a -> Rev s a -> Rev s a

append :: Sequence s => Rev s a -> Rev s a -> Rev s a

lview :: (Sequence s, MonadFail m) => Rev s a -> m (a, Rev s a)

lhead :: Sequence s => Rev s a -> a

ltail :: Sequence s => Rev s a -> Rev s a

rview :: (Sequence s, MonadFail m) => Rev s a -> m (a, Rev s a)

rhead :: Sequence s => Rev s a -> a

rtail :: Sequence s => Rev s a -> Rev s a

lheadM :: (Sequence s, MonadFail m) => Rev s a -> m a

ltailM :: (Sequence s, MonadFail m) => Rev s a -> m (Rev s a)

rheadM :: (Sequence s, MonadFail m) => Rev s a -> m a

rtailM :: (Sequence s, MonadFail m) => Rev s a -> m (Rev s a)

null :: Sequence s => Rev s a -> Bool

size :: Sequence s => Rev s a -> Int

concat :: Sequence s => Rev s (Rev s a) -> Rev s a

reverse :: Sequence s => Rev s a -> Rev s a

reverseOnto :: Sequence s => Rev s a -> Rev s a -> Rev s a

fromList :: Sequence s => [a] -> Rev s a

toList :: Sequence s => Rev s a -> [a]

map :: Sequence s => (a -> b) -> Rev s a -> Rev s b

concatMap :: Sequence s => (a -> Rev s b) -> Rev s a -> Rev s b

fold :: Sequence s => (a -> b -> b) -> b -> Rev s a -> b

fold' :: Sequence s => (a -> b -> b) -> b -> Rev s a -> b

fold1 :: Sequence s => (a -> a -> a) -> Rev s a -> a

fold1' :: Sequence s => (a -> a -> a) -> Rev s a -> a

foldr :: Sequence s => (a -> b -> b) -> b -> Rev s a -> b

foldr' :: Sequence s => (a -> b -> b) -> b -> Rev s a -> b

foldl :: Sequence s => (b -> a -> b) -> b -> Rev s a -> b

foldl' :: Sequence s => (b -> a -> b) -> b -> Rev s a -> b

foldr1 :: Sequence s => (a -> a -> a) -> Rev s a -> a

foldr1' :: Sequence s => (a -> a -> a) -> Rev s a -> a

foldl1 :: Sequence s => (a -> a -> a) -> Rev s a -> a

foldl1' :: Sequence s => (a -> a -> a) -> Rev s a -> a

reducer :: Sequence s => (a -> a -> a) -> a -> Rev s a -> a

reducer' :: Sequence s => (a -> a -> a) -> a -> Rev s a -> a

reducel :: Sequence s => (a -> a -> a) -> a -> Rev s a -> a

reducel' :: Sequence s => (a -> a -> a) -> a -> Rev s a -> a

reduce1 :: Sequence s => (a -> a -> a) -> Rev s a -> a

reduce1' :: Sequence s => (a -> a -> a) -> Rev s a -> a

copy :: Sequence s => Int -> a -> Rev s a

inBounds :: Sequence s => Int -> Rev s a -> Bool

lookup :: Sequence s => Int -> Rev s a -> a

lookupM :: (Sequence s, MonadFail m) => Int -> Rev s a -> m a

lookupWithDefault :: Sequence s => a -> Int -> Rev s a -> a

update :: Sequence s => Int -> a -> Rev s a -> Rev s a

adjust :: Sequence s => (a -> a) -> Int -> Rev s a -> Rev s a

mapWithIndex :: Sequence s => (Int -> a -> b) -> Rev s a -> Rev s b

foldrWithIndex :: Sequence s => (Int -> a -> b -> b) -> b -> Rev s a -> b

foldrWithIndex' :: Sequence s => (Int -> a -> b -> b) -> b -> Rev s a -> b

foldlWithIndex :: Sequence s => (b -> Int -> a -> b) -> b -> Rev s a -> b

foldlWithIndex' :: Sequence s => (b -> Int -> a -> b) -> b -> Rev s a -> b

take :: Sequence s => Int -> Rev s a -> Rev s a

drop :: Sequence s => Int -> Rev s a -> Rev s a

splitAt :: Sequence s => Int -> Rev s a -> (Rev s a, Rev s a)

subseq :: Sequence s => Int -> Int -> Rev s a -> Rev s a

filter :: Sequence s => (a -> Bool) -> Rev s a -> Rev s a

partition :: Sequence s => (a -> Bool) -> Rev s a -> (Rev s a, Rev s a)

takeWhile :: Sequence s => (a -> Bool) -> Rev s a -> Rev s a

dropWhile :: Sequence s => (a -> Bool) -> Rev s a -> Rev s a

splitWhile :: Sequence s => (a -> Bool) -> Rev s a -> (Rev s a, Rev s a)

zip :: Sequence s => Rev s a -> Rev s b -> Rev s (a, b)

zip3 :: Sequence s => Rev s a -> Rev s b -> Rev s c -> Rev s (a, b, c)

zipWith :: Sequence s => (a -> b -> c) -> Rev s a -> Rev s b -> Rev s c

zipWith3 :: Sequence s => (a -> b -> c -> d) -> Rev s a -> Rev s b -> Rev s c -> Rev s d

unzip :: Sequence s => Rev s (a, b) -> (Rev s a, Rev s b)

unzip3 :: Sequence s => Rev s (a, b, c) -> (Rev s a, Rev s b, Rev s c)

unzipWith :: Sequence s => (a -> b) -> (a -> c) -> Rev s a -> (Rev s b, Rev s c)

unzipWith3 :: Sequence s => (a -> b) -> (a -> c) -> (a -> d) -> Rev s a -> (Rev s b, Rev s c, Rev s d)

strict :: Sequence s => Rev s a -> Rev s a

strictWith :: Sequence s => (a -> b) -> Rev s a -> Rev s a

Unit testing

structuralInvariant :: Sequence s => Rev s a -> Bool

Documentation

moduleName :: String

instanceName :: Sequence s => Rev s a -> String

Other supported operations

fromSeq :: Sequence s => s a -> Rev s a

toSeq :: Sequence s => Rev s a -> s a