tpl_dlist.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_DLIST_H
# define TPL_DLIST_H

# include <tpl_dnode.H>

using namespace Aleph;

namespace Aleph {

    template <typename T>
class Dlist_Node : public Dnode<T>
{

public:

  Dlist_Node() : Dnode<T>() { /* Empty */ }

  Dlist_Node(const T & _data) : Dnode<T>(_data) { /* Empty */ }
};

    template <typename T>
class Dlist_Node_Vtl : public Dlist_Node<T>
{

public:

  Dlist_Node_Vtl() : Dlist_Node<T>() { /* Empty */ }

  virtual ~Dlist_Node_Vtl() { /* Empty */ }

  Dlist_Node_Vtl(const T & _data) : Dlist_Node<T>(_data) { /* Empty */ }
};  
    template <template <class> class Node, typename T>
class MetaDlistNode : public Node<T>
{

public:

  MetaDlistNode() { /* Empty */ }

  MetaDlistNode(const T& _data) : Node<T>(_data) { /* Empty */ }

  MetaDlistNode(const MetaDlistNode<Node, T> & node) : Node<T>(node) 
  { /* Empty */ }

  MetaDlistNode<Node, T> *& get_next() 
  {
    return reinterpret_cast<MetaDlistNode<Node, T> *&>(Node<T>::get_next()); 
  }

  MetaDlistNode<Node, T> *& get_prev() 
  {
    return reinterpret_cast<MetaDlistNode<Node, T> *&>(Node<T>::get_prev()); 
  }
};
    template <template <class> class Node_Type, typename T>
class GenDlist : public MetaDlistNode<Node_Type, T>
{

public:

  typedef MetaDlistNode<Node_Type,T> Node;
  Node * get_first() throw(std::exception, std::underflow_error)
  {
    if (this->is_empty())
      throw std::underflow_error ("List is empty");

    return this->get_next();
  }

  Node * get_last() throw(std::exception, std::underflow_error)
  {
    if (this->is_empty())
      throw std::underflow_error ("List is empty");

    return this->get_prev();
  }
  Node * remove_first() throw(std::exception, std::underflow_error)
  {
    if (this->is_empty())
      throw std::underflow_error ("List is empty");

    Node* retValue = this->get_next();
    retValue->del();

    return retValue;
  }

  Node* remove_last() throw(std::exception, std::underflow_error)
  {
    if (this->is_empty())
      throw std::underflow_error ("List is empty");

    Node* retValue = this->get_prev();
    retValue->del();

    return retValue;
  }
  class Iterator : public Node::Iterator
  {

  public:

    Iterator(GenDlist<Node_Type, T> & list) : Dnode<T>::Iterator(&list) 
    {
      // Empty
    }

    Iterator(GenDlist<Node_Type, T> & list, GenDlist<Node_Type, T> * curr) 
      : Dnode<T>::Iterator(&list, curr) 
    {
      // Empty
    }


    Iterator() : Dnode<T>::Iterator() { /* empty */ }

    Iterator(const Iterator & it) : Dnode<T>::Iterator(it) { /* Empty */ }

    Iterator & operator = (const Iterator & it) 
    {
      if (this == &it)
        return *this;

      Dnode<T>::Iterator::operator = (it);

      return *this;
    }

    Node * get_current() 
    { 
      return static_cast<Node*>(Dnode<T>::Iterator::get_current()); 
    }

    Node * del() { return static_cast<Node*>(Dnode<T>::Iterator::del()); }
  };
};
    template <typename T> 
class Dlist : public GenDlist<Dlist_Node, T> 
{

public:

  typedef typename GenDlist<Dlist_Node, T>::Node Node;

  typedef typename GenDlist<Dlist_Node, T>::Iterator Iterator;
};

    template <typename T> 
class DlistVtl : public GenDlist<Dlist_Node_Vtl, T> 
{

public:

  typedef typename GenDlist<Dlist_Node_Vtl, T>::Node Node;

  typedef typename GenDlist<Dlist_Node_Vtl, T>::Iterator Iterator ;
};

} // end namespace Aleph

# endif /* TPL_DLIST_H */

---