Data.Rope.Annotated

Annotated Ropes

data A s a

Instances

Measured Offset (A s a)

Functor (A s)

Foldable (A s)

Traversable (A s)

Comonad (A s)

type Ann a f = A a (f a)

class MonoidA f

Instances

MonoidA Unit

(MonoidA f, MonoidA g) => MonoidA (:*: f g)

class MonoidA f => ReducerA f

Instances

ReducerA Unit

(ReducerA f, ReducerA g) => ReducerA (:*: f g)

class BreakableA f

Instances

BreakableA Unit

(BreakableA f, BreakableA g) => BreakableA (:*: f g)

runAnn :: Ann a f -> (forall b. Ann b f -> r) -> r

Unpacking Ropes

null :: A s a -> Bool

head :: Unpackable t => A s a -> t

last :: Unpackable t => A s a -> t

unpack :: Unpackable t => A s a -> [t]

Building Annotated Rope

empty :: MonoidA f => Ann Nil f

append :: MonoidA f => Ann a f -> Ann b f -> Ann (a :<> b) f

unit :: (ReducerA f, Reducer t Rope) => t -> (forall a. Ann (Return a) f -> r) -> r

snoc :: (ReducerA f, Reducer t Rope) => Ann a f -> t -> (forall c. Ann (Snoc a c t) f -> r) -> r

cons :: (ReducerA f, Reducer t Rope) => t -> Ann a f -> (forall c. Ann (Cons c t a) f -> r) -> r

Cutting An Annotated Rope

splitAt :: BreakableA f => Int -> Ann a f -> (forall n. Ann (Take n a) f -> Ann (Drop n a) f -> r) -> r

drop :: BreakableA f => Int -> Ann a f -> (forall n. Ann (Drop n a) f -> r) -> r

take :: BreakableA f => Int -> Ann a f -> (forall n. Ann (Take n a) f -> r) -> r

break :: (BreakableA f, Breakable t) => (t -> Bool) -> Ann a f -> (forall n. Ann (Take n a) f -> Ann (Drop n a) f -> r) -> r

span :: (BreakableA f, Breakable t) => (t -> Bool) -> Ann a f -> (forall n. Ann (Take n a) f -> Ann (Drop n a) f -> r) -> r

takeWhile :: (BreakableA f, Breakable t) => (t -> Bool) -> Ann a f -> (forall n. Ann (Take n a) f -> r) -> r

dropWhile :: (BreakableA f, Breakable t) => (t -> Bool) -> Ann a f -> (forall n. Ann (Drop n a) f -> r) -> r

Inspecting the ends of the Rope

uncons :: (BreakableA f, Unpackable t) => Ann a f -> Maybe (t, Ann (Tail t a) f)

unsnoc :: (BreakableA f, Unpackable t) => Ann a f -> Maybe (Ann (Init a t) f, t)

Type-level constructors

type family Drop n a :: *

type family Take n a :: *

type Snoc a s t = a :<> Return (Token s t)

type Cons s t a = Token s t :> a

type Tail t a = Unit (Tailed t a)

type Init a t = Unit (Inited a t)

type Return a = a :> Nil

data Nil

type family a :<> b :: *

Annotations

Annotation Product

data (f :*: g) a

A Rope Annotation product.

Constructors

(f a) :*: (g a)

Instances

(Functor f, Functor g) => Functor (:*: f g)

(Applicative f, Applicative g) => Applicative (:*: f g)

(Foldable f, Foldable g) => Foldable (:*: f g)

(Traversable f, Traversable g) => Traversable (:*: f g)

(BreakableA f, BreakableA g) => BreakableA (:*: f g)

(ReducerA f, ReducerA g) => ReducerA (:*: f g)

(MonoidA f, MonoidA g) => MonoidA (:*: f g)

fstF :: (f :*: g) a -> f a

sndF :: (f :*: g) a -> g a

Annotation Unit

data Unit a

Instances

BreakableA Unit

ReducerA Unit

MonoidA Unit