Vihren Atlas

intervalTree.ts ×5

Code frontier

unlabeled · c_87cfb2831cc5

23 tests · 41494 LOC · 238 files · introduces 0 tests · 17 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
5 ranges17 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
5154 ranges41494 lines · 238 files · Browse complete extent
All tests (intent)
23 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.

1 file ranked by introduced lines: 17 introduced LOC across 5 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/editor/common/model/intervalTree.ts 17 introduced LOC · 5 ranges

Open complete file

575 const editDelta = (textLength - (end - start));
576 while (node !== SENTINEL) {
577 > if (getNodeIsVisited(node)) { intervalTree.ts
578 > // going up from this node
579 > setNodeIsVisited(node.left, false);
580 > setNodeIsVisited(node.right, false);
581 > if (node === node.parent.right) {
582 delta -= node.parent.delta;
583 }
584 > recomputeMaxEnd(node); intervalTree.ts
585 > node = node.parent;
586 > continue;
587 > }
588 >
589 > if (!getNodeIsVisited(node.left)) {
590 > // first time seeing this node
591 > nodeMaxEnd = delta + node.maxEnd;
592 > if (nodeMaxEnd < start) {
593 // cover case b) from above
594 // there is no need to search this node or its children
602 continue;
603 }
604 > } intervalTree.ts
605
606 // handle current node
621 setNodeIsVisited(node, true);
622
623 > if (node.right !== SENTINEL && !getNodeIsVisited(node.right)) { intervalTree.ts
624 // go right
625 delta += node.delta;
627 continue;
628 }
629 > } intervalTree.ts
630
631 setNodeIsVisited(T.root, false);

Direct hierarchy

Parents

Children