001: /*
002: * Copyright (c) 1998-2008 Caucho Technology -- all rights reserved
003: *
004: * This file is part of Resin(R) Open Source
005: *
006: * Each copy or derived work must preserve the copyright notice and this
007: * notice unmodified.
008: *
009: * Resin Open Source is free software; you can redistribute it and/or modify
010: * it under the terms of the GNU General Public License as published by
011: * the Free Software Foundation; either version 2 of the License, or
012: * (at your option) any later version.
013: *
014: * Resin Open Source is distributed in the hope that it will be useful,
015: * but WITHOUT ANY WARRANTY; without even the implied warranty of
016: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE, or any warranty
017: * of NON-INFRINGEMENT. See the GNU General Public License for more
018: * details.
019: *
020: * You should have received a copy of the GNU General Public License
021: * along with Resin Open Source; if not, write to the
022: * Free SoftwareFoundation, Inc.
023: * 59 Temple Place, Suite 330
024: * Boston, MA 02111-1307 USA
025: *
026: * @author Scott Ferguson
027: */
028:
029: package com.caucho.xpath.pattern;
030:
031: import com.caucho.xpath.Env;
032: import com.caucho.xpath.ExprEnvironment;
033: import com.caucho.xpath.XPathException;
034:
035: import org.w3c.dom.Node;
036:
037: /**
038: * matches child nodes.
039: */
040: public class FromChildren extends Axis {
041: public FromChildren(AbstractPattern parent) {
042: super (parent);
043: }
044:
045: /**
046: * Matches all nodes except attributes and tests the parent pattern
047: * with the parent node.
048: *
049: * @param node the current node
050: * @param env the variable environment
051: *
052: * @return true if the pattern matches
053: */
054: public boolean match(Node node, ExprEnvironment env)
055: throws XPathException {
056: if (node == null)
057: return false;
058:
059: return _parent == null
060: || _parent.match(node.getParentNode(), env);
061: }
062:
063: /**
064: * The position of the child is the count of previous siblings
065: * matching the pattern.
066: *
067: * @param node the current node
068: * @param env the variable environment
069: * @param pattern the position pattern
070: *
071: * @return the node's position.
072: */
073: public int position(Node node, Env env, AbstractPattern pattern)
074: throws XPathException {
075: int count = 1;
076:
077: for (node = node.getPreviousSibling(); node != null; node = node
078: .getPreviousSibling()) {
079: if (pattern == null || pattern.match(node, env))
080: count++;
081: }
082:
083: return count;
084: }
085:
086: /**
087: * Counts all siblings matching the pattern.
088: *
089: * @param node the current node
090: * @param env the variable environment
091: * @param pattern the position pattern
092: *
093: * @return the count of the node list.
094: */
095: public int count(Node node, Env env, AbstractPattern pattern)
096: throws XPathException {
097: int count = 0;
098:
099: for (node = node.getParentNode().getFirstChild(); node != null; node = node
100: .getNextSibling()) {
101: if (pattern.match(node, env))
102: count++;
103: }
104:
105: return count;
106: }
107:
108: /**
109: * Returns the first node in the selection order.
110: *
111: * @param node the current node
112: *
113: * @return the first node
114: */
115: public Node firstNode(Node node, ExprEnvironment env) {
116: return node.getFirstChild();
117: }
118:
119: /**
120: * Returns the next node in the selection order.
121: *
122: * @param node the current node
123: * @param node the last node
124: *
125: * @return the next node
126: */
127: public Node nextNode(Node node, Node lastNode) {
128: return node.getNextSibling();
129: }
130:
131: /**
132: * Returns true if the pattern nodes on a single level.
133: */
134: boolean isSingleLevel() {
135: return _parent == null || _parent.isSingleLevel();
136: }
137:
138: /**
139: * Returns true if the pattern is strictly ascending.
140: */
141: public boolean isStrictlyAscending() {
142: if (_parent == null)
143: return true;
144: else {
145: return _parent.isStrictlyAscending();
146: }
147: }
148:
149: /**
150: * Returns true if the two patterns are equal.
151: */
152: public boolean equals(Object b) {
153: if (!(b instanceof FromChildren))
154: return false;
155:
156: FromChildren bPattern = (FromChildren) b;
157:
158: return (_parent == bPattern._parent || (_parent != null && _parent
159: .equals(bPattern._parent)));
160: }
161:
162: public String toString() {
163: return getPrefix() + "child::";
164: }
165: }
|