25 os <<
"DDD in memory stats:" << std::endl
26 <<
"====================" << std::endl << std::endl;
37 int noLog(0), noSol(0), noMat(0), noRot(0);
40 int noCLog(0), noCSol(0), noCMat(0), noCRot(0);
45 const auto &
g = cpv.
graph();
48 while (exv.
next()) ++noExpNodes;
52 for(; it !=
g.end(); ++it) {
54 noEdges += it->size();
59 lpst_type::iterator lpstit = lpst.begin();
60 for(; lpstit != lpst.end(); ++lpstit) {
61 noCLog += lpstit->first.name().size();
67 mast_type::iterator mastit = mast.begin();
68 for(; mastit != mast.end(); ++mastit) {
69 noCMat += mastit->first.name().size();
75 sost_type::iterator sostit = sost.begin();
76 for(; sostit != sost.end(); ++sostit) {
77 noCSol += sostit->first.name().size();
85 rost_type::iterator rostit = rost.begin();
86 for(; rostit != rost.end(); ++rostit) {
87 noCRot += rostit->first.name().size();
92 std::cout <<
"sizeof(void*)=" <<
sizeof(
void*) << std::endl;
96 int store = 4*
sizeof(
void*);
98 int bySol = noSolidP *
sizeof(double) + noSol*store;
99 int byMat = noMat * (5*
sizeof(double) + store);
101 int byNam = noCLog + noCSol + noCMat + noCRot;
103 int byGra = (noEdges + noNodes)*store;
104 int bytes = byRot + bySol + byMat + byPos + byNam + byLog + byGra;
106 double mb = 1024.*1024.;
108 os <<
"noNodes=" << noNodes << std::endl
109 <<
"noEdges=" << noEdges << std::endl
110 <<
"noExNod=" << noExpNodes << std::endl << std::endl;
111 os <<
"noLog=" << noLog << std::endl
112 <<
"noSol=" << noSol <<
" noSolidP=" << noSolidP << std::endl
113 <<
"noMat=" << noMat << std::endl
114 <<
"noRot=" << noRot << std::endl << std::endl;
115 os <<
"noCLog=" << noCLog << std::endl
116 <<
"noCSol=" << noCSol << std::endl
117 <<
"noCMat=" << noCMat << std::endl
118 <<
"noCRot=" << noCRot << std::endl
119 <<
" --------" << std::endl
121 <<
" chars used for naming." << std::endl << std::endl;
122 os <<
"byLog = " << byLog/mb <<
" logicalparts " << std::endl
123 <<
"byNam = " << byNam/mb <<
" string for names " << std::endl
124 <<
"byRot = " << byRot/mb <<
" rotations " << std::endl
125 <<
"bySol = " << bySol/mb <<
" solids " << std::endl
126 <<
"byMat = " << byMat/mb <<
" materials " << std::endl
127 <<
"byPos = " << byPos/mb <<
" posparts " << std::endl
128 <<
"byGra = " << byGra/mb <<
" graph-struct " << std::endl
129 <<
"-----------------------" << std::endl
130 <<
"OVERALL: " << bytes / mb <<
" MByte" << std::endl;
bool next()
set current node to the next node in the expanded tree
const std::vector< double > & parameters(void) const
Give the parameters of the solid.
Relative position of a child-volume inside a parent-volume.
void ddstats(std::ostream &os)
DDMaterial is used to define and access material information.
Compact representation of the geometrical detector hierarchy.
The Signals That Services Can Subscribe To This is based on ActivityRegistry and is current per Services can connect to the signals distributed by the ActivityRegistry in order to monitor the activity of the application Each possible callback has some defined which we here list in angle e g
A DDSolid represents the shape of a part.
ROOT::Math::DisplacementVector3D< ROOT::Math::Cartesian3D< double > > DDTranslation
Represents a uniquely identifyable rotation matrix.
static value_type & instance()
A DDLogicalPart aggregates information concerning material, solid and sensitveness ...
const Graph & graph() const
Provides read-only access to the data structure of the compact-view.
Provides an exploded view of the detector (tree-view)
ROOT::Math::Rotation3D DDRotationMatrix
A DDRotationMatrix is currently implemented with a ROOT Rotation3D.