3 ms·
That does sound useful, although I'm having some trouble thinking of what for exactly. :-) And indeed, I don't recall seeing something like that. At a first gl
by vanviegen 4y ago
That does sound useful, although I'm having some trouble thinking of what for exactly. :-)
And indeed, I don't recall seeing something like that. At a first glance O(log n) seems easy to do in the average case, but perhaps not in the worst case.
- socksy 4y agoI suppose it's quite similar to the idea of Bagwell's persistent data structures[1] — those are particularly useful for lock free coding and with a high enough branching factor could be not as much overhead as a linked list or just plain copying. [1] https://hypirion.com/musings/understanding-persistent-vector-pt-1 https://hypirion.com/musings/understanding-persistent-vector...