"git@code.ihep.ac.cn:yudian2002/cepcsw-ote-development.git" did not exist on "7dc2c6d510464cd04677cf717bdb19eef701bdcb"
Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
//==========================================================================
// AIDA Detector description implementation
//--------------------------------------------------------------------------
// Copyright (C) Organisation europeenne pour la Recherche nucleaire (CERN)
// All rights reserved.
//
// For the licensing terms see $DD4hepINSTALL/LICENSE.
// For the list of contributors see $DD4hepINSTALL/doc/CREDITS.
//
// Author : M.Frank
//
//==========================================================================
//
// Specialized generic detector constructor
//
//==========================================================================
// Framework include files
#include "DD4hep/DetFactoryHelper.h"
#include "DD4hep/Printout.h"
#include "DDCMS/DDCMSPlugins.h"
// C/C++ include files
#include <sstream>
using namespace std;
using namespace dd4hep;
using namespace dd4hep::cms;
static long algorithm(Detector& /* description */,
ParsingContext& ctxt,
xml_h e,
SensitiveDetector& /* sens */)
{
stringstream str;
Namespace ns(ctxt,e,true);
AlgoArguments args(ctxt, e);
int startCopyNo = args.find("StartCopyNo") ? args.value<int>("StartCopyNo") : 1;
double rPosition = args.value<double>("RPosition");
vector<double> phiPosition = args.value<vector<double> >("PhiPosition");
vector<string> coolInsert = args.value<vector<string> >("CoolInsert");
Volume mother = ns.volume(args.parentName());
str << "debug: Parent " << mother.name()
<<" NameSpace " << ns.name << " at radial Position " << rPosition;
printout(ctxt.debug_algorithms ? ALWAYS : DEBUG,"DDTECCoolAlgo",str);
if (phiPosition.size() == coolInsert.size()) {
for (int i=0; i<(int)(phiPosition.size()); i++) {
str << "debug: Insert[" << i << "]: "
<< coolInsert.at(i) << " at Phi "
<< phiPosition.at(i)/CLHEP::deg;
printout(ctxt.debug_algorithms ? ALWAYS : DEBUG,"DDTECCoolAlgo",str);
}
} else {
str << "ERROR: Number of inserts does not match the numer of PhiPositions!";
printout(ctxt.debug_algorithms ? ALWAYS : DEBUG,"DDTECCoolAlgo",str);
}
int copyNo = startCopyNo;
// loop over the inserts to be placed
for (int i = 0; i < (int)(coolInsert.size()); i++) {
Volume child = ns.volume(ns.real_name(coolInsert.at(i)));
// get positions
double xpos = rPosition*cos(phiPosition.at(i));
double ypos = -rPosition*sin(phiPosition.at(i));
// place inserts
Position tran(xpos, ypos, 0.0);
mother.placeVolume(child,tran);
str << "test " << child.name() << "["
<< copyNo << "] positioned in " << mother.name()
<< " at " << tran
<< " phi " << phiPosition.at(i)/CLHEP::deg << " r "
<< rPosition;
printout(ctxt.debug_algorithms ? ALWAYS : DEBUG,"DDTECCoolAlgo",str);
copyNo++;
}
printout(ctxt.debug_algorithms ? ALWAYS : DEBUG,"DDTECCoolAlgo","Finished....");
return 1;
}
// first argument is the type from the xml file
DECLARE_DDCMS_DETELEMENT(track_DDTECCoolAlgo,algorithm)