Vihren Atlas

arrays.ts ×1

Joint frontier

unlabeled · c_43c0dabd6cfb

2 tests · 3430 LOC · 18 files · introduces 1 test · 50 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
1 range50 lines · 1 files
Tests
1 test

Contains — complete concept membership

All code (extent)
482 ranges3430 lines · 18 files · Browse complete extent
All tests (intent)
2 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.

Introduced files, introduced tests, and structurally relevant concept specializationarrays.ts ×1 · 11 introduced LOCarrays.ts ×1uri.test|title=URI URI#file, win-speciale|occurrence=1, charCode.test|title=CharCode has good values|occurrence=1, +2 · 0 introduced LOCuri.test|title=URI URI#f…utils.ts ×3 · 9 introduced LOCutils.ts ×3lifecycle.ts ×2 · 4 introduced LOClifecycle.ts ×2lifecycle.ts ×1 · 2 introduced LOClifecycle.ts ×1lifecycle.ts ×4 · 8 introduced LOClifecycle.ts ×4lifecycle.ts ×6 · 16 introduced LOClifecycle.ts ×6lifecycle.ts ×1 · 2 introduced LOClifecycle.ts ×1lifecycle.ts ×1 · 2 introduced LOClifecycle.ts ×1lifecycle.ts ×1 · 3 introduced LOClifecycle.ts ×1map.ts ×97 · 3334 introduced LOCmap.ts ×97src/vs/base/common/arrays.ts · 949 LOCcommon/arrays.tssrc/vs/base/common/arraysFind.ts · 226 LOCcommon/arraysFind.tssrc/vs/base/common/assert.ts · 91 LOCcommon/assert.tssrc/vs/base/common/charCode.ts · 450 LOCcommon/charCode.tssrc/vs/base/common/collections.ts · 176 LOCcommon/collections.tssrc/vs/base/common/errors.ts · 357 LOCcommon/errors.tssrc/vs/base/common/functional.ts · 32 LOCcommon/functional.tssrc/vs/base/common/iterator.ts · 194 LOCcommon/iterator.tssrc/vs/base/common/lifecycle.ts · 974 LOCcommon/lifecycle.tssrc/vs/base/common/map.ts · 1016 LOCcommon/map.tssrc/vs/base/common/marshallingIds.ts · 33 LOCcommon/marshallingIds.tssrc/vs/base/common/path.ts · 1589 LOCcommon/path.tssrc/vs/base/common/platform.ts · 281 LOCcommon/platform.tssrc/vs/base/common/process.ts · 76 LOCcommon/process.tssrc/vs/base/common/types.ts · 410 LOCcommon/types.tssrc/vs/base/common/uri.ts · 754 LOCcommon/uri.tssrc/vs/base/test/common/utils.ts · 107 LOCcommon/utils.tssrc/vs/nls.ts · 244 LOCvs/nls.tsarrays.test|title=Arrays delta sorted arrays|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/arrays.test|title=Arrays delta sorted arrays|occurrence=1arrays.test|title=Arrays…arrays.test|title=Arrays sortedDiff|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/arrays.test|title=Arrays sortedDiff|occurrence=1arrays.test|title=Arrays…charCode.test|title=CharCode has good values|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/charCode.test|title=CharCode has good values|occurrence=1charCode.test|title=Char…path.test|title=Paths (Node Implementation) path|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/path.test|title=Paths (Node Implementation) path|occurrence=1path.test|title=Paths (N…uri.test|title=URI File paths containing apostrophes break URI parsing and cannot be opened #276075|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/uri.test|title=URI File paths containing apostrophes break URI parsing and cannot be opened #276075|occurrence=1uri.test|title=URI File …uri.test|title=URI URI#file, win-speciale|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/uri.test|title=URI URI#file, win-speciale|occurrence=1uri.test|title=URI URI#f…Focused concept · arrays.ts ×1 · 50 introduced LOCarrays.ts ×1

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.

1 test introduced at this concept.

Introduced code

Every collected source range enters the hierarchy at exactly one concept.

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

src/vs/base/common/arrays.ts 50 introduced LOC · 1 range

Open complete file

216 */
217 export function sortedDiff<T>(before: ReadonlyArray<T>, after: ReadonlyArray<T>, compare: (a: T, b: T) => number): ISplice<T>[] {
218 > const result: IMutableSplice<T>[] = []; arrays.ts
219 >
220 > function pushSplice(start: number, deleteCount: number, toInsert: T[]): void {
221 > if (deleteCount === 0 && toInsert.length === 0) {
222 > return;
223 > }
224 >
225 > const latest = result[result.length - 1];
226 >
227 > if (latest && latest.start + latest.deleteCount === start) {
228 > latest.deleteCount += deleteCount;
229 > latest.toInsert.push(...toInsert);
230 > } else {
231 > result.push({ start, deleteCount, toInsert });
232 > }
233 > }
234 >
235 > let beforeIdx = 0;
236 > let afterIdx = 0;
237 >
238 > while (true) {
239 > if (beforeIdx === before.length) {
240 > pushSplice(beforeIdx, 0, after.slice(afterIdx));
241 > break;
242 > }
243 > if (afterIdx === after.length) {
244 > pushSplice(beforeIdx, before.length - beforeIdx, []);
245 > break;
246 > }
247 >
248 > const beforeElement = before[beforeIdx];
249 > const afterElement = after[afterIdx];
250 > const n = compare(beforeElement, afterElement);
251 > if (n === 0) {
252 > // equal
253 > beforeIdx += 1;
254 > afterIdx += 1;
255 > } else if (n < 0) {
256 > // beforeElement is smaller -> before element removed
257 > pushSplice(beforeIdx, 1, []);
258 > beforeIdx += 1;
259 > } else if (n > 0) {
260 > // beforeElement is greater -> after element added
261 > pushSplice(beforeIdx, 0, [afterElement]);
262 > afterIdx += 1;
263 > }
264 > }
265 >
266 > return result;
267 > }
268
269 /**

Direct hierarchy

Parents

Children