00001 /* Grid_Certificate class implementation: inline functions. 00002 Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it> 00003 Copyright (C) 2010-2011 BUGSENG srl (http://bugseng.com) 00004 00005 This file is part of the Parma Polyhedra Library (PPL). 00006 00007 The PPL is free software; you can redistribute it and/or modify it 00008 under the terms of the GNU General Public License as published by the 00009 Free Software Foundation; either version 3 of the License, or (at your 00010 option) any later version. 00011 00012 The PPL is distributed in the hope that it will be useful, but WITHOUT 00013 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 00014 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 00015 for more details. 00016 00017 You should have received a copy of the GNU General Public License 00018 along with this program; if not, write to the Free Software Foundation, 00019 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA. 00020 00021 For the most up-to-date information see the Parma Polyhedra Library 00022 site: http://www.cs.unipr.it/ppl/ . */ 00023 00024 #ifndef PPL_Grid_Certificate_inlines_hh 00025 #define PPL_Grid_Certificate_inlines_hh 1 00026 00027 namespace Parma_Polyhedra_Library { 00028 00029 inline 00030 Grid_Certificate::Grid_Certificate() 00031 : num_equalities(0), num_proper_congruences(0) { 00032 // This is the certificate for a zero-dim universe grid. 00033 PPL_ASSERT(OK()); 00034 } 00035 00036 inline 00037 Grid_Certificate::Grid_Certificate(const Grid_Certificate& y) 00038 : num_equalities(y.num_equalities), 00039 num_proper_congruences(y.num_proper_congruences) { 00040 } 00041 00042 inline 00043 Grid_Certificate::~Grid_Certificate() { 00044 } 00045 00046 inline bool 00047 Grid_Certificate::is_stabilizing(const Grid& gr) const { 00048 return compare(gr) == 1; 00049 } 00050 00051 inline bool 00052 Grid_Certificate::Compare::operator()(const Grid_Certificate& x, 00053 const Grid_Certificate& y) const { 00054 // For an efficient evaluation of the multiset ordering based 00055 // on this lgo relation, we want larger elements to come first. 00056 return x.compare(y) == 1; 00057 } 00058 00059 } // namespace Parma_Polyhedra_Library 00060 00061 #endif // !defined(PPL_Grid_Certificate_inlines_hh)
1.6.3