if_diff/src/idfMatchSmt.cxx
//============================================================================
// match_list(const idfModel &, const idfModel &)
//----------------------------------------------------------------------------
// Given two models with SMT lists that "ought to match", match the individual nodes
// as much as possible. 
//
// Return the number of matches made.
//============================================================================
match_list(const idfModel &, const idfModel &)
Given two models with SMT lists that "ought to match", match the individual nodes
as much as possible.

Return the number of matches made.
match_list ( const idfModel & const idfModel & ) Given two models with SMT lists that " ought to match " match the individual nodes as much as possible . Return the number of matches made .
static int match_list(const idfModel &model1, const idfModel &model2)
{
  idfSmt *smt1 = model1.getSmt();
  idfSmt *smt2 = model2.getSmt();
  idfSmt *match1;
  idfSmt *match2;
  int count = 0;
  while (make_one_match(smt1, smt2, match1, match2, model1, model2)) {
    smt1 = match1->getNext();
    smt2 = match2->getNext();
    count += 1;
  }
  return count;
}
static int match_list ( const idfModel & model1 , const idfModel & model2 ) { idfSmt * smt1 = model1 . getSmt ( ) ; idfSmt * smt2 = model2 . getSmt ( ) ; idfSmt * match1 ; idfSmt * match2 ; int count = 0 ; while ( make_one_match ( smt1 , smt2 , match1 , match2 , model1 , model2 ) ) { smt1 = match1 -> getNext ( ) ; smt2 = match2 -> getNext ( ) ; count += 1 ; } return count ; }
match_list(const idfModel &, const idfModel &)
Given two models with SMT lists that "ought to match", match the individual nodes
as much as possible.
match_list ( const idfModel & const idfModel & ) Given two models with SMT lists that " ought to match " match the individual nodes as much as possible .