@theia/scm 1.45.0 → 1.46.0-next.72
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +31 -31
- package/lib/browser/decorations/scm-decorations-service.d.ts +14 -14
- package/lib/browser/decorations/scm-decorations-service.js +101 -101
- package/lib/browser/decorations/scm-navigator-decorator.d.ts +25 -25
- package/lib/browser/decorations/scm-navigator-decorator.js +132 -132
- package/lib/browser/decorations/scm-tab-bar-decorator.d.ts +17 -17
- package/lib/browser/decorations/scm-tab-bar-decorator.js +93 -93
- package/lib/browser/dirty-diff/content-lines.d.ts +12 -12
- package/lib/browser/dirty-diff/content-lines.js +106 -106
- package/lib/browser/dirty-diff/content-lines.spec.d.ts +1 -1
- package/lib/browser/dirty-diff/content-lines.spec.js +39 -39
- package/lib/browser/dirty-diff/diff-computer.d.ts +29 -29
- package/lib/browser/dirty-diff/diff-computer.js +102 -102
- package/lib/browser/dirty-diff/diff-computer.spec.d.ts +1 -1
- package/lib/browser/dirty-diff/diff-computer.spec.js +315 -315
- package/lib/browser/dirty-diff/dirty-diff-decorator.d.ts +14 -14
- package/lib/browser/dirty-diff/dirty-diff-decorator.js +98 -98
- package/lib/browser/dirty-diff/dirty-diff-module.d.ts +3 -3
- package/lib/browser/dirty-diff/dirty-diff-module.js +24 -24
- package/lib/browser/scm-amend-component.d.ts +123 -123
- package/lib/browser/scm-amend-component.js +463 -463
- package/lib/browser/scm-amend-widget.d.ts +20 -20
- package/lib/browser/scm-amend-widget.js +101 -101
- package/lib/browser/scm-avatar-service.d.ts +3 -3
- package/lib/browser/scm-avatar-service.js +36 -36
- package/lib/browser/scm-commit-widget.d.ts +52 -52
- package/lib/browser/scm-commit-widget.js +199 -199
- package/lib/browser/scm-context-key-service.d.ts +10 -10
- package/lib/browser/scm-context-key-service.js +58 -58
- package/lib/browser/scm-contribution.d.ts +83 -83
- package/lib/browser/scm-contribution.js +356 -356
- package/lib/browser/scm-frontend-module.d.ts +6 -6
- package/lib/browser/scm-frontend-module.js +130 -130
- package/lib/browser/scm-groups-tree-model.d.ts +14 -14
- package/lib/browser/scm-groups-tree-model.js +97 -97
- package/lib/browser/scm-input.d.ts +53 -53
- package/lib/browser/scm-input.js +127 -127
- package/lib/browser/scm-layout-migrations.d.ts +9 -9
- package/lib/browser/scm-layout-migrations.js +79 -79
- package/lib/browser/scm-no-repository-widget.d.ts +8 -8
- package/lib/browser/scm-no-repository-widget.js +49 -49
- package/lib/browser/scm-preferences.d.ts +11 -11
- package/lib/browser/scm-preferences.js +51 -51
- package/lib/browser/scm-provider.d.ts +58 -58
- package/lib/browser/scm-provider.js +19 -19
- package/lib/browser/scm-quick-open-service.d.ts +11 -11
- package/lib/browser/scm-quick-open-service.js +73 -73
- package/lib/browser/scm-repository.d.ts +17 -17
- package/lib/browser/scm-repository.js +41 -41
- package/lib/browser/scm-service.d.ts +26 -26
- package/lib/browser/scm-service.js +108 -108
- package/lib/browser/scm-tree-label-provider.d.ts +7 -7
- package/lib/browser/scm-tree-label-provider.js +57 -57
- package/lib/browser/scm-tree-model.d.ts +74 -74
- package/lib/browser/scm-tree-model.js +351 -351
- package/lib/browser/scm-tree-widget.d.ts +208 -208
- package/lib/browser/scm-tree-widget.js +703 -703
- package/lib/browser/scm-widget.d.ts +40 -40
- package/lib/browser/scm-widget.js +218 -218
- package/package.json +6 -6
- package/src/browser/decorations/scm-decorations-service.ts +78 -78
- package/src/browser/decorations/scm-navigator-decorator.ts +121 -121
- package/src/browser/decorations/scm-tab-bar-decorator.ts +83 -83
- package/src/browser/dirty-diff/content-lines.spec.ts +42 -42
- package/src/browser/dirty-diff/content-lines.ts +112 -112
- package/src/browser/dirty-diff/diff-computer.spec.ts +387 -387
- package/src/browser/dirty-diff/diff-computer.ts +129 -129
- package/src/browser/dirty-diff/dirty-diff-decorator.ts +107 -107
- package/src/browser/dirty-diff/dirty-diff-module.ts +24 -24
- package/src/browser/scm-amend-component.tsx +600 -600
- package/src/browser/scm-amend-widget.tsx +77 -77
- package/src/browser/scm-avatar-service.ts +27 -27
- package/src/browser/scm-commit-widget.tsx +215 -215
- package/src/browser/scm-context-key-service.ts +46 -46
- package/src/browser/scm-contribution.ts +361 -361
- package/src/browser/scm-frontend-module.ts +149 -149
- package/src/browser/scm-groups-tree-model.ts +78 -78
- package/src/browser/scm-input.ts +164 -164
- package/src/browser/scm-layout-migrations.ts +64 -64
- package/src/browser/scm-no-repository-widget.tsx +41 -41
- package/src/browser/scm-preferences.ts +63 -63
- package/src/browser/scm-provider.ts +91 -91
- package/src/browser/scm-quick-open-service.ts +48 -48
- package/src/browser/scm-repository.ts +52 -52
- package/src/browser/scm-service.ts +108 -108
- package/src/browser/scm-tree-label-provider.ts +44 -44
- package/src/browser/scm-tree-model.ts +405 -405
- package/src/browser/scm-tree-widget.tsx +838 -838
- package/src/browser/scm-widget.tsx +204 -204
- package/src/browser/style/dirty-diff-decorator.css +52 -52
- package/src/browser/style/dirty-diff.css +50 -50
- package/src/browser/style/index.css +271 -271
- package/src/browser/style/scm-amend-component.css +94 -94
- package/src/browser/style/scm.svg +4 -4
|
@@ -1,387 +1,387 @@
|
|
|
1
|
-
// *****************************************************************************
|
|
2
|
-
// Copyright (C) 2018 TypeFox and others.
|
|
3
|
-
//
|
|
4
|
-
// This program and the accompanying materials are made available under the
|
|
5
|
-
// terms of the Eclipse Public License v. 2.0 which is available at
|
|
6
|
-
// http://www.eclipse.org/legal/epl-2.0.
|
|
7
|
-
//
|
|
8
|
-
// This Source Code may also be made available under the following Secondary
|
|
9
|
-
// Licenses when the conditions for such availability set forth in the Eclipse
|
|
10
|
-
// Public License v. 2.0 are satisfied: GNU General Public License, version 2
|
|
11
|
-
// with the GNU Classpath Exception which is available at
|
|
12
|
-
// https://www.gnu.org/software/classpath/license.html.
|
|
13
|
-
//
|
|
14
|
-
// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
|
|
15
|
-
// *****************************************************************************
|
|
16
|
-
|
|
17
|
-
import * as chai from 'chai';
|
|
18
|
-
import { expect } from 'chai';
|
|
19
|
-
chai.use(require('chai-string'));
|
|
20
|
-
|
|
21
|
-
import { DiffComputer, DirtyDiff } from './diff-computer';
|
|
22
|
-
import { ContentLines } from './content-lines';
|
|
23
|
-
|
|
24
|
-
let diffComputer: DiffComputer;
|
|
25
|
-
|
|
26
|
-
before(() => {
|
|
27
|
-
diffComputer = new DiffComputer();
|
|
28
|
-
});
|
|
29
|
-
|
|
30
|
-
describe('dirty-diff-computer', () => {
|
|
31
|
-
|
|
32
|
-
it('remove single line', () => {
|
|
33
|
-
const dirtyDiff = computeDirtyDiff(
|
|
34
|
-
[
|
|
35
|
-
'FIRST',
|
|
36
|
-
'SECOND TO-BE-REMOVED',
|
|
37
|
-
'THIRD'
|
|
38
|
-
],
|
|
39
|
-
[
|
|
40
|
-
'FIRST',
|
|
41
|
-
'THIRD'
|
|
42
|
-
],
|
|
43
|
-
);
|
|
44
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
45
|
-
added: [],
|
|
46
|
-
modified: [],
|
|
47
|
-
removed: [0],
|
|
48
|
-
});
|
|
49
|
-
});
|
|
50
|
-
|
|
51
|
-
[1, 2, 3, 20].forEach(lines => {
|
|
52
|
-
it(`remove ${formatLines(lines)} at the end`, () => {
|
|
53
|
-
const dirtyDiff = computeDirtyDiff(
|
|
54
|
-
sequenceOfN(2)
|
|
55
|
-
.concat(sequenceOfN(lines, () => 'TO-BE-REMOVED')),
|
|
56
|
-
sequenceOfN(2),
|
|
57
|
-
);
|
|
58
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
59
|
-
modified: [],
|
|
60
|
-
removed: [1],
|
|
61
|
-
added: [],
|
|
62
|
-
});
|
|
63
|
-
});
|
|
64
|
-
});
|
|
65
|
-
|
|
66
|
-
it('remove all lines', () => {
|
|
67
|
-
const dirtyDiff = computeDirtyDiff(
|
|
68
|
-
sequenceOfN(10, () => 'TO-BE-REMOVED'),
|
|
69
|
-
['']
|
|
70
|
-
);
|
|
71
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
72
|
-
added: [],
|
|
73
|
-
modified: [],
|
|
74
|
-
removed: [0],
|
|
75
|
-
});
|
|
76
|
-
});
|
|
77
|
-
|
|
78
|
-
[1, 2, 3, 20].forEach(lines => {
|
|
79
|
-
it(`remove ${formatLines(lines)} at the beginning`, () => {
|
|
80
|
-
const dirtyDiff = computeDirtyDiff(
|
|
81
|
-
sequenceOfN(lines, () => 'TO-BE-REMOVED')
|
|
82
|
-
.concat(sequenceOfN(2)),
|
|
83
|
-
sequenceOfN(2),
|
|
84
|
-
);
|
|
85
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
86
|
-
modified: [],
|
|
87
|
-
removed: [0],
|
|
88
|
-
added: [],
|
|
89
|
-
});
|
|
90
|
-
});
|
|
91
|
-
});
|
|
92
|
-
|
|
93
|
-
[1, 2, 3, 20].forEach(lines => {
|
|
94
|
-
it(`add ${formatLines(lines)}`, () => {
|
|
95
|
-
const previous = sequenceOfN(3);
|
|
96
|
-
const modified = insertIntoArray(previous, 2, ...sequenceOfN(lines, () => 'ADDED LINE'));
|
|
97
|
-
const dirtyDiff = computeDirtyDiff(previous, modified);
|
|
98
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
99
|
-
modified: [],
|
|
100
|
-
removed: [],
|
|
101
|
-
added: [{ start: 2, end: 2 + lines - 1 }],
|
|
102
|
-
});
|
|
103
|
-
});
|
|
104
|
-
});
|
|
105
|
-
|
|
106
|
-
[1, 2, 3, 20].forEach(lines => {
|
|
107
|
-
it(`add ${formatLines(lines)} at the beginning`, () => {
|
|
108
|
-
const dirtyDiff = computeDirtyDiff(
|
|
109
|
-
sequenceOfN(2),
|
|
110
|
-
sequenceOfN(lines, () => 'ADDED LINE')
|
|
111
|
-
.concat(sequenceOfN(2))
|
|
112
|
-
);
|
|
113
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
114
|
-
modified: [],
|
|
115
|
-
removed: [],
|
|
116
|
-
added: [{ start: 0, end: lines - 1 }],
|
|
117
|
-
});
|
|
118
|
-
});
|
|
119
|
-
});
|
|
120
|
-
|
|
121
|
-
it('add lines to empty file', () => {
|
|
122
|
-
const numberOfLines = 3;
|
|
123
|
-
const dirtyDiff = computeDirtyDiff(
|
|
124
|
-
[''],
|
|
125
|
-
sequenceOfN(numberOfLines, () => 'ADDED LINE')
|
|
126
|
-
);
|
|
127
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
128
|
-
modified: [],
|
|
129
|
-
removed: [],
|
|
130
|
-
added: [{ start: 0, end: numberOfLines - 1 }],
|
|
131
|
-
});
|
|
132
|
-
});
|
|
133
|
-
|
|
134
|
-
it('add empty lines', () => {
|
|
135
|
-
const dirtyDiff = computeDirtyDiff(
|
|
136
|
-
[
|
|
137
|
-
'1',
|
|
138
|
-
'2'
|
|
139
|
-
],
|
|
140
|
-
[
|
|
141
|
-
'1',
|
|
142
|
-
'',
|
|
143
|
-
'',
|
|
144
|
-
'2'
|
|
145
|
-
]
|
|
146
|
-
);
|
|
147
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
148
|
-
modified: [],
|
|
149
|
-
removed: [],
|
|
150
|
-
added: [{ start: 1, end: 2 }],
|
|
151
|
-
});
|
|
152
|
-
});
|
|
153
|
-
|
|
154
|
-
it('add empty line after single line', () => {
|
|
155
|
-
const dirtyDiff = computeDirtyDiff(
|
|
156
|
-
[
|
|
157
|
-
'1'
|
|
158
|
-
],
|
|
159
|
-
[
|
|
160
|
-
'1',
|
|
161
|
-
''
|
|
162
|
-
]
|
|
163
|
-
);
|
|
164
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
165
|
-
modified: [],
|
|
166
|
-
removed: [],
|
|
167
|
-
added: [{ start: 1, end: 1 }],
|
|
168
|
-
});
|
|
169
|
-
});
|
|
170
|
-
|
|
171
|
-
[1, 2, 3, 20].forEach(lines => {
|
|
172
|
-
it(`add ${formatLines(lines)} (empty) at the end`, () => {
|
|
173
|
-
const dirtyDiff = computeDirtyDiff(
|
|
174
|
-
sequenceOfN(2),
|
|
175
|
-
sequenceOfN(2)
|
|
176
|
-
.concat(new Array(lines).map(() => ''))
|
|
177
|
-
);
|
|
178
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
179
|
-
modified: [],
|
|
180
|
-
removed: [],
|
|
181
|
-
added: [{ start: 2, end: 1 + lines }],
|
|
182
|
-
});
|
|
183
|
-
});
|
|
184
|
-
});
|
|
185
|
-
|
|
186
|
-
it('add empty and non-empty lines', () => {
|
|
187
|
-
const dirtyDiff = computeDirtyDiff(
|
|
188
|
-
[
|
|
189
|
-
'FIRST',
|
|
190
|
-
'LAST'
|
|
191
|
-
],
|
|
192
|
-
[
|
|
193
|
-
'FIRST',
|
|
194
|
-
'1. ADDED',
|
|
195
|
-
'2. ADDED',
|
|
196
|
-
'3. ADDED',
|
|
197
|
-
'4. ADDED',
|
|
198
|
-
'5. ADDED',
|
|
199
|
-
'LAST'
|
|
200
|
-
]
|
|
201
|
-
);
|
|
202
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
203
|
-
modified: [],
|
|
204
|
-
removed: [],
|
|
205
|
-
added: [{ start: 1, end: 5 }],
|
|
206
|
-
});
|
|
207
|
-
});
|
|
208
|
-
|
|
209
|
-
[1, 2, 3, 4, 5].forEach(lines => {
|
|
210
|
-
it(`add ${formatLines(lines)} after single line`, () => {
|
|
211
|
-
const dirtyDiff = computeDirtyDiff(
|
|
212
|
-
['0'],
|
|
213
|
-
['0'].concat(sequenceOfN(lines, () => 'ADDED LINE'))
|
|
214
|
-
);
|
|
215
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
216
|
-
modified: [],
|
|
217
|
-
removed: [],
|
|
218
|
-
added: [{ start: 1, end: lines }],
|
|
219
|
-
});
|
|
220
|
-
});
|
|
221
|
-
});
|
|
222
|
-
|
|
223
|
-
it('modify single line', () => {
|
|
224
|
-
const dirtyDiff = computeDirtyDiff(
|
|
225
|
-
[
|
|
226
|
-
'FIRST',
|
|
227
|
-
'TO-BE-MODIFIED',
|
|
228
|
-
'LAST'
|
|
229
|
-
],
|
|
230
|
-
[
|
|
231
|
-
'FIRST',
|
|
232
|
-
'MODIFIED',
|
|
233
|
-
'LAST'
|
|
234
|
-
]
|
|
235
|
-
);
|
|
236
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
237
|
-
removed: [],
|
|
238
|
-
added: [],
|
|
239
|
-
modified: [{ start: 1, end: 1 }],
|
|
240
|
-
});
|
|
241
|
-
});
|
|
242
|
-
|
|
243
|
-
it('modify all lines', () => {
|
|
244
|
-
const numberOfLines = 10;
|
|
245
|
-
const dirtyDiff = computeDirtyDiff(
|
|
246
|
-
sequenceOfN(numberOfLines, () => 'TO-BE-MODIFIED'),
|
|
247
|
-
sequenceOfN(numberOfLines, () => 'MODIFIED')
|
|
248
|
-
);
|
|
249
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
250
|
-
removed: [],
|
|
251
|
-
added: [],
|
|
252
|
-
modified: [{ start: 0, end: numberOfLines - 1 }],
|
|
253
|
-
});
|
|
254
|
-
});
|
|
255
|
-
|
|
256
|
-
it('modify lines at the end', () => {
|
|
257
|
-
const dirtyDiff = computeDirtyDiff(
|
|
258
|
-
[
|
|
259
|
-
'1',
|
|
260
|
-
'2',
|
|
261
|
-
'3',
|
|
262
|
-
'4'
|
|
263
|
-
],
|
|
264
|
-
[
|
|
265
|
-
'1',
|
|
266
|
-
'2-changed',
|
|
267
|
-
'3-changed'
|
|
268
|
-
]
|
|
269
|
-
);
|
|
270
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
271
|
-
removed: [],
|
|
272
|
-
added: [],
|
|
273
|
-
modified: [{ start: 1, end: 2 }],
|
|
274
|
-
});
|
|
275
|
-
});
|
|
276
|
-
|
|
277
|
-
it('multiple diffs', () => {
|
|
278
|
-
const dirtyDiff = computeDirtyDiff(
|
|
279
|
-
[
|
|
280
|
-
'TO-BE-CHANGED',
|
|
281
|
-
'1',
|
|
282
|
-
'2',
|
|
283
|
-
'3',
|
|
284
|
-
'TO-BE-REMOVED',
|
|
285
|
-
'4',
|
|
286
|
-
'5',
|
|
287
|
-
'6',
|
|
288
|
-
'7',
|
|
289
|
-
'8',
|
|
290
|
-
'9'
|
|
291
|
-
],
|
|
292
|
-
[
|
|
293
|
-
'CHANGED',
|
|
294
|
-
'1',
|
|
295
|
-
'2',
|
|
296
|
-
'3',
|
|
297
|
-
'4',
|
|
298
|
-
'5',
|
|
299
|
-
'6',
|
|
300
|
-
'7',
|
|
301
|
-
'8',
|
|
302
|
-
'9',
|
|
303
|
-
'ADDED',
|
|
304
|
-
''
|
|
305
|
-
]
|
|
306
|
-
);
|
|
307
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
308
|
-
removed: [3],
|
|
309
|
-
added: [{ start: 10, end: 11 }],
|
|
310
|
-
modified: [{ start: 0, end: 0 }],
|
|
311
|
-
});
|
|
312
|
-
});
|
|
313
|
-
|
|
314
|
-
it('multiple additions', () => {
|
|
315
|
-
const dirtyDiff = computeDirtyDiff(
|
|
316
|
-
[
|
|
317
|
-
'first line',
|
|
318
|
-
'',
|
|
319
|
-
'foo changed on master',
|
|
320
|
-
'bar changed on master',
|
|
321
|
-
'',
|
|
322
|
-
'',
|
|
323
|
-
'',
|
|
324
|
-
'',
|
|
325
|
-
'',
|
|
326
|
-
'last line'
|
|
327
|
-
],
|
|
328
|
-
[
|
|
329
|
-
'first line',
|
|
330
|
-
'',
|
|
331
|
-
'foo changed on master',
|
|
332
|
-
'bar changed on master',
|
|
333
|
-
'',
|
|
334
|
-
'NEW TEXT',
|
|
335
|
-
'',
|
|
336
|
-
'',
|
|
337
|
-
'',
|
|
338
|
-
'last line',
|
|
339
|
-
'',
|
|
340
|
-
''
|
|
341
|
-
]);
|
|
342
|
-
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
343
|
-
removed: [11],
|
|
344
|
-
added: [{ start: 5, end: 5 }, { start: 9, end: 9 }],
|
|
345
|
-
modified: [],
|
|
346
|
-
});
|
|
347
|
-
});
|
|
348
|
-
|
|
349
|
-
});
|
|
350
|
-
|
|
351
|
-
function computeDirtyDiff(previous: string[], modified: string[]): DirtyDiff {
|
|
352
|
-
const a = ContentLines.arrayLike({
|
|
353
|
-
length: previous.length,
|
|
354
|
-
getLineContent: line => {
|
|
355
|
-
const value = previous[line];
|
|
356
|
-
if (value === undefined) {
|
|
357
|
-
console.log(undefined);
|
|
358
|
-
}
|
|
359
|
-
return value;
|
|
360
|
-
},
|
|
361
|
-
});
|
|
362
|
-
const b = ContentLines.arrayLike({
|
|
363
|
-
length: modified.length,
|
|
364
|
-
getLineContent: line => {
|
|
365
|
-
const value = modified[line];
|
|
366
|
-
if (value === undefined) {
|
|
367
|
-
console.log(undefined);
|
|
368
|
-
}
|
|
369
|
-
return value;
|
|
370
|
-
},
|
|
371
|
-
});
|
|
372
|
-
return diffComputer.computeDirtyDiff(a, b);
|
|
373
|
-
}
|
|
374
|
-
|
|
375
|
-
function sequenceOfN(n: number, mapFn: (index: number) => string = i => i.toString()): string[] {
|
|
376
|
-
return Array.from(new Array(n).keys()).map((value, index) => mapFn(index));
|
|
377
|
-
}
|
|
378
|
-
|
|
379
|
-
function formatLines(n: number): string {
|
|
380
|
-
return n + ' line' + (n > 1 ? 's' : '');
|
|
381
|
-
}
|
|
382
|
-
|
|
383
|
-
function insertIntoArray(target: string[], start: number, ...items: string[]): string[] {
|
|
384
|
-
const copy = target.slice(0);
|
|
385
|
-
copy.splice(start, 0, ...items);
|
|
386
|
-
return copy;
|
|
387
|
-
}
|
|
1
|
+
// *****************************************************************************
|
|
2
|
+
// Copyright (C) 2018 TypeFox and others.
|
|
3
|
+
//
|
|
4
|
+
// This program and the accompanying materials are made available under the
|
|
5
|
+
// terms of the Eclipse Public License v. 2.0 which is available at
|
|
6
|
+
// http://www.eclipse.org/legal/epl-2.0.
|
|
7
|
+
//
|
|
8
|
+
// This Source Code may also be made available under the following Secondary
|
|
9
|
+
// Licenses when the conditions for such availability set forth in the Eclipse
|
|
10
|
+
// Public License v. 2.0 are satisfied: GNU General Public License, version 2
|
|
11
|
+
// with the GNU Classpath Exception which is available at
|
|
12
|
+
// https://www.gnu.org/software/classpath/license.html.
|
|
13
|
+
//
|
|
14
|
+
// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
|
|
15
|
+
// *****************************************************************************
|
|
16
|
+
|
|
17
|
+
import * as chai from 'chai';
|
|
18
|
+
import { expect } from 'chai';
|
|
19
|
+
chai.use(require('chai-string'));
|
|
20
|
+
|
|
21
|
+
import { DiffComputer, DirtyDiff } from './diff-computer';
|
|
22
|
+
import { ContentLines } from './content-lines';
|
|
23
|
+
|
|
24
|
+
let diffComputer: DiffComputer;
|
|
25
|
+
|
|
26
|
+
before(() => {
|
|
27
|
+
diffComputer = new DiffComputer();
|
|
28
|
+
});
|
|
29
|
+
|
|
30
|
+
describe('dirty-diff-computer', () => {
|
|
31
|
+
|
|
32
|
+
it('remove single line', () => {
|
|
33
|
+
const dirtyDiff = computeDirtyDiff(
|
|
34
|
+
[
|
|
35
|
+
'FIRST',
|
|
36
|
+
'SECOND TO-BE-REMOVED',
|
|
37
|
+
'THIRD'
|
|
38
|
+
],
|
|
39
|
+
[
|
|
40
|
+
'FIRST',
|
|
41
|
+
'THIRD'
|
|
42
|
+
],
|
|
43
|
+
);
|
|
44
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
45
|
+
added: [],
|
|
46
|
+
modified: [],
|
|
47
|
+
removed: [0],
|
|
48
|
+
});
|
|
49
|
+
});
|
|
50
|
+
|
|
51
|
+
[1, 2, 3, 20].forEach(lines => {
|
|
52
|
+
it(`remove ${formatLines(lines)} at the end`, () => {
|
|
53
|
+
const dirtyDiff = computeDirtyDiff(
|
|
54
|
+
sequenceOfN(2)
|
|
55
|
+
.concat(sequenceOfN(lines, () => 'TO-BE-REMOVED')),
|
|
56
|
+
sequenceOfN(2),
|
|
57
|
+
);
|
|
58
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
59
|
+
modified: [],
|
|
60
|
+
removed: [1],
|
|
61
|
+
added: [],
|
|
62
|
+
});
|
|
63
|
+
});
|
|
64
|
+
});
|
|
65
|
+
|
|
66
|
+
it('remove all lines', () => {
|
|
67
|
+
const dirtyDiff = computeDirtyDiff(
|
|
68
|
+
sequenceOfN(10, () => 'TO-BE-REMOVED'),
|
|
69
|
+
['']
|
|
70
|
+
);
|
|
71
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
72
|
+
added: [],
|
|
73
|
+
modified: [],
|
|
74
|
+
removed: [0],
|
|
75
|
+
});
|
|
76
|
+
});
|
|
77
|
+
|
|
78
|
+
[1, 2, 3, 20].forEach(lines => {
|
|
79
|
+
it(`remove ${formatLines(lines)} at the beginning`, () => {
|
|
80
|
+
const dirtyDiff = computeDirtyDiff(
|
|
81
|
+
sequenceOfN(lines, () => 'TO-BE-REMOVED')
|
|
82
|
+
.concat(sequenceOfN(2)),
|
|
83
|
+
sequenceOfN(2),
|
|
84
|
+
);
|
|
85
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
86
|
+
modified: [],
|
|
87
|
+
removed: [0],
|
|
88
|
+
added: [],
|
|
89
|
+
});
|
|
90
|
+
});
|
|
91
|
+
});
|
|
92
|
+
|
|
93
|
+
[1, 2, 3, 20].forEach(lines => {
|
|
94
|
+
it(`add ${formatLines(lines)}`, () => {
|
|
95
|
+
const previous = sequenceOfN(3);
|
|
96
|
+
const modified = insertIntoArray(previous, 2, ...sequenceOfN(lines, () => 'ADDED LINE'));
|
|
97
|
+
const dirtyDiff = computeDirtyDiff(previous, modified);
|
|
98
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
99
|
+
modified: [],
|
|
100
|
+
removed: [],
|
|
101
|
+
added: [{ start: 2, end: 2 + lines - 1 }],
|
|
102
|
+
});
|
|
103
|
+
});
|
|
104
|
+
});
|
|
105
|
+
|
|
106
|
+
[1, 2, 3, 20].forEach(lines => {
|
|
107
|
+
it(`add ${formatLines(lines)} at the beginning`, () => {
|
|
108
|
+
const dirtyDiff = computeDirtyDiff(
|
|
109
|
+
sequenceOfN(2),
|
|
110
|
+
sequenceOfN(lines, () => 'ADDED LINE')
|
|
111
|
+
.concat(sequenceOfN(2))
|
|
112
|
+
);
|
|
113
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
114
|
+
modified: [],
|
|
115
|
+
removed: [],
|
|
116
|
+
added: [{ start: 0, end: lines - 1 }],
|
|
117
|
+
});
|
|
118
|
+
});
|
|
119
|
+
});
|
|
120
|
+
|
|
121
|
+
it('add lines to empty file', () => {
|
|
122
|
+
const numberOfLines = 3;
|
|
123
|
+
const dirtyDiff = computeDirtyDiff(
|
|
124
|
+
[''],
|
|
125
|
+
sequenceOfN(numberOfLines, () => 'ADDED LINE')
|
|
126
|
+
);
|
|
127
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
128
|
+
modified: [],
|
|
129
|
+
removed: [],
|
|
130
|
+
added: [{ start: 0, end: numberOfLines - 1 }],
|
|
131
|
+
});
|
|
132
|
+
});
|
|
133
|
+
|
|
134
|
+
it('add empty lines', () => {
|
|
135
|
+
const dirtyDiff = computeDirtyDiff(
|
|
136
|
+
[
|
|
137
|
+
'1',
|
|
138
|
+
'2'
|
|
139
|
+
],
|
|
140
|
+
[
|
|
141
|
+
'1',
|
|
142
|
+
'',
|
|
143
|
+
'',
|
|
144
|
+
'2'
|
|
145
|
+
]
|
|
146
|
+
);
|
|
147
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
148
|
+
modified: [],
|
|
149
|
+
removed: [],
|
|
150
|
+
added: [{ start: 1, end: 2 }],
|
|
151
|
+
});
|
|
152
|
+
});
|
|
153
|
+
|
|
154
|
+
it('add empty line after single line', () => {
|
|
155
|
+
const dirtyDiff = computeDirtyDiff(
|
|
156
|
+
[
|
|
157
|
+
'1'
|
|
158
|
+
],
|
|
159
|
+
[
|
|
160
|
+
'1',
|
|
161
|
+
''
|
|
162
|
+
]
|
|
163
|
+
);
|
|
164
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
165
|
+
modified: [],
|
|
166
|
+
removed: [],
|
|
167
|
+
added: [{ start: 1, end: 1 }],
|
|
168
|
+
});
|
|
169
|
+
});
|
|
170
|
+
|
|
171
|
+
[1, 2, 3, 20].forEach(lines => {
|
|
172
|
+
it(`add ${formatLines(lines)} (empty) at the end`, () => {
|
|
173
|
+
const dirtyDiff = computeDirtyDiff(
|
|
174
|
+
sequenceOfN(2),
|
|
175
|
+
sequenceOfN(2)
|
|
176
|
+
.concat(new Array(lines).map(() => ''))
|
|
177
|
+
);
|
|
178
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
179
|
+
modified: [],
|
|
180
|
+
removed: [],
|
|
181
|
+
added: [{ start: 2, end: 1 + lines }],
|
|
182
|
+
});
|
|
183
|
+
});
|
|
184
|
+
});
|
|
185
|
+
|
|
186
|
+
it('add empty and non-empty lines', () => {
|
|
187
|
+
const dirtyDiff = computeDirtyDiff(
|
|
188
|
+
[
|
|
189
|
+
'FIRST',
|
|
190
|
+
'LAST'
|
|
191
|
+
],
|
|
192
|
+
[
|
|
193
|
+
'FIRST',
|
|
194
|
+
'1. ADDED',
|
|
195
|
+
'2. ADDED',
|
|
196
|
+
'3. ADDED',
|
|
197
|
+
'4. ADDED',
|
|
198
|
+
'5. ADDED',
|
|
199
|
+
'LAST'
|
|
200
|
+
]
|
|
201
|
+
);
|
|
202
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
203
|
+
modified: [],
|
|
204
|
+
removed: [],
|
|
205
|
+
added: [{ start: 1, end: 5 }],
|
|
206
|
+
});
|
|
207
|
+
});
|
|
208
|
+
|
|
209
|
+
[1, 2, 3, 4, 5].forEach(lines => {
|
|
210
|
+
it(`add ${formatLines(lines)} after single line`, () => {
|
|
211
|
+
const dirtyDiff = computeDirtyDiff(
|
|
212
|
+
['0'],
|
|
213
|
+
['0'].concat(sequenceOfN(lines, () => 'ADDED LINE'))
|
|
214
|
+
);
|
|
215
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
216
|
+
modified: [],
|
|
217
|
+
removed: [],
|
|
218
|
+
added: [{ start: 1, end: lines }],
|
|
219
|
+
});
|
|
220
|
+
});
|
|
221
|
+
});
|
|
222
|
+
|
|
223
|
+
it('modify single line', () => {
|
|
224
|
+
const dirtyDiff = computeDirtyDiff(
|
|
225
|
+
[
|
|
226
|
+
'FIRST',
|
|
227
|
+
'TO-BE-MODIFIED',
|
|
228
|
+
'LAST'
|
|
229
|
+
],
|
|
230
|
+
[
|
|
231
|
+
'FIRST',
|
|
232
|
+
'MODIFIED',
|
|
233
|
+
'LAST'
|
|
234
|
+
]
|
|
235
|
+
);
|
|
236
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
237
|
+
removed: [],
|
|
238
|
+
added: [],
|
|
239
|
+
modified: [{ start: 1, end: 1 }],
|
|
240
|
+
});
|
|
241
|
+
});
|
|
242
|
+
|
|
243
|
+
it('modify all lines', () => {
|
|
244
|
+
const numberOfLines = 10;
|
|
245
|
+
const dirtyDiff = computeDirtyDiff(
|
|
246
|
+
sequenceOfN(numberOfLines, () => 'TO-BE-MODIFIED'),
|
|
247
|
+
sequenceOfN(numberOfLines, () => 'MODIFIED')
|
|
248
|
+
);
|
|
249
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
250
|
+
removed: [],
|
|
251
|
+
added: [],
|
|
252
|
+
modified: [{ start: 0, end: numberOfLines - 1 }],
|
|
253
|
+
});
|
|
254
|
+
});
|
|
255
|
+
|
|
256
|
+
it('modify lines at the end', () => {
|
|
257
|
+
const dirtyDiff = computeDirtyDiff(
|
|
258
|
+
[
|
|
259
|
+
'1',
|
|
260
|
+
'2',
|
|
261
|
+
'3',
|
|
262
|
+
'4'
|
|
263
|
+
],
|
|
264
|
+
[
|
|
265
|
+
'1',
|
|
266
|
+
'2-changed',
|
|
267
|
+
'3-changed'
|
|
268
|
+
]
|
|
269
|
+
);
|
|
270
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
271
|
+
removed: [],
|
|
272
|
+
added: [],
|
|
273
|
+
modified: [{ start: 1, end: 2 }],
|
|
274
|
+
});
|
|
275
|
+
});
|
|
276
|
+
|
|
277
|
+
it('multiple diffs', () => {
|
|
278
|
+
const dirtyDiff = computeDirtyDiff(
|
|
279
|
+
[
|
|
280
|
+
'TO-BE-CHANGED',
|
|
281
|
+
'1',
|
|
282
|
+
'2',
|
|
283
|
+
'3',
|
|
284
|
+
'TO-BE-REMOVED',
|
|
285
|
+
'4',
|
|
286
|
+
'5',
|
|
287
|
+
'6',
|
|
288
|
+
'7',
|
|
289
|
+
'8',
|
|
290
|
+
'9'
|
|
291
|
+
],
|
|
292
|
+
[
|
|
293
|
+
'CHANGED',
|
|
294
|
+
'1',
|
|
295
|
+
'2',
|
|
296
|
+
'3',
|
|
297
|
+
'4',
|
|
298
|
+
'5',
|
|
299
|
+
'6',
|
|
300
|
+
'7',
|
|
301
|
+
'8',
|
|
302
|
+
'9',
|
|
303
|
+
'ADDED',
|
|
304
|
+
''
|
|
305
|
+
]
|
|
306
|
+
);
|
|
307
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
308
|
+
removed: [3],
|
|
309
|
+
added: [{ start: 10, end: 11 }],
|
|
310
|
+
modified: [{ start: 0, end: 0 }],
|
|
311
|
+
});
|
|
312
|
+
});
|
|
313
|
+
|
|
314
|
+
it('multiple additions', () => {
|
|
315
|
+
const dirtyDiff = computeDirtyDiff(
|
|
316
|
+
[
|
|
317
|
+
'first line',
|
|
318
|
+
'',
|
|
319
|
+
'foo changed on master',
|
|
320
|
+
'bar changed on master',
|
|
321
|
+
'',
|
|
322
|
+
'',
|
|
323
|
+
'',
|
|
324
|
+
'',
|
|
325
|
+
'',
|
|
326
|
+
'last line'
|
|
327
|
+
],
|
|
328
|
+
[
|
|
329
|
+
'first line',
|
|
330
|
+
'',
|
|
331
|
+
'foo changed on master',
|
|
332
|
+
'bar changed on master',
|
|
333
|
+
'',
|
|
334
|
+
'NEW TEXT',
|
|
335
|
+
'',
|
|
336
|
+
'',
|
|
337
|
+
'',
|
|
338
|
+
'last line',
|
|
339
|
+
'',
|
|
340
|
+
''
|
|
341
|
+
]);
|
|
342
|
+
expect(dirtyDiff).to.be.deep.equal(<DirtyDiff>{
|
|
343
|
+
removed: [11],
|
|
344
|
+
added: [{ start: 5, end: 5 }, { start: 9, end: 9 }],
|
|
345
|
+
modified: [],
|
|
346
|
+
});
|
|
347
|
+
});
|
|
348
|
+
|
|
349
|
+
});
|
|
350
|
+
|
|
351
|
+
function computeDirtyDiff(previous: string[], modified: string[]): DirtyDiff {
|
|
352
|
+
const a = ContentLines.arrayLike({
|
|
353
|
+
length: previous.length,
|
|
354
|
+
getLineContent: line => {
|
|
355
|
+
const value = previous[line];
|
|
356
|
+
if (value === undefined) {
|
|
357
|
+
console.log(undefined);
|
|
358
|
+
}
|
|
359
|
+
return value;
|
|
360
|
+
},
|
|
361
|
+
});
|
|
362
|
+
const b = ContentLines.arrayLike({
|
|
363
|
+
length: modified.length,
|
|
364
|
+
getLineContent: line => {
|
|
365
|
+
const value = modified[line];
|
|
366
|
+
if (value === undefined) {
|
|
367
|
+
console.log(undefined);
|
|
368
|
+
}
|
|
369
|
+
return value;
|
|
370
|
+
},
|
|
371
|
+
});
|
|
372
|
+
return diffComputer.computeDirtyDiff(a, b);
|
|
373
|
+
}
|
|
374
|
+
|
|
375
|
+
function sequenceOfN(n: number, mapFn: (index: number) => string = i => i.toString()): string[] {
|
|
376
|
+
return Array.from(new Array(n).keys()).map((value, index) => mapFn(index));
|
|
377
|
+
}
|
|
378
|
+
|
|
379
|
+
function formatLines(n: number): string {
|
|
380
|
+
return n + ' line' + (n > 1 ? 's' : '');
|
|
381
|
+
}
|
|
382
|
+
|
|
383
|
+
function insertIntoArray(target: string[], start: number, ...items: string[]): string[] {
|
|
384
|
+
const copy = target.slice(0);
|
|
385
|
+
copy.splice(start, 0, ...items);
|
|
386
|
+
return copy;
|
|
387
|
+
}
|