Searched refs:d_disequalities (Results 1 – 4 of 4) sorted by relevance
72 : d_size( c, 0 ), d_disequalities( c ) {} in DiseqList()77 d_disequalities[ n ] = valid; in setDisequal()81 return d_disequalities.find(n) != d_disequalities.end(); in isSet()96 NodeBoolMap d_disequalities; variable102 d_disequalities[0] = &d_internal; in RegionNodeInfo()103 d_disequalities[1] = &d_external; in RegionNodeInfo()108 return d_disequalities[0]->size() + d_disequalities[1]->size(); in getNumDisequalities()111 return d_disequalities[0]->size(); in getNumExternalDisequalities()114 return d_disequalities[1]->size(); in getNumInternalDisequalities()126 DiseqList* d_disequalities[2]; variable[all …]
635 if( d_disequalities_index<d_disequalities.size() ){ in assertDisequal()636 d_disequalities[d_disequalities_index] = reason; in assertDisequal()638 d_disequalities.push_back( reason ); in assertDisequal()
198 context::CDQueue<TNode> d_disequalities; variable219 d_disequalities(c), in ContextNotifyObj()
337 d_disequalities.push_back(reason); in addDisequality()432 …for (CDQueue<TNode>::const_iterator it = d_disequalities.begin(); it != d_disequalities.end(); ++i… in checkDisequalities()