I want to rewrite the AVL tree code in mm/mmap_avl.c.
Before I do that, though, I wanted to clean up the
existing code a bit. Here's a small patch to 2.2.3 that
gets rid of some unnecessary counters. After this,
I want to recode using the AVL tree routines from
Knuth vol. 3, storing the height difference of the
children at each node, rather than the height itself.
If you want to do it using Knuth vol. 3, then you might want to take a
look at my libavl, which uses his algorithm for insertion and an
algorithm I developed from his outline for deletion. All iterative,
of course, given the way that Knuth writes his algorithms.
You can find libavl at ftp://ftp.gnu.org/pub/gnu/avl. Currently
version 1.2.4 is there but 1.2.8 with minor nits fixed should be moved
there soon; 1.2.8 is currently in ftp://alpha.gnu.org/gnu.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/