public Iterator<Property> iterator() { return TreeTraverser.propertyIterator(getNodeSequence().iterator(), errorHandler, inclusionPolicy); }
private static void addAll(NodeSequence nodes, List<String> words) throws RepositoryException { for (String name : words) { nodes.addNode(name, NodeType.NT_UNSTRUCTURED); } }
private static void removeAll(NodeSequence nodes, List<String> words) throws RepositoryException { for (String name : words) { nodes.removeNode(name); } }
public void testSingletonNodeSequence() throws RepositoryException { Comparator<String> order = Rank.<String>comparableComparator(); TreeManager treeManager = new BTreeManager(testNode, 5, 10, order, true); NodeSequence nodes = ItemSequence.createNodeSequence(treeManager, errorHandler); nodes.addNode("key", NodeType.NT_UNSTRUCTURED); assertTrue(nodes.hasItem("key")); Iterator<Node> nodeIt = nodes.iterator(); assertTrue(nodeIt.hasNext()); assertEquals("key", nodeIt.next().getName()); assertFalse(nodeIt.hasNext()); checkTreeProperty(testNode, 5, 10, order); checkOrder(nodes, order); nodes.removeNode("key"); assertEmpty(nodes); }
private static void checkLookup(NodeSequence nodes, List<String> keys) throws RepositoryException { for (String key : keys) { assertTrue("Missing key: " + key, nodes.hasItem(key)); Node node = nodes.getItem(key); assertEquals("Key " + key + " does not match name of node " + node, key, node.getName()); } }
private static void checkNotFound(NodeSequence nodes, List<String> keys) throws RepositoryException { for (String key : keys) { assertFalse("NodeSequence should not contain key " + key, nodes.hasItem(key)); try { nodes.getItem(key); fail("NodeSequence should not contain key " + key); } catch (RepositoryException expected) { } } }
public Iterator<Property> iterator() { return TreeTraverser.propertyIterator(getNodeSequence().iterator(), errorHandler, inclusionPolicy); }
public Iterator<Property> iterator() { return TreeTraverser.propertyIterator(getNodeSequence().iterator(), errorHandler, inclusionPolicy); }
public void testEmptyNodeSequence() throws RepositoryException { Comparator<String> order = Rank.<String>comparableComparator(); TreeManager treeManager = new BTreeManager(testNode, 5, 10, order, true); NodeSequence nodes = ItemSequence.createNodeSequence(treeManager, errorHandler); Iterator<Node> nodeIt = nodes.iterator(); assertTrue(nodeIt.hasNext()); assertTrue(treeManager.isRoot(nodeIt.next())); assertFalse(nodeIt.hasNext()); checkTreeProperty(testNode, 5, 10, order); checkOrder(nodes, order); assertEmpty(nodes); }