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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
/* EList class implementation: inline functions.
Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
This file is part of the Parma Polyhedra Library (PPL).
The PPL 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.
The PPL 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, write to the Free Software Foundation,
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
For the most up-to-date information see the Parma Polyhedra Library
site: http://bugseng.com/products/ppl/ . */
#ifndef PPL_EList_inlines_hh
#define PPL_EList_inlines_hh 1
#include <cassert>
namespace Parma_Polyhedra_Library {
namespace Implementation {
namespace Watchdog {
template <typename T>
inline
EList<T>::EList()
: Doubly_Linked_Object(this, this) {
}
template <typename T>
inline void
EList<T>::push_front(T& obj) {
next->insert_before(obj);
}
template <typename T>
inline void
EList<T>::push_back(T& obj) {
prev->insert_after(obj);
}
template <typename T>
inline typename EList<T>::Iterator
EList<T>::insert(Iterator position, T& obj) {
position->insert_before(obj);
return Iterator(&obj);
}
template <typename T>
inline typename EList<T>::Iterator
EList<T>::begin() {
return Iterator(next);
}
template <typename T>
inline typename EList<T>::Iterator
EList<T>::end() {
return Iterator(this);
}
template <typename T>
inline typename EList<T>::Const_Iterator
EList<T>::begin() const {
return Const_Iterator(next);
}
template <typename T>
inline typename EList<T>::Const_Iterator
EList<T>::end() const {
return Const_Iterator(const_cast<EList<T>*>(this));
}
template <typename T>
inline bool
EList<T>::empty() const {
return begin() == end();
}
template <typename T>
inline typename EList<T>::Iterator
EList<T>::erase(Iterator position) {
assert(!empty());
return Iterator(position->erase());
}
template <typename T>
inline
EList<T>::~EList() {
// Erase and deallocate all the elements.
for (Iterator i = begin(), lend = end(), next; i != lend; i = next) {
next = erase(i);
delete &*i;
}
}
template <typename T>
inline bool
EList<T>::OK() const {
for (Const_Iterator i = begin(), lend = end(); i != lend; ++i)
if (!i->OK())
return false;
return true;
}
} // namespace Watchdog
} // namespace Implementation
} // namespace Parma_Polyhedra_Library
#endif // !defined(PPL_EList_inlines_hh)
|
