summaryrefslogtreecommitdiff
path: root/xmerge/java/org/openoffice/xmerge/merger/merge/DocumentMerge.java
diff options
context:
space:
mode:
Diffstat (limited to 'xmerge/java/org/openoffice/xmerge/merger/merge/DocumentMerge.java')
-rw-r--r--xmerge/java/org/openoffice/xmerge/merger/merge/DocumentMerge.java250
1 files changed, 0 insertions, 250 deletions
diff --git a/xmerge/java/org/openoffice/xmerge/merger/merge/DocumentMerge.java b/xmerge/java/org/openoffice/xmerge/merger/merge/DocumentMerge.java
deleted file mode 100644
index 4842ca433e04..000000000000
--- a/xmerge/java/org/openoffice/xmerge/merger/merge/DocumentMerge.java
+++ /dev/null
@@ -1,250 +0,0 @@
-/************************************************************************
- *
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * Copyright 2000, 2010 Oracle and/or its affiliates.
- *
- * OpenOffice.org - a multi-platform office productivity suite
- *
- * 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.Document;
-import org.w3c.dom.Node;
-import org.w3c.dom.NodeList;
-import org.w3c.dom.NamedNodeMap;
-
-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);
- }
-}
-
generated by cgit v1.2.3 (git 2.39.1) at 2024-06-12 22:07:05 +0000