Vihren Atlas

diff.ts ×1

Code frontier

unlabeled · c_f9ec6ad1461c

70 tests · 6249 LOC · 31 files · introduces 0 tests · 10 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
1 range10 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
912 ranges6249 lines · 31 files · Browse complete extent
All tests (intent)
70 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: 10 introduced LOC across 1 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/base/common/diff/diff.ts 10 introduced LOC · 1 range

Open complete file

1053 return (right.length > 0) ? right : left;
1054 } else if (this.ChangesOverlap(left[left.length - 1], right[0], mergedChangeArr)) {
1055 > // Since we break the problem down recursively, it is possible that we diff.ts
1056 > // might recurse in the middle of a change thereby splitting it into
1057 > // two changes. Here in the combining stage, we detect and fuse those
1058 > // changes back together
1059 > const result = new Array<DiffChange>(left.length + right.length - 1);
1060 > MyArray.Copy(left, 0, result, 0, left.length - 1);
1061 > result[left.length - 1] = mergedChangeArr[0];
1062 > MyArray.Copy(right, 1, result, left.length, right.length - 1);
1063 >
1064 > return result;
1065 } else {
1066 const result = new Array<DiffChange>(left.length + right.length);

Direct hierarchy

Parents

Children