This patch implements splay trees.

Splay trees are self adjusting binary search trees that have several advantages over other trees:

*) They are faster for skewed access patterns since they contain a kind of
  builtin cache.

*) They do not use any memory for balancing information.

I will write reference documentation for them if the patch is accepted
into GLib.

The patch is made with diff -Pur.

S�ren Sandmann

You are viewing proxied material from ftp.icm.edu.pl. The copyright of proxied material belongs to its original authors. Any comments or complaints in relation to proxied material should be directed to the original authors of the content concerned. Please see the disclaimer for more details.