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
124
125
126
127
128
129
130
131
132
|
/* PIP_Tree related class implementation: inline functions.
Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
Copyright (C) 2010-2011 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://www.cs.unipr.it/ppl/ . */
#ifndef PPL_PIP_Tree_inlines_hh
#define PPL_PIP_Tree_inlines_hh 1
namespace Parma_Polyhedra_Library {
inline
PIP_Solution_Node::Tableau::Tableau()
: s(), t(), denom(1) {
PPL_ASSERT(OK());
}
inline
PIP_Solution_Node::Tableau::Tableau(const Tableau& y)
: s(y.s), t(y.t), denom(y.denom) {
PPL_ASSERT(OK());
}
inline
PIP_Solution_Node::Tableau::~Tableau() {
}
inline bool
PIP_Solution_Node::Tableau::is_integer() const {
return denom == 1;
}
inline Coefficient_traits::const_reference
PIP_Solution_Node::Tableau::denominator() const {
return denom;
}
inline
PIP_Tree_Node::~PIP_Tree_Node() {
}
inline void
PIP_Tree_Node::set_parent(const PIP_Decision_Node* p) {
parent_ = p;
}
inline const PIP_Decision_Node*
PIP_Tree_Node::parent() const {
return parent_;
}
inline const PIP_Problem*
PIP_Tree_Node::get_owner() const {
return owner_;
}
inline const Constraint_System&
PIP_Tree_Node::constraints() const {
return constraints_;
}
inline PIP_Tree_Node::Artificial_Parameter_Sequence::const_iterator
PIP_Tree_Node::art_parameter_begin() const {
return artificial_parameters.begin();
}
inline PIP_Tree_Node::Artificial_Parameter_Sequence::const_iterator
PIP_Tree_Node::art_parameter_end() const {
return artificial_parameters.end();
}
inline dimension_type
PIP_Tree_Node::art_parameter_count() const {
return artificial_parameters.size();
}
inline
const PIP_Tree_Node*
PIP_Decision_Node::child_node(bool v) const {
return v ? true_child : false_child;
}
inline
PIP_Tree_Node*
PIP_Decision_Node::child_node(bool v) {
return v ? true_child : false_child;
}
inline
PIP_Tree_Node::Artificial_Parameter::Artificial_Parameter()
: Linear_Expression(), denom(1) {
PPL_ASSERT(OK());
}
inline
PIP_Tree_Node::Artificial_Parameter
::Artificial_Parameter(const Artificial_Parameter& y)
: Linear_Expression(y), denom(y.denom) {
PPL_ASSERT(OK());
}
inline Coefficient_traits::const_reference
PIP_Tree_Node::Artificial_Parameter::denominator() const {
return denom;
}
inline void
PIP_Tree_Node::Artificial_Parameter::swap(Artificial_Parameter& y) {
Linear_Expression::swap(y);
std::swap(denom, y.denom);
}
} // namespace Parma_Polyhedra_Library
#endif // !defined(PPL_PIP_Tree_inlines_hh)
|
