| /* |
| * The Apache Software License, Version 1.1 |
| * |
| * |
| * Copyright (c) 1999 The Apache Software Foundation. All rights |
| * reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * |
| * 1. Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * |
| * 2. Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in |
| * the documentation and/or other materials provided with the |
| * distribution. |
| * |
| * 3. The end-user documentation included with the redistribution, |
| * if any, must include the following acknowledgment: |
| * "This product includes software developed by the |
| * Apache Software Foundation (http://www.apache.org/)." |
| * Alternately, this acknowledgment may appear in the software itself, |
| * if and wherever such third-party acknowledgments normally appear. |
| * |
| * 4. The names "Xalan" and "Apache Software Foundation" must |
| * not be used to endorse or promote products derived from this |
| * software without prior written permission. For written |
| * permission, please contact apache@apache.org. |
| * |
| * 5. Products derived from this software may not be called "Apache", |
| * nor may "Apache" appear in their name, without prior written |
| * permission of the Apache Software Foundation. |
| * |
| * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED |
| * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR |
| * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
| * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
| * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
| * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
| * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| * SUCH DAMAGE. |
| * ==================================================================== |
| * |
| * This software consists of voluntary contributions made by many |
| * individuals on behalf of the Apache Software Foundation and was |
| * originally based on software copyright (c) 1999, Lotus |
| * Development Corporation., http://www.lotus.com. For more |
| * information on the Apache Software Foundation, please see |
| * <http://www.apache.org/>. |
| */ |
| package org.apache.xpath.axes; |
| |
| import org.apache.xml.dtm.DTMIterator; |
| import org.apache.xpath.XPathContext; |
| import org.apache.xpath.objects.XObject; |
| import org.apache.xpath.patterns.NodeTest; |
| |
| /** |
| * This class defines a simplified type of union iterator that only |
| * tests along the child axes. If the conditions are right, it is |
| * much faster than using a UnionPathIterator. |
| */ |
| public class UnionChildIterator extends ChildTestIterator |
| { |
| /** |
| * Even though these may hold full LocPathIterators, this array does |
| * not have to be cloned, since only the node test and predicate |
| * portion are used, and these only need static information. However, |
| * also note that index predicates can not be used! |
| */ |
| private PredicatedNodeTest[] m_nodeTests = null; |
| |
| /** |
| * Constructor for UnionChildIterator |
| */ |
| public UnionChildIterator() |
| { |
| super(null); |
| } |
| |
| /** |
| * Add a node test to the union list. |
| * |
| * @param test reference to a NodeTest, which will be added |
| * directly to the list of node tests (in other words, it will |
| * not be cloned). The parent of this test will be set to |
| * this object. |
| */ |
| public void addNodeTest(PredicatedNodeTest test) |
| { |
| |
| // Increase array size by only 1 at a time. Fix this |
| // if it looks to be a problem. |
| if (null == m_nodeTests) |
| { |
| m_nodeTests = new PredicatedNodeTest[1]; |
| m_nodeTests[0] = test; |
| } |
| else |
| { |
| PredicatedNodeTest[] tests = m_nodeTests; |
| int len = m_nodeTests.length; |
| |
| m_nodeTests = new PredicatedNodeTest[len + 1]; |
| |
| System.arraycopy(tests, 0, m_nodeTests, 0, len); |
| |
| m_nodeTests[len] = test; |
| } |
| test.exprSetParent(this); |
| } |
| |
| /** |
| * Test whether a specified node is visible in the logical view of a |
| * TreeWalker or NodeIterator. This function will be called by the |
| * implementation of TreeWalker and NodeIterator; it is not intended to |
| * be called directly from user code. |
| * @param n The node to check to see if it passes the filter or not. |
| * @return a constant to determine whether the node is accepted, |
| * rejected, or skipped, as defined above . |
| */ |
| public short acceptNode(int n) |
| { |
| XPathContext xctxt = getXPathContext(); |
| try |
| { |
| xctxt.pushCurrentNode(n); |
| for (int i = 0; i < m_nodeTests.length; i++) |
| { |
| PredicatedNodeTest pnt = m_nodeTests[i]; |
| XObject score = pnt.execute(xctxt, n); |
| if (score != NodeTest.SCORE_NONE) |
| { |
| // Note that we are assuming there are no positional predicates! |
| if (pnt.getPredicateCount() > 0) |
| { |
| if (pnt.executePredicates(n, xctxt)) |
| return DTMIterator.FILTER_ACCEPT; |
| } |
| else |
| return DTMIterator.FILTER_ACCEPT; |
| |
| } |
| } |
| } |
| catch (javax.xml.transform.TransformerException se) |
| { |
| |
| // TODO: Fix this. |
| throw new RuntimeException(se.getMessage()); |
| } |
| finally |
| { |
| xctxt.popCurrentNode(); |
| } |
| return DTMIterator.FILTER_SKIP; |
| } |
| |
| } |