1 /* H79_Certificate class implementation: inline functions.
2    Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
3    Copyright (C) 2010-2016 BUGSENG srl (http://bugseng.com)
4 
5 This file is part of the Parma Polyhedra Library (PPL).
6 
7 The PPL is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by the
9 Free Software Foundation; either version 3 of the License, or (at your
10 option) any later version.
11 
12 The PPL is distributed in the hope that it will be useful, but WITHOUT
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
15 for more details.
16 
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software Foundation,
19 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
20 
21 For the most up-to-date information see the Parma Polyhedra Library
22 site: http://bugseng.com/products/ppl/ . */
23 
24 #ifndef PPL_H79_Certificate_inlines_hh
25 #define PPL_H79_Certificate_inlines_hh 1
26 
27 #include "Polyhedron_defs.hh"
28 
29 namespace Parma_Polyhedra_Library {
30 
31 inline
H79_Certificate()32 H79_Certificate::H79_Certificate()
33   : affine_dim(0), num_constraints(0) {
34   // This is the certificate for a zero-dim universe polyhedron.
35 }
36 
37 inline
H79_Certificate(const H79_Certificate & y)38 H79_Certificate::H79_Certificate(const H79_Certificate& y)
39   : affine_dim(y.affine_dim), num_constraints(y.num_constraints) {
40 }
41 
42 inline
~H79_Certificate()43 H79_Certificate::~H79_Certificate() {
44 }
45 
46 inline bool
operator ()(const H79_Certificate & x,const H79_Certificate & y) const47 H79_Certificate::Compare::operator()(const H79_Certificate& x,
48                                      const H79_Certificate& y) const {
49   // For an efficient evaluation of the multiset ordering based
50   // on this LGO relation, we want larger elements to come first.
51   return x.compare(y) == 1;
52 }
53 
54 template <typename PH>
55 inline
H79_Certificate(const PH & ph)56 H79_Certificate::H79_Certificate(const PH& ph)
57   : affine_dim(0), num_constraints(0) {
58   H79_Certificate cert(Polyhedron(NECESSARILY_CLOSED, ph.constraints()));
59   affine_dim = cert.affine_dim;
60   num_constraints = cert.num_constraints;
61 }
62 
63 template <typename PH>
64 inline int
compare(const PH & ph) const65 H79_Certificate::compare(const PH& ph) const {
66   return this->compare(Polyhedron(NECESSARILY_CLOSED, ph.constraints()));
67 }
68 
69 } // namespace Parma_Polyhedra_Library
70 
71 #endif // !defined(PPL_H79_Certificate_inlines_hh)
72