tpl_dynSetTree.H File Reference

Dynamic set implementations based on balanced binary search trees. More...

#include <cassert>
#include <typeinfo>
#include <type_traits>
#include <utility>
#include <algorithm>
#include <memory>
#include <stdexcept>
#include <ah-errors.H>
#include <ah-args-ctor.H>
#include <ahIterator.H>
#include <ah-zip.H>
#include <ah-arena.H>
#include <tpl_binNodeUtils.H>
#include <tpl_binNodeXt.H>
#include <tpl_binTree.H>
#include <tpl_treap.H>
#include <tpl_treapRk.H>
#include <tpl_avl.H>
#include <tpl_avlRk.H>
#include <tpl_rand_tree.H>
#include <tpl_rb_tree.H>
#include <tpl_rbRk.H>
#include <tpl_tdRbTree.H>
#include <tpl_tdRbTreeRk.H>
#include <tpl_hRbTree.H>
#include <tpl_hRbTreeRk.H>
#include <tpl_splay_tree.H>
#include <tpl_splay_treeRk.H>

Include dependency graph for tpl_dynSetTree.H:

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

Go to the source code of this file.

Classes
class	Aleph::AbstractTreeNodeAllocator< Node >
class	Aleph::DftTreeNodeAllocator< Node >
struct	Aleph::ArenaTreeAllocator< Node >
struct	Aleph::CmpContainer< Container, T >
class	Aleph::DynSetTree< Key, Tree, Compare >
	Dynamic set backed by balanced binary search trees with automatic memory management. More...
struct	Aleph::DynSetTree< Key, Tree, Compare >::Has_Range_Methods< T >
struct	Aleph::DynSetTree< Key, Tree, Compare >::Node_Op< Key_Op >
struct	Aleph::DynSetTree< Key, Tree, Compare >::Iterator
class	Aleph::DynSetBinTree< Key, Compare >
	Dynamic set implemented using binary search trees of type BinTree<Key>. More...
class	Aleph::DynSetAvlTree< Key, Compare >
	Dynamic set implemented using AVL binary search trees of type Avl_Tree<Key>. More...
class	Aleph::DynSetSplayTree< Key, Compare >
	Dynamic set implemented using splay binary search trees of type Splay_Tree<Key>. More...
class	Aleph::DynSetSplayRkTree< Key, Compare >
	Dynamic set implemented using splay trees with rank support of type Splay_Tree_Rk<Key>. More...
class	Aleph::DynSetSplayRkTree< Key, Compare >::Iterator
class	Aleph::DynSetRandTree< Key, Compare >
	Dynamic set implemented using randomized binary search trees of type Rand_Tree<Key>. More...
class	Aleph::DynSetRandTree< Key, Compare >::Iterator
class	Aleph::DynSetTreap< Key, Compare >
	Dynamic set implemented using randomized treap binary search trees of type Treap<Key>. More...
class	Aleph::DynSetTreapRk< Key, Compare >
	Dynamic set implemented using extended treap binary search trees with rank support of type Treap_Rk<Key>. More...
class	Aleph::DynSetTreapRk< Key, Compare >::Iterator
class	Aleph::DynSetAvlRkTree< Key, Compare >
	Dynamic set implemented using extended AVL binary search trees with rank support of type Avl_Tree_Rk<Key>. More...
class	Aleph::DynSetAvlRkTree< Key, Compare >::Iterator
class	Aleph::DynSetRbTree< Key, Compare >
	Dynamic set implemented using Red-Black binary search trees of type Rb_Tree<Key> (bottom-up implementation). More...
class	Aleph::DynSetTdRbTree< Key, Compare >
	Dynamic set implemented using Top-Down Red-Black binary search trees of type TdRbTree<Key>. More...
class	Aleph::DynSetRbRkTree< Key, Compare >
	Dynamic set implemented using extended Red-Black binary search trees with rank support of type Rb_Tree_Rk<Key> (bottom-up implementation). More...
class	Aleph::DynSetRbRkTree< Key, Compare >::Iterator
class	Aleph::DynSetTdRbRkTree< Key, Compare >
	Dynamic set implemented using Top-Down Red-Black binary search trees with rank support of type TdRbTreeRk<Key>. More...
class	Aleph::DynSetTdRbRkTree< Key, Compare >::Iterator
class	Aleph::DynSetHtdRbTree< Key, Compare >
	Dynamic set implemented using Hybrid Top-Down/Bottom-Up Red-Black trees of type HtdRbTree<Key>. More...
class	Aleph::DynSetHtdRbTree< Key, Compare >::Iterator
class	Aleph::DynSetHtdRbRkTree< Key, Compare >
	Dynamic set implemented using Hybrid Red-Black trees with rank support of type HtdRbTreeRk<Key>. More...
class	Aleph::DynSetHtdRbRkTree< Key, Compare >::Iterator

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

Macros
#define	SETTREE_ITOR(Name, Key, Cmp)

Functions
template<typename T , class Op , class C >
DynSetTree< T >	Aleph::set_unify (const C &c, Op op)

Detailed Description

Dynamic set implementations based on balanced binary search trees.

This file provides DynSetTree, a generic dynamic set backed by various balanced BST implementations (AVL, Treap, Red-Black, Splay, etc.). It offers logarithmic-time insertion, deletion, and search operations with support for ranked operations and functional programming patterns.

Author

Leandro Rabindranath León

Definition in file tpl_dynSetTree.H.

Macro Definition Documentation

SETTREE_ITOR

#define SETTREE_ITOR	(		Name,
			Key,
			Cmp
	)

Value:

  class Iterator : public DynSetTree<Key, Name, Cmp>::Iterator  \
  {                                                             \
  public:                                                       \
    Iterator() : DynSetTree<Key, Name, Cmp>::Iterator()         \
      { /* empty */ }                                           \
                                                                \
    Iterator(DynSetTree<Key, Name, Cmp> & tree)                 \
      : DynSetTree<Key, Name, Cmp>::Iterator(tree)              \
      { /* empty */ }                                           \
  };

Definition at line 1513 of file tpl_dynSetTree.H.