Namespace AlgorithmsSW.GapBuffer

Classes

GapBufferWithArray<T>

Implements a gap buffer with an underlying array.

GapBufferWithStacks<T>

A gap buffer implemented with two stacks.

LazyMoveGapBuffer<T>

This gap buffer does not immediately copy elements around when moving the cursor; the copying only happens once we remove or add elements.

RandomAccessLazyMoveGapBuffer<T>

A LazyMoveGapBuffer<T> that also provides random access.

Interfaces

IGapBuffer<T>

Represents a gap buffer, a data structure that allows efficient insertions and deletions at arbitrary positions.