Vihren Atlas

diff.ts ×13

Code frontier

unlabeled · c_afd43db2a92a

105 tests · 5976 LOC · 31 files · introduces 0 tests · 48 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
13 ranges48 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
870 ranges5976 lines · 31 files · Browse complete extent
All tests (intent)
105 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: 48 introduced LOC across 13 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/base/common/diff/diff.ts 48 introduced LOC · 13 ranges

Open complete file

73
74 public static Assert(condition: boolean, message: string): void {
75 > if (!condition) { diff.ts
76 throw new Error(message);
77 }
78 > } diff.ts
79 }
80
248 */
249 constructor(originalSequence: ISequence, modifiedSequence: ISequence, continueProcessingPredicate: IContinueProcessingPredicate | null = null) {
250 > this.ContinueProcessingPredicate = continueProcessingPredicate; diff.ts
251 >
252 > this._originalSequence = originalSequence;
253 > this._modifiedSequence = modifiedSequence;
254 >
255 > const [originalStringElements, originalElementsOrHash, originalHasStrings] = LcsDiff._getElements(originalSequence);
256 > const [modifiedStringElements, modifiedElementsOrHash, modifiedHasStrings] = LcsDiff._getElements(modifiedSequence);
257 >
258 > this._hasStrings = (originalHasStrings && modifiedHasStrings);
259 > this._originalStringElements = originalStringElements;
260 > this._originalElementsOrHash = originalElementsOrHash;
261 > this._modifiedStringElements = modifiedStringElements;
262 > this._modifiedElementsOrHash = modifiedElementsOrHash;
263 >
264 > this.m_forwardHistory = [];
265 > this.m_reverseHistory = [];
266 > }
267
268 private static _isStringArray(arr: Int32Array | number[] | string[]): arr is string[] {
269 > return (arr.length > 0 && typeof arr[0] === 'string'); diff.ts
270 > }
271
272 private static _getElements(sequence: ISequence): [string[], Int32Array, boolean] {
273 > const elements = sequence.getElements(); diff.ts
274 >
275 > if (LcsDiff._isStringArray(elements)) {
276 const hashes = new Int32Array(elements.length);
277 for (let i = 0, len = elements.length; i < len; i++) {
286
287 return [[], new Int32Array(elements), false];
288 > } diff.ts
289
290 private ElementsAreEqual(originalIndex: number, newIndex: number): boolean {
326
327 public ComputeDiff(pretty: boolean): IDiffResult {
328 > return this._ComputeDiff(0, this._originalElementsOrHash.length - 1, 0, this._modifiedElementsOrHash.length - 1, pretty); diff.ts
329 > }
330
331 /**
335 */
336 private _ComputeDiff(originalStart: number, originalEnd: number, modifiedStart: number, modifiedEnd: number, pretty: boolean): IDiffResult {
337 > const quitEarlyArr = [false]; diff.ts
338 > let changes = this.ComputeDiffRecursive(originalStart, originalEnd, modifiedStart, modifiedEnd, quitEarlyArr);
339 >
340 > if (pretty) {
341 // We have to clean up the computed diff to be more intuitive
342 // but it turns out this cannot be done correctly until the entire set
344 changes = this.PrettifyChanges(changes);
345 }
346 > diff.ts
347 > return {
348 > quitEarly: quitEarlyArr[0],
349 > changes: changes
350 > };
351 > }
352
353 /**
357 */
358 private ComputeDiffRecursive(originalStart: number, originalEnd: number, modifiedStart: number, modifiedEnd: number, quitEarlyArr: boolean[]): DiffChange[] {
359 > quitEarlyArr[0] = false; diff.ts
360 >
361 > // Find the start of the differences
362 > while (originalStart <= originalEnd && modifiedStart <= modifiedEnd && this.ElementsAreEqual(originalStart, modifiedStart)) {
363 originalStart++;
364 modifiedStart++;
365 }
366 > diff.ts
367 > // Find the end of the differences
368 > while (originalEnd >= originalStart && modifiedEnd >= modifiedStart && this.ElementsAreEqual(originalEnd, modifiedEnd)) {
369 originalEnd--;
370 modifiedEnd--;
371 }
372 > diff.ts
373 > // In the special case where we either have all insertions or all deletions or the sequences are identical
374 > if (originalStart > originalEnd || modifiedStart > modifiedEnd) {
375 let changes: DiffChange[];
376
438 new DiffChange(originalStart, originalEnd - originalStart + 1, modifiedStart, modifiedEnd - modifiedStart + 1)
439 ];
440 > } diff.ts
441
442 private WALKTRACE(diagonalForwardBase: number, diagonalForwardStart: number, diagonalForwardEnd: number, diagonalForwardOffset: number,

Direct hierarchy

Parents

Children