Data.Sequence.Circular

Documentation

type Seq a = Maybe (NonEmptySeq a)

A variant of Seq in which we can walk from the outside in, as usual, but also from the inside out.

data NonEmptySeq a

A doubly-linked list.

Sequences are not typically represented this way because the cycles between each node and its neighbours mean that any change to the sequence requires reallocating all of its node, not just the path from the closest end to the modified element. For this reason, we do not offer any update operations.

Constructors

NonEmptySeq

Fields

• seqFirst :: SeqNode a
• seqLast :: SeqNode a

data SeqNode a

Constructors

SeqNode

Fields

• seqNodePrev :: Maybe (SeqNode a)
• seqNodeLabel :: a
• seqNodeNext :: Maybe (SeqNode a)

freeze :: forall a. Seq a -> Seq a

freeze :: Data.Sequence.Seq a
       -> Data.Sequence.Circular.Seq a

O(n)

thaw :: forall a. Seq a -> Seq a

Returns the elements at and to the right of the given SeqNode.

thaw :: Data.Sequence.Circular.Seq a
     -> Data.Sequence.Seq a

O(n)