[Olsr-dev] [PATCH] fix hash handling for IP{v4,v6}

[Hagen Paul Pfeifer]

On Tue, 6 May 2008 07:48:50 +0200, Hannes Gredler <(spam-protected)>
wrote:

> there are other reasons for the speed,
> like the rewrites of the past 12 months in the areas of
> 
> -timer library
> -linkset handling
> -inplace SPF computation
> -RIB table management
> -netlink interface towards kernel
> -efficient message parsing

I was just kidding, I realized your efforts!

> in fact we have converted most data structures to use AVL trees rather
> than hashed lookups.

Nice! But one question about that: are there any advantages to use AVL
trees rather then rbtrees? I know that olsrd often remove elements from the
trees and then the re-balancing is more time and CPU consuming as the
rbtree.

Best regards