/**
* Copyright (C) 2010-2017 Structr GmbH
*
* This file is part of Structr <http://structr.org>.
*
* Structr is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* Structr 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with Structr. If not, see <http://www.gnu.org/licenses/>.
*/
package org.structr.web.diff;
import java.util.List;
import java.util.Map;
import org.structr.common.error.FrameworkException;
import org.structr.core.app.App;
import org.structr.web.entity.dom.Content;
import org.structr.web.entity.dom.DOMElement;
import org.structr.web.entity.dom.DOMNode;
import org.structr.web.entity.dom.Page;
import org.w3c.dom.DOMException;
import org.w3c.dom.Node;
/**
*
*
*/
public class MoveOperation extends InvertibleModificationOperation {
private List<String> siblingHashes = null;
private DOMNode originalNode = null;
private String parentHash = null;
private DOMNode newNode = null;
public MoveOperation(final Map<String, DOMNode> hashMappedExistingNodes, final String parentHash, final List<String> siblingHashes, final DOMNode newNode, final DOMNode originalNode) {
super(hashMappedExistingNodes);
this.siblingHashes = siblingHashes;
this.originalNode = originalNode;
this.parentHash = parentHash;
this.newNode = newNode;
}
@Override
public String toString() {
if (originalNode instanceof Content) {
return "Move Content(" + originalNode.getIdHashOrProperty() + ")";
} else {
return "Move " + originalNode.getProperty(DOMElement.tag) + "(" + originalNode.getIdHashOrProperty() + ")";
}
}
// ----- interface InvertibleModificationOperation -----
@Override
public void apply(final App app, final Page sourcePage, final Page newPage) throws FrameworkException {
final InsertPosition insertPosition = findInsertPosition(sourcePage, parentHash, siblingHashes, newNode);
if (insertPosition != null) {
final DOMNode parent = insertPosition.getParent();
final DOMNode sibling = insertPosition.getSibling();
final Node originalSibling = originalNode.getNextSibling();
final Node originalParent = originalNode.getParentNode();
// do not modify synced nodes (nodes that are shared between multiple pages)
if (parent.isSynced()) {
return;
}
if (parent.equals(originalParent)) {
if (sibling != null && sibling.equals(originalSibling)) {
// nothing to be done
return;
}
if (sibling == null && originalSibling == null) {
return;
}
}
// the following code tries to insert the original node next to
// its original sibling. If there is no sibling (since the node
// was moved up or down, this method tries to insert the new
// node next to its sibling's parent, ascending the tree until
// no parents are left.
Node localSibling = sibling;
boolean found = false;
int count = 0;
while (localSibling != null && count++ < 10) {
try {
parent.insertBefore(originalNode, localSibling);
found = true;
break;
} catch (DOMException dex) {
}
// ascend to parent
localSibling = localSibling.getParentNode();
}
// try direct insertion
if (!found) {
parent.appendChild(originalNode);
}
}
}
@Override
public InvertibleModificationOperation revert() {
return null;
}
@Override
public Integer getPosition() {
// move operations should go after Delete and Create but before Update
return 300;
}
}