public DiffSummary<BoundingBox, BoundingBox> getResult() { DiffSummary<BoundingBox, BoundingBox> r = this.diffBoundsResult; if (r == null) { BoundingBox empty = new ReferencedEnvelope(crs); r = new DiffSummary<BoundingBox, BoundingBox>(empty, empty, empty); } return r; }
public DiffSummary<BoundingBox, BoundingBox> getResult() { DiffSummary<BoundingBox, BoundingBox> r = this.result; if (r == null) { BoundingBox empty = new ReferencedEnvelope(crs); r = new DiffSummary<BoundingBox, BoundingBox>(empty, empty, empty); } return r; }
@Override public void endTree(NodeRef left, NodeRef right) { String name = left == null ? right.name() : left.name(); if (NodeRef.ROOT.equals(name)) { BoundingBox lbounds = new ReferencedEnvelope(this.leftEnv); BoundingBox rbounds = new ReferencedEnvelope(this.rightEnv); BoundingBox merged; if (lbounds.isEmpty()) { merged = rbounds; } else if (rbounds.isEmpty()) { merged = lbounds; } else { merged = new ReferencedEnvelope(lbounds); merged.include(rbounds); } this.result = new DiffSummary<BoundingBox, BoundingBox>(lbounds, rbounds, merged); } }
@Override public void endTree(NodeRef left, NodeRef right) { String name = left == null ? right.name() : left.name(); if (NodeRef.ROOT.equals(name)) { BoundingBox lbounds = new ReferencedEnvelope(this.leftEnv); BoundingBox rbounds = new ReferencedEnvelope(this.rightEnv); BoundingBox merged; if (lbounds.isEmpty()) { merged = rbounds; } else if (rbounds.isEmpty()) { merged = lbounds; } else { merged = new ReferencedEnvelope(lbounds); merged.include(rbounds); } this.diffBoundsResult = new DiffSummary<BoundingBox, BoundingBox>(lbounds, rbounds, merged); } }