仓库指标
- 星标
- (13,277 个星标)
- PR 合并指标
- (平均合并 8天 19小时) (30 天内合并 10 个 PR)
描述
It is already possible to distribute 'trees' in Distributed Data CRDT's by encoding them into the generic ORMap data type. However, that may lead to surprising effects when you encode a 'move' operation as multiple updates of the map: since those updates are distributed independently (and conflicts in those updates are resolved independently), you might end up with a Map that doesn't encode the tree you expected. To avoid such problems, we might provide a Tree CRDT data type that has an explicit 'move' operation, so conflicts involving those can be handled while keeping the tree structure intact.
https://martin.kleppmann.com/papers/move-op.pdf might be interesting inspiration.