Vihren Atlas

heuristicSequenceOptimizations.ts ×3

Code frontier

unlabeled · c_0a8903cfcafb

48 tests · 8752 LOC · 52 files · introduces 0 tests · 23 LOC · 2 files

Introduces — evidence that enters the hierarchy at this concept

Code
6 ranges23 lines · 2 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
1470 ranges8752 lines · 52 files · Browse complete extent
All tests (intent)
48 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: 23 introduced LOC across 6 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/editor/common/diff/defaultLinesDiffComputer/heuristicSequenceOptimizations.ts 13 introduced LOC · 3 ranges

Open complete file

243 return;
244 }
245 > let w = new SequenceDiff(w1, w2); heuristicSequenceOptimizations.ts
246 > const equalPart = w.intersect(equalMapping)!;
247 >
248 > let equalChars1 = equalPart.seq1Range.length;
249 > let equalChars2 = equalPart.seq2Range.length;
250 >
251 > // The words do not touch previous equals mappings, as we would have processed them already.
252 > // But they might touch the next ones.
253 >
254 > while (equalMappings.length > 0) {
255 const next = equalMappings[0];
256 const intersects = next.seq1Range.intersects(w.seq1Range) || next.seq2Range.intersects(w.seq2Range);
277 }
278 }
279 > heuristicSequenceOptimizations.ts
280 if ((force && equalChars1 + equalChars2 < w.seq1Range.length + w.seq2Range.length) || equalChars1 + equalChars2 < (w.seq1Range.length + w.seq2Range.length) * 2 / 3) {
281 additional.push(w);
282 }
283 > heuristicSequenceOptimizations.ts
284 > lastPoint = w.getEndExclusives();
285 }
286
src/vs/editor/common/diff/defaultLinesDiffComputer/linesSliceCharSequence.ts 10 introduced LOC · 3 ranges

Open complete file

129 return undefined;
130 }
131 > linesSliceCharSequence.ts
132 > // find start
133 > let start = offset;
134 while (start > 0 && isWordChar(this.elements[start - 1])) {
135 start--;
136 }
137 > linesSliceCharSequence.ts
138 > // find end
139 > let end = offset;
140 while (end < this.elements.length && isWordChar(this.elements[end])) {
141 > end++; linesSliceCharSequence.ts
142 > }
143 >
144 > return new OffsetRange(start, end);
145 }
146

Direct hierarchy

Parents

Children