101102103104105106107108109110111
_index.put(value, nodes); nodes.add(node); // Because nodes are added in document order, // duplicates can be eliminated easily at this stage. } else if (node != nodes.at(nodes.cardinality() - 1)) { nodes.add(node); } } /**
105106107108109110111112113114115
7475767778798081828384
!matchesFrom(next)) { ancestors.add(next); } // Create an array of counters final int nAncestors = ancestors.cardinality(); final int[] counters = new int[nAncestors]; for (int i = 0; i < nAncestors; i++) { counters[i] = Integer.MIN_VALUE; }
6364656667686970717273