00001 00002 /* 00003 This file is part of Aleph system 00004 00005 Copyright (c) 2002, 2003, 2004, 2005, 2006 00006 UNIVERSITY LOS ANDES (ULA) Merida - REPÚBLICA BOLIVARIANA DE VENEZUELA 00007 00008 - Center of Studies in Microelectronics & Distributed Systems (CEMISID) 00009 - ULA Computer Science Department 00010 - FUNDACITE Mérida - Ministerio de Ciencia y Tecnología 00011 00012 PERMISSION TO USE, COPY, MODIFY AND DISTRIBUTE THIS SOFTWARE AND ITS 00013 DOCUMENTATION IS HEREBY GRANTED, PROVIDED THAT BOTH THE COPYRIGHT 00014 NOTICE AND THIS PERMISSION NOTICE APPEAR IN ALL COPIES OF THE 00015 SOFTWARE, DERIVATIVE WORKS OR MODIFIED VERSIONS, AND ANY PORTIONS 00016 THEREOF, AND THAT BOTH NOTICES APPEAR IN SUPPORTING DOCUMENTATION. 00017 00018 Aleph is distributed in the hope that it will be useful, but WITHOUT 00019 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 00020 or FITNESS FOR A PARTICULAR PURPOSE. 00021 00022 UNIVERSIDAD DE LOS ANDES requests users of this software to return to 00023 00024 Leandro Leon 00025 CEMISID 00026 Ed La Hechicera 00027 3er piso, ala sur 00028 Facultad de Ingenieria 00029 Universidad de Los Andes 00030 Merida - REPÚBLICA BOLIVARIANA DE VENEZUELA or 00031 00032 lrleon@ula.ve 00033 00034 any improvements or extensions that they make and grant Universidad 00035 de Los Andes (ULA) the rights to redistribute these changes. 00036 00037 Aleph is (or was) granted by: 00038 - Consejo de Desarrollo Cientifico, Humanistico, Tecnico de la ULA 00039 (CDCHT) 00040 - Fundacite Mérida 00041 */ 00042 00043 00044 # ifndef TPL_LISTSTACK_H 00045 # define TPL_LISTSTACK_H 00046 00047 # include <tpl_snode.H> 00048 00049 using namespace Aleph; 00050 00051 namespace Aleph { 00052 00065 template <typename T> 00066 class ListStack : private Snode<T> 00067 { 00068 size_t num_nodes; 00069 00070 public: 00071 00073 typedef Snode<T> Node; 00075 ListStack() : num_nodes(0) { /* Empty */ } 00082 void push(Node * node) 00083 { 00084 ++num_nodes; 00085 this->insert_next(node); 00086 } 00094 Node * pop() throw(std::exception,std::underflow_error) 00095 { 00096 if (this->is_empty()) 00097 throw std::underflow_error ("Stack underflow"); 00098 --num_nodes; 00099 return this->remove_next(); 00100 } 00108 Node * top() const 00109 { 00110 if (this->is_empty()) 00111 throw std::underflow_error ("Stack underflow"); 00112 return static_cast<Node*>(this->get_next()); 00113 } 00115 bool is_empty() const { return Snode<T>::is_empty(); } 00116 00118 const size_t & size() const { return num_nodes; } 00119 }; 00120 00121 } // end namespace Aleph 00122 00123 # endif /* TPL_LISTSTACK_H */ 00124