@Override public void endTree(NodeRef left, NodeRef right) { if (intersects(left, right)) { super.endTree(left, right); } }
@Override public boolean tree(NodeRef left, NodeRef right) { if (intersects(left, right)) { return super.tree(left, right); } return false; }
private DiffObjectCount count(RevTree left, RevTree right) { PreOrderDiffWalk visitor = new PreOrderDiffWalk(left, right, odb, odb); DiffCountConsumer consumer = new DiffCountConsumer(odb); visitor.walk(consumer); DiffObjectCount count = consumer.get(); return count; }
public String toString() { if (getType().equals(TYPE.MODIFIED)) { return attributeValueAsString(oldValue) + " -> " + attributeValueAsString(newValue); } else if (getType().equals(TYPE.ADDED)) { return "[MISSING] -> " + attributeValueAsString(newValue); } else if (getType().equals(TYPE.REMOVED)) { return attributeValueAsString(oldValue) + " -> [MISSING]"; } else { return "[NO CHANGE] -> " + attributeValueAsString(oldValue); } }
@Override public boolean bucket(NodeRef lparent, NodeRef rparent, BucketIndex bucketIndex, Bucket left, Bucket right) { ObjectId lmd = md(lparent); ObjectId rmd = md(rparent); if (intersects(left, lmd) || intersects(right, rmd)) { return super.bucket(lparent, rparent, bucketIndex, left, right); } return false; }
@Override public boolean feature(NodeRef left, NodeRef right) { boolean continuteTraversal = !isCancelled() && delegate.feature(left, right); if (!continuteTraversal) { abortTraversal(); } return continuteTraversal; }
@Override public AttributeDiff reversed() { if (type == TYPE.MODIFIED) { return new GeometryAttributeDiff(this.diff.reversed()); } else { return new GeometryAttributeDiff(oldGeometry, newGeometry); } }
@Override public void endBucket(NodeRef lparent, NodeRef rparent, BucketIndex bucketIndex, Bucket left, Bucket right) { ObjectId lmd = md(lparent); ObjectId rmd = md(rparent); if (intersects(left, lmd) || intersects(right, rmd)) { super.endBucket(lparent, rparent, bucketIndex, left, right); } }
@Override public boolean feature(NodeRef left, NodeRef right) { if (intersects(left, right)) { return super.feature(left, right); } return true; }
@Override public boolean bucket(NodeRef leftParent, NodeRef rightParent, BucketIndex bucketIndex, Bucket left, Bucket right) { return !isCancelled() && delegate.bucket(leftParent, rightParent, bucketIndex, left, right); } }
/** * @param featurePath path o a feature node (e.g. {@code 'roads/road1'} * @return {@code true} if {@code featurePath} is a child of, or equals to, one of the path * filters. */ public boolean featureApplies(final String parent, final String node) { List<String> path = toPath(parent, node); boolean applies = pathFilter.applies(path); return applies; } }
public boolean bucketApplies(BucketIndex bucketIndex) { final int[] myIndices = getBucketIndices(); final int[] bucketIndices = bucketIndex.getIndexPath(); for (int i = 0; i < bucketIndices.length; i++) { int ours = myIndices[i]; int theirs = bucketIndices[i]; if (ours != theirs) { return false; } } return true; }
private DiffObjectCount count(RevTree left, RevTree right) { PreOrderDiffWalk visitor = new PreOrderDiffWalk(left, right, odb, odb); DiffCountConsumer consumer = new DiffCountConsumer(odb); visitor.walk(consumer); DiffObjectCount count = consumer.get(); return count; }
public String toString() { if (getType().equals(TYPE.MODIFIED)) { return attributeValueAsString(oldValue) + " -> " + attributeValueAsString(newValue); } else if (getType().equals(TYPE.ADDED)) { return "[MISSING] -> " + attributeValueAsString(newValue); } else if (getType().equals(TYPE.REMOVED)) { return attributeValueAsString(oldValue) + " -> [MISSING]"; } else { return "[NO CHANGE] -> " + attributeValueAsString(oldValue); } }
@Override public boolean bucket(NodeRef lparent, NodeRef rparent, BucketIndex bucketIndex, Bucket left, Bucket right) { ObjectId lmd = md(lparent); ObjectId rmd = md(rparent); if (intersects(left, lmd) || intersects(right, rmd)) { return super.bucket(lparent, rparent, bucketIndex, left, right); } return false; }
@Override public void endTree(NodeRef left, NodeRef right) { if (intersects(left, right)) { super.endTree(left, right); } }
@Override public boolean feature(NodeRef left, NodeRef right) { if (intersects(left, right)) { return super.feature(left, right); } return true; }