Gap buffer

A gap buffer In computer science is a dynamic array that allows efficient insertion and deletion operations clustered near the same location. Gap buffers are especially common in text editors, where most changes to the text occur at or near the current location of the cursor. The text is stored in a large buffer in two contiguous segments, with a gap between them for inserting new text. Moving the cursor involves copying text from one side of the gap to the other (sometimes copying is delayed until the next operation that changes the text). Insertion adds new text at the end of the first segment. Deletion increases the size of the gap.

Advantages and disadvantages

Advantages

The advantage of using a gap buffer over more sophisticated data structures (such as linked lists) is that the text is represented simply as two literal strings, which take very little extra space and which can be searched and displayed very quickly.

Disadvantages

The disadvantage is that operations at different locations in the text and ones that fill the gap (requiring a new gap to be created) require re-copying most of the text, which is especially inefficient for large files. The use of gap buffers is based on the assumption that such recopying occurs rarely enough that its cost can be amortized over the more common cheap operations.

Text Editing with Gap Buffer

Editable sequences are useful, in particular in interactive applications such as text editors, word processors, score editors, and much more. In such kind of applications, it is highly possible that an editing operation is close to the preceding one, measured as the difference in positions in the sequence. These technical things led towards implementation of the editable sequences as a gap buffer.

It is a fairly simple technique that involves keeping track of 5 pointers and a sequencial block (known as gap) inside the buffer structure for inserting new text. The five pointers are

Head of the buffer,
Start of the gap,
First location outside the gap,
End of the buffer, and
Location (point) within the buffer.

The main rule for point is that it must be within the buffer and cannot be anywhere inside the gap other than the beginning of it. The basic idea behind this technique is to store objects in a vector that is usually longer than the number of elements stored in it. For a sequence of N elements where editing is required at index i, elements 0 to i are stored at the beginning of the vector, and elements i + 1 to N − 1 are stored at the end of the vector. When the vector is longer than N, this storage leaves a gap. Editing operations always result in modifications at the beginning or at the end of the gap.

Example

Below are some examples of operations with buffer gaps. The gap is represented pictorially by the empty space between the square brackets. This representation is a bit misleading: in a typical implementation, the endpoints of the gap are tracked using pointers or array indices, and the contents of the gap are ignored; this allows, for example, deletions to be done by adjusting a pointer without changing the text in the buffer. It is a common programming practice to use a semi-open interval for the gap pointers, i.e. the start-of-gap points to the invalid character following the last character in the first buffer, and the end-of-gap points to the first valid character in the second buffer (or equivalently, the pointers are considered to point "between" characters).

Initial state:

This is the way [                    ]out.

User inserts some new text:

This is the way the world started [   ]out.

User moves the cursor before "started"; system moves "started " from the first buffer to the second buffer.

This is the way the world [   ]started out.

User adds text filling the gap; system creates new gap:

This is the way the world as we know it [                   ]started out.

External references

Overview and implementation in .NET/C#
Brief overview and sample C++ code
Implementation of a cyclic sorted gap buffer in .NET/C#
Use of gap buffer in early editor. (First written somewhere between 1969 and 1971)
emac gap buffer info(Emacs gap buffer reference)
Text Editing