tpl_dynSetTree.H

/*
  This file is part of Aleph system

  Copyright (c) 2002, 2003, 2004, 2005, 2006
  UNIVERSITY LOS ANDES (ULA) Merida - REPÚBLICA BOLIVARIANA DE VENEZUELA  

  - Center of Studies in Microelectronics & Distributed Systems (CEMISID) 
  - ULA Computer Science Department
  - FUNDACITE Mérida - Ministerio de Ciencia y Tecnología

  PERMISSION TO USE, COPY, MODIFY AND DISTRIBUTE THIS SOFTWARE AND ITS
  DOCUMENTATION IS HEREBY GRANTED, PROVIDED THAT BOTH THE COPYRIGHT
  NOTICE AND THIS PERMISSION NOTICE APPEAR IN ALL COPIES OF THE
  SOFTWARE, DERIVATIVE WORKS OR MODIFIED VERSIONS, AND ANY PORTIONS
  THEREOF, AND THAT BOTH NOTICES APPEAR IN SUPPORTING DOCUMENTATION.

  Aleph is distributed in the hope that it will be useful, but WITHOUT
  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
  or FITNESS FOR A PARTICULAR PURPOSE.

  UNIVERSIDAD DE LOS ANDES requests users of this software to return to 

  Leandro Leon
  CEMISID 
  Ed La Hechicera 
  3er piso, ala sur
  Facultad de Ingenieria 
  Universidad de Los Andes 
  Merida - REPÚBLICA BOLIVARIANA DE VENEZUELA    or

  lrleon@ula.ve

  any improvements or extensions that they make and grant Universidad 
  de Los Andes (ULA) the rights to redistribute these changes. 

  Aleph is (or was) granted by: 
  - Consejo de Desarrollo Cientifico, Humanistico, Tecnico de la ULA 
    (CDCHT)
  - Fundacite Mérida
*/


# ifndef TPL_DYNSETTREE_H
# define TPL_DYNSETTREE_H

# include <tpl_binNodeUtils.H>
# include <tpl_binTree.H>
# include <tpl_treap.H>
# include <tpl_avl.H>
# include <tpl_rand_tree.H>
# include <tpl_rb_tree.H>
# include <tpl_splay_tree.H>

using namespace Aleph;

namespace Aleph { 

    template <
      template <class /* Key */, class /* Compare */> class Tree, 
      typename Key, 
      class Compare = Aleph::less<Key> 
    >
class DynSetTree
{
private:

  Tree<Key, Compare> tree; 

  size_t num_nodes; 

public:

  typedef typename Tree<Key, Compare>::Node Node;

  DynSetTree() : num_nodes(0) { /* empty */ }

  DynSetTree(DynSetTree & srcTree) : num_nodes(srcTree.num_nodes) 
  { 
    Node * srcRoot = static_cast<Node*>(srcTree.tree.getRoot()); 

    try 
      {
     tree.getRoot() = copyStack(srcRoot);
      }
    catch (...)
      {
     num_nodes = 0;
     throw;
      }
  }

  DynSetTree & operator = (DynSetTree & srcTree)
  {
    if (this == &srcTree)
      return *this;

    Node *srcRoot = static_cast<Node*>(srcTree.tree.getRoot());
    Node *oldRoot = static_cast<Node*>(tree.getRoot());

    tree.getRoot() = copyStack(srcRoot);
    num_nodes       = srcTree.num_nodes;
    destroyStack(oldRoot);

    return *this;
  }

  virtual ~DynSetTree() 
  {
    destroyRec(tree.getRoot());
  }

  size_t insert(const Key & key)
  {
    Node * node = new Node (key);

    if (tree.insert(node) == NULL)
      {
     delete node;
     return num_nodes;
      }

    return ++num_nodes;
  }

  size_t remove(const Key & key)
  {
    Node *node = static_cast<Node*>(tree.remove(key));

    if (node == NULL)
      return num_nodes;

    delete node;

    return --num_nodes;
  }

  bool exist(const Key & key)
  {
    Node * node = static_cast<Node*>(tree.search(key));

    return node not_eq NULL;
  }

  Key & find(const Key & key) throw(std::exception, std::domain_error)
  {
    Node *node = static_cast<Node*>(tree.search(key));

    if (node == NULL)
      throw std::domain_error("key not found");;

    return node->get_data();
  }

  size_t size() const { return num_nodes; }

  bool is_empty() const { return num_nodes == 0; }

  size_t internal_path_length() const 
  {
    return internal_path_length(tree.getRoot()); 
  }

  size_t height() const { return computeHeightRec(tree.getRoot()); }

void for_each_in_preorder(void (*visitFct)(Node*, int, int))
{
  Node * root = static_cast<Node*>(tree.getRoot());

  preOrderRec(root, visitFct); 
}

private:

      template <class Operation> static
  void visit(Node * p, int, int pos)
  {
    Operation()(KEY(p), pos);
  }

public:

  template <class Operation>
void for_each()
{
  inOrderRec(tree.getRoot(), visit<Operation>);
}
};


    template  <typename Key, class Compare = Aleph::less<Key> >
class DynSetBinTree : public DynSetTree<BinTree, Key, Compare>
    { /* empty */ };


    template  <typename Key, class Compare = Aleph::less<Key> >
class DynSetAvlTree : public DynSetTree<Avl_Tree, Key, Compare>
    { /* empty */ };


    template  <typename Key, class Compare = Aleph::less<Key> >
class DynSetSplayTree : public DynSetTree<Splay_Tree, Key, Compare>
    { /* empty */ };


    template  <typename Key, class Compare = Aleph::less<Key> >
class DynSetRandTree : public DynSetTree<Rand_Tree, Key, Compare>
    { /* empty */ };


    template  <typename Key, class Compare = Aleph::less<Key> >
class DynSetTreap : public DynSetTree<Treap, Key, Compare>
    { /* empty */ };


    template  <typename Key, class Compare = Aleph::less<Key> >
class DynSetRbTree : public DynSetTree<Rb_Tree, Key, Compare>
    { /* empty */ }; 


} // end namespace Aleph

# endif /* TPL_DYNSETTREE_H */

---