@Override public MutableTree clone() { MutableTree clone = new MutableTree(node); for (MutableTree child : this.childTrees.values()) { clone.childTrees.put(child.getNode().getName(), child.clone()); } return clone; } }
@Override public MutableTree clone() { MutableTree clone = new MutableTree(node); for (MutableTree child : this.childTrees.values()) { clone.childTrees.put(child.getNode().getName(), child.clone()); } return clone; } }
@Override protected RevTree _call() { checkArgument(root != null, "root tree not provided"); if (childTreeRemoves.isEmpty() && childTreeUpdates.isEmpty()) { return root; } // all the current child trees of root final MutableTree mutableRoot = load(root); MutableTree updatedRoot = mutableRoot.clone(); this.childTreeRemoves.forEach((path) -> { updatedRoot.removeChild(path); }); this.childTreeUpdates.values().forEach((r) -> { updatedRoot.forceChild(r.getParentPath(), r.getNode()); }); ObjectDatabase db = objectDatabase(); RevTree newRoot = updatedRoot.build(db); return newRoot; }
@Override protected RevTree _call() { checkArgument(root != null, "root tree not provided"); if (childTreeRemoves.isEmpty() && childTreeUpdates.isEmpty()) { return root; } // all the current child trees of root final MutableTree mutableRoot = load(root); MutableTree updatedRoot = mutableRoot.clone(); this.childTreeRemoves.forEach((path) -> { updatedRoot.removeChild(path); }); this.childTreeUpdates.values().forEach((r) -> { updatedRoot.forceChild(r.getParentPath(), r.getNode()); }); ObjectDatabase db = objectDatabase(); RevTree newRoot = updatedRoot.build(db); return newRoot; }
final MutableTree oldLeftTree = treeDifference.getLeftTree().clone(); Preconditions.checkState(oldLeftTree.equals(treeDifference.getLeftTree()));
final MutableTree oldLeftTree = treeDifference.getLeftTree().clone(); Preconditions.checkState(oldLeftTree.equals(treeDifference.getLeftTree()));