1 /*
2 * Copyright (C) 2002 Carsten Krebs (Team-Konzept GmbH & Co.KG)
3 *
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2.1 of the License, or (at your option) any later version.
8 *
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
13 *
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 */
18 package com.teamkonzept.dom4jb.saxon;
19
20 import org.w3c.dom.Node;
21
22 import com.icl.saxon.om.AxisEnumeration;
23 import com.icl.saxon.om.NodeInfo;
24
25 public class AncestorEnumeration implements AxisEnumeration {
26
27 private Node currNode;
28 private Node nextNode;
29
30 public AncestorEnumeration(final AxisNode start, final boolean includeSelf) {
31 if ( includeSelf ) {
32 nextNode = start;
33 } else {
34 nextNode = start.getParentNode();
35 }
36 }
37
38 public int getLastPosition() {
39 return 1; // not used
40 }
41
42 public boolean hasMoreElements() {
43 if ( nextNode != null ) {
44 return true;
45 }
46 if ( currNode == null ) {
47 return false;
48 }
49 nextNode = currNode.getParentNode();
50
51 return nextNode != null;
52 }
53
54 public boolean isPeer() {
55 return false;
56 }
57
58 public boolean isReverseSorted() {
59 return true;
60 }
61
62 public boolean isSorted() {
63 return false;
64 }
65
66 public NodeInfo nextElement() {
67 if ( nextNode != null || hasMoreElements() ) {
68 currNode = nextNode;
69 nextNode = null;
70 return (NodeInfo)currNode;
71 }
72 return null;
73 }
74 }
This page was automatically generated by Maven