@Override
public Iter iter(final QueryContext ctx) throws QueryException {
final Iter iter = ctx.iter(root);
final Value cv = ctx.value;
final long cs = ctx.size;
final long cp = ctx.pos;
// cache results to support last() function
final ItemCache ic = new ItemCache();
for (Item i; (i = iter.next()) != null; ) ic.add(i);
// evaluate predicates
for (final Expr p : pred) {
final long is = ic.size();
ctx.size = is;
ctx.pos = 1;
int c = 0;
for (int s = 0; s < is; ++s) {
ctx.value = ic.get(s);
if (p.test(ctx, input) != null) ic.set(ic.get(s), c++);
ctx.pos++;
}
ic.size(c);
}
ctx.value = cv;
ctx.size = cs;
ctx.pos = cp;
return ic;
}
@Override
public NodeIter iter(final QueryContext ctx) throws QueryException {
final Value v = checkCtx(ctx);
if (!v.type.isNode()) NODESPATH.thrw(input, AxisStep.this, v.type);
final AxisIter ai = axis.iter((ANode) v);
final NodeCache nc = new NodeCache();
for (ANode n; (n = ai.next()) != null; ) if (test.eval(n)) nc.add(n.finish());
// evaluate predicates
for (final Expr p : preds) {
ctx.size = nc.size();
ctx.pos = 1;
int c = 0;
for (int n = 0; n < nc.size(); ++n) {
ctx.value = nc.get(n);
final Item i = p.test(ctx, input);
if (i != null) {
// assign score value
nc.get(n).score(i.score());
nc.item[c++] = nc.get(n);
}
ctx.pos++;
}
nc.size(c);
}
return nc;
}
@Override
public Iter iter(final QueryContext ctx) throws QueryException {
final Value cv = ctx.value;
final long cs = ctx.size;
final long cp = ctx.pos;
try {
Value r = root != null ? ctx.value(root) : cv;
if (!cache
|| citer == null
|| lvalue.type != NodeType.DOC
|| r.type != NodeType.DOC
|| !((ANode) lvalue).is((ANode) r)) {
lvalue = r;
citer = new NodeCache().random();
if (r != null) {
final Iter ir = ctx.iter(r);
while ((r = ir.next()) != null) {
ctx.value = r;
iter(0, citer, ctx);
}
} else {
ctx.value = null;
iter(0, citer, ctx);
}
citer.sort();
} else {
citer.reset();
}
return citer;
} finally {
ctx.value = cv;
ctx.size = cs;
ctx.pos = cp;
}
}
