DDCompareCPV Struct Reference

#include <DDCompareTools.h>

Inheritance diagram for DDCompareCPV:

Public Member Functions
	DDCompareCPV ()
	DDCompareCPV (const DDCompOptions &ddco)
bool	operator() (const DDCompactView &lhs, const DDCompactView &rhs) const

Public Attributes
DDCompOptions	ddco_

Detailed Description

Definition at line 44 of file DDCompareTools.h.

Constructor & Destructor Documentation

DDCompareCPV::DDCompareCPV

(

)

Definition at line 76 of file DDCompareTools.cc.

: ddco_() { }

DDCompareCPV::DDCompareCPV

(

const DDCompOptions &

ddco

)

Definition at line 78 of file DDCompareTools.cc.

: ddco_(ddco) { }

Member Function Documentation

bool DDCompareCPV::operator()	(	const DDCompactView &	lhs,
		const DDCompactView &	rhs
	)		const

Definition at line 80 of file DDCompareTools.cc.

References gather_cfg::cout, ddco_, DDName::fullname(), diffTwoXMLs::g1, diffTwoXMLs::g2, DDCompactView::graph(), mps_fire::i, DDBase< N, C >::name(), p1, and p2.

                                                                                      {
  bool ret(true);

  const auto & g1 = lhs.graph();
  const auto & g2 = rhs.graph();

  using Graph = DDCompactView::Graph;
  using adjl_iterator = Graph::const_adj_iterator;

  adjl_iterator git1 = g1.begin();
  adjl_iterator gend1 = g1.end();
  adjl_iterator git2 = g2.begin();
  adjl_iterator gend2 = g2.end();

  Graph::index_type i=0;

  while ( git1 != gend1 && git2 != gend2 && ret ) {
    const DDLogicalPart & ddLP1 = g1.nodeData(git1);
    const DDLogicalPart & ddLP2 = g2.nodeData(git2);
    std::cout << ++i << " P " << ddLP1.name() << " " << ddLP2.name() << std::endl;
    if ( ! DDCompareLP(ddco_)(ddLP1, ddLP2) ) {
      ret = false;
      break;
    } else if (!git1->empty() && !git2->empty() ) { 
      auto cit1  = git1->begin();
      auto cend1 = git1->end();
      auto cit2  = git2->begin();
      auto cend2 = git2->end();

      while ( cit1 != cend1 && cit2 != cend2 ) {
    const DDLogicalPart & ddcurLP1 = g1.nodeData(cit1->first);
    const DDLogicalPart & ddcurLP2 = g2.nodeData(cit2->first);
    std::cout << ++i << " c1--> " << g1.edgeData(cit1->second)->copyno() << " " << ddcurLP1.name().fullname() << std::endl;
    std::cout << ++i << " c2--> " << g2.edgeData(cit2->second)->copyno() << " " << ddcurLP2.name().fullname() << std::endl;
    const DDPosData* p1(g1.edgeData(cit1->second));
    const DDPosData* p2(g2.edgeData(cit2->second));

    if ( p1->copyno() != p2->copyno() || 
         ! DDCompareLP(ddco_)(ddcurLP1,ddcurLP2) ) {
      std::cout << "Failed to match node (fullname:copy_no): 1: " 
            << ddcurLP1.name().fullname() << ":" << p1->copyno() << " 2: " 
            << ddcurLP2.name().fullname() << ":" << p2->copyno() << std::endl;
      ret = false;
      break;
    } else if ( ! DDCompareDDTrans()(p1->trans(), p2->trans()) ) {
      std::cout << "Failed to match translation " << std::endl;
      ret = false;
      break;
    } else if ( ! DDCompareDDRot(ddco_)(p1->ddrot(), p2->ddrot()) ) {
      std::cout << "Failed to match rotation " << std::endl;
      ret = false;
      break;
    }
    ++cit1;
    ++cit2;
      }
    } else if ( git1->size() != git2->size() ) {
      ret = false;
      std::cout << "DDCompactViews are different because number of children do not match" << std::endl;
      std::cout << "graph1 size of edge_list: " << git1->size() << " and graph2 size of edge_list: " << git2->size() << std::endl;
      break;
    }
    ++git1;
    ++git2;
  }
  return ret;
}

Member Data Documentation

DDCompOptions DDCompareCPV::ddco_

Definition at line 48 of file DDCompareTools.h.

Referenced by operator()().