Lines Matching +full:self +full:- +full:advertising

14 .\" 3. All advertising materials mentioning features or use of this software
105 .Nd "implementations of splay and rank-balanced (wavl) trees"
211 splay trees and rank-balanced (wavl) trees.
244 A splay tree is a self-organizing data structure.
270 .Bd -ragged -offset indent
330 .Bd -ragged -offset indent
353 .Bd -literal -offset indent
366 .Bd -literal -offset indent
373 .Bd -ragged -offset indent
380 .Sh RANK-BALANCED TREES
381 Rank-balanced (RB) trees are a framework for defining height-balanced
382 binary search trees, including AVL and red-black trees.
389 (wavl) trees, which combine the best aspects of AVL and red-black
392 with the same worst-case time as red-black trees offer, and with
395 restructuring, in the worst case, than either AVL or red-black trees
397 Removals can lead to a tree almost as unbalanced as a red-black
400 A rank-balanced tree is headed by a structure defined by the
405 .Bd -ragged -offset indent
505 The rank-balanced tree can also be initialized statically by using the
508 .Bd -ragged -offset indent
559 .Bd -literal -offset indent
582 .Bd -ragged -offset indent
611 macro should be used to check whether a rank-balanced tree is empty.
670 The following example demonstrates how to declare a rank-balanced tree
677 .Bd -literal -offset 3n
693 	return (e1->i < e2->i ? -1 : e1->i > e2->i);
699 	e->sum = e->i;
701 		e->sum += RB_LEFT(e, entry)->sum;
703 		e->sum += RB_RIGHT(e, entry)->sum;
726 		printf("%d", n->i);
728 		printf("%d(", n->i);
745 		n->i = testdata[i];
750 		printf("%d\en", n->i);
753 	printf("\enSum of values = %d\en", RB_ROOT(&head)->sum);
759 .Bd -literal -offset indent
773 .Bd -literal -offset indent
804 .%T "Rank-Balanced Trees"
805 .%U "http://sidsen.azurewebsites.net/papers/rb-trees-talg.pdf"