com.sun.org.apache.xml.internal.dtm.ref
public class: DTMAxisIterNodeList [javadoc |
source]
java.lang.Object
com.sun.org.apache.xml.internal.dtm.ref.DTMNodeListBase
com.sun.org.apache.xml.internal.dtm.ref.DTMAxisIterNodeList
All Implemented Interfaces:
NodeList
DTMAxisNodeList gives us an implementation of the DOM's
NodeList interface wrapped around a DTM Iterator. The author
considers this something of an abominations, since NodeList was not
intended to be a general purpose "list of nodes" API and is
generally considered by the DOM WG to have be a mistake... but I'm
told that some of the XPath/XSLT folks say they must have this
solution.
Please note that this is not necessarily equivlaent to a DOM
NodeList operating over the same document. In particular:
- If there are several Text nodes in logical succession (ie,
across CDATASection and EntityReference boundaries), we will return
only the first; the caller is responsible for stepping through
them.
(%REVIEW% Provide a convenience routine here to assist, pending
proposed DOM Level 3 getAdjacentText() operation?)
- Since the whole XPath/XSLT architecture assumes that the source
document is not altered while we're working with it, we do not
promise to implement the DOM NodeList's "live view" response to
document mutation.
State: In progress!!
| Constructor: |
|---|
 public DTMAxisIterNodeList(DTM dtm,
DTMAxisIterator dtmAxisIterator) {
if (dtmAxisIterator == null) {
m_last = 0;
} else {
m_cachedNodes = new IntVector();
m_dtm = dtm;
}
m_iter = dtmAxisIterator;
}
Public constructor: Wrap a DTMNodeList around an existing
and preconfigured DTMAxisIterator |
| Methods from com.sun.org.apache.xml.internal.dtm.ref.DTMNodeListBase: |
|---|
|
getLength, item |
| Method from com.sun.org.apache.xml.internal.dtm.ref.DTMAxisIterNodeList Detail: |
|---|
public DTMAxisIterator getDTMAxisIterator() {
return m_iter;
} Access the wrapped DTMIterator. I'm not sure whether anyone will
need this or not, but let's write it and think about it. |
public int getLength() {
if (m_last == -1) {
int node;
while ((node = m_iter.next()) != DTMAxisIterator.END) {
m_cachedNodes.addElement(node);
}
m_last = m_cachedNodes.size();
}
return m_last;
} The number of nodes in the list. The range of valid child node indices
is 0 to length-1 inclusive. |
public Node item(int index) {
if (m_iter != null) {
int node;
int count = m_cachedNodes.size();
if (count > index) {
node = m_cachedNodes.elementAt(index);
return m_dtm.getNode(node);
} else if (m_last == -1) {
while (((node = m_iter.next()) != DTMAxisIterator.END)
&& count < = index) {
m_cachedNodes.addElement(node);
count++;
}
if (node == DTMAxisIterator.END) {
m_last = count;
} else {
return m_dtm.getNode(node);
}
}
}
return null;
} Returns the indexth item in the collection. If
index is greater than or equal to the number of nodes in
the list, this returns null. |
Save This Page