tpl_dynMapTree.H File Reference

Dynamic key-value map based on balanced binary search trees. More...

#include <type_traits>
#include <utility>
#include <tpl_dynSetTree.H>
#include <tpl_binTree.H>
#include <tpl_avl.H>
#include <tpl_rb_tree.H>
#include <tpl_rand_tree.H>
#include <tpl_treap.H>
#include <tpl_treapRk.H>
#include <tpl_splay_tree.H>

Include dependency graph for tpl_dynMapTree.H:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	Aleph::DynMapTree< Key, Data, Tree, Compare >
	Generic key-value map implemented on top of a binary search tree. More...
class	Aleph::DynMapBinTree< Key, Type, Compare >
	Dynamic map implemented with a classic binary search tree. More...
class	Aleph::DynMapAvlTree< Key, Type, Compare >
	Dynamic map implemented with an AVL tree. More...
class	Aleph::DynMapRbTree< Key, Type, Compare >
	Dynamic map implemented with a red-black tree. More...
class	Aleph::DynMapRandTree< Key, Type, Compare >
	Dynamic map implemented with a randomized BST. More...
class	Aleph::DynMapTreap< Key, Type, Compare >
	Dynamic map implemented with a treap. More...
class	Aleph::DynMapTreapRk< Key, Type, Compare >
	Dynamic map implemented with a ranked treap. More...
class	Aleph::DynMapSplayTree< Key, Type, Compare >
	Dynamic map implemented with a splay tree. More...

Namespaces
namespace	Aleph
	Main namespace for Aleph-w library functions.

Functions
template<typename T , class Op , class C >
DynMapTree< typename C::Item_Type, T >	Aleph::map_unify (const C &c, Op op)

Detailed Description

Dynamic key-value map based on balanced binary search trees.

This file provides DynMapTree, a generic associative container mapping keys to values. It supports logarithmic-time operations and can use various balanced BST implementations (AVL, Treap, Red-Black, etc.).

Author

Leandro Rabindranath León

Definition in file tpl_dynMapTree.H.