TreeWalker2Resultpublic class DTMTreeWalker
extends java.lang.Object
| Constructor | Description |
|---|---|
DTMTreeWalker() |
Constructor.
|
DTMTreeWalker(org.xml.sax.ContentHandler contentHandler,
DTM dtm) |
Constructor.
|
| Modifier and Type | Method | Description |
|---|---|---|
org.xml.sax.ContentHandler |
getcontentHandler() |
Get the ContentHandler used for the tree walk.
|
void |
setcontentHandler(org.xml.sax.ContentHandler ch) |
Set the ContentHandler used for the tree walk.
|
void |
setDTM(DTM dtm) |
Set the DTM to be traversed.
|
void |
traverse(int pos) |
Perform a non-recursive pre-order/post-order traversal,
operating as a Visitor. startNode (preorder) and endNode
(postorder) are invoked for each node as we traverse over them,
with the result that the node is written out to m_contentHandler.
|
void |
traverse(int pos,
int top) |
Perform a non-recursive pre-order/post-order traversal,
operating as a Visitor. startNode (preorder) and endNode
(postorder) are invoked for each node as we traverse over them,
with the result that the node is written out to m_contentHandler.
|
public DTMTreeWalker()
public DTMTreeWalker(org.xml.sax.ContentHandler contentHandler,
DTM dtm)
contentHandler - The implemention of the
contentHandler operation (toXMLString, digest, ...)public void setDTM(DTM dtm)
dtm - The Document Table Model to be used.public org.xml.sax.ContentHandler getcontentHandler()
public void setcontentHandler(org.xml.sax.ContentHandler ch)
ch - the ContentHandler to be the result of the tree walk.public void traverse(int pos)
throws org.xml.sax.SAXException
pos - Node in the tree at which to start (and end) traversal --
in other words, the root of the subtree to traverse over.TransformerExceptionorg.xml.sax.SAXExceptionpublic void traverse(int pos,
int top)
throws org.xml.sax.SAXException
pos - Node in the tree where to start traversaltop - Node in the tree where to end traversal.
If top==DTM.NULL, run through end of document.TransformerExceptionorg.xml.sax.SAXExceptionCopyright © 2014 Apache XML Project. All Rights Reserved.