At the moment all elements are in both base and patch will eventually be present in the merge result. Although in some use case (e.g. html forms) this may not be the desirable result.
LeXeMe should therefore introduce the concept of a leaf element, i.e. an element whose sub tree won't be merged after a match but either replaced by the base or the patch elements sub tree.
This can be done by adding a new attribute to the handling element that indicates such a leaf element.
At the moment all elements are in both base and patch will eventually be present in the merge result. Although in some use case (e.g. html forms) this may not be the desirable result.
LeXeMe should therefore introduce the concept of a leaf element, i.e. an element whose sub tree won't be merged after a match but either replaced by the base or the patch elements sub tree.
This can be done by adding a new attribute to the
handlingelement that indicates such a leaf element.