Frontier kind: Code frontier
unlabeled · c_1dbb54cbc91b
16 tests · 3607 LOC · 19 files · introduces 0 tests · 42 LOC · 1 file
The orange circle is the focus. Violet and green circles are every ancestor and descendant, broader and narrower, at any distance; blue squares and pink diamonds are the introduced files and exact introduced tests of every visible concept, not only the focus's. Arrows point from broader to narrower concepts and bridge only concepts omitted from this view. Undirected links show source or test introduction. Concept and file size follows LOC; exact test nodes use test-count units.
Introduced files, introduced tests, and structurally relevant concept specialization
In the embedded map, ordinary wheel input scrolls the page; use the visible controls to zoom and drag to pan. Open the full-screen map for canvas navigation: wheel pans, Ctrl/Command plus wheel zooms, and arrow keys pan when this region is focused. On touch screens, open the full-screen map to pan or pinch. If JavaScript or WebGL is unavailable, use the native relationship evidence on this page.
Graph controls are ready.
Interactive rendering requires JavaScript and WebGL. Use the native relationship evidence on this page while the interactive map is unavailable.
Every exact file and test below is linked only from the concept that introduces it.
mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/editor/test/common/model/tokenStore.test|title=TokenStore Insert new line and remove tabs (split tokens)|occurrence=1mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/editor/test/common/model/tokenStore.test|title=TokenStore Realistic scenario four|occurrence=1mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/charCode.test|title=CharCode has good values|occurrence=1mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/path.test|title=Paths (Node Implementation) path|occurrence=1mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/uri.test|title=URI File paths containing apostrophes break URI parsing and cannot be opened #276075|occurrence=1mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/uri.test|title=URI URI#file, win-speciale|occurrence=1Every collected test enters the hierarchy at exactly one concept.
No tests are introduced at this concept. Its intent tests are introduced by other concepts.
Every collected source range enters the hierarchy at exactly one concept.
1 file ranked by introduced lines: 42 introduced LOC across 10 ranges. Expand a file to inspect source; the > gutter marks introduced lines.
}
if (node1.height === node2.height) {
return ListNode.create(node1, node2);
}
return prepend(node2, node1);
}
export class TokenStore implements IDisposable {
*/
private replace(length: number, updateOffsetStart: number, tokens: TokenUpdate[], tokenQuality: TokenQuality) {
// Find the last unchanged node preceding the update
const precedingNodes: Node[] = [];
// Find the first unchanged node after the update
const postcedingNodes: Node[] = [];
const stack: { node: Node; offset: number }[] = [{ node: this._root, offset: 0 }];
while (stack.length > 0) {
const node = stack.pop()!;
const currentOffset = node.offset;
if (currentOffset < updateOffsetStart && currentOffset + node.node.length <= updateOffsetStart) {
if (!isLeaf(node.node)) {
node.node.parent = undefined;
precedingNodes.push(node.node);
continue;
// We have a partial preceding node
precedingNodes.push({ length: updateOffsetStart - currentOffset, token: node.node.token, height: 0, tokenQuality: node.node.tokenQuality });
// Node could also be postceeding, so don't continue
}
if ((updateOffsetStart <= currentOffset) && (currentOffset + node.node.length <= firstUnchangedOffsetAfterUpdate)) {
continue;
}
if (currentOffset >= firstUnchangedOffsetAfterUpdate) {
if (!isLeaf(node.node)) {
node.node.parent = undefined;
postcedingNodes.push(node.node);
continue;
} else if (isLeaf(node.node) && (currentOffset + node.node.length > firstUnchangedOffsetAfterUpdate)) {
tokenStore.ts
// we have a partial postceeding node
postcedingNodes.push({ length: currentOffset + node.node.length - firstUnchangedOffsetAfterUpdate, token: node.node.token, height: 0, tokenQuality: node.node.tokenQuality });
continue;
}
if (!isLeaf(node.node)) {
// Push children in reverse order to process them left-to-right when popping
let childOffset = currentOffset + node.node.length;
for (let i = node.node.children.length - 1; i >= 0; i--) {
childOffset -= node.node.children[i].length;
stack.push({ node: node.node.children[i], offset: childOffset });
}
}
}
let allNodes: Node[];
if (tokens.length > 0) {
allNodes = precedingNodes.concat(this.createFromUpdates(tokens, tokenQuality), postcedingNodes);
allNodes = precedingNodes.concat(postcedingNodes);
}
for (let i = 1; i < allNodes.length; i++) {
newRoot = concat(newRoot, allNodes[i]);
}
this._root = newRoot ?? this.createEmptyRoot();
}
/**