net.sf.saxon.tree.iter.NodeWrappingAxisIterator Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of Saxon-HE Show documentation
Show all versions of Saxon-HE Show documentation
The XSLT and XQuery Processor
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2018-2022 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.iter;
import net.sf.saxon.om.NodeInfo;
import java.util.Iterator;
/**
* An AxisIterator that wraps a Java Iterator.
* @param the class of the external nodes being wrapped.
*/
public class NodeWrappingAxisIterator
implements AxisIterator, LookaheadIterator {
private final Iterator base;
private final NodeWrappingFunction wrappingFunction;
/**
* Create a SequenceIterator over a given iterator
*
* @param base the base Iterator
* @param wrappingFunction a function that wraps objects of type B in a Saxon NodeInfo
*/
public NodeWrappingAxisIterator(
Iterator base,
NodeWrappingFunction wrappingFunction) {
this.base = base;
this.wrappingFunction = wrappingFunction;
}
public Iterator getBaseIterator() {
return base;
}
public NodeWrappingFunction getNodeWrappingFunction() {
return wrappingFunction;
}
@Override
public boolean supportsHasNext() {
return true;
}
@Override
public boolean hasNext() {
return base.hasNext();
}
/*@Nullable*/
@Override
public NodeInfo next() {
while (base.hasNext()) {
B next = base.next();
if (!isIgnorable(next)) {
return wrappingFunction.wrap(next);
}
}
return null;
}
public boolean isIgnorable(B node) {
return false;
}
}