-
Notifications
You must be signed in to change notification settings - Fork 0
/
Queue.H
79 lines (56 loc) · 2.26 KB
/
Queue.H
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
/* Aleph-w
/ \ | | ___ _ __ | |__ __ __
/ _ \ | |/ _ \ '_ \| '_ \ ____\ \ /\ / / Data structures & Algorithms
/ ___ \| | __/ |_) | | | |_____\ V V / version 1.9c
/_/ \_\_|\___| .__/|_| |_| \_/\_/ https://github.com/lrleon/Aleph-w
|_|
This file is part of Aleph-w library
Copyright (c) 2002-2018 Leandro Rabindranath Leon
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
# ifndef AH_QUEUE_H
# define AH_QUEUE_H
# include <tpl_dynListQueue.H>
namespace Aleph {
/** Implantación Aleph del contenedor estándar queue<T>.
En Aleph este contenedor estándar es implantado mediante una
lista circular simplemente enlazada. Consecuentemente, esta
versión de queue<T> no emplea un contenedor genérico como
parámetro.
@ingroup stl
*/
template <class T>
class queue : public Aleph::DynListQueue<T>
{
public:
/// El tipo numérico para representar el tamaño
typedef size_t size_type;
/// Instancia una cola vacía
queue() { /* empty */ }
/// Instancia una cola con los elementos del contenedor cont.
template <class Container>
queue(Container & cont)
{
const typename Container::iterator end = cont.end();
for (typename Container::iterator it(cont.begin()); it != end; put(it++));
}
/// Inserta value en la cola.
void push(const T & value) { put(value); }
/// Elimina un elemento del frente de la cola.
void pop() { this->get(); }
/// Consulta el elemento trasero de la cola.
T & back() { return this->rear(); }
/// Retorna true la cola está vacía.
bool empty() const { return this->is_empty(); }
};
} // end namespace Aleph
# endif // AH_QUEUE_H