Merge two property trees, producing a new tree. More...
Merge two property trees, producing a new tree.
If the nodes are both leaves, value comes from left leaf. Otherwise, The children are examined. If a left and right child are "identical," they are merged and the result placed in the children of the result. Otherwise the left children are placed after the right children in the result.
Nodes are considered equal if their names and indexes are equal.