Here we have update where we use the iterator of primatry base nodes to go through each subnode of an object through the DFS method,
then our "save_node" function will take in a map of the first object , keys as uuid and values as map in the object , and compare it with the second object that we traverse, for each node in the second object that we are walking, we look up the uuid of that object, then we compare, we take the diff on the json of the subnodes , then we create appropriate patch and removes , we line up all the patch and removes and do them from last one up, based on the node logic I discussed with Ludwig .
Changes
Known Issues
Notes
Checklist
[ ] My name is on the list of contributors (CONTRIBUTORS.md) in the pull request source branch.
[ ] I have updated the documentation to reflect my changes.
[ ] My code changes have been verified by automated tests and pass all relevant test scenarios.
Description
Here we have update where we use the iterator of primatry base nodes to go through each subnode of an object through the DFS method,
then our "save_node" function will take in a map of the first object , keys as uuid and values as map in the object , and compare it with the second object that we traverse, for each node in the second object that we are walking, we look up the uuid of that object, then we compare, we take the diff on the json of the subnodes , then we create appropriate patch and removes , we line up all the patch and removes and do them from last one up, based on the node logic I discussed with Ludwig .
Changes
Known Issues
Notes
Checklist
CONTRIBUTORS.md
) in the pull request source branch.