Fast incremental parsing using piece table and tree-sitter to generate syntax tree
-
Updated
May 12, 2020 - C
Fast incremental parsing using piece table and tree-sitter to generate syntax tree
A high-performance, immutable text buffer for Kotlin Multiplatform, powered by a balanced Rope data structure. Designed for collaborative editors, IDEs, and reactive text processing, it delivers O(log N) insertions/deletions with structural sharing to minimize memory overhead. Features include reactive coroutine-based event streams, multi-encoding.
Extensible ommand-history core with multi-level undo/redo, redo invalidation, macro commands, and a deterministic text-buffer demo.
Terminal text buffer implementation in Java — the core data structure used by terminal emulators to store, edit, and render text. Application project for a JetBrains internship. Features scrollback history, 16-color ANSI support, wide character (CJK/emoji) handling, and a live REPL for interactive testing.
To associate your repository with the text-buffer topic, visit your repo's landing page and select "manage topics."