Package org.apache.commons.jxpath.ri.model

Examples of org.apache.commons.jxpath.ri.model.NodeIterator

142
143
144
145
146
147
148
149
150
151
152
153
     * @return boolean
     */
    private boolean isRecursive() {
        Object node = currentNodePointer.getNode();
        for (int i = stack.size() - 1; --i >= 0;) {
            NodeIterator it = (NodeIterator) stack.get(i);
            Pointer pointer = it.getNodePointer();
            if (pointer != null && pointer.getNode() == node) {
                return true;
            }
        }
        return false;
View Full Code Here
602
603
604
605
606
607
608
609
610
            Attribute attr = element.getAttribute(name.getName());
            if (attr == null) {
                element.setAttribute(name.getName(), "");
            }
        }
        NodeIterator it = attributeIterator(name);
        it.setPosition(1);
        return it.getNodePointer();
    }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
102
103
104
        NodePointer ptr = (NodePointer) pointer.clone();
        int length = ptr.getLength();
        for (int i = 0; i < length; i++) {
            ptr.setIndex(i);
            NodePointer elementPointer = ptr.getValuePointer();
            NodeIterator iter = getElementNodeIterator(elementPointer);

            for (int j = 1; iter.setPosition(j); j++) {
                NodePointer childPointer = iter.getNodePointer();
                if (reverse) {
                    collection.add(0, childPointer);
                }
                else {
                    collection.add(childPointer);
View Full Code Here
252
253
254
255
256
257
258
259
260
261
262
263
264
                name = (QName)property;
            }
            else {
                name = new QName(null, (String)property);
            }
            NodeIterator it = parent.childIterator(new NodeNameTest(name), false, null);
            if (it != null && it.setPosition(index == -1 ? 1 : index + 1)){
                return it.getNodePointer();
            }
            else {
                PropertyPointer pointer = new NullPropertyPointer(parent);
                pointer.setPropertyName(name.toString());
                pointer.setIndex(index);
View Full Code Here
133
134
135
136
137
138
139
140
141
142
143
144
145
                }
            }
        }

        while (!stack.isEmpty()){
            NodeIterator it = (NodeIterator)stack.peek();
            if (it.setPosition(it.getPosition() + 1)){
                currentNodePointer = it.getNodePointer();
                if (!currentNodePointer.isLeaf()){
                    stack.push(currentNodePointer.childIterator(null, false, null));
                }
                if (currentNodePointer.testNode(nodeTest)){
                    position++;
View Full Code Here
384
385
386
387
388
389
390
391
392
393
394
395
        }
        if (!getAbstractFactory(context).createObject(context, this, node, name.toString(), index)){
            throw new JXPathException("Factory could not create a child node for path: " +
                    asPath() + "/" + name + "[" + (index+1) + "]");
        }
        NodeIterator it = childIterator(new NodeNameTest(name), false, null);
        if (it == null || !it.setPosition(index + 1)){
            throw new JXPathException("Factory could not create a child node for path: " +
                    asPath() + "/" + name + "[" + (index+1) + "]");
        }
        return it.getNodePointer();
    }
View Full Code Here
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
                }
            }

            while (!stack.isEmpty()){
                if (!reverse){
                    NodeIterator it = (NodeIterator)stack.peek();
                    if (it.setPosition(it.getPosition() + 1)){
                        currentNodePointer = it.getNodePointer();
                        if (!currentNodePointer.isLeaf()){
                            stack.push(currentNodePointer.childIterator(null, reverse, null));
                        }
                        if (currentNodePointer.testNode(nodeTest)){
                            super.setPosition(getCurrentPosition() + 1);
                            return true;
                        }
                    }
                    else {
                        // We get here only if the name test failed and the iterator ended
                        stack.pop();
                    }
                }
                else {
                    NodeIterator it = (NodeIterator)stack.peek();
                    if (it.setPosition(it.getPosition() + 1)){
                        currentNodePointer = it.getNodePointer();
                        if (!currentNodePointer.isLeaf()){
                            stack.push(currentNodePointer.childIterator(null, reverse, null));
                        }
                        else if (currentNodePointer.testNode(nodeTest)){
                            super.setPosition(getCurrentPosition() + 1);
                            return true;
                        }
                    }
                    else {
                        stack.pop();
                        if (!stack.isEmpty()){
                            it = (PropertyIterator)stack.peek();
                            currentNodePointer = it.getNodePointer();
                            if (currentNodePointer.testNode(nodeTest)){
                                super.setPosition(getCurrentPosition() + 1);
                                return true;
                            }
                        }
View Full Code Here
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
     * @param p the node pointer to test
     */
    private void checkIterators(NodePointer p)
    {
        ConfigurationNode node = (ConfigurationNode) p.getNode();
        NodeIterator it = p.childIterator(null, false, null);
        assertEquals("Iterator count differs from children count", node
                .getChildrenCount(), iteratorSize(it));

        for (int index = 1; it.setPosition(index); index++)
        {
            NodePointer pchild = it.getNodePointer();
            assertEquals("Wrong child", node.getChild(index - 1), pchild
                    .getNode());
            checkIterators(pchild);
        }

        it = p.attributeIterator(new QName(null, "*"));
        assertEquals("Iterator count differs from attribute count", node
                .getAttributeCount(), iteratorSize(it));
        for (int index = 1; it.setPosition(index); index++)
        {
            NodePointer pattr = it.getNodePointer();
            assertTrue("Node pointer is no attribute", pattr.isAttribute());
            assertEquals("Wrong attribute", node.getAttribute(index - 1), pattr
                    .getNode());
            checkIterators(pattr);
        }
View Full Code Here
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
     * @param p the node pointer to test
     */
    private void checkIterators(NodePointer p)
    {
        ConfigurationNode node = (ConfigurationNode) p.getNode();
        NodeIterator it = p.childIterator(null, false, null);
        assertEquals("Iterator count differs from children count", node
                .getChildrenCount(), iteratorSize(it));

        for (int index = 1; it.setPosition(index); index++)
        {
            NodePointer pchild = it.getNodePointer();
            assertEquals("Wrong child", node.getChild(index - 1), pchild
                    .getNode());
            checkIterators(pchild);
        }

        it = p.attributeIterator(new QName(null, "*"));
        assertEquals("Iterator count differs from attribute count", node
                .getAttributeCount(), iteratorSize(it));
        for (int index = 1; it.setPosition(index); index++)
        {
            NodePointer pattr = it.getNodePointer();
            assertTrue("Node pointer is no attribute", pattr.isAttribute());
            assertEquals("Wrong attribute", node.getAttribute(index - 1), pattr
                    .getNode());
            checkIterators(pattr);
        }
View Full Code Here
505
506
507
508
509
510
511
512
513
514
515
516
517
518
            }
            else {
                nodeTest = new NodeNameTest(name);
            }

            NodeIterator it =
                childIterator(nodeTest, false, null);
            if (it != null && it.setPosition(index + 1)) {
                return it.getNodePointer();
            }
        }
        throw new JXPathException(
            "Factory could not create "
                + "a child node for path: "
View Full Code Here
TOP

Related Classes of org.apache.commons.jxpath.ri.model.NodeIterator

  • org.apache.commons.configuration.tree.xpath.TestConfigurationNodePointer
  • org.apache.commons.configuration2.tree.xpath.TestConfigurationNodePointer
  • org.apache.commons.jxpath.ri.axes.DescendantContext
  • org.apache.commons.jxpath.ri.axes.PrecedingOrFollowingContext
  • org.apache.commons.jxpath.ri.axes.SimplePathInterpreter
  • org.apache.commons.jxpath.ri.model.beans.CollectionNodeIterator
  • org.apache.commons.jxpath.ri.model.dom.DOMNodePointer
  • org.apache.commons.jxpath.ri.model.jdom.JDOMNodePointer
  • org.apache.commons.jxpath.ri.NamespaceResolver
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.