Richard Braun, on Wed 20 Apr 2016 11:40:39 +0200, wrote: > I wrote an incomplete vm_map_enter in X15 [1] that should be helpful. > In addition to a free hint pointer, it uses the red-black tree, making > all allocations at worst O(n).
Well, the current algorithm also has O(n) worst case :) But I guess with the red-black tree you have less than O(n) amortised complexity? Samuel
