1 /* Grid_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_Grid_Certificate_inlines_hh
25 #define PPL_Grid_Certificate_inlines_hh 1
26
27 #include "assertions.hh"
28
29 namespace Parma_Polyhedra_Library {
30
31 inline
Grid_Certificate()32 Grid_Certificate::Grid_Certificate()
33 : num_equalities(0), num_proper_congruences(0) {
34 // This is the certificate for a zero-dim universe grid.
35 PPL_ASSERT(OK());
36 }
37
38 inline
Grid_Certificate(const Grid_Certificate & y)39 Grid_Certificate::Grid_Certificate(const Grid_Certificate& y)
40 : num_equalities(y.num_equalities),
41 num_proper_congruences(y.num_proper_congruences) {
42 }
43
44 inline
~Grid_Certificate()45 Grid_Certificate::~Grid_Certificate() {
46 }
47
48 inline bool
is_stabilizing(const Grid & gr) const49 Grid_Certificate::is_stabilizing(const Grid& gr) const {
50 return compare(gr) == 1;
51 }
52
53 inline bool
operator ()(const Grid_Certificate & x,const Grid_Certificate & y) const54 Grid_Certificate::Compare::operator()(const Grid_Certificate& x,
55 const Grid_Certificate& y) const {
56 // For an efficient evaluation of the multiset ordering based
57 // on this LGO relation, we want larger elements to come first.
58 return x.compare(y) == 1;
59 }
60
61 } // namespace Parma_Polyhedra_Library
62
63 #endif // !defined(PPL_Grid_Certificate_inlines_hh)
64