Copyright	Copyright (c) 1998-1999 2008 Chris Okasaki
License	MIT; see COPYRIGHT file for terms and conditions
Maintainer	robdockins AT fastmail DOT fm
Stability	stable
Portability	GHC, Hugs (MPTC and FD)
Safe Haskell	None
Language	Haskell2010

Data.Edison.Seq.RevSeq

Contents

Rev Sequence Type
Sequence Operations
Unit testing
Documentation
Other supported operations

Description

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 ).

Synopsis

Rev Sequence Type

data Rev s a Source #

Instances

Sequence s => Monad (Rev s) Source #
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 # fail :: String -> Rev s a #
Sequence s => Functor (Rev s) Source #
Methods fmap :: (a -> b) -> Rev s a -> Rev s b # (<$) :: a -> Rev s b -> Rev s a #
Sequence s => Applicative (Rev s) Source #
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 => Sequence (Rev s) Source #
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 :: Monad m => Rev s a -> m (a, Rev s a) # lhead :: Rev s a -> a # lheadM :: Monad m => Rev s a -> m a # ltail :: Rev s a -> Rev s a # ltailM :: Monad m => Rev s a -> m (Rev s a) # rview :: Monad m => Rev s a -> m (a, Rev s a) # rhead :: Rev s a -> a # rheadM :: Monad m => Rev s a -> m a # rtail :: Rev s a -> Rev s a # rtailM :: Monad 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 :: Monad 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) Source #
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 => MonadPlus (Rev s) Source #
Methods mzero :: Rev s a # mplus :: Rev s a -> Rev s a -> Rev s a #
Eq (s a) => Eq (Rev s a) Source #
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) Source #
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 s, Read (s a)) => Read (Rev s a) Source #
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) Source #
Methods showsPrec :: Int -> Rev s a -> ShowS # show :: Rev s a -> String # showList :: [Rev s a] -> ShowS #
Sequence s => Semigroup (Rev s a) Source #
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 => Monoid (Rev s a) Source #
Methods mempty :: Rev s a # mappend :: Rev s a -> Rev s a -> Rev s a # mconcat :: [Rev s a] -> Rev s a #
(Sequence s, Arbitrary (s a)) => Arbitrary (Rev s a) Source #
Methods arbitrary :: Gen (Rev s a) # shrink :: Rev s a -> [Rev s a] #
(Sequence s, CoArbitrary (s a)) => CoArbitrary (Rev s a) Source #
Methods coarbitrary :: Rev s a -> Gen b -> Gen b #