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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: DocumentMerge.java,v $
* $Revision: 1.4 $
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
package org.openoffice.xmerge.merger.merge;
import org.w3c.dom.Element;
import org.w3c.dom.Node;
import org.openoffice.xmerge.ConverterCapabilities;
import org.openoffice.xmerge.MergeException;
import org.openoffice.xmerge.merger.MergeAlgorithm;
import org.openoffice.xmerge.merger.NodeMergeAlgorithm;
import org.openoffice.xmerge.merger.Iterator;
import org.openoffice.xmerge.merger.Difference;
import org.openoffice.xmerge.util.XmlUtil;
/**
* This is an implementation of the <code>MergeAlgorithm</code> interface.
* This class will merge two <code>Document</code> classes. It utilizes the
* appropriate class which implements {@link
* org.openoffice.xmerge.merger.NodeMergeAlgorithm
* NodeMergeAlgorithm} to perform the merge.
*
* @author smak
*/
public class DocumentMerge implements MergeAlgorithm {
private NodeMergeAlgorithm subDocumentMerge = null;
/** The capabilities of this converter. */
protected ConverterCapabilities cc_;
/**
* Constructor
*
* @param cc The <code>ConverterCapabilities</code>.
* @param merge The <code>NodeMergeAlgorithm</code>.
*/
public DocumentMerge(ConverterCapabilities cc, NodeMergeAlgorithm merge) {
cc_ = cc;
subDocumentMerge = merge;
}
public void applyDifference(Iterator orgSeq, Iterator modSeq,
Difference[] differences) throws MergeException {
// a quick test whether the differences array is in ascending order
int currentPosition = -1;
boolean haveDeleteOperation = false;
for (int i = 0; i < differences.length; i++) {
if (differences[i].getOrgPosition() > currentPosition) {
currentPosition = differences[i].getOrgPosition();
if (differences[i].getOperation() == Difference.DELETE) {
haveDeleteOperation = true;
} else {
haveDeleteOperation = false;
}
} else if (differences[i].getOrgPosition() == currentPosition) {
if (differences[i].getOperation() == Difference.DELETE) {
haveDeleteOperation = true;
} else if (differences[i].getOperation() == Difference.ADD &&
haveDeleteOperation == true) {
throw new MergeException(
"Differences array is not sorted. Delete before Add");
}
} else {
throw new MergeException("Differences array need to be sorted.");
}
}
// reset sequence counters
orgSeq.start();
int orgSeqCounter = 0;
modSeq.start();
int modSeqCounter = 0;
// check for each diff unit in the diff array to apply the diff
for (int i = 0; i < differences.length; i++) {
Difference currentDiff = differences[i];
int operation = currentDiff.getOperation();
Object currentElement;
switch (operation) {
case Difference.DELETE:
// loop through the original sequence up to the expected
// position. note that we use delta (see above comment)
// also. we will just continue the counter without reset it.
for (;
orgSeqCounter < currentDiff.getOrgPosition();
orgSeqCounter++, orgSeq.next()) {
// empty
}
// remove the Node. note that it will NOT affect the
// iterator sequence as ParaNodeIterator is a static one.
removeNode((Node)(orgSeq.currentElement()));
break;
// if it's an add operation, then get content from original seq
case Difference.ADD:
// loop through the modified sequence up to the expected
// position to get the content. As we don't need to modify
// the sequence. we don't need to use delta to do adjustment.
for (;
modSeqCounter < currentDiff.getModPosition();
modSeqCounter++, modSeq.next()) {
// empty
}
currentElement = orgSeq.currentElement();
for (;
orgSeqCounter < currentDiff.getOrgPosition();
orgSeqCounter++, currentElement = orgSeq.next()) {
// empty
}
if (orgSeqCounter > orgSeq.elementCount() - 1) {
// append the element to the end of the original sequence
appendNode((Node)(orgSeq.currentElement()),
(Node)(modSeq.currentElement()));
} else {
// insert the element BEFORE the current element
insertNode((Node)(orgSeq.currentElement()),
(Node)(modSeq.currentElement()));
}
break;
case Difference.CHANGE:
for (;
modSeqCounter < currentDiff.getModPosition();
modSeqCounter++, modSeq.next()) {
// empty
}
currentElement = orgSeq.currentElement();
for (;
orgSeqCounter < currentDiff.getOrgPosition();
orgSeqCounter++, currentElement = orgSeq.next()) {
// empty
}
if (subDocumentMerge == null) {
// use a simple replace if no row merge algorithm supply
replaceElement((Element)orgSeq.currentElement(),
(Element)modSeq.currentElement());
} else {
subDocumentMerge.merge((Element)orgSeq.currentElement(),
(Element)modSeq.currentElement());
}
break;
default:
break;
}
}
}
/**
* Removes the specified <code>Node</code>.
*
* @param node <code>Node</code> to remove.
*/
protected void removeNode(Node node) {
Node parent = node.getParentNode();
parent.removeChild(node);
}
/**
* Appends <code>Node</code> after the specified <code>Node</code>.
*
* @param oldNode <code>Node</code> to append after.
* @param newNode <code>Node</code> to append.
*/
protected void appendNode(Node oldNode, Node newNode) {
Node clonedNode = XmlUtil.deepClone(oldNode, newNode);
Node parent = oldNode.getParentNode();
parent.appendChild(clonedNode);
}
/**
* Insert <code>Node</code> before the specified <code>Node</code>.
*
* @param oldNode <code>Node</code> to insert before.
* @param newNode <code>Node</code> to insert.
*/
protected void insertNode(Node oldNode, Node newNode) {
Node clonedNode = XmlUtil.deepClone(oldNode, newNode);
Node parent = oldNode.getParentNode();
parent.insertBefore(clonedNode, oldNode);
}
/**
* Replace <code>Element</code>.
*
* @param currElem <code>Element</code> to be replaced.
* @param newElem <code>Element</code> to replace.
*/
protected void replaceElement(Element currElem, Element newElem) {
Node clonedNode = XmlUtil.deepClone(currElem, newElem);
Node parent = currElem.getParentNode();
parent.replaceChild(clonedNode, currElem);
}
}
|
