Vihren Atlas

stringEdit.ts ×7

Code frontier

unlabeled · c_1268a054c77c

1005 tests · 6514 LOC · 39 files · introduces 0 tests · 18 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
7 ranges18 lines · 1 files
Tests
0 tests

Contains — complete concept membership

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

src/vs/editor/common/core/edits/stringEdit.ts 18 introduced LOC · 7 ranges

Open complete file

93
94 private _tryRebase(base: StringEdit, noOverlap: boolean): StringEdit | undefined {
95 > const newEdits: StringReplacement[] = []; stringEdit.ts
96 >
97 > let baseIdx = 0;
98 > let ourIdx = 0;
99 > let offset = 0;
100 >
101 > while (ourIdx < this.replacements.length || baseIdx < base.replacements.length) {
102 > // take the edit that starts first
103 > const baseEdit = base.replacements.at(baseIdx);
104 > const ourEdit = this.replacements.at(ourIdx);
105 >
106 > if (!ourEdit) {
107 // We processed all our edits
108 break;
109 > } else if (!baseEdit) { stringEdit.ts
110 // no more edits from base
111 const transformedRange = ourEdit.replaceRange.delta(offset);
113 ourIdx++;
114 } else if (
115 > ourEdit.replaceRange.intersects(baseEdit.replaceRange) || stringEdit.ts
116 areConcurrentInserts(ourEdit.replaceRange, baseEdit.replaceRange) ||
117 isInsertStrictlyInsideRange(ourEdit.replaceRange, baseEdit.replaceRange) ||
118 isInsertStrictlyInsideRange(baseEdit.replaceRange, ourEdit.replaceRange)
119 > ) { stringEdit.ts
120 ourIdx++; // Don't take our edit, as it is conflicting -> skip
121 if (noOverlap) {
122 return undefined;
123 }
124 > } else if (ourEdit.replaceRange.start < baseEdit.replaceRange.start || stringEdit.ts
125 (ourEdit.replaceRange.isEmpty && ourEdit.replaceRange.start === baseEdit.replaceRange.start)) {
126 // Our edit starts first, or is an insert at the start of base's range
133 offset += baseEdit.newText.length - baseEdit.replaceRange.length;
134 }
135 > } stringEdit.ts
136
137 return new StringEdit(newEdits);
138 > } stringEdit.ts
139
140 public toJson(): ISerializedStringEdit {

Direct hierarchy

Parents

Children