36 this->lag[
n]= a.lag[
n];
49 if (tree == 0)
return;
54 fChain->SetBranchAddress(
"run",&(this->
run));
55 fChain->SetBranchAddress(
"gps",&(this->
gps));
56 fChain->SetBranchAddress(
"live",&(this->
live));
57 fChain->SetBranchAddress(
"lag",(this->
lag));
83 TTree* waveTree =
new TTree(
"liveTime",
"liveTime");
94 waveTree->Branch(
"run", &(this->
run),
"run/I");
95 waveTree->Branch(
"gps", &(this->
gps),
"gps/D");
96 waveTree->Branch(
"live", &(this->
live),
"live/D");
97 waveTree->Branch(
"lag", (this->
lag), clag);
98 waveTree->Branch(
"slag", (this->
slag), cslag);
99 waveTree->Branch(
"start", (this->
start), cstart);
100 waveTree->Branch(
"stop", (this->
stop), cstop);
127 for(m=0; m<detSegs.size(); m++) {
128 this->
start[
m] = detSegs[
m].start;
129 this->
stop[
m] = detSegs[
m].stop;
134 if(slag!=NULL)
for(m=0; m<M+1; m++) this->slag[m] = slag[m];
136 for(n=0; n<net->
nLag; n++){
169 return fChain->GetEntry(entry);
detector * getifo(size_t n)
param: detector index
wavearray< double > a(hp.size())
Double_t * start
time slag [sec]
double getliveTime(size_t n)
virtual void start(double s)
network ** net
NOISE_MDC_SIMULATION.
Int_t fCurrent
pointer to the analyzed TTree or TChain
Int_t run
current Tree number in a TChain
void output(TTree *waveTree, network *net, float *slag=NULL, vector< waveSegment > detSegs=DEFAULT_WAVESEGMENT)
wavearray< double > lagShift
vector< waveSegment > detSegs
Double_t * stop
array of gps start time segment for each detector
WSeries< double > * getTFmap()
param: no parameters
netcluster * getwc(size_t n)
param: delay index
sprintf(tfres,"(1/%g)x(%g) (sec)x(Hz)", 2 *df, df)
void Show(Int_t entry=-1)
TBranch * b_run
array of gps stop time segment for each detector