28 return StatusCode::FAILURE;
32 auto larPhysWaveContainerNew = std::make_unique<LArPhysWaveContainer>();
34 ATH_CHECK ( larPhysWaveContainerNew->initialize() );
37 unsigned int lcounter=0;
42 std::vector<double> wave;
43 std::vector<double> wave_err;
44 std::vector<int> wave_trig;
48 while ( ! std::getline(
inf, line).eof() )
50 std::vector<std::string> strvec;
51 boost::split(strvec, line, boost::is_any_of(
" "));
52 if(strvec.size() != lsize) {
58 if(std::stoi(strvec[1]) != 0) {
62 hwid = std::stoi(strvec[0]);
65 lasttime=std::stof(strvec[lsize - 2]);
66 wave.push_back(std::stod(strvec[lsize - 1]));
67 wave_err.push_back(0);
68 wave_trig.push_back(1);
69 }
else if(hwid != std::stoul(strvec[0])) {
71 unsigned int skipped = 0;
72 unsigned int limit = wave.size();
74 std::vector<double> store_wave(limit,0);
75 std::vector<double> store_wave_err(limit,0);
76 std::vector<int> store_wave_trig(limit,1);
77 for (
unsigned int i = 0; i < limit; i++ ) {
86 LArPhysWave newLArPhysWave(store_wave, store_wave_err, store_wave_trig, timdiff, 0, 0);
99 hwid = std::stoi(strvec[0]);
102 lasttime=std::stof(strvec[lsize - 2]);
103 wave.push_back(std::stod(strvec[lsize - 1]));
104 wave_err.push_back(0);
105 wave_trig.push_back(1);
108 if(
m_hasIndex && lcounter+1 != std::stoul(strvec[1])){
114 timdiff= std::stof(strvec[lsize - 2]) - lasttime;
116 if(
int(timdiff) !=
int(std::stof(strvec[lsize - 2]) - lasttime)) {
118 ATH_MSG_WARNING(
int(timdiff)<<
" "<<
int(std::stof(strvec[lsize - 2]) - lasttime)<<
" "<<lasttime);
123 lasttime=std::stof(strvec[lsize - 2]);
124 wave.push_back(std::stod(strvec[lsize - 1]));
125 wave_err.push_back(0);
126 wave_trig.push_back(1);
132 unsigned int skipped = 0;
133 unsigned int limit = wave.size();
135 std::vector<double> store_wave(limit,0);
136 std::vector<double> store_wave_err(limit,0);
137 std::vector<int> store_wave_trig(limit,1);
138 for (
unsigned int i = 0; i < limit; i++ ) {
147 LArPhysWave newLArPhysWave(store_wave, store_wave_err, store_wave_trig, timdiff, 0, 0);
153 return StatusCode::SUCCESS;