CMS 3D CMS Logo

List of all members | Public Member Functions | Public Attributes
DDCompareEPV Struct Reference

#include <DDCompareTools.h>

Inheritance diagram for DDCompareEPV:

Public Member Functions

 DDCompareEPV ()
 
 DDCompareEPV (const DDCompOptions &ddco)
 
bool operator() (DDExpandedView &lhs, DDExpandedView &rhs) const
 

Public Attributes

DDCompOptions ddco_
 

Detailed Description

Definition at line 37 of file DDCompareTools.h.

Constructor & Destructor Documentation

DDCompareEPV::DDCompareEPV ( )

Definition at line 17 of file DDCompareTools.cc.

17 : ddco_() { }
DDCompOptions ddco_
DDCompareEPV::DDCompareEPV ( const DDCompOptions ddco)

Definition at line 19 of file DDCompareTools.cc.

19 : ddco_(ddco) { }
DDCompOptions ddco_

Member Function Documentation

bool DDCompareEPV::operator() ( DDExpandedView lhs,
DDExpandedView rhs 
) const

Definition at line 21 of file DDCompareTools.cc.

References DDExpandedView::copyno(), gather_cfg::cout, DDExpandedView::depth(), DDExpandedView::firstChild(), DDExpandedView::logicalPart(), DDName::name(), DDBase< N, C >::name(), DDExpandedView::next(), DDExpandedView::nextSibling(), and DDExpandedView::parent().

21  {
22  bool ret(true);
23 
24  std::cout <<"*********FIRST BY firstChild, firstChild, nextSibling, nextSibling*********" << std::endl;
25  std::cout << lhs.logicalPart().name().name() << ":" << lhs.copyno()
26  << " !=? " << rhs.logicalPart().name().name() << ":" << rhs.copyno()
27  << std::endl;
28  lhs.firstChild();
29  rhs.firstChild();
30  std::cout << lhs.logicalPart().name().name() << ":" << lhs.copyno()
31  << " !=? " << rhs.logicalPart().name().name() << ":" << rhs.copyno()
32  << std::endl;
33  lhs.firstChild();
34  rhs.firstChild();
35  std::cout << lhs.logicalPart().name().name() << ":" << lhs.copyno()
36  << " !=? " << rhs.logicalPart().name().name() << ":" << rhs.copyno()
37  << std::endl;
38  lhs.nextSibling();
39  rhs.nextSibling();
40  std::cout << lhs.logicalPart().name().name() << ":" << lhs.copyno()
41  << " !=? " << rhs.logicalPart().name().name() << ":" << rhs.copyno()
42  << std::endl;
43  lhs.nextSibling();
44  rhs.nextSibling();
45  std::cout << lhs.logicalPart().name().name() << ":" << lhs.copyno()
46  << " !=? " << rhs.logicalPart().name().name() << ":" << rhs.copyno()
47  << std::endl;
48  lhs.parent();
49  rhs.parent();
50  std::cout <<"*********THEN BY next, next, next, next*********" << std::endl;
51  lhs.parent();
52  rhs.parent();
53  std::cout << lhs.logicalPart().name().name() << ":" << lhs.copyno()
54  << " !=? " << rhs.logicalPart().name().name() << ":" << rhs.copyno()
55  << std::endl;
56  lhs.next();
57  rhs.next();
58  std::cout << lhs.logicalPart().name().name() << ":" << lhs.copyno()
59  << " !=? " << rhs.logicalPart().name().name() << ":" << rhs.copyno()
60  << std::endl;
61  lhs.next();
62  rhs.next();
63  std::cout << lhs.logicalPart().name().name() << ":" << lhs.copyno()
64  << " !=? " << rhs.logicalPart().name().name() << ":" << rhs.copyno()
65  << std::endl;
66  std::cout << lhs.depth() << " depth " << rhs.depth() << std::endl;
67  lhs.next();
68  rhs.next();
69  std::cout << lhs.depth() << " depth " << rhs.depth() << std::endl;
70  std::cout << lhs.logicalPart().name().name() << ":" << lhs.copyno()
71  << " !=? " << rhs.logicalPart().name().name() << ":" << rhs.copyno()
72  << std::endl;
73  return ret;
74 }
bool next()
set current node to the next node in the expanded tree
bool parent()
set the current node to the parent node ...
const N & name() const
Definition: DDBase.h:78
int depth() const
depth of the scope. 0 means unrestricted depth.
int copyno() const
Copy number associated with the current node.
bool firstChild()
set the current node to the first child ...
bool nextSibling()
set the current node to the next sibling ...
const DDLogicalPart & logicalPart() const
The logical-part of the current node in the expanded-view.
const std::string & name() const
Returns the name.
Definition: DDName.cc:88

Member Data Documentation

DDCompOptions DDCompareEPV::ddco_

Definition at line 41 of file DDCompareTools.h.