Vihren Atlas

defaultLinesDiffComputer.ts ×8

Code frontier

unlabeled · c_22d7481abe83

64 tests · 8051 LOC · 52 files · introduces 0 tests · 34 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
8 ranges34 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
1288 ranges8051 lines · 52 files · Browse complete extent
All tests (intent)
64 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: 34 introduced LOC across 8 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/editor/common/diff/defaultLinesDiffComputer/defaultLinesDiffComputer.ts 34 introduced LOC · 8 ranges

Open complete file

22
23 export class DefaultLinesDiffComputer implements ILinesDiffComputer {
24 > private readonly dynamicProgrammingDiffing = new DynamicProgrammingDiffing(); defaultLinesDiffComputer.ts
25 > private readonly myersDiffingAlgorithm = new MyersDiffAlgorithm();
26
27 computeDiff(originalLines: string[], modifiedLines: string[], options: ILinesDiffComputerOptions): LinesDiff {
28 > if (originalLines.length <= 1 && equals(originalLines, modifiedLines, (a, b) => a === b)) { defaultLinesDiffComputer.ts
29 return new LinesDiff([], [], false);
30 }
31 > defaultLinesDiffComputer.ts
32 > if (originalLines.length === 1 && originalLines[0].length === 0 || modifiedLines.length === 1 && modifiedLines[0].length === 0) {
33 return new LinesDiff([
34 new DetailedLineRangeMapping(
45 }
46
47 > const timeout = options.maxComputationTimeMs === 0 ? InfiniteTimeout.instance : new DateTimeout(options.maxComputationTimeMs); defaultLinesDiffComputer.ts
48 > const considerWhitespaceChanges = !options.ignoreTrimWhitespace;
49 >
50 > const perfectHashes = new Map<string, number>();
51 > function getOrCreateHash(text: string): number {
52 let hash = perfectHashes.get(text);
53 if (hash === undefined) {
57 return hash;
58 }
59 > defaultLinesDiffComputer.ts
60 > const originalLinesHashes = originalLines.map((l) => getOrCreateHash(l.trim()));
61 > const modifiedLinesHashes = modifiedLines.map((l) => getOrCreateHash(l.trim()));
62 >
63 > const sequence1 = new LineSequence(originalLinesHashes, originalLines);
64 > const sequence2 = new LineSequence(modifiedLinesHashes, modifiedLines);
65 >
66 > const lineAlignmentResult = (() => {
67 if (sequence1.length + sequence2.length < 1700) {
68 // Use the improved algorithm for small files
85 timeout
86 );
87 > })(); defaultLinesDiffComputer.ts
88 >
89 > let lineAlignments = lineAlignmentResult.diffs;
90 > let hitTimeout = lineAlignmentResult.hitTimeout;
91 > lineAlignments = optimizeSequenceDiffs(sequence1, sequence2, lineAlignments);
92 > lineAlignments = removeVeryShortMatchingLinesBetweenDiffs(sequence1, sequence2, lineAlignments);
93 >
94 > const alignments: RangeMapping[] = [];
95 >
96 > const scanForWhitespaceChanges = (equalLinesCount: number) => {
97 if (!considerWhitespaceChanges) {
98 return;
117 }
118 };
119 > defaultLinesDiffComputer.ts
120 > let seq1LastStart = 0;
121 > let seq2LastStart = 0;
122 >
123 > for (const diff of lineAlignments) {
124 assertFn(() => diff.seq1Range.start - seq1LastStart === diff.seq2Range.start - seq2LastStart);
125

Direct hierarchy

Parents

Children