CountingNodeVisitor v = new CountingNodeVisitor(max); v.visit(index); count = v.getEstimatedCount(); if (count >= max) { CountingNodeVisitor v = new CountingNodeVisitor(max); v.visit(s); count += v.getEstimatedCount();
CountingNodeVisitor v = new CountingNodeVisitor(max); v.visit(index); count = v.getEstimatedCount(); if (count >= max) { CountingNodeVisitor v = new CountingNodeVisitor(max); v.visit(s); count += v.getEstimatedCount();
CountingNodeVisitor v = new CountingNodeVisitor(max); v.visit(index); count = v.getEstimatedCount(); if (count >= max) { CountingNodeVisitor v = new CountingNodeVisitor(max); v.visit(s); count += v.getEstimatedCount();
@Override public void visit(NodeState state) { if (state.hasProperty("match")) { count++; depthTotal += depth; } if (count < maxCount) { depth++; for (ChildNodeEntry entry : state.getChildNodeEntries()) { if (count >= maxCount) { break; } visit(entry.getNodeState()); } depth--; } }
@Override public void visit(NodeState state) { if (state.hasProperty("match")) { count++; depthTotal += depth; } if (count < maxCount) { depth++; for (ChildNodeEntry entry : state.getChildNodeEntries()) { if (count >= maxCount) { break; } visit(entry.getNodeState()); } depth--; } }
@Override public void visit(NodeState state) { if (state.hasProperty("match")) { count++; depthTotal += depth; } if (count < maxCount) { depth++; for (ChildNodeEntry entry : state.getChildNodeEntries()) { if (count >= maxCount) { break; } visit(entry.getNodeState()); } depth--; } }