@Override public void verifyTree(final Set<Node> set, final WarnCallback warnings) { if (!set.contains(this)) { set.add(this); if (car != null) { if (car.parent != this) { warnings.warn("broken list car: " + this.getAddressName() + " -> " + car.getAddressName()); } car.verifyTree(set,warnings); } if (cdr != null) { if (cdr.parent != this) { warnings.warn("broken list cdr: " + this.getAddressName() + " -> " + cdr.getAddressName()); } cdr.verifyTree(set,warnings); } } }
@Override public void verifyTree(Set<Node> set, WarnCallback warnings) { if (!set.contains(this)) { set.add(this); if (car != null) { if (car.parent != this) { warnings.warn("broken list car: " + this.getAddressName() + " -> " + car.getAddressName()); } car.verifyTree(set,warnings); } if (cdr != null) { if (cdr.parent != this) { warnings.warn("broken list cdr: " + this.getAddressName() + " -> " + cdr.getAddressName()); } cdr.verifyTree(set,warnings); } } }
public void verifyTree(final Set<Node> set, final WarnCallback warnings) { if (!set.contains(this) && getChild() != null) { set.add(this); if (getChild().parent != this) { warnings.warn("broken link to child: " + this.getAddressName() + " -> " + getChild().getAddressName()); } getChild().verifyTree(set, warnings); } }
public void verifyTree(Set<Node> set, WarnCallback warnings) { if (!set.contains(this) && getChild() != null) { set.add(this); if (getChild().parent != this) { warnings.warn("broken link to child: " + this.getAddressName() + " -> " + getChild().getAddressName()); } getChild().verifyTree(set, warnings); } }