Vihren Atlas

edit.ts ×6

Code frontier

unlabeled · c_75f8b5b2664a

1387 tests · 6275 LOC · 35 files · introduces 0 tests · 33 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
6 ranges33 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
1033 ranges6275 lines · 35 files · Browse complete extent
All tests (intent)
1387 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: 33 introduced LOC across 6 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/editor/common/core/edits/edit.ts 33 introduced LOC · 6 ranges

Open complete file

105 if (edits1.isEmpty()) { return edits2; }
106 if (edits2.isEmpty()) { return edits1; }
107 > edit.ts
108 > const edit1Queue = [...edits1.replacements];
109 > const result: T[] = [];
110 >
111 > let edit1ToEdit2 = 0;
112 >
113 > for (const r2 of edits2.replacements) {
114 > // Copy over edit1 unmodified until it touches edit2.
115 > while (true) {
116 > const r1 = edit1Queue[0];
117 > if (!r1 || r1.replaceRange.start + edit1ToEdit2 + r1.getNewLength() >= r2.replaceRange.start) {
118 > break;
119 > }
120 edit1Queue.shift();
121
123 edit1ToEdit2 += r1.getNewLength() - r1.replaceRange.length;
124 }
125 > edit.ts
126 > const firstEdit1ToEdit2 = edit1ToEdit2;
127 > let firstIntersecting: T | undefined; // or touching
128 > let lastIntersecting: T | undefined; // or touching
129 >
130 > while (true) {
131 > const r1 = edit1Queue[0];
132 > if (!r1 || r1.replaceRange.start + edit1ToEdit2 > r2.replaceRange.endExclusive) {
133 > break;
134 > }
135 // else we intersect, because the new end of edit1 is after or equal to our start
136
143 edit1ToEdit2 += r1.getNewLength() - r1.replaceRange.length;
144 }
145 > edit.ts
146 > if (!firstIntersecting) {
147 result.push(r2.delta(-edit1ToEdit2));
148 > } else { edit.ts
149 const newReplaceRangeStart = Math.min(firstIntersecting.replaceRange.start, r2.replaceRange.start - firstEdit1ToEdit2);
150
174 result.push(middle);
175 }
176 > } edit.ts
177 >
178 > while (true) {
179 > const item = edit1Queue.shift();
180 > if (!item) { break; }
181 result.push(item);
182 }
183 > edit.ts
184 > return this._createNew(result).normalize();
185 }
186

Direct hierarchy

Parents

Children