1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
/*
* Copyright 2000-2014 JetBrains s.r.o.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.intellij.util.diff;
import java.util.BitSet;
public class PatienceIntLCS {
private final int[] myFirst;
private final int[] mySecond;
private final int myStart1;
private final int myStart2;
private final int myCount1;
private final int myCount2;
private final BitSet myChanges1;
private final BitSet myChanges2;
public PatienceIntLCS(int[] first, int[] second) {
this(first, second, 0, first.length, 0, second.length, new BitSet(first.length), new BitSet(second.length));
}
public PatienceIntLCS(int[] first, int[] second, int start1, int count1, int start2, int count2, BitSet changes1, BitSet changes2) {
myFirst = first;
mySecond = second;
myStart1 = start1;
myStart2 = start2;
myCount1 = count1;
myCount2 = count2;
myChanges1 = changes1;
myChanges2 = changes2;
}
public void execute() throws FilesTooBigForDiffException {
if (myCount1 == 0 && myCount2 == 0) {
return;
}
if (myCount1 == 0 || myCount2 == 0) {
addChange(myStart1, myCount1, myStart2, myCount2);
return;
}
int startOffset = matchForward(0, 0);
int start1 = myStart1 + startOffset;
int start2 = myStart2 + startOffset;
int endOffset = matchBackward(myStart1 + myCount1 - 1, myStart2 + myCount2 - 1, start1, start2);
int count1 = myCount1 - startOffset - endOffset;
int count2 = myCount2 - startOffset - endOffset;
if (count1 == 0 || count2 == 0) {
addChange(start1, count1, start2, count2);
}
else {
UniqueLCS uniqueLCS = new UniqueLCS(myFirst, mySecond, start1, count1, start2, count2);
int[][] matching = uniqueLCS.execute();
if (matching == null) {
IntLCS intLCS = new IntLCS(myFirst, mySecond, start1, count1, start2, count2, myChanges1, myChanges2);
intLCS.execute();
}
else {
int s1, s2, c1, c2;
int matched = matching[0].length;
assert matched > 0;
PatienceIntLCS patienceDiff =
new PatienceIntLCS(myFirst, mySecond, start1, matching[0][0], start2, matching[1][0], myChanges1, myChanges2);
patienceDiff.execute();
for (int i = 1; i < matching[0].length; i++) {
s1 = matching[0][i - 1] + 1;
s2 = matching[1][i - 1] + 1;
c1 = matching[0][i] - s1;
c2 = matching[1][i] - s2;
if (c1 > 0 || c2 > 0) {
patienceDiff = new PatienceIntLCS(myFirst, mySecond, start1 + s1, c1, start2 + s2, c2, myChanges1, myChanges2);
patienceDiff.execute();
}
}
if (matching[0][matched - 1] == count1 - 1) {
s1 = count1 - 1;
c1 = 0;
}
else {
s1 = matching[0][matched - 1] + 1;
c1 = count1 - s1;
}
if (matching[1][matched - 1] == count2 - 1) {
s2 = count2 - 1;
c2 = 0;
}
else {
s2 = matching[1][matched - 1] + 1;
c2 = count2 - s2;
}
patienceDiff = new PatienceIntLCS(myFirst, mySecond, start1 + s1, c1, start2 + s2, c2, myChanges1, myChanges2);
patienceDiff.execute();
}
}
}
private int matchForward(int offset1, int offset2) {
final int size = Math.min(myCount1 - offset1, myCount2 - offset2);
int idx = 0;
for (int i = 0; i < size; i++) {
if (!(myFirst[offset1 + i] == mySecond[offset2 + i])) break;
++idx;
}
return idx;
}
private int matchBackward(int offset1, int offset2, int processedOffset1, int processedOffset2) {
final int size = Math.min(offset1 - processedOffset1 - 1, offset2 - processedOffset2 - 1);
int idx = 0;
for (int i = 0; i < size; i++) {
if (!(myFirst[offset1 - i] == mySecond[offset2 - i])) break;
++idx;
}
return idx;
}
public void addChange(int start1, int count1, int start2, int count2) {
myChanges1.set(start1, start1 + count1);
myChanges2.set(start2, start2 + count2);
}
public BitSet[] getChanges() {
return new BitSet[]{myChanges1, myChanges2};
}
}
|
