Open j1nse opened 5 years ago
two similar tree merge into one like this: Node('/a') └── Node('/a/b') and Node('/a') └── Node('/a/c') then: Node('/a') |── Node('/a/c') └── Node('/a/b')
With option to specify a conflict resolving function, would be great.
Hi, this is implemented over here.
https://bigtree.readthedocs.io/en/latest/others/tips.html#merging-trees
two similar tree merge into one like this: Node('/a') └── Node('/a/b') and Node('/a') └── Node('/a/c') then: Node('/a') |── Node('/a/c') └── Node('/a/b')