8cf71b7f1c
In this commit we implement algorithm for CRDT trees from https://martin.klepmann.com/papers/move-op.pdf Each tree is identified by the ID of a container it belongs to and the tree name itself. Essentially, it is a sequence of operations which should be applied in chronological order to get a usual tree representation. There are 2 backends for now: bbolt database and in-memory. In-memory backend is here for debugging and will eventually act as a memory-cache for the on-disk database. Signed-off-by: Evgenii Stratonikov <evgeniy@nspcc.ru> |
||
|---|---|---|
| .. | ||
| blobovnicza | ||
| blobstor | ||
| engine | ||
| internal/log | ||
| metabase | ||
| pilorama | ||
| shard | ||
| util | ||
| writecache | ||