Abstract: Enhancements described support transparent remote execution of development tool extensions. Compute-intensive extensions may be executed on an extension machine external to a developer machine which runs a user interface renderer of the development tool. User interface extensions may run locally. Instead of sharing a filesystem, the renderer on the developer machine and an extension host and extension(s) on the extension machine may access distinct respective machine filesystems. Instead of spawning debug extension and other extension-support processes locally, the renderer may instruct the extension host or an extension host agent to spawn the processes remotely on the extension machine. Existing extensions and newly created extensions are binary-compatible with single-machine or multi-machine development tool deployments.

Abstract: A family of piece tree data structures and related algorithms are described, for buffering editable text in a digital memory. A piece tree includes one or more string buffers and a tree, such as a balanced binary tree. Tree nodes identify respective substrings in the buffer(s), and correspond to edits of the content loaded into a text editor. Specific changes in data structures and the impact of those changes on performance relative to other buffering structures are discussed, including reduced memory usage, faster file loading, and the impact of accumulated edit operations. Offsets of text items such as line breaks are tracked, permitting optimizations for locating them in a text. Benchmark testing results are presented. Source code editors provide examples, but the piece tree buffering structures and their related traversal, (re)configuration, and other algorithms can be part of text editors in a variety of application or subject matter areas.

Abstract: A family of piece tree data structures and related algorithms are described, for buffering editable text in a digital memory. A piece tree includes one or more string buffers and a tree, such as a balanced binary tree. Tree nodes identify respective substrings in the buffer(s), and correspond to edits of the content loaded into a text editor. Specific changes in data structures and the impact of those changes on performance relative to other buffering structures are discussed, including reduced memory usage, faster file loading, and the impact of accumulated edit operations. Offsets of text items such as line breaks are tracked, permitting optimizations for locating them in a text. Benchmark testing results are presented. Source code editors provide examples, but the piece tree buffering structures and their related traversal, (re)configuration, and other algorithms can be part of text editors in a variety of application or subject matter areas.

Abstract: Enhancements described support transparent remote execution of development tool extensions. Compute-intensive extensions may be executed on an extension machine external to a developer machine which runs a user interface renderer of the development tool. User interface extensions may run locally. Instead of sharing a filesystem, the renderer on the developer machine and an extension host and extension(s) on the extension machine may access distinct respective machine filesystems. Instead of spawning debug extension and other extension-support processes locally, the renderer may instruct the extension host or an extension host agent to spawn the processes remotely on the extension machine. No change is needed to extensions; existing extensions and newly created extensions are binary-compatible with single-machine or multi-machine development tool deployments.