01: /*
02: * @(#)DOMNodeListByTagNameImpl.java 1.11 2000/08/16
03: *
04: */
05:
06: package org.w3c.tidy;
07:
08: /**
09: *
10: * DOMNodeListByTagNameImpl
11: *
12: * (c) 1998-2000 (W3C) MIT, INRIA, Keio University
13: * See Tidy.java for the copyright notice.
14: * Derived from <a href="http://www.w3.org/People/Raggett/tidy">
15: * HTML Tidy Release 4 Aug 2000</a>
16: *
17: * @author Dave Raggett <dsr@w3.org>
18: * @author Andy Quick <ac.quick@sympatico.ca> (translation to Java)
19: * @version 1.4, 1999/09/04 DOM support
20: * @version 1.5, 1999/10/23 Tidy Release 27 Sep 1999
21: * @version 1.6, 1999/11/01 Tidy Release 22 Oct 1999
22: * @version 1.7, 1999/12/06 Tidy Release 30 Nov 1999
23: * @version 1.8, 2000/01/22 Tidy Release 13 Jan 2000
24: * @version 1.9, 2000/06/03 Tidy Release 30 Apr 2000
25: * @version 1.10, 2000/07/22 Tidy Release 8 Jul 2000
26: * @version 1.11, 2000/08/16 Tidy Release 4 Aug 2000
27: */
28:
29: /**
30: * <p>The items in the <code>NodeList</code> are accessible via an integral
31: * index, starting from 0.
32: *
33: */
34: public class DOMNodeListByTagNameImpl implements org.w3c.dom.NodeList {
35:
36: private Node first = null;
37: private String tagName = "*";
38: private int currIndex = 0;
39: private int maxIndex = 0;
40: private Node currNode = null;
41:
42: protected DOMNodeListByTagNameImpl(Node first, String tagName) {
43: this .first = first;
44: this .tagName = tagName;
45: }
46:
47: /**
48: * @see org.w3c.dom.NodeList#item
49: */
50: public org.w3c.dom.Node item(int index) {
51: currIndex = 0;
52: maxIndex = index;
53: preTraverse(first);
54:
55: if (currIndex > maxIndex && currNode != null)
56: return currNode.getAdapter();
57: else
58: return null;
59: }
60:
61: /**
62: * @see org.w3c.dom.NodeList#getLength
63: */
64: public int getLength() {
65: currIndex = 0;
66: maxIndex = Integer.MAX_VALUE;
67: preTraverse(first);
68: return currIndex;
69: }
70:
71: protected void preTraverse(Node node) {
72: if (node == null)
73: return;
74:
75: if (node.type == Node.StartTag || node.type == Node.StartEndTag) {
76: if (currIndex <= maxIndex
77: && (tagName.equals("*") || tagName
78: .equals(node.element))) {
79: currIndex += 1;
80: currNode = node;
81: }
82: }
83: if (currIndex > maxIndex)
84: return;
85:
86: node = node.content;
87: while (node != null) {
88: preTraverse(node);
89: node = node.next;
90: }
91: }
92:
93: }
|