You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A thought: we could store every version of the state tree, and we could do it efficiently using reverse deltas like RCS did. The deltas could just be a path and a new (actually old) version of the state at that location. The reverse of a sequence of replace and delete operations is another sequence of replace and delete operations.
Here's the cool part: the BsonSurgeon component we developed for #2 could work, almost unchanged, to compose an older version of the state tree given the latest version and a sequence of reverse deltas!
reacted with thumbs up emoji reacted with thumbs down emoji reacted with laugh emoji reacted with hooray emoji reacted with confused emoji reacted with heart emoji reacted with rocket emoji reacted with eyes emoji
Uh oh!
There was an error while loading. Please reload this page.
-
A thought: we could store every version of the state tree, and we could do it efficiently using reverse deltas like RCS did. The deltas could just be a path and a new (actually old) version of the state at that location. The reverse of a sequence of replace and delete operations is another sequence of replace and delete operations.
Here's the cool part: the
BsonSurgeoncomponent we developed for #2 could work, almost unchanged, to compose an older version of the state tree given the latest version and a sequence of reverse deltas!Beta Was this translation helpful? Give feedback.
All reactions