Merging is always 3-way, but what does this work if two keys are created concurrently and there is no old value? it also says:
the conventional approach is more invasive as it requires the data structure to carry more information about the operation history (for instance conflict-free replicated datatypes, which relies on unbounded vector clocks).
But isn’t the solution of storing all the tips unbounded as well?
the openmirage project is doing some very exciting stuff! i am impressed both by the scope of the project and the momentum behind it.
Merging is always 3-way, but what does this work if two keys are created concurrently and there is no old value? it also says:
But isn’t the solution of storing all the tips unbounded as well?