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