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
Blocking a user prevents them from interacting with repositories, such as opening or commenting on pull requests or issues. Learn more about blocking a user.
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.
Abandoned: too much complexity for too little value. The existing code is already pretty good it seems.