#include <Grid_Certificate.defs.hh>
Public Member Functions | |
bool | operator() (const Grid_Certificate &x, const Grid_Certificate &y) const |
Returns true if and only if x comes before y . |
This binary predicate defines a total ordering on Grid certificates which is used when storing information about sets of grids.
Definition at line 81 of file Grid_Certificate.defs.hh.
bool Parma_Polyhedra_Library::Grid_Certificate::Compare::operator() | ( | const Grid_Certificate & | x, | |
const Grid_Certificate & | y | |||
) | const [inline] |
Returns true
if and only if x
comes before y
.
Definition at line 51 of file Grid_Certificate.inlines.hh.
References Parma_Polyhedra_Library::Grid_Certificate::compare().
00052 { 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 }