1.2.0 • Published 3 years ago
@codesandbox/crdt-tree v1.2.0
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.
Additional References
Usage
See test/tree.test.ts.
1.3.0-beta.5
3 years ago
1.3.0-beta.6
3 years ago
1.3.0-beta.1
3 years ago
1.3.0-beta.2
3 years ago
1.3.0-beta.3
3 years ago
1.3.0-beta.4
3 years ago
1.2.0
3 years ago
1.1.4
3 years ago
1.1.3
3 years ago
1.1.2
3 years ago
1.1.1
3 years ago
1.1.0
3 years ago
1.0.0
3 years ago