3 ms·
Trivial CRDT implementations tend to be memory-heavy and to scale badly, especially after a long editing session. Decreasing the cost of tree traversal requires
by espadrine 11y ago
Trivial CRDT implementations tend to be memory-heavy and to scale badly, especially after a long editing session. Decreasing the cost of tree traversal requires smart garbage collection, balancing and merging of nodes.
- gritzko 11y agoCRDT is heavy on metadata and thus requires some compression and garbage collection techniques. In this implementation, every letter is a JavaScript object. Performance was not an objective, I guess.