Re: Build times of hurd and glibc for different versions of gnumach, hurd and glibc

[Richard Braun]

On Wed, Apr 20, 2016 at 11:44:36AM +0200, Samuel Thibault wrote:
> 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?

Err, O(log(n)) of course.

-- 
Richard Braun