An implementation of a tree Conflict-Free Replicated Data Type (CRDT).
This crate aims to be an accurate implementation of the tree crdt algorithm described in the paper:
A highly-available move operation for replicated trees and distributed filesystems by M. Kleppmann, et al.
Please refer to the paper for a description of the algorithm's properties.
For clarity, data structures in this implementation are named the same as in the paper (State, Tree) or close to (OpMove --> Move, LogOpMove --> LogOp). Some are not explicitly named in the paper, such as TreeId,TreeMeta, TreeNode, Clock.
See test/tree.test.ts.