data sctructures

2006-02-08 Thread Gustavo Rios
i saw openbsd uses red-black trees inside. I could not figure it out a motivation for not using AVL, SPL or even something based on http://user.it.uu.se/~arnea/abs/simp.html. I could not figure what would it be the best/average/worst cost, i.e., O(f(n)) for those method above. Thanks a lot for

Re: data sctructures

2006-02-08 Thread Gustavo Rios
2006/2/8, Otto Moerbeek [EMAIL PROTECTED]: On Wed, 8 Feb 2006, Gustavo Rios wrote: i saw openbsd uses red-black trees inside. I could not figure it out a motivation for not using AVL, SPL or even something based on http://user.it.uu.se/~arnea/abs/simp.html. I could not figure what

Re: data sctructures

2006-02-08 Thread Ted Unangst
On 2/8/06, Gustavo Rios [EMAIL PROTECTED] wrote: I just wanted to know which would it be the best choice, and why? For instance, i don't know the best/average/worst case for the method supplied. I don't have a simple source of reference where i could see these metrics, prefereable on the

Re: data sctructures

2006-02-08 Thread Claudio Jeker
On Wed, Feb 08, 2006 at 06:47:15PM -0200, Gustavo Rios wrote: 2006/2/8, Otto Moerbeek [EMAIL PROTECTED]: On Wed, 8 Feb 2006, Gustavo Rios wrote: i saw openbsd uses red-black trees inside. I could not figure it out a motivation for not using AVL, SPL or even something based on

Re: data sctructures

2006-02-08 Thread Gustavo Rios
Don't get me wrong, i am very confident with openbsd. Although i am very confident using the openbsd native support for my needs, all of them have some thing i dislike. First: i would really enjoy worst case O(log2 n), none of the method i know so far make such garantee. Another problem is about

Re: data sctructures

2006-02-08 Thread Claudio Jeker
On Wed, Feb 08, 2006 at 09:34:02PM -0200, Gustavo Rios wrote: Don't get me wrong, i am very confident with openbsd. Although i am very confident using the openbsd native support for my needs, all of them have some thing i dislike. First: i would really enjoy worst case O(log2 n), none of

Re: data sctructures

2006-02-08 Thread Otto Moerbeek
On Wed, 8 Feb 2006, Gustavo Rios wrote: 2006/2/8, Otto Moerbeek [EMAIL PROTECTED]: On Wed, 8 Feb 2006, Gustavo Rios wrote: i saw openbsd uses red-black trees inside. I could not figure it out a motivation for not using AVL, SPL or even something based on

Re: data sctructures

2006-02-08 Thread Otto Moerbeek
On Wed, 8 Feb 2006, Gustavo Rios wrote: Don't get me wrong, i am very confident with openbsd. Although i am very confident using the openbsd native support for my needs, all of them have some thing i dislike. First: i would really enjoy worst case O(log2 n), none of the method i know so