Tagged “algorithms”

look inside
it’s Dijkstra’s algorithm

Paper on arxiv

Cool write up, some interesting points:

• operational transforms are complicated (mainly used for text collab)
• last value written to server wins
• ignore incoming changes from server while writing, to avoid flicker
• fractional indexing for reordering
• for undo, if things were changed (by someone else), that history is updated to prevent conflicts with redo