net.sf.saxon.expr.RangeIterator 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
An OSGi bundle for Saxon-HE
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2013 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.expr;
import net.sf.saxon.om.GroundedValue;
import net.sf.saxon.om.SequenceIterator;
import net.sf.saxon.trans.XPathException;
import net.sf.saxon.tree.iter.EmptyIterator;
import net.sf.saxon.tree.iter.GroundedIterator;
import net.sf.saxon.tree.iter.LookaheadIterator;
import net.sf.saxon.tree.iter.ReversibleIterator;
import net.sf.saxon.value.BigIntegerValue;
import net.sf.saxon.value.Int64Value;
import net.sf.saxon.value.IntegerRange;
import net.sf.saxon.value.IntegerValue;
/**
* An Iterator that produces numeric values in a monotonic sequence,
* ascending or descending. Although a range expression (N to M) is always
* in ascending order, applying the reverse() function will produce
* a RangeIterator that works in descending order.
*/
public class RangeIterator implements SequenceIterator,
ReversibleIterator,
LastPositionFinder,
LookaheadIterator,
GroundedIterator {
long start;
long currentValue;
long limit;
public static SequenceIterator makeRangeIterator(IntegerValue start, IntegerValue end) throws XPathException {
if (start == null || end == null) {
return EmptyIterator.getInstance();
} else {
if (start.compareTo(end) > 0) {
return EmptyIterator.getInstance();
}
if (start instanceof BigIntegerValue || end instanceof BigIntegerValue) {
return new BigRangeIterator(start.asBigInteger(), end.asBigInteger());
} else {
return new RangeIterator(start.longValue(), end.longValue());
}
}
}
/**
* Create an iterator over a range of monotonically increasing integers
* @param start the first integer in the sequence
* @param end the last integer in the sequence. Must be >= start.
*/
public RangeIterator(long start, long end) throws XPathException {
if (end - start > Integer.MAX_VALUE) {
throw new XPathException("Saxon limit on sequence length exceeded (2^32-1)");
}
this.start = start;
currentValue = start - 1;
limit = end;
}
public boolean hasNext() {
return currentValue < limit;
}
/*@Nullable*/ public IntegerValue next() {
if (++currentValue > limit) {
return null;
}
return Int64Value.makeIntegerValue(currentValue);
}
public IntegerValue current() {
if (currentValue > limit) {
return null;
} else {
return Int64Value.makeIntegerValue(currentValue);
}
}
public int position() {
if (currentValue > limit) {
return -1;
} else {
return (int)(currentValue - start + 1);
}
}
public void close() {
}
public int getLength() {
return (int)((limit - start) + 1);
}
/*@NotNull*/
public SequenceIterator getAnother() throws XPathException {
return new RangeIterator(start, limit);
}
/**
* Get properties of this iterator, as a bit-significant integer.
*
* @return the properties of this iterator. This will be some combination of
* properties such as {@link net.sf.saxon.om.SequenceIterator#GROUNDED}, {@link net.sf.saxon.om.SequenceIterator#LAST_POSITION_FINDER},
* and {@link net.sf.saxon.om.SequenceIterator#LOOKAHEAD}. It is always
* acceptable to return the value zero, indicating that there are no known special properties.
* It is acceptable for the properties of the iterator to change depending on its state.
*/
public int getProperties() {
return LOOKAHEAD | LAST_POSITION_FINDER | GROUNDED;
}
public SequenceIterator getReverseIterator() {
try {
return new ReverseRangeIterator(limit, start);
} catch (XPathException err) {
throw new AssertionError(err);
}
}
/**
* Return a Value containing all the items in the sequence returned by this
* SequenceIterator. This should be an "in-memory" value, not a Closure.
*
* @return the corresponding Value
*/
public GroundedValue materialize() {
return new IntegerRange(start, limit);
}
}