-
Notifications
You must be signed in to change notification settings - Fork 83
Expand file tree
/
Copy pathDifference.cs
More file actions
276 lines (235 loc) · 6.3 KB
/
Difference.cs
File metadata and controls
276 lines (235 loc) · 6.3 KB
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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
using System;
using Waher.Runtime.Collections;
namespace Waher.Runtime.Text
{
/// <summary>
/// Computes the difference between two sequences of symbols.
/// </summary>
public static class Difference
{
/// <summary>
/// Analyzes two sequences of symbols to estimate the difference between them.
/// </summary>
/// <remarks>
/// Method searches for the shortest path in changing <paramref name="S1"/> to
/// <paramref name="S2"/>. Costs are 0, if keeping a symbol: Cost of inserting
/// or deleting a symbol is 1, if first symbol, or same operation as previous
/// symbol, or 2, if chaning operation. The reason for this is to avoid altering
/// inserts and deletions when blocks are changed.
/// </remarks>
/// <typeparam name="T">Type of symbols to compare.</typeparam>
/// <param name="S1">First sequence.</param>
/// <param name="S2">Second sequence.</param>
/// <returns>Edit script</returns>
public static EditScript<T> Analyze<T>(T[] S1, T[] S2)
{
int c1 = S1.Length;
int c2 = S2.Length;
if (c1 == 0 && c2 == 0)
return new EditScript<T>(S1, S2, Array.Empty<Step<T>>());
int StartOffset = 0;
while (StartOffset < c1 && StartOffset < c2 &&
S1[StartOffset].Equals(S2[StartOffset]))
{
StartOffset++;
}
int EndOffset1 = c1;
int EndOffset2 = c2;
while (EndOffset1 > StartOffset && EndOffset2 > StartOffset &&
S1[EndOffset1 - 1].Equals(S2[EndOffset2 - 1]))
{
EndOffset1--;
EndOffset2--;
}
int c1p = EndOffset1 - StartOffset + 1;
int c2p = EndOffset2 - StartOffset + 1;
long NrBits = ((long)c1p) * c2p;
long NrBytes = (NrBits + 7) >> 3;
if (NrBytes > int.MaxValue)
throw new OutOfMemoryException("Unable to allocate enough memory to process the difference between the two sequences.");
byte[] Processed = new byte[NrBytes];
ChunkedList<State<T>> Current = new ChunkedList<State<T>>();
ChunkedList<State<T>> Next = new ChunkedList<State<T>>();
ChunkedList<State<T>> NextNext = new ChunkedList<State<T>>();
ChunkedList<State<T>> Temp;
State<T> P, Q;
bool b1, b2;
int i, j, iByte;
byte iBit;
P = null;
for (i = 0; i <= StartOffset; i++)
{
P = new State<T>()
{
Op = EditOperation.Keep,
i1 = i,
i2 = i,
Prev = P
};
}
while (true)
{
if (P.i1 == EndOffset1 && P.i2 == EndOffset2)
break;
i = P.i1 - StartOffset + (P.i2 - StartOffset) * c1p;
iByte = i >> 3;
iBit = (byte)(1 << (i & 7));
if ((Processed[iByte] & iBit) == 0)
{
Processed[iByte] |= iBit;
if (b2 = P.i2 < EndOffset2)
{
j = i + c1p;
if ((Processed[j >> 3] & (byte)(1 << (j & 7))) == 0)
{
Q = new State<T>()
{
Op = EditOperation.Insert,
i1 = P.i1,
i2 = P.i2 + 1,
Prev = P
};
if (P.Op == EditOperation.Insert)
Next.AddLastItem(Q);
else
NextNext.AddLastItem(Q);
}
}
if (b1 = P.i1 < EndOffset1)
{
j = i + 1;
if ((Processed[j >> 3] & (byte)(1 << (j & 7))) == 0)
{
Q = new State<T>()
{
Op = EditOperation.Delete,
i1 = P.i1 + 1,
i2 = P.i2,
Prev = P
};
if (P.Op == EditOperation.Delete)
Next.AddLastItem(Q);
else
NextNext.AddLastItem(Q);
}
}
if (b1 && b2 && S1[P.i1].Equals(S2[P.i2]))
{
j = i + 1 + c1p;
if ((Processed[j >> 3] & (byte)(1 << (j & 7))) == 0)
{
Q = new State<T>()
{
Op = EditOperation.Keep,
i1 = P.i1 + 1,
i2 = P.i2 + 1,
Prev = P
};
Current.AddLastItem(Q);
if (Q.i1 == EndOffset1 && Q.i2 == EndOffset2)
{
P = Q;
break;
}
}
}
}
if (!Current.HasFirstItem)
{
Temp = Current;
if (!Next.HasFirstItem)
Current = NextNext;
else
{
Current = Next;
Next = NextNext;
}
NextNext = Temp;
}
P = Current.RemoveLast();
}
while (EndOffset1 < c1 && EndOffset2 < c2)
{
P = new State<T>()
{
Op = EditOperation.Keep,
i1 = ++EndOffset1,
i2 = ++EndOffset2,
Prev = P
};
}
State<T> Loop = P;
int NrSteps = 0;
while (!(Loop.Prev is null))
{
NrSteps++;
Loop = Loop.Prev;
}
State<T>[] Steps = new State<T>[NrSteps];
for (i = NrSteps, Loop = P; i > 0; Loop = Loop.Prev)
Steps[--i] = Loop;
ChunkedList<T> Elements = new ChunkedList<T>();
ChunkedList<Step<T>> Operations = new ChunkedList<Step<T>>();
EditOperation Op;
Q = Steps[0];
Op = Q.Op;
for (i = 0; i < NrSteps; i++)
{
P = Steps[i];
if (P.Op != Op)
{
Operations.Add(new Step<T>(Elements.ToArray(), Q.i1, Q.i2, Op));
Q = P;
Op = P.Op;
Elements.Clear();
}
if (Op == EditOperation.Insert)
Elements.Add(S2[P.i2 - 1]);
else
Elements.Add(S1[P.i1 - 1]);
}
Operations.Add(new Step<T>(Elements.ToArray(), Q.i1, Q.i2, Op));
return new EditScript<T>(S1, S2, Operations.ToArray());
}
private class State<T>
{
public EditOperation Op;
public int i1;
public int i2;
public State<T> Prev;
public override string ToString()
{
return this.Op.ToString() + " " + this.i1.ToString() + "," + this.i2.ToString();
}
}
/// <summary>
/// Analyzes two text strings, estimating the difference between them.
/// </summary>
/// <param name="s1">First string.</param>
/// <param name="s2">Second string.</param>
/// <returns>Differences found.</returns>
public static EditScript<char> AnalyzeStrings(string s1, string s2)
{
return Analyze(s1.ToCharArray(), s2.ToCharArray());
}
/// <summary>
/// Analyzes two texts, estimating the difference between them, as a sequence of rows.
/// </summary>
/// <param name="Text1">First text.</param>
/// <param name="Text2">Second text.</param>
/// <returns>Differences found.</returns>
public static EditScript<string> AnalyzeRows(string Text1, string Text2)
{
return Analyze(ExtractRows(Text1), ExtractRows(Text2));
}
/// <summary>
/// Extracts the rows from a text.
/// </summary>
/// <param name="Text">Text.</param>
/// <returns>Sequence of rows.</returns>
public static string[] ExtractRows(string Text)
{
return Text.Replace("\r\n", "\n").Replace('\r', '\n').Split('\n');
}
}
}