01: /*
02: * Copyright (c) 1998-2008 Caucho Technology -- all rights reserved
03: *
04: * This file is part of Resin(R) Open Source
05: *
06: * Each copy or derived work must preserve the copyright notice and this
07: * notice unmodified.
08: *
09: * Resin Open Source is free software; you can redistribute it and/or modify
10: * it under the terms of the GNU General Public License as published by
11: * the Free Software Foundation; either version 2 of the License, or
12: * (at your option) any later version.
13: *
14: * Resin Open Source is distributed in the hope that it will be useful,
15: * but WITHOUT ANY WARRANTY; without even the implied warranty of
16: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE, or any warranty
17: * of NON-INFRINGEMENT. See the GNU General Public License for more
18: * details.
19: *
20: * You should have received a copy of the GNU General Public License
21: * along with Resin Open Source; if not, write to the
22: * Free SoftwareFoundation, Inc.
23: * 59 Temple Place, Suite 330
24: * Boston, MA 02111-1307 USA
25: *
26: * @author Scott Ferguson
27: */
28:
29: package com.caucho.xpath.pattern;
30:
31: import org.w3c.dom.Node;
32:
33: /**
34: * Represents a selected node.
35: */
36: public class SelectedAttribute extends SelectedNode {
37: /**
38: * Creates new selected node, calculating the index.
39: *
40: * @param node the underlying DOM node.
41: */
42: public SelectedAttribute(Node node) {
43: super (node);
44:
45: _level = 0;
46: for (Node ptr = node; ptr != null; ptr = ptr
47: .getPreviousSibling())
48: _level--;
49: }
50:
51: /**
52: * Returns the node's index
53: */
54: public int compareTo(SelectedNode b) {
55: Node aPtr = getNode();
56: Node bPtr = b.getNode();
57:
58: int aDepth = _depth;
59: int bDepth = b._depth;
60:
61: if (aPtr == bPtr)
62: return 0;
63:
64: if (b instanceof SelectedAttribute) {
65: if (aPtr.getParentNode() == bPtr.getParentNode()) {
66: // Using getNextSibling() because QAttr doesn't
67: // implement getPreviousSibling
68: for (; bPtr != null; bPtr = bPtr.getNextSibling()) {
69: if (aPtr == bPtr)
70: return 1;
71: }
72:
73: return -1;
74: } else
75: return compareTo(aPtr.getParentNode(), aDepth - 1, bPtr
76: .getParentNode(), bDepth - 1);
77: } else if (bPtr.getParentNode() == aPtr.getParentNode())
78: return -1;
79:
80: return compareTo(aPtr, aDepth, bPtr, bDepth);
81: }
82: }
|