org.apache.jackrabbit.test.api.WorkspaceMoveSameNameSibsTest Maven / Gradle / Ivy
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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 org.apache.jackrabbit.test.api;
import org.apache.jackrabbit.test.NotExecutableException;
import javax.jcr.ItemExistsException;
import javax.jcr.Node;
import javax.jcr.NodeIterator;
import javax.jcr.RepositoryException;
/**
* WorkspaceMoveSameNameSibsTest contains tests for moving nodes
* with same name siblings supported in one workspace.
*
*/
public class WorkspaceMoveSameNameSibsTest extends AbstractWorkspaceSameNameSibsTest {
protected String getOtherWorkspaceName() throws NotExecutableException {
return workspace.getName();
}
protected void initNodesW2() throws RepositoryException {
// nothing to do.
}
/**
* If ordering is supported by the node type of the parent node of the new
* location, then the newly moved node is appended to the end of the child
* node list.
*/
public void testMoveNodesOrderingSupportedByParent() throws RepositoryException {
// test assumes that repositry supports Orderable Child Node Support (optional)
String[] orderList = {nodeName1, nodeName2, nodeName3};
// create a new node to move nodes
Node newNode = testRootNode.addNode(nodeName2, testNodeType);
testRootNode.getSession().save();
// copy node three times below a node and check the order
for (int i = 0; i < orderList.length; i++) {
workspace.copy(node1.getPath(), newNode.getPath() + "/" + orderList[i]);
}
// check regarding orderList with the counter if nodes are added at the end
int cnt = 0;
NodeIterator iter = node2.getNodes();
while (iter.hasNext()) {
Node n = iter.nextNode();
assertTrue(n.getName().equals(orderList[cnt]));
cnt++;
}
}
/**
* An ItemExistsException is thrown if a node or property already exists at
* destAbsPath.
*
* - {@code sameNameSibsFalseNodeType} name of a node type that does not
* allows same name siblings.
*
- {@code nodeName3} name of a child node that does not allow same name
* siblings..
*
*/
public void testMoveNodesNodeExistsAtDestPath() throws RepositoryException {
// create a parent node where allowSameNameSiblings are set to false
Node snsfNode = testRootNode.addNode(nodeName3, sameNameSibsFalseNodeType.getName());
testRootNode.getSession().save();
String dstAbsPath = snsfNode.getPath() + "/" + node1.getName();
workspace.copy(node1.getPath(), dstAbsPath);
// try to copy again the node to same destAbsPath
// property already exist
try {
workspace.move(node1.getPath(), dstAbsPath);
fail("Node exists below '" + dstAbsPath + "'. Test should fail.");
} catch (ItemExistsException e) {
// successful
}
}
}