@Override public boolean feature(@Nullable NodeRef left, @Nullable NodeRef right) { stats.allFeatures.incrementAndGet(); return super.feature(left, right); }
@Override public boolean feature(@Nullable NodeRef left, @Nullable NodeRef right) { stats.acceptedFeatures.incrementAndGet(); return super.feature(left, right); }
@Override public boolean feature(@Nullable NodeRef left, @Nullable NodeRef right) { stats.allFeatures.incrementAndGet(); return super.feature(left, right); }
private boolean flush() { final int size = featureEvents.size(); if (size == 0) { return true; } int adds = 0, removes = 0; for (Iterator<FeatureEvent> it = featureEvents.values().iterator(); it.hasNext();) {//@formatter:off FeatureEvent fe = it.next(); it.remove(); NodeRef left = fe.left; NodeRef right = fe.right; if(left == null) adds++; if(right == null) removes++;//@formatter:on if (!super.feature(left, right)) { return false; } } if (log.isInfoEnabled()) { log.info(String.format( "Flushed %,d of %,d feature events: +%,d -%,d ~%,d, max held features: %,d", size, totalFeatureEvents, adds, removes, totalMerged, maxHeldFeatures)); } return true; }
@Override public boolean feature(@Nullable NodeRef left, @Nullable NodeRef right) { stats.acceptedFeatures.incrementAndGet(); return super.feature(left, right); }
@Override public boolean feature(final NodeRef left, final NodeRef right) { if (featureApplies(left, right)) { super.feature(left, right); } return true; }
@Override public boolean feature(NodeRef left, NodeRef right) { if (intersects(left, right)) { return super.feature(left, right); } return true; }
@Override public boolean feature(NodeRef left, NodeRef right) { String featurePath = left == null ? right.path() : left.path(); if (filter.featureApplies(featurePath)) { return super.feature(left, right); } return true; }
@Override public boolean feature(NodeRef left, NodeRef right) { if (intersects(left, right)) { return super.feature(left, right); } return true; }
@Override public boolean feature(NodeRef left, NodeRef right) { if (predicate.apply(left) || predicate.apply(right)) { super.feature(left, right); } return true; }
@Override public boolean feature(NodeRef left, NodeRef right) { if (predicate.apply(left) || predicate.apply(right)) { super.feature(left, right); } return true; }
@Override public boolean feature(NodeRef left, NodeRef right) { String parent = left == null ? right.getParentPath() : left.getParentPath(); String node = left == null ? right.name() : left.name(); if (filter.featureApplies(parent, node)) { return super.feature(left, right); } return true; }
@Override public boolean feature(NodeRef left, NodeRef right) { if (count.incrementAndGet() > limit) { return false; } return super.feature(left, right); } }
@Override public boolean feature(final NodeRef left, final NodeRef right) { if (featureApplies(left, right)) { super.feature(left, right); } return true; }
@Override public boolean feature(NodeRef left, NodeRef right) { if (count.incrementAndGet() > limit) { return false; } return super.feature(left, right); } }