Data.Incremental.Sequence

Type

data Seq a :: * -> *

General-purpose finite sequences.

Instances

Monad Seq

Methods

(>>=) :: Seq a -> (a -> Seq b) -> Seq b

(>>) :: Seq a -> Seq b -> Seq b

return :: a -> Seq a

fail :: String -> Seq a

Functor Seq

Methods

fmap :: (a -> b) -> Seq a -> Seq b

(<$) :: a -> Seq b -> Seq a

Applicative Seq

Methods

pure :: a -> Seq a

(<*>) :: Seq (a -> b) -> Seq a -> Seq b

(*>) :: Seq a -> Seq b -> Seq b

(<*) :: Seq a -> Seq b -> Seq a

Foldable Seq

Methods

fold :: Monoid m => Seq m -> m

foldMap :: Monoid m => (a -> m) -> Seq a -> m

foldr :: (a -> b -> b) -> b -> Seq a -> b

foldr' :: (a -> b -> b) -> b -> Seq a -> b

foldl :: (b -> a -> b) -> b -> Seq a -> b

foldl' :: (b -> a -> b) -> b -> Seq a -> b

foldr1 :: (a -> a -> a) -> Seq a -> a

foldl1 :: (a -> a -> a) -> Seq a -> a

toList :: Seq a -> [a]

null :: Seq a -> Bool

length :: Seq a -> Int

elem :: Eq a => a -> Seq a -> Bool

maximum :: Ord a => Seq a -> a

minimum :: Ord a => Seq a -> a

sum :: Num a => Seq a -> a

product :: Num a => Seq a -> a

Traversable Seq

Methods

traverse :: Applicative f => (a -> f b) -> Seq a -> f (Seq b)

sequenceA :: Applicative f => Seq (f a) -> f (Seq a)

mapM :: Monad m => (a -> m b) -> Seq a -> m (Seq b)

sequence :: Monad m => Seq (m a) -> m (Seq a)

Alternative Seq

Methods

empty :: Seq a

(<|>) :: Seq a -> Seq a -> Seq a

some :: Seq a -> Seq [a]

many :: Seq a -> Seq [a]

MonadPlus Seq

Methods

mzero :: Seq a

mplus :: Seq a -> Seq a -> Seq a

IsList (Seq a)

Associated Types

type Item (Seq a) :: *

Methods

fromList :: [Item (Seq a)] -> Seq a

fromListN :: Int -> [Item (Seq a)] -> Seq a

toList :: Seq a -> [Item (Seq a)]

Eq a => Eq (Seq a)

Methods

(==) :: Seq a -> Seq a -> Bool

(/=) :: Seq a -> Seq a -> Bool

Data a => Data (Seq a)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Seq a -> c (Seq a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Seq a)

toConstr :: Seq a -> Constr

dataTypeOf :: Seq a -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Seq a))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Seq a))

gmapT :: (forall b. Data b => b -> b) -> Seq a -> Seq a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Seq a -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Seq a -> r

gmapQ :: (forall d. Data d => d -> u) -> Seq a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Seq a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a)

Ord a => Ord (Seq a)

Methods

compare :: Seq a -> Seq a -> Ordering

(<) :: Seq a -> Seq a -> Bool

(<=) :: Seq a -> Seq a -> Bool

(>) :: Seq a -> Seq a -> Bool

(>=) :: Seq a -> Seq a -> Bool

max :: Seq a -> Seq a -> Seq a

min :: Seq a -> Seq a -> Seq a

Read a => Read (Seq a)

Methods

readsPrec :: Int -> ReadS (Seq a)

readList :: ReadS [Seq a]

readPrec :: ReadPrec (Seq a)

readListPrec :: ReadPrec [Seq a]

Show a => Show (Seq a)

Methods

showsPrec :: Int -> Seq a -> ShowS

show :: Seq a -> String

showList :: [Seq a] -> ShowS

IsString (Seq Char)

Methods

fromString :: String -> Seq Char

Semigroup (Seq a)

Methods

(<>) :: Seq a -> Seq a -> Seq a

sconcat :: NonEmpty (Seq a) -> Seq a

stimes :: Integral b => b -> Seq a -> Seq a

Monoid (Seq a)

Methods

mempty :: Seq a

mappend :: Seq a -> Seq a -> Seq a

mconcat :: [Seq a] -> Seq a

NFData a => NFData (Seq a)

Methods

rnf :: Seq a -> ()

type Item (Seq a)

type Item (Seq a) = a

type DefaultChange (Seq a)

type DefaultChange (Seq a) = MultiChange (AtomicChange a)

Changes

insert :: Int -> Seq a -> DefaultChange (Seq a)

delete :: Int -> Int -> DefaultChange (Seq a)

shift :: Int -> Int -> Int -> DefaultChange (Seq a)

changeAt :: Int -> DefaultChange a -> DefaultChange (Seq a)

Atomic changes

data AtomicChange a

Constructors

Insert !Int !(Seq a)

Delete !Int !Int

Shift !Int !Int !Int

ChangeAt !Int (DefaultChange a)

Instances

Changeable a => Change (AtomicChange a)

Associated Types

type Value (AtomicChange a) :: *

Methods

($$) :: AtomicChange a -> Value (AtomicChange a) -> Value (AtomicChange a)

type Value (AtomicChange a)

type Value (AtomicChange a) = Seq a

normalizeAtomicChange :: Int -> AtomicChange a -> AtomicChange a

Transformations

singleton :: Changeable a => a ->> Seq a

fromPair :: Changeable a => (a, a) ->> Seq a

cat :: Changeable a => (Seq a, Seq a) ->> Seq a

null :: Changeable a => Seq a ->> Bool

length :: Changeable a => Seq a ->> Int

map :: (Changeable a, Changeable b) => (a ->> b) -> Seq a ->> Seq b

map' :: (Changeable a, DefaultChange a ~ PrimitiveChange a, Changeable b, DefaultChange b ~ PrimitiveChange b) => (a -> b) -> Seq a ->> Seq b

concat :: Changeable a => Seq (Seq a) ->> Seq a

concatMap :: (Changeable a, Changeable b) => (a ->> Seq b) -> Seq a ->> Seq b

gate :: Changeable a => (a ->> Bool) -> a ->> Seq a

gate' :: (Changeable a, DefaultChange a ~ PrimitiveChange a) => (a -> Bool) -> a ->> Seq a

filter :: Changeable a => (a ->> Bool) -> Seq a ->> Seq a

filter' :: (Changeable a, DefaultChange a ~ PrimitiveChange a) => (a -> Bool) -> Seq a ->> Seq a

reverse :: Changeable a => Seq a ->> Seq a

sort :: (Ord a, Changeable a) => Seq a ->> Seq a

sortBy :: Changeable a => (a -> a -> Ordering) -> Seq a ->> Seq a

Orphan instances

Changeable a => Changeable (Seq a)

Associated Types

type DefaultChange (Seq a) :: *