tpl_treap.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_TREAP_H
# define TPL_TREAP_H

# include <gsl/gsl_rng.h> 
# include <ahFunction.H>
# include <treapNode.H>
# include <tpl_binNodeUtils.H>
# include <ran_array.h>

using namespace Aleph;

namespace Aleph
{

    template <template <typename> class NodeType, typename Key, class Compare>
class Gen_Treap
{

public:
  typedef NodeType<Key> Node;

  
  private:

  Node        head;
  Node *      head_ptr;
  Node *&     tree_root;
  gsl_rng * r;
  public:

  Gen_Treap() : head_ptr(&head), tree_root(RLINK(head_ptr)), r(NULL)
  {
    PRIO(head_ptr) = Min_Priority;

    r = gsl_rng_alloc (gsl_rng_mt19937);

    if (r == NULL)
      throw std::bad_alloc();

    gsl_rng_set(r, time(NULL) % gsl_rng_max(r));
  }

  ~Gen_Treap() 
  {
    if (r != NULL)
      gsl_rng_free(r);
  }

  gsl_rng * gsl_rng_object() { return r;}

  Node *& getRoot() { return tree_root; }

  Node * search(const Key & key)
  {
    Node* ret_val = searchInBinTree<Node, Compare>(tree_root, key);

    return ret_val == Node::NullPtr ? NULL : ret_val;
  }

  private:

  static Node * insert(Node * root, Node * p)
  {
    if (root == Node::NullPtr)
      return p;

    Node * insertion_result = NULL;
    if (Compare() (KEY(p), KEY(root))) 
      {
        insertion_result = insert(LLINK(root), p);

        if (insertion_result == Node::NullPtr)
          return Node::NullPtr;

        LLINK(root) = insertion_result;

        if (PRIO(insertion_result) < PRIO(root))
          return rotate_to_right(root);
        else
          return root;
      }
    else if (Compare() (KEY(root), KEY(p)))
      {
        insertion_result = insert(RLINK(root), p);

        if (insertion_result == Node::NullPtr)
          return Node::NullPtr;

        RLINK(root) = insertion_result;

        if (PRIO(insertion_result) < PRIO(root))
          return rotate_to_left(root);
        else
          return root;
      }

    return Node::NullPtr;
  }

  public:

  Node * insert(Node * p)
  {

    I(p != Node::NullPtr);

    PRIO(p) = gsl_rng_get(r);

    Node * result = insert(tree_root, p);

    if (result == Node::NullPtr)
      return NULL;

    tree_root = result;

    return p;  
  }
  Node * remove(const Key & key)
  {
    Node ** pp = &RLINK(head_ptr);
    Node * p = tree_root;
    while (p != Node::NullPtr)
      if (Compare() (key, KEY(p)))
        {
          pp = &LLINK(p);
          p  = LLINK(p);
        }
      else if (Compare() (KEY(p), key))
        {
          pp = &RLINK(p);
          p  = RLINK(p);
        }
      else
        break;

    if (p == Node::NullPtr)
      return NULL; // clave no fue encontrada

    while (not (LLINK(p) == Node::NullPtr and RLINK(p) == Node::NullPtr))
      if (PRIO(LLINK(p)) < PRIO(RLINK(p)))
        {
          *pp = rotate_to_right(p);
          pp  = &RLINK(*pp);
        }
      else
        {
          *pp = rotate_to_left(p);
          pp  = &LLINK(*pp);
        }

    *pp = Node::NullPtr;

    p->reset();

    return p;
  }
};

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

    template <typename Key, class Compare = Aleph::less<Key> >
class Treap_Vtl : public Gen_Treap<TreapNodeVtl, Key, Compare>
    { /* empty */ };

} // end namespace Aleph
# endif // TPL_TREAP_H

---