Vihren Atlas

nodeReader.ts ×3

Code frontier

unlabeled · c_cacc0a53fb62

6 tests · 43092 LOC · 238 files · introduces 0 tests · 19 LOC · 2 files

Introduces — evidence that enters the hierarchy at this concept

Code
4 ranges19 lines · 2 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
5627 ranges43092 lines · 238 files · Browse complete extent
All tests (intent)
6 testsBrowse complete intent

Neighbourhood graph

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.

Native relationship evidence

Every exact file and test below is linked only from the concept that introduces it.

Introduced tests

Every collected test enters the hierarchy at exactly one concept.

No tests are introduced at this concept. Its intent tests are introduced by other concepts.

Introduced code

Every collected source range enters the hierarchy at exactly one concept.

2 files ranked by introduced lines: 19 introduced LOC across 4 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/editor/common/model/bracketPairsTextModelPart/bracketPairsTree/nodeReader.ts 12 introduced LOC · 3 ranges

Open complete file

67 }
68 } else {
69 > // readerOffsetBeforeChange === curNodeOffset nodeReader.ts
70 > if (predicate(curNode)) {
71 this.nextNodeAfterCurrent();
72 return curNode;
73 > } else { nodeReader.ts
74 > const nextChildIdx = getNextChildIdx(curNode);
75 > // look for shorter node
76 > if (nextChildIdx === -1) {
77 > // There is no shorter node.
78 > this.nextNodeAfterCurrent();
79 > return undefined;
80 > } else {
81 // Descend into first child & repeat.
82 this.nextNodes.push(curNode.getChild(nextChildIdx)!);
84 this.idxs.push(nextChildIdx);
85 }
86 > } nodeReader.ts
87 > }
88 }
89 }
src/vs/editor/common/model/bracketPairsTextModelPart/bracketPairsTree/parser.ts 7 introduced LOC · 1 range

Open complete file

108 if (maxCacheableLength === null || !lengthIsZero(maxCacheableLength)) {
109 const cachedNode = this.oldNodeReader.readLongestNodeAt(this.positionMapper.getOffsetBeforeChange(this.tokenizer.offset), curNode => {
110 > // The edit could extend the ending token, thus we cannot re-use nodes that touch the edit. parser.ts
111 > // If there is no edit anymore, we can re-use the node in any case.
112 > if (maxCacheableLength !== null && !lengthLessThan(curNode.length, maxCacheableLength)) {
113 > // Either the node contains edited text or touches edited text.
114 > // In the latter case, brackets might have been extended (`end` -> `ending`), so even touching nodes cannot be reused.
115 > return false;
116 > }
117 const canBeReused = curNode.canBeReused(openedBracketIds);
118 return canBeReused;

Direct hierarchy

Parents

Children