Rewrite addWriteRange to erase more efficiently #11

Closed
opened 2024-03-16 00:15:02 +00:00 by andrew · 1 comment
Owner

It should be possible to avoid traversing through all the intermediate nodes in the interval in lexicographic order. You just need to free them. This would probably look similar to how checkRangeRead traverses nodes in an interval. We should also be able to get away with less bookkeeping about which nodes we have to update if we invalidate them.

It should be possible to avoid traversing through all the intermediate nodes in the interval in lexicographic order. You just need to free them. This would probably look similar to how checkRangeRead traverses nodes in an interval. We should also be able to get away with less bookkeeping about which nodes we have to update if we invalidate them.
andrew added this to the (deleted) project 2024-03-16 00:15:02 +00:00
andrew modified the project from (deleted) to (deleted) 2024-03-19 22:45:27 +00:00
andrew added the
enhancement
label 2024-03-31 22:31:18 +00:00
andrew added this to the 1.1 milestone 2024-04-02 00:33:06 +00:00
Author
Owner

Abandoned: too much complexity for too little value. The existing code is already pretty good it seems.

Abandoned: too much complexity for too little value. The existing code is already pretty good it seems.
Sign in to join this conversation.
1 Participants
Notifications
Due Date
No due date set.
Dependencies

No dependencies set.

Reference: weaselab/conflict-set#11
No description provided.