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 # ifndef AH_QUEUE_H 00044 # define AH_QUEUE_H 00045 00046 # include <tpl_dynListQueue.H> 00047 00048 namespace Aleph { 00049 00059 template <class T> 00060 class queue : public Aleph::DynListQueue<T> 00061 { 00062 public: 00063 00065 typedef size_t size_type; 00066 00068 queue() { /* empty */ } 00069 00071 template <class Container> 00072 queue(Container & cont) 00073 { 00074 const typename Container::iterator end = cont.end(); 00075 00076 for (typename Container::iterator it(cont.begin()); it != end; put(it++)); 00077 } 00078 00080 void push(const T & value) { put(value); } 00081 00083 void pop() { this->get(); } 00084 00086 T & back() { return this->rear(); } 00087 00089 bool empty() const { return this->is_empty(); } 00090 }; 00091 00092 } // end namespace Aleph 00093 00094 # endif // AH_QUEUE_H 00095