| /* |
| * 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.xpath.axes.LocPathIterator; |
| import org.apache.xpath.XPath; |
| import org.apache.xpath.XPathContext; |
| import org.apache.xpath.DOMHelper; |
| |
| //import org.w3c.dom.Node; |
| import org.apache.xml.dtm.DTM; |
| |
| /** |
| * Walker for the 'preceding' axes. |
| * <p>The walk is done from the root node, in depth-first order, |
| * testing to see if a given vertice is an ancestor of the step |
| * context, in which case that vertice, and all following vertices, |
| * are skipped.</p> |
| * @see <a href="http://www.w3.org/TR/xpath#axes">XPath axes descriptions</a> |
| */ |
| public class PrecedingWalker extends ReverseAxesWalker |
| { |
| |
| /** |
| * Construct a PrecedingWalker using a LocPathIterator. |
| * |
| * @param locPathIterator The location path iterator that 'owns' this walker. |
| */ |
| public PrecedingWalker(LocPathIterator locPathIterator) |
| { |
| super(locPathIterator); |
| } |
| |
| /** |
| * Set the root node of the TreeWalker. If we follow an attribute:: or namespace:: |
| * axis, we operate relative to the parent node. |
| * |
| * @param root The context node of this step. |
| */ |
| public void setRoot(int root) |
| { |
| DTM dtm = getDTM(root); |
| if (DTM.ATTRIBUTE_NODE == dtm.getNodeType(root)) |
| { |
| root = dtm.getParent(root); |
| } |
| |
| super.setRoot(root); |
| |
| m_doc = dtm.getDocument(); |
| m_currentNode = m_doc; |
| m_nextLevelAmount = (dtm.getFirstChild(root) != DTM.NULL) ? 1 : 0; |
| |
| super.resetProximityPositions(); |
| } |
| |
| /** |
| * Reset the proximity positions counts. |
| */ |
| public void resetProximityPositions(){} |
| |
| /** |
| * Moves to and returns the closest visible ancestor node of the current |
| * node. If the search for parentNode attempts to step upward from the |
| * TreeWalker's root node, or if it fails to find a visible ancestor |
| * node, this method retains the current position and returns null. |
| * @return The new parent node, or null if the current node has no parent |
| * in the TreeWalker's logical view. |
| */ |
| public int parentNode() |
| { |
| |
| int next = getDTM(m_currentNode).getParent(m_currentNode); |
| |
| // If we're at the root of the tree, we're done. |
| if ((DTM.NULL == next) || m_doc == next) |
| return DTM.NULL; |
| |
| // If the parent vertice is an ancestor of the step |
| // context, then all siblings are to the left of the |
| // ancestor path, so we're done. |
| if (isAncestorOfRootContext(next)) |
| return DTM.NULL; |
| |
| m_nextLevelAmount = 0; |
| |
| // if(null != next) |
| // { |
| // int attrNode = next.getAttributes().getNamedItem("id"); |
| // if(null != attrNode) |
| // System.out.println("parentNode: "+attrNode.getNodeValue()); |
| // else |
| // System.out.println("parentNode: no id value"); |
| // } |
| // else |
| // System.out.println("parentNode: null"); |
| |
| return setCurrentIfNotNull(next); |
| } |
| |
| /** |
| * Moves the <code>TreeWalker</code> to the first visible child of the |
| * current node, and returns the new node. If the current node has no |
| * visible children, returns <code>null</code> , and retains the current |
| * node. |
| * @return The new node, or <code>null</code> if the current node has no |
| * visible children in the TreeWalker's logical view. |
| */ |
| public int firstChild() |
| { |
| |
| // Walk down the left edge of the current sub-tree. |
| // Get the next child on the 'preceding' axes. This will |
| // skip any children nodes that are ancestors of the step context, |
| // but will return children of those nodes. |
| if (m_root == m_currentNode) |
| return DTM.NULL; |
| |
| int nextNode = m_currentNode; |
| |
| DTM dtm = getDTM(m_root); |
| |
| while (DTM.NULL != nextNode) |
| { |
| int n = dtm.getFirstChild(nextNode); |
| |
| if (DTM.NULL != n) |
| { |
| nextNode = n; |
| } |
| else |
| { |
| |
| // If the next sibling is an ancestor, then continue |
| // on to get it's first child, otherwise nextSibling() |
| // will get it. |
| nextNode = dtm.getNextSibling(nextNode); |
| |
| if (DTM.NULL != nextNode) |
| { |
| if ((m_root == nextNode) ||!isAncestorOfRootContext(nextNode)) |
| return DTM.NULL; |
| else |
| continue; |
| } |
| } |
| |
| if (DTM.NULL != nextNode) |
| { |
| if (m_root == nextNode) |
| return DTM.NULL; |
| else if (!isAncestorOfRootContext(nextNode)) |
| break; |
| } |
| } |
| |
| m_nextLevelAmount = (DTM.NULL == nextNode) |
| ? 0 : (dtm.hasChildNodes(nextNode) ? 1 : 0); |
| |
| // if(null != nextNode) |
| // { |
| // Node attrNode = nextNode.getAttributes().getNamedItem("id"); |
| // if(null != attrNode) |
| // System.out.println("firstChild: "+attrNode.getNodeValue()); |
| // else |
| // System.out.println("firstChild: no id value"); |
| // } |
| // else |
| // System.out.println("firstChild: null"); |
| |
| return setCurrentIfNotNull(nextNode); |
| } |
| |
| /** |
| * Moves the <code>TreeWalker</code> to the next sibling of the current |
| * node, and returns the new node. If the current node has no visible |
| * next sibling, returns <code>null</code> , and retains the current node. |
| * @return The new node, or <code>null</code> if the current node has no |
| * next sibling in the TreeWalker's logical view. |
| */ |
| public int nextSibling() |
| { |
| |
| if (m_root == m_currentNode) |
| return DTM.NULL; |
| |
| DTM dtm = getDTM(m_root); |
| int next = dtm.getNextSibling(m_currentNode); |
| |
| if ((DTM.NULL == next) || m_root == next |
| /* || isAncestorOfRootContext(next) */) |
| return DTM.NULL; |
| |
| if(isAncestorOfRootContext(next)) |
| { |
| next = dtm.getFirstChild(next); |
| |
| if ((DTM.NULL == next) || (m_root == next) |
| /* || isAncestorOfRootContext(next) */) |
| return DTM.NULL; |
| } |
| |
| m_nextLevelAmount = (DTM.NULL == next) ? 0 : (dtm.hasChildNodes(next) ? 1 : 0); |
| |
| // if(null != next) |
| // { |
| // int attrNode = next.getAttributes().getNamedItem("id"); |
| // if(null != attrNode) |
| // System.out.println("nextSibling: "+attrNode.getNodeValue()); |
| // else |
| // System.out.println("nextSibling: no id value"); |
| // } |
| // else |
| // System.out.println("nextSibling: null"); |
| |
| return setCurrentIfNotNull(next); |
| } |
| |
| /** The document owner node. */ |
| transient int m_doc = DTM.NULL; |
| |
| /** |
| * Tell what's the maximum level this axes can descend to. |
| * |
| * @return Short.MAX_VALUE. |
| */ |
| protected int getLevelMax() |
| { |
| return Short.MAX_VALUE; |
| } |
| } |