net.sf.saxon.tree.tiny.TinyTreeEventIterator Maven / Gradle / Ivy
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2015 Saxonica Limited.
// This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0.
// If a copy of the MPL was not distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
// This Source Code Form is "Incompatible With Secondary Licenses", as defined by the Mozilla Public License, v. 2.0.
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
package net.sf.saxon.tree.tiny;
import net.sf.saxon.event.PipelineConfiguration;
import net.sf.saxon.evpull.*;
import net.sf.saxon.om.CodedName;
import net.sf.saxon.om.NamespaceBinding;
import net.sf.saxon.trans.XPathException;
import net.sf.saxon.tree.util.NamespaceIterator;
import net.sf.saxon.type.Type;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
/**
* This implementation of the Saxon event-pull interface starts from a document, element,
* text, comment, or processing-instruction node in a TinyTree,
* and returns the events corresponding to that node and its descendants (including
* their attributes and namespaces). The class performs the same function as
* the general-purpose {@link net.sf.saxon.evpull.Decomposer} class, but is
* specialized to exploit the TinyTree data structure: in particular, it never
* materializes any Node objects.
*/
public class TinyTreeEventIterator implements EventIterator {
private int startNodeNr;
private int currentNodeNr;
private int pendingEndEvents = 0;
private boolean startAtDocument = false;
private TinyTree tree;
private PipelineConfiguration pipe;
/*@NotNull*/ private NamespaceBinding[] nsBuffer = new NamespaceBinding[10];
/**
* Create a TinyTreeEventIterator to return events associated with a tree or subtree
*
* @param startNode the root of the tree or subtree. Must be a document or element node.
* @param pipe the Saxon pipeline configuration
* @throws IllegalArgumentException if the start node is an attribute or namespace node.
*/
public TinyTreeEventIterator(/*@NotNull*/ TinyNodeImpl startNode, PipelineConfiguration pipe) {
this.pipe = pipe;
int kind = startNode.getNodeKind();
if (kind != Type.DOCUMENT && kind != Type.ELEMENT) {
throw new IllegalArgumentException("TinyTreeEventIterator must start at a document or element node");
}
startNodeNr = startNode.nodeNr;
currentNodeNr = startNodeNr;
tree = startNode.tree;
pendingEndEvents = 0;
startAtDocument = (kind == Type.DOCUMENT);
}
/**
* Get the next event
*
* @return a PullEvent object representing the next event, or null when the sequence is exhausted
*/
/*@Nullable*/
public PullEvent next() throws XPathException {
if (startNodeNr < 0) {
// this is a signal that we've finished
return null;
}
int thisDepth = tree.depth[currentNodeNr];
boolean lastNode = currentNodeNr + 1 >= tree.numberOfNodes;
int nextDepth = (lastNode ? 0 : tree.depth[currentNodeNr + 1]);
if (nextDepth < tree.depth[startNodeNr]) {
nextDepth = tree.depth[startNodeNr];
}
boolean atEnd = (thisDepth <= tree.depth[startNodeNr] && currentNodeNr != startNodeNr);
if (atEnd && pendingEndEvents == 1) {
pendingEndEvents--;
startNodeNr = -1;
if (startAtDocument) {
return EndDocumentEvent.getInstance();
} else {
//return null;
return EndElementEvent.getInstance();
}
}
if (pendingEndEvents > 0) {
pendingEndEvents--;
return EndElementEvent.getInstance();
}
byte kind = tree.nodeKind[currentNodeNr];
switch (kind) {
case Type.DOCUMENT:
pendingEndEvents = thisDepth - nextDepth + 1;
currentNodeNr++;
return StartDocumentEvent.getInstance();
case Type.ELEMENT:
pendingEndEvents = thisDepth - nextDepth + 1;
StartElementEvent see = new StartElementEvent(pipe);
see.setElementName(new CodedName(tree.nameCode[currentNodeNr], tree.getNamePool()));
see.setTypeCode(tree.getSchemaType(currentNodeNr));
//see.setLocationId(currentNodeNr);
// add the attributes
int index = tree.alpha[currentNodeNr];
if (index >= 0) {
while (index < tree.numberOfAttributes && tree.attParent[index] == currentNodeNr) {
see.addAttribute(tree.getAttributeNode(index++));
}
}
if (currentNodeNr == startNodeNr) {
// get all inscope namespaces for a top-level element in the sequence.
List list = new ArrayList();
Iterator iter = NamespaceIterator.iterateNamespaces(tree.getNode(currentNodeNr));
while (iter.hasNext()) {
list.add(iter.next());
}
see.setLocalNamespaces(list.toArray(new NamespaceBinding[list.size()]));
} else {
// only namespace declarations (and undeclarations) on this element are required
see.setLocalNamespaces(TinyElementImpl.getDeclaredNamespaces(tree, currentNodeNr, nsBuffer));
}
currentNodeNr++;
return see;
case Type.TEXT:
case Type.WHITESPACE_TEXT:
case Type.COMMENT:
case Type.PROCESSING_INSTRUCTION:
pendingEndEvents = thisDepth - nextDepth;
return tree.getNode(currentNodeNr++);
case Type.PARENT_POINTER:
currentNodeNr++;
return next();
default:
throw new IllegalStateException("Unknown node kind " + tree.nodeKind[currentNodeNr]);
}
}
/**
* Determine whether the EventIterator returns a flat sequence of events, or whether it can return
* nested event iterators
*
* @return true if the next() method is guaranteed never to return an EventIterator
*/
public boolean isFlatSequence() {
return true;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy