Jpp test-rotations-new
the software that should make you happy
Loading...
Searching...
No Matches
Functions
JAcousticsMonitor.cc File Reference

Example program to monitor acoustic events. More...

#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <algorithm>
#include "TROOT.h"
#include "TFile.h"
#include "TH1D.h"
#include "TH2D.h"
#include "TProfile2D.h"
#include "JTools/JHashCollection.hh"
#include "JTools/JHashMap.hh"
#include "JTools/JRange.hh"
#include "JTools/JQuantile.hh"
#include "JDetector/JDetector.hh"
#include "JDetector/JDetectorToolkit.hh"
#include "JDetector/JTripod.hh"
#include "JDetector/JTransmitter.hh"
#include "JSupport/JMultipleFileScanner.hh"
#include "JSupport/JTreeScanner.hh"
#include "JROOT/JRootToolkit.hh"
#include "JROOT/JManager.hh"
#include "JLang/JComparator.hh"
#include "JAcoustics/JEmitter.hh"
#include "JAcoustics/JEvent.hh"
#include "JAcoustics/JSupport.hh"
#include "Jeep/JContainer.hh"
#include "Jeep/JPrint.hh"
#include "Jeep/JParser.hh"
#include "Jeep/JMessage.hh"

Go to the source code of this file.

Functions

int main (int argc, char **argv)
 

Detailed Description

Example program to monitor acoustic events.

Author
mdejong

Definition in file JAcousticsMonitor.cc.

Function Documentation

◆ main()

int main ( int argc,
char ** argv )

Definition at line 79 of file JAcousticsMonitor.cc.

80{
81 using namespace std;
82 using namespace JPP;
83
84 typedef JContainer< vector<JTripod> > tripods_container;
85 typedef JContainer< vector<JTransmitter> > transmitters_container;
86
87 JMultipleFileScanner<> inputFile;
88 JLimit_t& numberOfEvents = inputFile.getLimit();
89 string outputFile;
90 string detectorFile;
91 tripods_container tripods; // tripods
92 transmitters_container transmitters; // transmitters
93 double Q;
94 int debug;
95
96 try {
97
98 JParser<> zap("Example program to monitor acoustic events.");
99
100 zap['f'] = make_field(inputFile, "output of JAcousticEventBuilder[.sh]");
101 zap['n'] = make_field(numberOfEvents) = JLimit::max();
102 zap['o'] = make_field(outputFile) = "monitor.root";
103 zap['a'] = make_field(detectorFile);
104 zap['T'] = make_field(tripods, "tripod data") = JPARSER::initialised();
105 zap['Y'] = make_field(transmitters, "transmitter data") = JPARSER::initialised();
106 zap['Q'] = make_field(Q) = 0.9;
107 zap['d'] = make_field(debug) = 2;
108
109 zap(argc, argv);
110 }
111 catch(const exception &error) {
112 FATAL(error.what() << endl);
113 }
114
115 JDetector detector;
116
117 try {
118 load(detectorFile, detector);
119 }
120 catch(const JException& error) {
121 FATAL(error);
122 }
123
124 sort(detector.begin(), detector.end(), make_comparator(&JModule::getLocation));
125
126 JHashMap<int, JModule_t> receivers;
127 JHashMap<int, JPosition3D> emitters;
128
129 for (JDetector::const_iterator i = detector.begin(); i != detector.end(); ++i) {
130 receivers[i->getID()] = JModule_t(i->getLocation(), i->getPosition());
131 }
132
133 for (tripods_container::const_iterator i = tripods.begin(); i != tripods.end(); ++i) {
134 emitters[i->getID()] = (i->getUTMPosition() - detector.getUTMPosition());
135 }
136
137 for (transmitters_container::const_iterator i = transmitters.begin(); i != transmitters.end(); ++i) {
138 try {
139 emitters[i->getID()] = (i->getPosition() + detector.getModule(i->getLocation()).getPosition());
140 }
141 catch(const exception&) {
142 continue; // if no module available, discard transmitter
143 }
144 }
145
146 const JHashCollection<int> string(make_array(detector.begin(), detector.end(), &JModule::getString));
147 const JRange <int> floor (make_array(detector.begin(), detector.end(), &JModule::getFloor));
148
149 JManager<int, TH1D> HA(new TH1D("H[%].size", NULL, detector.size() + 1, -0.5, detector.size() + 0.5));
150 JManager<int, TH1D> HB(new TH1D("H[%].overlays", NULL, 201, -0.5, 200.5));
151 JManager<int, TH1D> HC(new TH1D("H[%].time", NULL, 800, 0.0, 4.0));
152 JManager<int, TH1D> HD(new TH1D("H[%].rms", NULL, 500, 0.0, 1.0e-1));
153 JManager<int, TH1D> HE(new TH1D("H[%].quantile", NULL, 500, 0.0, 1.0e-1));
154 JManager<int, TH1D> HQ(new TH1D("H[%].quality", NULL, 200, 0.0, 8.0));
155 JManager<int, TH2D> HR(new TH2D("H[%].QR", NULL, 40, 1.5, 3.5, 40, 3.0, 7.0));
156 JManager<int, TH1D> H1(new TH1D("H[%].multiplicity", NULL, 101, -0.5, 100.5));
157 JManager<int, TH2D> H2(new TH2D("H[%].event", NULL,
158 string.size(), -0.5, string.size() - 0.5,
159 floor.getUpperLimit() + 1, - 0.5, floor.getUpperLimit() + 0.5));
160 JManager<int, TProfile2D> H4(new TProfile2D("H[%].log10(Q)", NULL,
161 string.size(), -0.5, string.size() - 0.5,
162 floor.getUpperLimit() + 1, - 0.5, floor.getUpperLimit() + 0.5));
163
164 for (Int_t i = 1; i <= H2->GetXaxis()->GetNbins(); ++i) {
165 H2->GetXaxis()->SetBinLabel(i, MAKE_CSTRING(string.at(i-1)));
166 }
167
168 for (Int_t i = 1; i <= H2->GetYaxis()->GetNbins(); ++i) {
169 H2->GetYaxis()->SetBinLabel(i, MAKE_CSTRING(i-1));
170 }
171
172 for (Int_t i = 1; i <= H4->GetXaxis()->GetNbins(); ++i) {
173 H4->GetXaxis()->SetBinLabel(i, MAKE_CSTRING(string.at(i-1)));
174 }
175
176 for (Int_t i = 1; i <= H4->GetYaxis()->GetNbins(); ++i) {
177 H4->GetYaxis()->SetBinLabel(i, MAKE_CSTRING(i-1));
178 }
179
180 JManager<int, TH2D> H3((TH2D*) H2->Clone("H[%].doubles"));
181
182 for (JHashMap<int, JPosition3D>::const_iterator i = emitters.begin(); i != emitters.end(); ++i) {
183 H2[i->first];
184 H3[i->first];
185 }
186
187 typedef JTreeScanner<JEvent, JEvent::JEvaluator> JTreeScanner_t;
188
189 counter_type counter = 0;
190
191 for (JMultipleFileScanner<>::const_iterator i = inputFile.begin(); i != inputFile.end(); ++i) {
192
193 JTreeScanner_t in(*i);
194
195 JHashMap<int, double> toe;
196
197 for (JTreeScanner_t::iterator event = in.begin(); event != in.end() && counter != inputFile.getLimit(); ++event, ++counter) {
198
199 if (counter%1000 == 0) {
200 STATUS("event " << setw(8) << counter << '\r'); DEBUG(endl);
201 }
202
203 const JEvent evt = *event;
204
205 JQuantile Q1("", true);
206
207 for (JEvent::const_iterator i = evt.begin(); i != evt.end(); ++i) {
208 Q1.put(i->getToE());
209 }
210
211 HA[evt.getID()]->Fill((double) evt.size());
212 HB[evt.getID()]->Fill((double) evt.getOverlays());
213
214 if (toe.has(evt.getID())) {
215 HC[evt.getID()]->Fill(log10(evt.begin()->getToE() - toe[evt.getID()]));
216 }
217
218 HD[evt.getID()]->Fill(Q1.getSTDev());
219 HE[evt.getID()]->Fill(Q1.getQuantile(Q, JQuantile::symmetric_t));
220
221 toe[evt.getID()] = evt.begin()->getToE();
222
223 TH1D* hq = HQ[evt.getID()];
224 TH2D* hr = HR[evt.getID()];
225 TH1D* h1 = H1[evt.getID()];
226 TH2D* h2 = H2[evt.getID()];
227 TH2D* h3 = H3[evt.getID()];
228 TProfile2D* h4 = H4[evt.getID()];
229
230 for (JEvent::const_iterator i = evt.begin(); i != evt.end(); ++i) {
231 hq->Fill(log10(i->getQ()));
232 }
233
234 if (emitters.has(evt.getID())) {
235
236 const JPosition3D& p0 = emitters[evt.getID()];
237
238 for (JEvent::const_iterator i = evt.begin(); i != evt.end(); ++i) {
239 if (receivers.has(i->getID())) {
240 HR->Fill(log10(p0.getDistance(receivers[i->getID()])), log10(i->getQ()));
241 hr->Fill(log10(p0.getDistance(receivers[i->getID()])), log10(i->getQ()));
242 }
243 }
244 }
245
246 map<int, set<double> > buffer;
247
248 for (JEvent::const_iterator i = evt.begin(); i != evt.end(); ++i) {
249 buffer[i->getID()].insert(i->getQ());
250 }
251
252 for (map<int, set<double> >::const_iterator i = buffer.begin(); i != buffer.end(); ++i) {
253
254 h1->Fill((double) i->second.size());
255
256 if (receivers.has(i->first)) {
257
258 const JLocation& location = receivers[i->first];
259
260 const double x = string.getIndex(location.getString());
261 const double y = location.getFloor();
262
263 h2->Fill(x, y, 1.0);
264
265 if (i->second.size() >= 2u) {
266 h3->Fill(x, y, 1.0);
267 }
268
269 h4->Fill(x, y, log10(*(i->second.rbegin())));
270 }
271 }
272 }
273 }
274 STATUS(endl);
275
276
277 TFile out(outputFile.c_str(), "recreate");
278
279 out << HA << HB << HC << HD << HE << HQ << HR << *HR << H1 << H2 << H3 << H4;
280
281 out.Write();
282 out.Close();
283}
outputFile
string outputFile
Definition JDAQTimesliceSelector.cc:37
DEBUG
#define DEBUG(A)
Message macros.
Definition JMessage.hh:62
STATUS
#define STATUS(A)
Definition JMessage.hh:63
FATAL
#define FATAL(A)
Definition JMessage.hh:67
debug
int debug
debug level
Definition JSirene.cc:72
make_field
#define make_field(A,...)
macro to convert parameter to JParserTemplateElement object
Definition JParser.hh:2142
MAKE_CSTRING
#define MAKE_CSTRING(A)
Make C-string.
Definition JPrint.hh:72
JDETECTOR::JDetector
Detector data structure.
Definition JDetector.hh:96
JDETECTOR::JLocation
Logical location of module.
Definition JLocation.hh:40
JDETECTOR::JLocation::getLocation
const JLocation & getLocation() const
Get location.
Definition JLocation.hh:70
JDETECTOR::JLocation::getFloor
int getFloor() const
Get floor number.
Definition JLocation.hh:146
JDETECTOR::JLocation::getString
int getString() const
Get string number.
Definition JLocation.hh:135
JGEOMETRY3D::JPosition3D
Data structure for position in three dimensions.
Definition JPosition3D.hh:38
JGEOMETRY3D::JVector3D::getDistance
double getDistance(const JVector3D &pos) const
Get distance to point.
Definition JVector3D.hh:270
JLANG::JException
General exception.
Definition JException.hh:24
JPARSER::JParser
Utility class to parse command line options.
Definition JParser.hh:1698
JROOT::JManager
Auxiliary class to manage set of compatible ROOT objects (e.g. histograms) using unique keys.
Definition JManager.hh:47
JSUPPORT::JTreeScanner_t
Base class for JTreeScanner.
Definition JTreeScanner.hh:56
JSUPPORT::JTreeScanner
Template definition for direct access of elements in ROOT TChain.
Definition JTreeScanner.hh:698
JTOOLS::JHashCollection
General purpose class for hash collection of unique elements.
Definition JHashCollection.hh:38
JTOOLS::JHashCollection::has
bool has(const T &value) const
Test whether given value is present.
Definition JHashCollection.hh:309
JACOUSTICS::tripods_container
JContainer< std::vector< JTripod > > tripods_container
Definition JSydney.cc:79
JACOUSTICS::transmitters_container
JContainer< std::vector< JTransmitter > > transmitters_container
Definition JSydney.cc:81
JDETECTOR::load
void load(const std::string &file_name, JDetector &detector)
Load detector from input file.
Definition JDetectorToolkit.hh:508
JLANG::make_comparator
JComparator< JResult_t T::*, JComparison::lt > make_comparator(JResult_t T::*member)
Helper method to create comparator between values of data member.
Definition JLang/JComparator.hh:185
JLANG::make_array
const array_type< JValue_t > & make_array(const JValue_t(&array)[N])
Method to create array of values.
Definition JVectorize.hh:54
JPP
This name space includes all other name spaces (except KM3NETDAQ, KM3NET and ANTARES).
Definition JAAnetToolkit.hh:43
JROOT::counter_type
Long64_t counter_type
Type definition for counter.
Definition JROOT/JCounter.hh:24
JAANET::detector
Detector file.
Definition JHead.hh:227
JACOUSTICS::JEvent::getID
int getID() const
Get emitter identifier.
Definition JAcoustics/JEvent.hh:151
JACOUSTICS::JEvent::getOverlays
int getOverlays() const
Get number of overlayed events.
Definition JAcoustics/JEvent.hh:140
JEEP::JContainer
Auxiliary wrapper for I/O of container with optional comment (see JComment).
Definition JContainer.hh:42
JPARSER::initialised
Empty structure for specification of parser element that is initialised (i.e. does not require input)...
Definition JParser.hh:68
JSUPPORT::JLimit
Auxiliary class for defining the range of iterations of objects.
Definition JLimit.hh:45
JSUPPORT::JLimit::max
static counter_type max()
Get maximum counter value.
Definition JLimit.hh:128
JTOOLS::JHashMap
General purpose class for hash map of unique keys.
Definition JHashMap.hh:75
JTOOLS::JHashMap::const_iterator
container_type::const_iterator const_iterator
Definition JHashMap.hh:86
JTOOLS::JQuantile
Auxiliary data structure for running average, standard deviation and quantiles.
Definition JQuantile.hh:46
JTOOLS::JQuantile::symmetric_t
@ symmetric_t
symmatric
Definition JQuantile.hh:337
Generated by doxygen 1.12.0