01: // Copyright (c) 2003 Per M.A. Bothner.
02: // This is free software; for terms and warranty disclaimer see ./COPYING.
03:
04: package gnu.kawa.xml;
05:
06: import gnu.lists.*;
07:
08: /** Used to implement a following-sibling:: step in a path expression. */
09:
10: public class PrecedingSiblingAxis extends TreeScanner {
11: public static PrecedingSiblingAxis make(NodePredicate type) {
12: PrecedingSiblingAxis axis = new PrecedingSiblingAxis();
13: axis.type = type;
14: return axis;
15: }
16:
17: public void scan(AbstractSequence seq, int ipos,
18: PositionConsumer out) {
19: int end = seq.endPos();
20: int parent = seq.parentPos(ipos);
21: if (parent == end)
22: return;
23: int child = seq.firstChildPos(parent);
24: if (child == 0)
25: return;
26: if (type.isInstancePos(seq, child))
27: out.writePosition(seq, child);
28: for (;;) {
29: child = seq.nextMatching(child, type, ipos, false);
30: if (child == 0)
31: break;
32: out.writePosition(seq, child);
33: }
34: }
35: }
|