|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Treap with rank (order statistics). More...
#include <gsl/gsl_rng.h>#include <ahFunction.H>#include <tpl_binTreeOps.H>#include <ran_array.h>#include <treapNode.H>#include <ah-errors.H>Go to the source code of this file.
Classes | |
| class | Aleph::TreapRkNode_Data |
| class | Aleph::Treap_Rk_Node< Key > |
| class | Aleph::Treap_Rk_NodeVtl< Key > |
| class | Aleph::Gen_Treap_Rk< NodeType, Key, Compare > |
| Extended Treap with rank support for O(log n) indexed access. More... | |
| class | Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator |
| Iterator on nodes of the tree. More... | |
| struct | Aleph::Treap_Rk< Key, Compare > |
| Extended treap (a special type of randomized binary search tree) which manages selection and splitting for inorder position. More... | |
| struct | Aleph::Treap_Rk_Vtl< Key, Compare > |
| Extended treap (a special type of randomized binary search tree) which manages selection and splitting for inorder position. More... | |
Namespaces | |
| namespace | Aleph |
| Main namespace for Aleph-w library functions. | |
Treap with rank (order statistics).
Randomized BST augmented with subtree sizes. Simple implementation with expected O(log n).
Definition in file tpl_treapRk.H.