void StrongSolverTheoryUf::ConflictFind::explainClique( std::vector< Node >& clique, OutputChannel* out ){
Assert( d_cardinality>0 );
- while( clique.size()>long(d_cardinality+1) ){
+ while( clique.size()>size_t(d_cardinality+1) ){
clique.pop_back();
}
//found a clique
conflict.push_back( d_disequalities[i] );
nodesWithinRep[r1][ d_disequalities[i][0][0] ] = true;
nodesWithinRep[r2][ d_disequalities[i][0][1] ] = true;
- if( conflict.size()==((int)clique.size()*( (int)clique.size()-1 )/2) ){
+ if( conflict.size()==(clique.size()*( clique.size()-1 )/2) ){
break;
}
}