Vihren Atlas

textModel.ts ×5

Code frontier

unlabeled · c_2d95c6a0685a

63 tests · 41550 LOC · 238 files · introduces 0 tests · 18 LOC · 2 files

Introduces — evidence that enters the hierarchy at this concept

Code
7 ranges18 lines · 2 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
5174 ranges41550 lines · 238 files · Browse complete extent
All tests (intent)
63 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: 18 introduced LOC across 7 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/editor/common/model/textModel.ts 10 introduced LOC · 5 ranges

Open complete file

2328 const versionId = host.getVersionId();
2329 if (node.cachedVersionId !== versionId) {
2330 > this._resolveNode(node, versionId); textModel.ts
2331 > }
2332 if (node.range === null) {
2333 > node.range = host.getRangeAt(node.cachedAbsoluteStart, node.cachedAbsoluteEnd); textModel.ts
2334 > }
2335 return node.range;
2336 }
2337
2338 private _resolveNode(node: IntervalNode, cachedVersionId: number): void {
2339 > if (isNodeInjectedText(node)) { textModel.ts
2340 this._injectedTextDecorationsTree.resolveNode(node, cachedVersionId);
2341 > } else if (isNodeInOverviewRuler(node)) { textModel.ts
2342 this._decorationsTree1.resolveNode(node, cachedVersionId);
2343 > } else { textModel.ts
2344 > this._decorationsTree0.resolveNode(node, cachedVersionId);
2345 > }
2346 > }
2347
2348 public acceptReplace(offset: number, length: number, textLength: number, forceMoveMarkers: boolean): void {
src/vs/editor/common/model/intervalTree.ts 8 introduced LOC · 2 ranges

Open complete file

290
291 public resolveNode(node: IntervalNode, cachedVersionId: number): void {
292 > const initialNode = node; intervalTree.ts
293 > let delta = 0;
294 > while (node !== this.root) {
295 if (node === node.parent.right) {
296 delta += node.parent.delta;
298 node = node.parent;
299 }
300 > intervalTree.ts
301 > const nodeStart = initialNode.start + delta;
302 > const nodeEnd = initialNode.end + delta;
303 > initialNode.setCachedOffsets(nodeStart, nodeEnd, cachedVersionId);
304 > }
305
306 public acceptReplace(offset: number, length: number, textLength: number, forceMoveMarkers: boolean): void {

Direct hierarchy

Parents

Children