Because even deleted text is still included in the piece table, this makes multi-level or unlimited undo easier to implement with a piece table than with alternative data structures such as a gap buffer.
[2] For this description, we use buffer as the immutable block to hold the contents.
For the buffers and piece table given above, the following text is shown: Inserting characters to the text consists of: Single character deletion can be one of two possible conditions: Several text editors use an in-RAM piece table internally, including Bravo,[1] Abiword,[3][4][5] Atom[6] and Visual Studio Code.
[7] The "fast save" feature in some versions of Microsoft Word uses a piece table for the on-disk file format.
[2] The on-disk representation of text files in the Oberon System uses a piece chain technique that allows pieces of one document to point to text stored in some other document, similar to transclusion.