Bug Summary

File:/home/sdobbs/work/clang/halld_recon/src/libraries/HDDM/DEventSourceHDDM.cc
Warning:line 1100, column 23
Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

clang -cc1 -cc1 -triple x86_64-unknown-linux-gnu -analyze -disable-free -main-file-name DEventSourceHDDM.cc -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 2 -fhalf-no-semantic-interposition -mframe-pointer=none -fmath-errno -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -tune-cpu generic -fno-split-dwarf-inlining -debugger-tuning=gdb -resource-dir /w/halld-scifs17exp/home/sdobbs/clang/llvm-project/install/lib/clang/12.0.0 -D HAVE_CCDB -D HAVE_RCDB -D HAVE_EVIO -D HAVE_TMVA=1 -D RCDB_MYSQL=1 -D RCDB_SQLITE=1 -D SQLITE_USE_LEGACY_STRUCT=ON -I .Linux_CentOS7.7-x86_64-gcc4.8.5/libraries/HDDM -I libraries/HDDM -I . -I libraries -I libraries/include -I /w/halld-scifs17exp/home/sdobbs/clang/halld_recon/Linux_CentOS7.7-x86_64-gcc4.8.5/include -I external/xstream/include -I /usr/include/tirpc -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/root/root-6.08.06/include -I /w/halld-scifs17exp/halld2/home/sdobbs/Software/jana/jana_0.8.2/Linux_CentOS7.7-x86_64-gcc4.8.5/include -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/ccdb/ccdb_1.06.06/include -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/rcdb/rcdb_0.06.00/cpp/include -I /usr/include/mysql -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/sqlitecpp/SQLiteCpp-2.2.0^bs130/include -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/sqlite/sqlite-3.13.0^bs130/include -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/hdds/hdds-4.9.0/Linux_CentOS7.7-x86_64-gcc4.8.5/src -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/xerces-c/xerces-c-3.1.4/include -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/evio/evio-4.4.6/Linux-x86_64/include -internal-isystem /usr/lib/gcc/x86_64-redhat-linux/4.8.5/../../../../include/c++/4.8.5 -internal-isystem /usr/lib/gcc/x86_64-redhat-linux/4.8.5/../../../../include/c++/4.8.5/x86_64-redhat-linux -internal-isystem /usr/lib/gcc/x86_64-redhat-linux/4.8.5/../../../../include/c++/4.8.5/backward -internal-isystem /usr/local/include -internal-isystem /w/halld-scifs17exp/home/sdobbs/clang/llvm-project/install/lib/clang/12.0.0/include -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -std=c++11 -fdeprecated-macro -fdebug-compilation-dir /home/sdobbs/work/clang/halld_recon/src -ferror-limit 19 -fgnuc-version=4.2.1 -fcxx-exceptions -fexceptions -vectorize-loops -vectorize-slp -analyzer-output=html -faddrsig -o /tmp/scan-build-2021-01-21-110224-160369-1 -x c++ libraries/HDDM/DEventSourceHDDM.cc

libraries/HDDM/DEventSourceHDDM.cc

→
1// $Id: DEventSourceHDDM.cc 19023 2015-07-14 20:23:27Z beattite $
2//
3// Author: David Lawrence June 24, 2004
4//
5// changes: Wed Jun 20 17:08:13 EDT 2007 B. Zihlmann
6// modify TOF section to add several new variables incuding the
7// GEANT particle type to the Truth hits and the hit and track-hit
8// list.
9//
10// Oct 3, 2012 Yi Qiang: add functions for Cherenkov RICH detector
11// Oct 11, 2012 Yi Qiang: complete functions for Cherenkov detector
12// Oct 8, 2013 Yi Qiang: added dedicated object for RICH Truth Hit
13// July 5, 2014 R.T.Jones: changed over from c to c++ API for hddm
14// June 22, 2015 J. Stevens: changed RICH -> DIRC and remove CERE
15// May 7, 2017 R. Dzhygadlo: added DDIRCTruthPmtHit DDIRCTruthBarHit
16// Oct 20, 2017 A. Somov: Added fields for the DPSHit/DPSCHit
17//
18// DEventSourceHDDM methods
19//
20
21#include <iostream>
22#include <iomanip>
23#include <cmath>
24using namespace std;
25
26#include <JANA/JFactory_base.h>
27#include <JANA/JEventLoop.h>
28#include <JANA/JEvent.h>
29#include <DANA/DStatusBits.h>
30
31#include <JANA/JGeometryXML.h>
32#include "BCAL/DBCALGeometry.h"
33#include "PAIR_SPECTROMETER/DPSGeometry.h"
34
35#include <DVector2.h>
36#include <DEventSourceHDDM.h>
37#include <FDC/DFDCGeometry.h>
38#include <FCAL/DFCALGeometry.h>
39#include <FCAL/DFCALHit.h>
40#include <CCAL/DCCALGeometry.h>
41#include <CCAL/DCCALHit.h>
42
43
44//------------------------------------------------------------------
45// Binary predicate used to sort hits
46//------------------------------------------------------------------
47class MCTrackHitSort{
48 public:
49 bool operator()(DMCTrackHit* const &thit1,
50 DMCTrackHit* const &thit2) const {
51 return thit1->z < thit2->z;
52 }
53};
54
55bool MCTrackHitSort_C(DMCTrackHit* const &thit1,
56 DMCTrackHit* const &thit2) {
57 return thit1->z < thit2->z;
58}
59
60
61//----------------
62// Constructor
63//----------------
64DEventSourceHDDM::DEventSourceHDDM(const char* source_name)
65: JEventSource(source_name)
66{
67 /// Constructor for DEventSourceHDDM object
68 ifs = new ifstream(source_name);
69 ifs->get();
70 ifs->unget();
71 if (ifs->rdbuf()->in_avail() > 30) {
72 class nonstd_streambuf: public std::streambuf {
73 public: char *pub_gptr() {return gptr();}
74 };
75 void *buf = (void*)ifs->rdbuf();
76 std::stringstream sbuf(((nonstd_streambuf*)buf)->pub_gptr());
77 std::string head;
78 std::getline(sbuf, head);
79 std::string expected = " class=\"s\" ";
80 std::string also_supported = " class=\"mc_s\" ";
81 if (head.find(expected) == head.npos &&
82 head.find(also_supported) == head.npos)
83 {
84 std::string msg("Unexpected header found in input HDDM stream: ");
85 throw std::runtime_error(msg + head + source_name);
86 }
87 }
88
89 fin = new hddm_s::istream(*ifs);
90 initialized = false;
91 dapp = NULL__null;
92 bfield = NULL__null;
93 geom = NULL__null;
94
95 dRunNumber = -1;
96
97 if( (!gPARMS->Exists("JANA_CALIB_CONTEXT")) && (getenv("JANA_CALIB_CONTEXT")==NULL__null) ){
98 cout << "============================================================" << endl;
99 cout << " WARNING: JANA_CALIB_CONTEXT not set. " << endl;
100 cout << "You are reading from an HDDM file which is most likely" << endl;
101 cout << "MC data. In most cases, you will want to set this parameter" << endl;
102 cout << "to get proper reconstruction." << endl;
103 cout << "(usually something like \"variation=mc\")" << endl;
104 cout << "============================================================" << endl;
105 }
106}
107
108//----------------
109// Destructor
110//----------------
111DEventSourceHDDM::~DEventSourceHDDM()
112{
113 if (fin)
114 delete fin;
115 if (ifs)
116 delete ifs;
117}
118
119//----------------
120// GetEvent
121//----------------
122jerror_t DEventSourceHDDM::GetEvent(JEvent &event)
123{
124 /// Implementation of JEventSource virtual function
125
126 if (!fin)
127 return EVENT_SOURCE_NOT_OPEN;
128
129 // Each open HDDM file takes up about 1M of memory so it's
130 // worthwhile to close it as soon as we can.
131 else if (!ifs->good()) {
132 delete fin;
133 fin = NULL__null;
134 delete ifs;
135 ifs = NULL__null;
136 return NO_MORE_EVENTS_IN_SOURCE;
137 }
138
139 hddm_s::HDDM *record = new hddm_s::HDDM();
140 while (record->getPhysicsEvents().size() == 0) {
141 if (! (*fin >> *record)) {
142 delete fin;
143 fin = NULL__null;
144 delete ifs;
145 ifs = NULL__null;
146 return NO_MORE_EVENTS_IN_SOURCE;
147 }
148 }
149
150 ++Nevents_read;
151
152 int event_number = -1;
153 int run_number = -1;
154
155 if(!record->getPhysicsEvents().empty()) {
156 // Get event/run numbers from HDDM
157 hddm_s::PhysicsEvent &pe = record->getPhysicsEvent(0);
158 event_number = pe.getEventNo();
159 run_number = pe.getRunNo();
160 }
161
162 // Copy the reference info into the JEvent object
163 event.SetJEventSource(this);
164 event.SetEventNumber(event_number);
165 event.SetRunNumber(run_number);
166 event.SetRef(record);
167 event.SetStatusBit(kSTATUS_HDDM);
168 event.SetStatusBit(kSTATUS_FROM_FILE);
169 event.SetStatusBit(kSTATUS_PHYSICS_EVENT);
170
171 return NOERROR;
172}
173
174//----------------
175// FreeEvent
176//----------------
177void DEventSourceHDDM::FreeEvent(JEvent &event)
178{
179 hddm_s::HDDM *record = (hddm_s::HDDM*)event.GetRef();
180 delete record;
181}
182
183//----------------
184// GetObjects
185//----------------
186jerror_t DEventSourceHDDM::GetObjects(JEvent &event, JFactory_base *factory)
187{
188 /// This gets called through the virtual method of the
189 /// JEventSource base class. It creates the objects of the type
190 /// on which factory is based. It uses the hddm_s::HDDM* object
191 /// kept in the ref field of the JEvent object passed.
192
193 // We must have a factory to hold the data
194 if (!factory)
1
Assuming 'factory' is non-null
→
2
←
Taking false branch
→
195 throw RESOURCE_UNAVAILABLE;
196
197 // HDDM doesn't exactly support tagged factories, but the tag
198 // can be used to direct filling of the correct factory.
199 string tag = (factory->Tag()==NULL__null)? "" : factory->Tag();
3
←
Assuming the condition is false
→
4
←
'?' condition is false
→
200
201 // The ref field of the JEvent is just the HDDM object pointer.
202 hddm_s::HDDM *record = (hddm_s::HDDM*)event.GetRef();
203 if (!record)
5
←
Assuming 'record' is non-null
→
6
←
Taking false branch
→
204 throw RESOURCE_UNAVAILABLE;
205
206 // Get pointer to the B-field object and Geometry object
207 JEventLoop *loop = event.GetJEventLoop();
7
←
'loop' initialized here
→
208 if (initialized == false && loop) {
8
←
Assuming the condition is true
→
9
←
Assuming pointer value is null
→
10
←
Assuming 'loop' is null
→
11
←
Taking false branch
→
209 initialized = true;
210 dRunNumber = event.GetRunNumber();
211 dapp = dynamic_cast<DApplication*>(loop->GetJApplication());
212 if (dapp) {
213 jcalib = dapp->GetJCalibration(event.GetRunNumber());
214 // Make sure jcalib is set
215 if (!jcalib) {
216 _DBG_std::cerr<<"libraries/HDDM/DEventSourceHDDM.cc"<<
":"<<216<<" " << "ERROR - no jcalib set!" <<endl;
217 return RESOURCE_UNAVAILABLE;
218 }
219 // Get constants and do basic check on number of elements
220 vector< map<string, float> > tvals;
221 if(jcalib->Get("FDC/strip_calib", tvals))
222 throw JException("Could not load CCDB table: FDC/strip_calib");
223
224 if (tvals.size() != 192) {
225 _DBG_std::cerr<<"libraries/HDDM/DEventSourceHDDM.cc"<<
":"<<225<<" " << "ERROR - strip calibration vectors are not the right size!"
226 << endl;
227 return VALUE_OUT_OF_RANGE;
228 }
229 map<string,float>::iterator iter;
230 for (iter=tvals[0].begin(); iter!=tvals[0].end(); iter++) {
231 // Copy values into tables. We preserve the order since
232 // that is how it was originally done in hitFDC.c
233 for (unsigned int i=0; i<tvals.size(); i++) {
234 map<string, float> &row = tvals[i];
235 uscale[i]=row["qru"];
236 vscale[i]=row["qrv"];
237 }
238 }
239 }
240 // load BCAL geometry
241 vector<const DBCALGeometry *> BCALGeomVec;
242 loop->Get(BCALGeomVec);
243 if(BCALGeomVec.size() == 0)
244 throw JException("Could not load DBCALGeometry object!");
245 dBCALGeom = BCALGeomVec[0];
246
247 // load PS geometry
248 vector<const DPSGeometry*> psGeomVect;
249 loop->Get(psGeomVect);
250 if (psGeomVect.size() < 1)
251 return OBJECT_NOT_AVAILABLE;
252 psGeom = psGeomVect[0];
253
254
255 }
256
257 // Warning: This class is not completely thread-safe and can fail if running
258 // running in multithreaded mode over files with events from multiple runs
259 // It is expected that simulated data will rarely contain events from multiple
260 // runs, as this is an intermediate format in the simulation chain, so for
261 // now we just insert a sanity check, and push the problem to the future
262 if(dRunNumber != event.GetRunNumber()) {
12
←
Assuming the condition is false
→
13
←
Taking false branch
→
263 jerr << endl
264 << "WARNING: DEventSourceHDDM cannot currently handle HDDM files containing" << endl
265 << "events with multiple runs! If you encounter this error message," << endl
266 << "please contact the GlueX Offline Software Group: halld-offline@jlab.org" << endl
267 << endl;
268 exit(-1);
269 }
270
271 //Get target center
272 //multiple reader threads can access this object: need lock
273 bool locNewRunNumber = false;
274 unsigned int locRunNumber = event.GetRunNumber();
275 LockRead();
276 {
277 locNewRunNumber = (dTargetCenterZMap.find(locRunNumber) == dTargetCenterZMap.end());
278 }
279 UnlockRead();
280 if(locNewRunNumber)
14
←
Assuming 'locNewRunNumber' is false
→
15
←
Taking false branch
→
281 {
282 DApplication* dapp = dynamic_cast<DApplication*>(loop->GetJApplication());
283 DGeometry* locGeometry = dapp->GetDGeometry(loop->GetJEvent().GetRunNumber());
284 double locTargetCenterZ = 0.0;
285 locGeometry->GetTargetZ(locTargetCenterZ);
286
287 JGeometryXML *jgeom = dynamic_cast<JGeometryXML *>(locGeometry);
288 hddm_s::GeometryList geolist = record->getGeometrys();
289 if (jgeom != 0 && geolist.size() > 0) {
290 std::string md5sim = geolist(0).getMd5simulation();
291 std::string md5smear = geolist(0).getMd5smear();
292 std::string md5recon = jgeom->GetChecksum();
293 geolist(0).setMd5reconstruction(md5recon);
294 if (md5sim != md5smear) {
295 jerr << std::endl
296 << "WARNING: simulation geometry checksum does not match"
297 << " that shown for the mcsmear step."
298 << std::endl;
299 }
300 else if (md5sim != md5recon) {
301 jerr << endl
302 << "WARNING: simulation geometry checksum does not match"
303 << " the geometry being used for reconstruction."
304 << std::endl;
305 }
306 }
307
308 vector<double> locBeamPeriodVector;
309 if(loop->GetCalib("PHOTON_BEAM/RF/beam_period", locBeamPeriodVector))
310 throw runtime_error("Could not load CCDB table: PHOTON_BEAM/RF/beam_period");
311 double locBeamBunchPeriod = locBeamPeriodVector[0];
312
313 LockRead();
314 {
315 dTargetCenterZMap[locRunNumber] = locTargetCenterZ;
316 dBeamBunchPeriodMap[locRunNumber] = locBeamBunchPeriod;
317 }
318 UnlockRead();
319 }
320
321 // Get name of data class we're trying to extract
322 string dataClassName = factory->GetDataClassName();
323
324 if (dataClassName == "DPSHit")
16
←
Calling 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
19
←
Returning from 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
20
←
Taking false branch
→
325 return Extract_DPSHit(record,
326 dynamic_cast<JFactory<DPSHit>*>(factory), tag);
327
328 if (dataClassName == "DPSTruthHit")
21
←
Calling 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
24
←
Returning from 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
25
←
Taking false branch
→
329 return Extract_DPSTruthHit(record,
330 dynamic_cast<JFactory<DPSTruthHit>*>(factory), tag);
331
332 if (dataClassName == "DPSCHit")
26
←
Calling 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
29
←
Returning from 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
30
←
Taking false branch
→
333 return Extract_DPSCHit(record,
334 dynamic_cast<JFactory<DPSCHit>*>(factory), tag);
335
336 if (dataClassName == "DPSCTruthHit")
31
←
Calling 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
34
←
Returning from 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
35
←
Taking false branch
→
337 return Extract_DPSCTruthHit(record,
338 dynamic_cast<JFactory<DPSCTruthHit>*>(factory), tag);
339
340 if (dataClassName == "DRFTime")
36
←
Calling 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
39
←
Returning from 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
40
←
Taking false branch
→
341 return Extract_DRFTime(record,
342 dynamic_cast<JFactory<DRFTime>*>(factory), loop);
343
344 if (dataClassName == "DTAGMHit")
41
←
Calling 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
44
←
Returning from 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
45
←
Taking false branch
→
345 return Extract_DTAGMHit(record,
346 dynamic_cast<JFactory<DTAGMHit>*>(factory), tag);
347
348 if (dataClassName == "DTAGHHit")
46
←
Calling 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
49
←
Returning from 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
50
←
Taking false branch
→
349 return Extract_DTAGHHit(record,
350 dynamic_cast<JFactory<DTAGHHit>*>(factory), tag);
351
352 if (dataClassName == "DMCTrackHit")
51
←
Calling 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
54
←
Returning from 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
55
←
Taking false branch
→
353 return Extract_DMCTrackHit(record,
354 dynamic_cast<JFactory<DMCTrackHit>*>(factory), tag);
355
356 if (dataClassName == "DMCReaction")
56
←
Calling 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
59
←
Returning from 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
60
←
Taking true branch
→
357 return Extract_DMCReaction(record,
62
←
Calling 'DEventSourceHDDM::Extract_DMCReaction'
→
358 dynamic_cast<JFactory<DMCReaction>*>(factory), tag, loop);
61
←
Passing null pointer value via 4th parameter 'loop'
→
359
360 if (dataClassName == "DMCThrown")
361 return Extract_DMCThrown(record,
362 dynamic_cast<JFactory<DMCThrown>*>(factory), tag);
363
364 if (dataClassName == "DBCALTruthShower")
365 return Extract_DBCALTruthShower(record,
366 dynamic_cast<JFactory<DBCALTruthShower>*>(factory), tag);
367
368 if (dataClassName == "DBCALSiPMSpectrum")
369 return Extract_DBCALSiPMSpectrum(record,
370 dynamic_cast<JFactory<DBCALSiPMSpectrum>*>(factory), tag);
371
372 if (dataClassName == "DBCALTruthCell")
373 return Extract_DBCALTruthCell(record,
374 dynamic_cast<JFactory<DBCALTruthCell>*>(factory), tag);
375
376 if (dataClassName == "DBCALSiPMHit")
377 return Extract_DBCALSiPMHit(record,
378 dynamic_cast<JFactory<DBCALSiPMHit>*>(factory), tag);
379
380 if (dataClassName == "DBCALDigiHit")
381 return Extract_DBCALDigiHit(record,
382 dynamic_cast<JFactory<DBCALDigiHit>*>(factory), tag);
383
384 if (dataClassName == "DBCALIncidentParticle")
385 return Extract_DBCALIncidentParticle(record,
386 dynamic_cast<JFactory<DBCALIncidentParticle>*>(factory), tag);
387
388 if (dataClassName == "DBCALTDCDigiHit")
389 return Extract_DBCALTDCDigiHit(record,
390 dynamic_cast<JFactory<DBCALTDCDigiHit>*>(factory), tag);
391
392 if (dataClassName == "DCDCHit")
393 return Extract_DCDCHit(loop, record,
394 dynamic_cast<JFactory<DCDCHit>*>(factory) , tag);
395
396 if (dataClassName == "DFDCHit")
397 return Extract_DFDCHit(record,
398 dynamic_cast<JFactory<DFDCHit>*>(factory), tag);
399
400 if (dataClassName == "DFCALTruthShower")
401 return Extract_DFCALTruthShower(record,
402 dynamic_cast<JFactory<DFCALTruthShower>*>(factory), tag);
403
404 if (dataClassName == "DFCALHit")
405 return Extract_DFCALHit(record,
406 dynamic_cast<JFactory<DFCALHit>*>(factory), tag,
407 event.GetJEventLoop());
408
409 if (dataClassName == "DCCALTruthShower")
410 return Extract_DCCALTruthShower(record,
411 dynamic_cast<JFactory<DCCALTruthShower>*>(factory), tag);
412
413 if (dataClassName == "DCCALHit")
414 return Extract_DCCALHit(record,
415 dynamic_cast<JFactory<DCCALHit>*>(factory), tag,
416 event.GetJEventLoop());
417
418 if (dataClassName == "DMCTrajectoryPoint" && tag == "")
419 return Extract_DMCTrajectoryPoint(record,
420 dynamic_cast<JFactory<DMCTrajectoryPoint>*>(factory), tag);
421
422 if (dataClassName == "DTOFTruth")
423 return Extract_DTOFTruth(record,
424 dynamic_cast<JFactory<DTOFTruth>*>(factory), tag);
425
426 // TOF is a special case: TWO factories are needed at the same time
427 // DTOFHit and DTOFHitMC
428 if (dataClassName == "DTOFHit") {
429 JFactory_base* factory2 = loop->GetFactory("DTOFHitMC", tag.c_str());
430 return Extract_DTOFHit(record,
431 dynamic_cast<JFactory<DTOFHit>*>(factory),
432 dynamic_cast<JFactory<DTOFHitMC>*>(factory2), tag);
433 }
434 if (dataClassName == "DTOFHitMC") {
435 JFactory_base* factory2 = loop->GetFactory("DTOFHit", tag.c_str());
436 return Extract_DTOFHit(record,
437 dynamic_cast<JFactory<DTOFHit>*>(factory2),
438 dynamic_cast<JFactory<DTOFHitMC>*>(factory), tag);
439 }
440
441 if (dataClassName == "DSCHit")
442 return Extract_DSCHit(record,
443 dynamic_cast<JFactory<DSCHit>*>(factory), tag);
444
445 if (dataClassName == "DSCTruthHit")
446 return Extract_DSCTruthHit(record,
447 dynamic_cast<JFactory<DSCTruthHit>*>(factory), tag);
448
449 if (dataClassName == "DFMWPCTruthHit")
450 return Extract_DFMWPCTruthHit(record,
451 dynamic_cast<JFactory<DFMWPCTruthHit>*>(factory), tag);
452
453 if (dataClassName == "DFMWPCHit")
454 return Extract_DFMWPCHit(record,
455 dynamic_cast<JFactory<DFMWPCHit>*>(factory), tag);
456
457 if (dataClassName == "DDIRCTruthBarHit")
458 return Extract_DDIRCTruthBarHit(record,
459 dynamic_cast<JFactory<DDIRCTruthBarHit>*>(factory), tag);
460
461 if (dataClassName == "DDIRCTruthPmtHit")
462 return Extract_DDIRCTruthPmtHit(record,
463 dynamic_cast<JFactory<DDIRCTruthPmtHit>*>(factory), tag);
464
465 if (dataClassName == "DDIRCPmtHit")
466 return Extract_DDIRCPmtHit(record,
467 dynamic_cast<JFactory<DDIRCPmtHit>*>(factory), tag, event.GetJEventLoop());
468
469 // extract CereTruth and CereRichHit hits, yqiang Oct 3, 2012
470 // removed CereTruth (merged into MCThrown), added CereHit, yqiang Oct 10 2012
471 if (dataClassName == "DCereHit")
472 return Extract_DCereHit(record,
473 dynamic_cast<JFactory<DCereHit>*>(factory), tag);
474
475 if (dataClassName == "DTPOLHit")
476 return Extract_DTPOLHit(record,
477 dynamic_cast<JFactory<DTPOLHit>*>(factory), tag);
478
479 if (dataClassName == "DTPOLTruthHit")
480 return Extract_DTPOLTruthHit(record,
481 dynamic_cast<JFactory<DTPOLTruthHit>*>(factory), tag);
482
483 return OBJECT_NOT_AVAILABLE;
484}
485
486//------------------
487// Extract_DRFTime
488//------------------
489jerror_t DEventSourceHDDM::Extract_DRFTime(hddm_s::HDDM *record,
490 JFactory<DRFTime> *factory, JEventLoop* locEventLoop)
491{
492 if (factory==NULL__null)
493 return OBJECT_NOT_AVAILABLE;
494 string tag = (factory->Tag())? factory->Tag() : "";
495
496 vector<DRFTime*> locRFTimes;
497
498 // loop over RF-time records
499 const hddm_s::RFtimeList &rftimes = record->getRFtimes();
500 hddm_s::RFtimeList::iterator iter;
501 for (iter = rftimes.begin(); iter != rftimes.end(); ++iter)
502 {
503 if (iter->getJtag() != tag)
504 continue;
505 DRFTime *locRFTime = new DRFTime;
506 locRFTime->dTime = iter->getTsync();
507 locRFTime->dTimeVariance = 0.0; //SET ME!!
508 locRFTimes.push_back(locRFTime);
509 }
510
511 if(!locRFTimes.empty())
512 {
513 //found in the file, copy into factory and return
514 factory->CopyTo(locRFTimes);
515 return NOERROR;
516 }
517
518 //Not found in the file, so either:
519 //Experimental data & it's missing: bail
520 //MC data: generate it
521
522 vector<const DBeamPhoton*> locMCGENPhotons;
523 locEventLoop->Get(locMCGENPhotons, "MCGEN");
524 if(locMCGENPhotons.empty())
525 return OBJECT_NOT_AVAILABLE; //Experimental data & it's missing: bail
526
527 //Is MC data. Either:
528 //No tag: return t = 0.0, but true t is 0.0 +/- n*locBeamBunchPeriod: must select the correct beam bunch
529 //TRUTH tag: get exact t from DBeamPhoton tag MCGEN
530
531 if(tag == "TRUTH")
532 {
533 DRFTime *locRFTime = new DRFTime;
534 locRFTime->dTime = locMCGENPhotons[0]->time();
535 locRFTime->dTimeVariance = 0.0;
536 locRFTimes.push_back(locRFTime);
537 }
538 else
539 {
540 double locBeamBunchPeriod = 0.0;
541 int locRunNumber = locEventLoop->GetJEvent().GetRunNumber();
542 LockRead();
543 {
544 locBeamBunchPeriod = dBeamBunchPeriodMap[locRunNumber];
545 }
546 UnlockRead();
547
548 //start with true RF time, increment/decrement by multiples of locBeamBunchPeriod ns until closest to 0
549 double locTime = locMCGENPhotons[0]->time();
550 int locNumRFBuckets = int(locTime/locBeamBunchPeriod);
551 locTime -= double(locNumRFBuckets)*locBeamBunchPeriod;
552 while(locTime > 0.5*locBeamBunchPeriod)
553 locTime -= locBeamBunchPeriod;
554 while(locTime < -0.5*locBeamBunchPeriod)
555 locTime += locBeamBunchPeriod;
556
557 DRFTime *locRFTime = new DRFTime;
558 locRFTime->dTime = locTime;
559 locRFTime->dTimeVariance = 0.0;
560 locRFTimes.push_back(locRFTime);
561 }
562
563 // Copy into factories
564 factory->CopyTo(locRFTimes);
565
566 return NOERROR;
567}
568
569//------------------
570// Extract_DMCTrackHit
571//------------------
572jerror_t DEventSourceHDDM::Extract_DMCTrackHit(hddm_s::HDDM *record,
573 JFactory<DMCTrackHit> *factory, string tag)
574{
575 /// Copies the data from the given hddm_s structure. This is called
576 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
577 /// returns OBJECT_NOT_AVAILABLE immediately.
578
579 if (factory == NULL__null)
580 return OBJECT_NOT_AVAILABLE;
581 if (tag != "")
582 return OBJECT_NOT_AVAILABLE;
583
584 // The following routines will create DMCTrackHit objects and add them
585 // to data.
586 vector<DMCTrackHit*> data;
587 GetCDCTruthHits(record, data);
588 GetFDCTruthHits(record, data);
589 GetBCALTruthHits(record, data);
590 GetTOFTruthHits(record, data);
591 GetCherenkovTruthHits(record, data);
592 GetFCALTruthHits(record, data);
593 GetSCTruthHits(record, data);
594
595 // It has happened that some CDC hits have "nan" for the drift time
596 // in a peculiar event Alex Somov came across. This ultimately caused
597 // a seg. fault in MCTrackHitSort_C. I hate doing this since it
598 // is treating the symptom rather than the cause, but nonetheless,
599 // it patches up the problem for now until there is time to revisit
600 // it later.
601 for (unsigned int i=0; i < data.size(); i++)
602 if (!isfinite(data[i]->z))
603 data[i]->z = -1000.0;
604
605 // sort hits by z
606 sort(data.begin(), data.end(), MCTrackHitSort_C);
607
608 // Some systems will use negative phis. Force them all to
609 // be in the 0 to 2pi range
610 for (unsigned int i=0; i < data.size(); i++) {
611 DMCTrackHit *mctrackhit = data[i];
612 if (mctrackhit->phi < 0.0)
613 mctrackhit->phi += 2.0*M_PI3.14159265358979323846;
614 }
615
616 // Copy into factory
617 factory->CopyTo(data);
618
619 return NOERROR;
620}
621
622//-------------------
623// GetCDCTruthHits
624//-------------------
625jerror_t DEventSourceHDDM::GetCDCTruthHits(hddm_s::HDDM *record,
626 vector<DMCTrackHit*>& data)
627{
628 const hddm_s::CdcTruthPointList &points = record->getCdcTruthPoints();
629 hddm_s::CdcTruthPointList::iterator iter;
630 for (iter = points.begin(); iter != points.end(); ++iter) {
631 DMCTrackHit *mctrackhit = new DMCTrackHit;
632 mctrackhit->r = iter->getR();
633 mctrackhit->phi = iter->getPhi();
634 mctrackhit->z = iter->getZ();
635 mctrackhit->track = iter->getTrack();
636 mctrackhit->primary = iter->getPrimary();
637 mctrackhit->ptype = iter->getPtype();
638 mctrackhit->system = SYS_CDC;
639 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
640 mctrackhit->itrack = (ids.size())? ids.begin()->getItrack() : 0;
641 data.push_back(mctrackhit);
642 }
643
644 return NOERROR;
645}
646
647//-------------------
648// GetFDCTruthHits
649//-------------------
650jerror_t DEventSourceHDDM::GetFDCTruthHits(hddm_s::HDDM *record,
651 vector<DMCTrackHit*>& data)
652{
653 const hddm_s::FdcTruthPointList &points = record->getFdcTruthPoints();
654 hddm_s::FdcTruthPointList::iterator iter;
655 for (iter = points.begin(); iter != points.end(); ++iter) {
656 float x = iter->getX();
657 float y = iter->getY();
658 DMCTrackHit *mctrackhit = new DMCTrackHit;
659 mctrackhit->r = sqrt(x*x + y*y);
660 mctrackhit->phi = atan2(y,x);
661 mctrackhit->z = iter->getZ();
662 mctrackhit->track = iter->getTrack();
663 mctrackhit->primary = iter->getPrimary();
664 mctrackhit->ptype = iter->getPtype();
665 mctrackhit->system = SYS_FDC;
666 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
667 mctrackhit->itrack = (ids.size())? ids.begin()->getItrack() : 0;
668 data.push_back(mctrackhit);
669 }
670
671 return NOERROR;
672}
673
674//-------------------
675// GetBCALTruthHits
676//-------------------
677jerror_t DEventSourceHDDM::GetBCALTruthHits(hddm_s::HDDM *record,
678 vector<DMCTrackHit*>& data)
679{
680 const hddm_s::BcalTruthShowerList &showers = record->getBcalTruthShowers();
681 hddm_s::BcalTruthShowerList::iterator iter;
682 for (iter = showers.begin(); iter != showers.end(); ++iter) {
683 DMCTrackHit *mctrackhit = new DMCTrackHit;
684 mctrackhit->r = iter->getR();
685 mctrackhit->phi = iter->getPhi();
686 mctrackhit->z = iter->getZ();
687 mctrackhit->track = iter->getTrack();
688 mctrackhit->primary = iter->getPrimary();
689 mctrackhit->ptype = iter->getPtype();
690 mctrackhit->system = SYS_BCAL;
691 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
692 mctrackhit->itrack = (ids.size())? ids.begin()->getItrack() : 0;
693 data.push_back(mctrackhit);
694 }
695
696 return NOERROR;
697}
698
699//-------------------
700// GetTOFTruthHits
701//-------------------
702jerror_t DEventSourceHDDM::GetTOFTruthHits(hddm_s::HDDM *record,
703 vector<DMCTrackHit*>& data)
704{
705 const hddm_s::FtofTruthPointList &points = record->getFtofTruthPoints();
706 hddm_s::FtofTruthPointList::iterator iter;
707 for (iter = points.begin(); iter != points.end(); ++iter) {
708 float x = iter->getX();
709 float y = iter->getY();
710 DMCTrackHit *mctrackhit = new DMCTrackHit;
711 mctrackhit->r = sqrt(x*x + y*y);
712 mctrackhit->phi = atan2(y,x);
713 mctrackhit->z = iter->getZ();
714 mctrackhit->track = iter->getTrack();
715 mctrackhit->primary = iter->getPrimary();
716 mctrackhit->ptype = iter->getPtype(); // save GEANT particle type
717 mctrackhit->system = SYS_TOF;
718 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
719 mctrackhit->itrack = (ids.size())? ids.begin()->getItrack() : 0;
720 data.push_back(mctrackhit);
721 }
722
723 return NOERROR;
724}
725
726//-------------------
727// GetCherenkovTruthHits
728// modified by yqiang, Oct 10 2012
729//-------------------
730jerror_t DEventSourceHDDM::GetCherenkovTruthHits(hddm_s::HDDM *record,
731 vector<DMCTrackHit*>& data)
732{
733 const hddm_s::CereTruthPointList &points = record->getCereTruthPoints();
734 hddm_s::CereTruthPointList::iterator iter;
735 for (iter = points.begin(); iter != points.end(); ++iter) {
736 float x = iter->getX();
737 float y = iter->getY();
738 DMCTrackHit *mctrackhit = new DMCTrackHit;
739 mctrackhit->r = sqrt(x*x + y*y);
740 mctrackhit->phi = atan2(y,x);
741 mctrackhit->z = iter->getZ();
742 mctrackhit->track = iter->getTrack();
743 mctrackhit->primary = iter->getPrimary();
744 mctrackhit->ptype = iter->getPtype(); // save GEANT particle typ()e
745 mctrackhit->system = SYS_CHERENKOV;
746 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
747 mctrackhit->itrack = (ids.size())? ids.begin()->getItrack() : 0;
748 data.push_back(mctrackhit);
749 }
750
751 return NOERROR;
752}
753
754//-------------------
755// GetFCALTruthHits
756//-------------------
757jerror_t DEventSourceHDDM::GetFCALTruthHits(hddm_s::HDDM *record,
758 vector<DMCTrackHit*>& data)
759{
760 const hddm_s::FcalTruthShowerList &points = record->getFcalTruthShowers();
761 hddm_s::FcalTruthShowerList::iterator iter;
762 for (iter = points.begin(); iter != points.end(); ++iter) {
763 float x = iter->getX();
764 float y = iter->getY();
765 DMCTrackHit *mctrackhit = new DMCTrackHit;
766 mctrackhit->r = sqrt(x*x + y*y);
767 mctrackhit->phi = atan2(y,x);
768 mctrackhit->z = iter->getZ();
769 mctrackhit->track = iter->getTrack();
770 mctrackhit->primary = iter->getPrimary();
771 mctrackhit->ptype = iter->getPtype();
772 mctrackhit->system = SYS_FCAL;
773 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
774 mctrackhit->itrack = (ids.size())? ids.begin()->getItrack() : 0;
775 data.push_back(mctrackhit);
776 }
777
778 return NOERROR;
779}
780
781//-------------------
782// GetCCALTruthHits
783//-------------------
784jerror_t DEventSourceHDDM::GetCCALTruthHits(hddm_s::HDDM *record,
785 vector<DMCTrackHit*>& data)
786{
787 const hddm_s::CcalTruthShowerList &points = record->getCcalTruthShowers();
788 hddm_s::CcalTruthShowerList::iterator iter;
789 for (iter = points.begin(); iter != points.end(); ++iter) {
790 float x = iter->getX();
791 float y = iter->getY();
792 DMCTrackHit *mctrackhit = new DMCTrackHit;
793 mctrackhit->r = sqrt(x*x + y*y);
794 mctrackhit->phi = atan2(y,x);
795 mctrackhit->z = iter->getZ();
796 mctrackhit->track = iter->getTrack();
797 mctrackhit->primary = iter->getPrimary();
798 mctrackhit->ptype = iter->getPtype();
799 mctrackhit->system = SYS_CCAL;
800 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
801 mctrackhit->itrack = (ids.size())? ids.begin()->getItrack() : 0;
802 data.push_back(mctrackhit);
803 }
804
805 return NOERROR;
806}
807
808
809//-------------------
810// GetSCTruthHits
811//-------------------
812jerror_t DEventSourceHDDM::GetSCTruthHits(hddm_s::HDDM *record,
813 vector<DMCTrackHit*>& data)
814{
815 const hddm_s::StcTruthPointList &points = record->getStcTruthPoints();
816 hddm_s::StcTruthPointList::iterator iter;
817 for (iter = points.begin(); iter != points.end(); ++iter) {
818 DMCTrackHit *mctrackhit = new DMCTrackHit;
819 mctrackhit->r = iter->getR();
820 mctrackhit->phi = iter->getPhi();
821 mctrackhit->z = iter->getZ();
822 mctrackhit->track = iter->getTrack();
823 mctrackhit->primary = iter->getPrimary();
824 mctrackhit->ptype = iter->getPtype(); // save GEANT particle type
825 mctrackhit->system = SYS_START;
826 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
827 mctrackhit->itrack = (ids.size())? ids.begin()->getItrack() : 0;
828 data.push_back(mctrackhit);
829 }
830
831 return NOERROR;
832}
833
834//------------------
835// Extract_DBCALSiPMHit
836//------------------
837jerror_t DEventSourceHDDM::Extract_DBCALSiPMHit(hddm_s::HDDM *record,
838 JFactory<DBCALSiPMHit> *factory, string tag)
839{
840 /// Copies the data from the given hddm_s structure. This is called
841 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
842 /// returns OBJECT_NOT_AVAILABLE immediately.
843
844 if (factory == NULL__null)
845 return OBJECT_NOT_AVAILABLE;
846 if (tag != "")
847 return OBJECT_NOT_AVAILABLE;
848
849 vector<DBCALSiPMHit*> data;
850
851 const hddm_s::BcalSiPMUpHitList &uphits = record->getBcalSiPMUpHits();
852 hddm_s::BcalSiPMUpHitList::iterator uiter;
853 for (uiter = uphits.begin(); uiter != uphits.end(); ++uiter) {
854 DBCALSiPMHit *response = new DBCALSiPMHit;
855 response->module = uiter->getModule();
856 response->layer = uiter->getLayer();
857 response->sector = uiter->getSector();
858 response->E = uiter->getE();
859 response->t = uiter->getT();
860 response->end = DBCALGeometry::kUpstream;
861 response->cellId = dBCALGeom->cellId(uiter->getModule(),
862 uiter->getLayer(),
863 uiter->getSector());
864 data.push_back(response);
865 }
866
867 const hddm_s::BcalSiPMDownHitList &downhits = record->getBcalSiPMDownHits();
868 hddm_s::BcalSiPMDownHitList::iterator diter;
869 for (diter = downhits.begin(); diter != downhits.end(); ++diter) {
870 DBCALSiPMHit *response = new DBCALSiPMHit;
871 response->module = diter->getModule();
872 response->layer = diter->getLayer();
873 response->sector = diter->getSector();
874 response->E = diter->getE();
875 response->t = diter->getT();
876 response->end = DBCALGeometry::kDownstream;
877 response->cellId = dBCALGeom->cellId(diter->getModule(),
878 diter->getLayer(),
879 diter->getSector());
880 data.push_back(response);
881 }
882
883 // Copy into factory
884 factory->CopyTo(data);
885
886 return NOERROR;
887}
888
889//------------------
890// Extract_DBCALDigiHit
891//------------------
892jerror_t DEventSourceHDDM::Extract_DBCALDigiHit(hddm_s::HDDM *record,
893 JFactory<DBCALDigiHit> *factory, string tag)
894{
895 /// Copies the data from the given hddm_s structure. This is called
896 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
897 /// returns OBJECT_NOT_AVAILABLE immediately.
898
899 if (factory == NULL__null)
900 return OBJECT_NOT_AVAILABLE;
901 if (tag != "")
902 return OBJECT_NOT_AVAILABLE;
903
904 vector<DBCALDigiHit*> data;
905
906 const hddm_s::BcalfADCDigiHitList &digihits = record->getBcalfADCDigiHits();
907 hddm_s::BcalfADCDigiHitList::iterator iter;
908 for (iter = digihits.begin(); iter != digihits.end(); ++iter) {
909 DBCALDigiHit *response = new DBCALDigiHit;
910 response->module = iter->getModule();
911 response->layer = iter->getLayer();
912 response->sector = iter->getSector();
913 response->pulse_integral = (uint32_t)iter->getPulse_integral();
914 response->pulse_peak = 0;
915 if(iter->getBcalfADCPeaks().size() > 0) {
916 response->pulse_peak = iter->getBcalfADCPeak().getPeakAmp();
917 }
918 response->pulse_time = (uint32_t)iter->getPulse_time();
919 response->pedestal = 1;
920 response->QF = 1;
921 response->nsamples_integral = 1;
922 response->nsamples_pedestal = 1;
923 response->datasource = 3;
924 response->end = (iter->getEnd() == 0)? DBCALGeometry::kUpstream :
925 DBCALGeometry::kDownstream;
926 data.push_back(response);
927 }
928
929 // Copy into factory
930 factory->CopyTo(data);
931
932 return NOERROR;
933}
934
935//------------------
936// Extract_DBCALIncidentParticle
937//------------------
938jerror_t DEventSourceHDDM::Extract_DBCALIncidentParticle(hddm_s::HDDM *record,
939 JFactory<DBCALIncidentParticle> *factory,
940 string tag)
941{
942 /// Copies the data from the given hddm_s structure. This is called
943 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
944 /// returns OBJECT_NOT_AVAILABLE immediately.
945
946 if (factory == NULL__null)
947 return OBJECT_NOT_AVAILABLE;
948 if (tag != "")
949 return OBJECT_NOT_AVAILABLE;
950
951 vector<DBCALIncidentParticle*> data;
952
953 const hddm_s::BcalTruthIncidentParticleList &plist =
954 record->getBcalTruthIncidentParticles();
955 hddm_s::BcalTruthIncidentParticleList::iterator iter;
956 for (iter = plist.begin(); iter != plist.end(); ++iter) {
957 DBCALIncidentParticle *part = new DBCALIncidentParticle;
958 part->ptype = iter->getPtype();
959 part->px = iter->getPx();
960 part->py = iter->getPy();
961 part->pz = iter->getPz();
962 part->x = iter->getX();
963 part->y = iter->getY();
964 part->z = iter->getZ();
965 data.push_back(part);
966 }
967
968 factory->CopyTo(data);
969
970 return NOERROR;
971}
972
973//------------------
974// Extract_DBCALSiPMSpectrum
975//------------------
976jerror_t DEventSourceHDDM::Extract_DBCALSiPMSpectrum(hddm_s::HDDM *record,
977 JFactory<DBCALSiPMSpectrum> *factory,
978 string tag)
979{
980 /// Copies the data from the given hddm_s structure. This is called
981 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
982 /// returns OBJECT_NOT_AVAILABLE immediately.
983
984 if (factory == NULL__null)
985 return OBJECT_NOT_AVAILABLE;
986 if (tag != "" && tag != "TRUTH")
987 return OBJECT_NOT_AVAILABLE;
988
989 vector<DBCALSiPMSpectrum*> data;
990
991 const hddm_s::BcalSiPMSpectrumList &specs = record->getBcalSiPMSpectrums();
992 hddm_s::BcalSiPMSpectrumList::iterator iter;
993 for (iter = specs.begin(); iter != specs.end(); ++iter) {
994 DBCALSiPMSpectrum *dana_spectrum = new DBCALSiPMSpectrum;
995 dana_spectrum->module = iter->getModule();
996 dana_spectrum->layer = iter->getLayer();
997 dana_spectrum->sector = iter->getSector();
998 dana_spectrum->end = (iter->getEnd()==0)?
999 DBCALGeometry::kUpstream :
1000 DBCALGeometry::kDownstream;
1001 if (tag == "")
1002 dana_spectrum->incident_id = 0;
1003 else if (tag == "TRUTH") {
1004 const hddm_s::BcalSiPMTruthList &truths = iter->getBcalSiPMTruths();
1005 if (truths.size() > 0)
1006 dana_spectrum->incident_id = truths.begin()->getIncident_id();
1007 else
1008 dana_spectrum->incident_id = 0;
1009 }
1010
1011 double t = iter->getTstart();
1012 double bin_width = iter->getBin_width();
1013 stringstream ss(iter->getVals());
1014
1015 // Extract values and use them to fill histo
1016 string entry;
1017 while (ss >> entry) {
1018 if (entry[0] == 'X') {
1019 // get rid of the X, the rest of the entry is the number of zeroes to add
1020 stringstream sss(entry.substr(1));
1021 int num_zeros;
1022 sss >> num_zeros;
1023
1024 for(int i=0; i<num_zeros; i++) {
1025 dana_spectrum->spectrum.Fill(t, 0.0);
1026 t += bin_width;
1027 }
1028 } else {
1029 stringstream sss(entry);
1030 double dE;
1031 sss >> dE;
1032 dana_spectrum->spectrum.Fill(t, dE);
1033 t += bin_width;
1034 }
1035 }
1036
1037 data.push_back(dana_spectrum);
1038 }
1039
1040 // Copy into factory
1041 factory->CopyTo(data);
1042
1043 return NOERROR;
1044}
1045
1046//------------------
1047// Extract_DBCALTDCDigiHit
1048//------------------
1049jerror_t DEventSourceHDDM::Extract_DBCALTDCDigiHit(hddm_s::HDDM *record,
1050 JFactory<DBCALTDCDigiHit> *factory, string tag)
1051{
1052 /// Copies the data from the given hddm_s structure. This is called
1053 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1054 /// returns OBJECT_NOT_AVAILABLE immediately.
1055
1056 if (factory == NULL__null)
1057 return OBJECT_NOT_AVAILABLE;
1058 if (tag != "")
1059 return OBJECT_NOT_AVAILABLE;
1060
1061 vector<DBCALTDCDigiHit*> data;
1062
1063 const hddm_s::BcalTDCDigiHitList &hits = record->getBcalTDCDigiHits();
1064 hddm_s::BcalTDCDigiHitList::iterator iter;
1065 for (iter = hits.begin(); iter != hits.end(); ++iter) {
1066 DBCALTDCDigiHit *bcaltdchit = new DBCALTDCDigiHit;
1067 bcaltdchit->module = iter->getModule();
1068 bcaltdchit->layer = iter->getLayer();
1069 bcaltdchit->sector = iter->getSector();
1070 bcaltdchit->end = (iter->getEnd() == 0)? DBCALGeometry::kUpstream :
1071 DBCALGeometry::kDownstream;
1072 bcaltdchit->time = (uint32_t)iter->getTime();
1073 data.push_back(bcaltdchit);
1074 }
1075
1076 // Copy into factory
1077 factory->CopyTo(data);
1078
1079 return NOERROR;
1080}
1081
1082//------------------
1083// Extract_DMCReaction
1084//------------------
1085jerror_t DEventSourceHDDM::Extract_DMCReaction(hddm_s::HDDM *record,
1086 JFactory<DMCReaction> *factory, string tag,
1087 JEventLoop *loop)
1088{
1089 /// Copies the data from the given hddm_s structure. This is called
1090 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1091 /// returns OBJECT_NOT_AVAILABLE immediately.
1092
1093 if (tag != "")
63
←
Calling 'operator!=<char, std::char_traits<char>, std::allocator<char>>'
→
69
←
Returning from 'operator!=<char, std::char_traits<char>, std::allocator<char>>'
→
70
←
Taking false branch
→
1094 return OBJECT_NOT_AVAILABLE;
1095
1096 if (factory
70.1
'factory' is not equal to NULL
70.1
'factory' is not equal to NULL
 == NULL__null)
71
←
Taking false branch
→
1097 return OBJECT_NOT_AVAILABLE;
1098
1099 double locTargetCenterZ = 0.0;
1100 int locRunNumber = loop->GetJEvent().GetRunNumber();
72
←
Called C++ object pointer is null
1101 LockRead();
1102 {
1103 locTargetCenterZ = dTargetCenterZMap[locRunNumber];
1104 }
1105 UnlockRead();
1106 DVector3 locPosition(0.0, 0.0, locTargetCenterZ);
1107
1108 vector<DMCReaction*> dmcreactions;
1109
1110 const hddm_s::ReactionList &reacts = record->getReactions();
1111 hddm_s::ReactionList::iterator iter;
1112 for (iter = reacts.begin(); iter != reacts.end(); ++iter) {
1113 DMCReaction *mcreaction = new DMCReaction;
1114 dmcreactions.push_back(mcreaction);
1115 mcreaction->type = iter->getType();
1116 mcreaction->weight = iter->getWeight();
1117 hddm_s::Origin &origin = iter->getVertex().getOrigin();
1118 double torig = origin.getT();
1119 double zorig = origin.getVz();
1120
1121 const hddm_s::BeamList &beams = record->getBeams();
1122 if (beams.size() > 0) {
1123 hddm_s::Beam &beam = iter->getBeam();
1124 DVector3 mom(beam.getMomentum().getPx(),
1125 beam.getMomentum().getPy(),
1126 beam.getMomentum().getPz());
1127 mcreaction->beam.setPosition(locPosition);
1128 mcreaction->beam.setMomentum(mom);
1129 mcreaction->beam.setPID(Gamma);
1130 mcreaction->target.setPID(IDTrack(mcreaction->beam.charge(),
1131 mcreaction->beam.mass()));
1132 mcreaction->beam.setTime(torig - (zorig - locTargetCenterZ)/29.9792458);
1133 }
1134 else {
1135 // fake values for DMCReaction
1136 mcreaction->beam.setPosition(locPosition);
1137 mcreaction->beam.setPID(Gamma);
1138 }
1139
1140 const hddm_s::TargetList &targets = record->getTargets();
1141 if (targets.size() > 0) {
1142 hddm_s::Target &target = iter->getTarget();
1143 DKinematicData target_kd;
1144 DVector3 mom(target.getMomentum().getPx(),
1145 target.getMomentum().getPy(),
1146 target.getMomentum().getPz());
1147 mcreaction->target.setPosition(locPosition);
1148 mcreaction->target.setMomentum(mom);
1149 mcreaction->target.setPID(IDTrack(target.getProperties().getCharge(),
1150 target.getProperties().getMass()));
1151 mcreaction->target.setTime(torig - (zorig - locTargetCenterZ)/29.9792458);
1152 }
1153 else {
1154 // fake values for DMCReaction
1155 mcreaction->target.setPosition(locPosition);
1156 }
1157 }
1158
1159 // Copy into factories
1160 //_DBG_<<"Creating "<<dmcreactions.size()<<" DMCReaction objects"<<endl;
1161
1162 factory->CopyTo(dmcreactions);
1163
1164 return NOERROR;
1165}
1166
1167//------------------
1168// Extract_DMCThrown
1169//------------------
1170jerror_t DEventSourceHDDM::Extract_DMCThrown(hddm_s::HDDM *record,
1171 JFactory<DMCThrown> *factory, string tag)
1172{
1173 /// Copies the data from the given hddm_s structure. This is called
1174 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1175 /// returns OBJECT_NOT_AVAILABLE immediately.
1176
1177 if (factory == NULL__null)
1178 return OBJECT_NOT_AVAILABLE;
1179 if (tag != "")
1180 return OBJECT_NOT_AVAILABLE;
1181
1182 vector<DMCThrown*> data;
1183
1184 const hddm_s::VertexList &verts = record->getVertices();
1185 hddm_s::VertexList::iterator iter;
1186 for (iter = verts.begin(); iter != verts.end(); ++iter) {
1187 const hddm_s::OriginList &origs = iter->getOrigins();
1188 const hddm_s::ProductList &prods = iter->getProducts();
1189 double vertex[4] = {0., 0., 0., 0.};
1190 if (origs.size() > 0) {
1191 vertex[0] = iter->getOrigin().getT();
1192 vertex[1] = iter->getOrigin().getVx();
1193 vertex[2] = iter->getOrigin().getVy();
1194 vertex[3] = iter->getOrigin().getVz();
1195 }
1196 hddm_s::ProductList::iterator piter;
1197 for (piter = prods.begin(); piter != prods.end(); ++piter) {
1198 double E = piter->getMomentum().getE();
1199 double px = piter->getMomentum().getPx();
1200 double py = piter->getMomentum().getPy();
1201 double pz = piter->getMomentum().getPz();
1202 double mass = sqrt(E*E - (px*px + py*py + pz*pz));
1203 if (!isfinite(mass))
1204 mass = 0.0;
1205 DMCThrown *mcthrown = new DMCThrown;
1206 mcthrown->type = piter->getType();
1207 mcthrown->myid = piter->getId();
1208 mcthrown->parentid = piter->getParentid();
1209 mcthrown->mech = piter->getMech();
1210 mcthrown->pdgtype = piter->getPdgtype();
1211 mcthrown->setPID((Particle_t)mcthrown->type);
1212 mcthrown->setMomentum(DVector3(px, py, pz));
1213 mcthrown->setPosition(DVector3(vertex[1], vertex[2], vertex[3]));
1214 mcthrown->setTime(vertex[0]);
1215 data.push_back(mcthrown);
1216 }
1217 }
1218
1219 // Copy into factory
1220 factory->CopyTo(data);
1221
1222 return NOERROR;
1223}
1224
1225//------------------
1226// Extract_DCDCHit
1227//------------------
1228jerror_t DEventSourceHDDM::Extract_DCDCHit(JEventLoop* locEventLoop, hddm_s::HDDM *record,
1229 JFactory<DCDCHit> *factory, string tag)
1230{
1231 /// Copies the data from the given hddm_s structure. This is called
1232 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1233 /// returns OBJECT_NOT_AVAILABLE immediately.
1234
1235 if (factory == NULL__null)
1236 return OBJECT_NOT_AVAILABLE;
1237
1238 // Since we are writing out CDC hits with the new "Calib" tag by default
1239 // assume that is what we are reading in, so that we don't support the
1240 // default tag anymore
1241 // sdobbs -- 3/13/2018
1242 //if (tag != "" && tag != "TRUTH" && tag != "Calib")
1243 if (tag != "TRUTH" && tag != "Calib")
1244 return OBJECT_NOT_AVAILABLE;
1245
1246 vector<DCDCHit*> data;
1247
1248 if ( tag == "" || tag == "Calib" ) {
1249 vector<const DCDCHit*> locTruthHits;
1250 locEventLoop->Get(locTruthHits, "TRUTH");
1251
1252 //pre-sort truth hits
1253 map<pair<int, int>, vector<const DCDCHit*>> locTruthHitMap; //key pair: ring, straw
1254 for(auto& locTruthHit : locTruthHits)
1255 locTruthHitMap[std::make_pair(locTruthHit->ring, locTruthHit->straw)].push_back(locTruthHit);
1256
1257 const hddm_s::CdcStrawHitList &hits = record->getCdcStrawHits();
1258 hddm_s::CdcStrawHitList::iterator iter;
1259 int locIndex = 0;
1260 for (iter = hits.begin(); iter != hits.end(); ++iter) {
1261 DCDCHit *hit = new DCDCHit;
1262 hit->ring = iter->getRing();
1263 hit->straw = iter->getStraw();
1264 hit->q = iter->getQ();
1265 hit->t = iter->getT();
1266 if(iter->getCdcDigihits().size() > 0) {
1267 hit->amp = iter->getCdcDigihit().getPeakAmp();
1268 }
1269 else{
1270 // for generated events (not folded-in background events) for which we
1271 // have no digi hits return q
1272 hit->amp=hit->q;
1273 }
1274 hit->QF = 0;
1275 if(iter->getCdcHitQFs().size() > 0) {
1276 hit->QF = iter->getCdcHitQF().getQF();
1277 }
1278 hit->d = 0.; // initialize to zero to avoid any NaN
1279 hit->itrack = 0; // track information is in TRUTH tag
1280 hit->ptype = 0; // ditto
1281
1282 //match hit between truth & recon
1283 auto& locPotentialTruthHits = locTruthHitMap[std::make_pair(hit->ring, hit->straw)];
1284 double locBestDeltaT = 9.9E99;
1285 const DCDCHit* locBestTruthHit = nullptr;
1286 for(auto& locTruthHit : locPotentialTruthHits)
1287 {
1288 auto locDeltaT = fabs(hit->t - locTruthHit->t);
1289 if(locDeltaT >= locBestDeltaT)
1290 continue;
1291 locBestDeltaT = locDeltaT;
1292 locBestTruthHit = locTruthHit;
1293 }
1294 if(locBestTruthHit != nullptr)
1295 hit->AddAssociatedObject(locBestTruthHit);
1296
1297 data.push_back(hit);
1298 ++locIndex;
1299 }
1300 }
1301 else if (tag == "TRUTH") {
1302 const hddm_s::CdcStrawTruthHitList &thits = record->getCdcStrawTruthHits();
1303 hddm_s::CdcStrawTruthHitList::iterator iter;
1304 for (iter = thits.begin(); iter != thits.end(); ++iter) {
1305 DCDCHit *hit = new DCDCHit;
1306 hit->ring = iter->getRing();
1307 hit->straw = iter->getStraw();
1308 hit->q = iter->getQ();
1309 hit->t = iter->getT();
1310 hit->d = iter->getD();
1311 hit->itrack = iter->getItrack();
1312 hit->ptype = iter->getPtype();
1313 data.push_back(hit);
1314 }
1315 }
1316
1317 // Copy into factory
1318 factory->CopyTo(data);
1319
1320 return NOERROR;
1321}
1322
1323
1324//------------------
1325// Extract_DFDCHit
1326//------------------
1327jerror_t DEventSourceHDDM::Extract_DFDCHit(hddm_s::HDDM *record,
1328 JFactory<DFDCHit> *factory, string tag)
1329{
1330 /// Copies the data from the given hddm_s structure. This is called
1331 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1332 /// returns OBJECT_NOT_AVAILABLE immediately.
1333
1334 if (factory == NULL__null)
1335 return OBJECT_NOT_AVAILABLE;
1336 if (tag != "" && tag != "TRUTH" && tag != "CALIB")
1337 return OBJECT_NOT_AVAILABLE;
1338
1339 vector<DFDCHit*> data;
1340
1341 if (tag == "") {
1342 const hddm_s::FdcAnodeHitList &ahits = record->getFdcAnodeHits();
1343 hddm_s::FdcAnodeHitList::iterator ahiter;
1344 for (ahiter = ahits.begin(); ahiter != ahits.end(); ++ahiter) {
1345 DFDCHit* newHit = new DFDCHit();
1346 newHit->layer = ahiter->getLayer();
1347 newHit->module = ahiter->getModule();
1348 newHit->element = ahiter->getWire();
1349 newHit->q = ahiter->getDE();
1350 newHit->pulse_height = 0.; // not measured
1351 newHit->t = ahiter->getT();
1352 newHit->d = 0.; // initialize to zero to avoid any NaN
1353 newHit->itrack = 0; // track information is in TRUTH tag
1354 newHit->ptype = 0; // ditto
1355 newHit->plane = 2;
1356 newHit->type = 0;
1357 newHit->gPlane = DFDCGeometry::gPlane(newHit);
1358 newHit->gLayer = DFDCGeometry::gLayer(newHit);
1359 newHit->r = DFDCGeometry::getWireR(newHit);
1360 data.push_back(newHit);
1361 }
1362
1363 // Ditto for the cathodes.
1364 const hddm_s::FdcCathodeHitList &chits = record->getFdcCathodeHits();
1365 hddm_s::FdcCathodeHitList::iterator chiter;
1366 for (chiter = chits.begin(); chiter != chits.end(); ++chiter) {
1367 DFDCHit* newHit = new DFDCHit();
1368 newHit->layer = chiter->getLayer();
1369 newHit->module = chiter->getModule();
1370 newHit->element = chiter->getStrip();
1371 if (newHit->element > 1000)
1372 newHit->element -= 1000;
1373 newHit->plane = chiter->getPlane();
1374 newHit->q = chiter->getQ();
1375 newHit->pulse_height = newHit->q;
1376 if(chiter->getFdcDigihits().size() > 0) {
1377 newHit->pulse_height = chiter->getFdcDigihit().getPeakAmp();
1378 }
1379 newHit->t = chiter->getT();
1380 newHit->d = 0.; // initialize to zero to avoid any NaN
1381 newHit->itrack = 0; // track information is in TRUTH tag
1382 newHit->ptype = 0; // ditto
1383 newHit->type = 1;
1384 newHit->gPlane = DFDCGeometry::gPlane(newHit);
1385 newHit->gLayer = DFDCGeometry::gLayer(newHit);
1386 newHit->r = DFDCGeometry::getStripR(newHit);
1387 data.push_back(newHit);
1388 }
1389 }
1390
1391 else if (tag == "TRUTH"){
1392 const hddm_s::FdcAnodeTruthHitList &aths = record->getFdcAnodeTruthHits();
1393 hddm_s::FdcAnodeTruthHitList::iterator atiter;
1394 for (atiter = aths.begin(); atiter != aths.end(); ++atiter) {
1395 DFDCHit* newHit = new DFDCHit();
1396 newHit->layer = atiter->getLayer();
1397 newHit->module = atiter->getModule();
1398 newHit->element = atiter->getWire();
1399 newHit->q = atiter->getDE();
1400 newHit->pulse_height=0.; // not measured
1401 newHit->t = atiter->getT();
1402 newHit->d = atiter->getD();
1403 newHit->itrack = atiter->getItrack();
1404 newHit->ptype = atiter->getPtype();
1405 newHit->plane = 2;
1406 newHit->type = 0;
1407 newHit->gPlane = DFDCGeometry::gPlane(newHit);
1408 newHit->gLayer = DFDCGeometry::gLayer(newHit);
1409 newHit->r = DFDCGeometry::getWireR(newHit);
1410 data.push_back(newHit);
1411 }
1412
1413 // Ditto for the cathodes.
1414 const hddm_s::FdcCathodeTruthHitList &cths =
1415 record->getFdcCathodeTruthHits();
1416 hddm_s::FdcCathodeTruthHitList::iterator ctiter;
1417 for (ctiter = cths.begin(); ctiter != cths.end(); ++ctiter) {
1418 DFDCHit* newHit = new DFDCHit();
1419 newHit->layer = ctiter->getLayer();
1420 newHit->module = ctiter->getModule();
1421 newHit->element = ctiter->getStrip();
1422 if (newHit->element > 1000)
1423 newHit->element -= 1000;
1424 newHit->plane = ctiter->getPlane();
1425 newHit->q = ctiter->getQ();
1426 newHit->pulse_height = newHit->q;
1427 newHit->t = ctiter->getT();
1428 newHit->d = 0.; // initialize to zero to avoid any NaN
1429 newHit->itrack = ctiter->getItrack();
1430 newHit->ptype = ctiter->getPtype();
1431 newHit->type = 1;
1432 newHit->gPlane = DFDCGeometry::gPlane(newHit);
1433 newHit->gLayer = DFDCGeometry::gLayer(newHit);
1434 newHit->r = DFDCGeometry::getStripR(newHit);
1435 data.push_back(newHit);
1436 }
1437 }
1438
1439 else if (tag == "CALIB") {
1440 // Deal with the wires
1441 const hddm_s::FdcAnodeHitList &ahits = record->getFdcAnodeHits();
1442 hddm_s::FdcAnodeHitList::iterator ahiter;
1443 for (ahiter = ahits.begin(); ahiter != ahits.end(); ++ahiter) {
1444 DFDCHit* newHit = new DFDCHit();
1445 newHit->layer = ahiter->getLayer();
1446 newHit->module = ahiter->getModule();
1447 newHit->element = ahiter->getWire();
1448 newHit->q = ahiter->getDE();
1449 newHit->t = ahiter->getT();
1450 newHit->d = 0.; // initialize to zero to avoid any NaN
1451 newHit->itrack = 0; // track information is in TRUTH tag
1452 newHit->ptype = 0; // ditto
1453 newHit->plane = 2;
1454 newHit->type = 0;
1455 newHit->gPlane = DFDCGeometry::gPlane(newHit);
1456 newHit->gLayer = DFDCGeometry::gLayer(newHit);
1457 newHit->r = DFDCGeometry::getWireR(newHit);
1458 data.push_back(newHit);
1459 }
1460
1461 // Ditto for the cathodes.
1462 const hddm_s::FdcCathodeHitList &chits = record->getFdcCathodeHits();
1463 hddm_s::FdcCathodeHitList::iterator chiter;
1464 for (chiter = chits.begin(); chiter != chits.end(); ++chiter) {
1465 DFDCHit* newHit = new DFDCHit();
1466 newHit->layer = chiter->getLayer();
1467 newHit->module = chiter->getModule();
1468 newHit->element = chiter->getStrip();
1469 if (newHit->element > 1000)
1470 newHit->element-=1000;
1471 newHit->plane = chiter->getPlane();
1472 if (newHit->plane == 1) // v
1473 newHit->q = chiter->getQ()*vscale[newHit->element-1];
1474 else // u
1475 newHit->q = chiter->getQ()*uscale[newHit->element-1];
1476 newHit->t = chiter->getT();
1477 newHit->d = 0.; // initialize to zero to avoid any NaN
1478 newHit->itrack = 0; // track information is in TRUTH tag
1479 newHit->ptype = 0; // ditto
1480 newHit->type = 1;
1481 newHit->gPlane = DFDCGeometry::gPlane(newHit);
1482 newHit->gLayer = DFDCGeometry::gLayer(newHit);
1483 newHit->r = DFDCGeometry::getStripR(newHit);
1484 data.push_back(newHit);
1485 }
1486 }
1487
1488 // Copy into factory
1489 factory->CopyTo(data);
1490
1491 return NOERROR;
1492}
1493
1494//------------------
1495// Extract_DBCALTruthShower
1496//------------------
1497jerror_t DEventSourceHDDM::Extract_DBCALTruthShower(hddm_s::HDDM *record,
1498 JFactory<DBCALTruthShower> *factory,
1499 string tag)
1500{
1501 /// Copies the data from the given hddm_s structure. This is called
1502 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1503 /// returns OBJECT_NOT_AVAILABLE immediately.
1504
1505 if (factory == NULL__null)
1506 return OBJECT_NOT_AVAILABLE;
1507 if (tag != "")
1508 return OBJECT_NOT_AVAILABLE;
1509
1510 vector<DBCALTruthShower*> data;
1511
1512 const hddm_s::BcalTruthShowerList &shows = record->getBcalTruthShowers();
1513 hddm_s::BcalTruthShowerList::iterator iter;
1514 for (iter = shows.begin(); iter != shows.end(); ++iter) {
1515 DBCALTruthShower *bcaltruth = new DBCALTruthShower;
1516 bcaltruth->track = iter->getTrack();
1517 bcaltruth->ptype = iter->getPtype();
1518 bcaltruth->primary = (iter->getPrimary())? 1 : 0;
1519 bcaltruth->phi = iter->getPhi();
1520 bcaltruth->r = iter->getR();
1521 bcaltruth->z = iter->getZ();
1522 bcaltruth->t = iter->getT();
1523 bcaltruth->E = iter->getE();
1524 bcaltruth->px = iter->getPx();
1525 bcaltruth->py = iter->getPy();
1526 bcaltruth->pz = iter->getPz();
1527 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
1528 bcaltruth->itrack = (ids.size())? ids.begin()->getItrack() : 0;
1529 data.push_back(bcaltruth);
1530 }
1531
1532 // Copy into factory
1533 factory->CopyTo(data);
1534
1535 return NOERROR;
1536}
1537
1538//------------------
1539// Extract_DBCALTruthCell
1540//------------------
1541jerror_t DEventSourceHDDM::Extract_DBCALTruthCell(hddm_s::HDDM *record,
1542 JFactory<DBCALTruthCell> *factory,
1543 string tag)
1544{
1545 /// Copies the data from the given hddm_s structure. This is called
1546 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1547 /// returns OBJECT_NOT_AVAILABLE immediately.
1548
1549 if (factory == NULL__null)
1550 return OBJECT_NOT_AVAILABLE;
1551 if (tag != "")
1552 return OBJECT_NOT_AVAILABLE;
1553
1554 vector<DBCALTruthCell*> data;
1555
1556 const hddm_s::BcalTruthHitList &hits = record->getBcalTruthHits();
1557 hddm_s::BcalTruthHitList::iterator hiter;
1558 for (hiter = hits.begin(); hiter != hits.end(); ++hiter) {
1559 DBCALTruthCell *truthcell = new DBCALTruthCell();
1560 truthcell->module = hiter->getModule();
1561 truthcell->layer = hiter->getLayer();
1562 truthcell->sector = hiter->getSector();
1563 truthcell->E = hiter->getE();
1564 truthcell->t = hiter->getT();
1565 truthcell->zLocal = hiter->getZLocal();
1566 data.push_back(truthcell);
1567 }
1568
1569 // Copy into factory
1570 factory->CopyTo(data);
1571
1572 return NOERROR;
1573}
1574
1575//------------------
1576// Extract_DFCALTruthShower
1577//------------------
1578jerror_t DEventSourceHDDM::Extract_DFCALTruthShower(hddm_s::HDDM *record,
1579 JFactory<DFCALTruthShower> *factory,
1580 string tag)
1581{
1582 /// Copies the data from the given hddm_s structure. This is called
1583 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1584 /// returns OBJECT_NOT_AVAILABLE immediately.
1585
1586 if (factory == NULL__null)
1587 return OBJECT_NOT_AVAILABLE;
1588 if (tag != "")
1589 return OBJECT_NOT_AVAILABLE;
1590
1591 vector<DFCALTruthShower*> data;
1592 JObject::oid_t id=1;
1593
1594 const hddm_s::FcalTruthShowerList &shows = record->getFcalTruthShowers();
1595 hddm_s::FcalTruthShowerList::iterator iter;
1596 for (iter = shows.begin(); iter != shows.end(); ++iter) {
1597 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
1598 int itrack = (ids.size())? ids.begin()->getItrack() : 0;
1599 DFCALTruthShower *dfcaltruthshower = new DFCALTruthShower(
1600 id++,
1601 iter->getX(),
1602 iter->getY(),
1603 iter->getZ(),
1604 iter->getPx(),
1605 iter->getPy(),
1606 iter->getPz(),
1607 iter->getE(),
1608 iter->getT(),
1609 iter->getPrimary(),
1610 iter->getTrack(),
1611 iter->getPtype(),
1612 itrack
1613 );
1614 data.push_back(dfcaltruthshower);
1615 }
1616
1617 // Copy into factory
1618 factory->CopyTo(data);
1619
1620 return NOERROR;
1621}
1622
1623//------------------
1624// Extract_DFCALHit
1625//------------------
1626jerror_t DEventSourceHDDM::Extract_DFCALHit(hddm_s::HDDM *record,
1627 JFactory<DFCALHit> *factory, string tag,
1628 JEventLoop* eventLoop)
1629{
1630 /// Copies the data from the given hddm_s structure. This is called
1631 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1632 /// returs OBJECT_NOT_AVAILABLE immediately.
1633
1634 if (factory == NULL__null)
1635 return OBJECT_NOT_AVAILABLE;
1636 if (tag != "" && tag != "TRUTH")
1637 return OBJECT_NOT_AVAILABLE;
1638
1639 // extract the FCAL Geometry (for isBlockActive() and positionOnFace())
1640 vector<const DFCALGeometry*> fcalGeomVect;
1641 eventLoop->Get( fcalGeomVect );
1642 if (fcalGeomVect.size() < 1)
1643 return OBJECT_NOT_AVAILABLE;
1644 const DFCALGeometry& fcalGeom = *(fcalGeomVect[0]);
1645
1646 vector<DFCALHit*> data;
1647
1648 if (tag == "") {
1649 const hddm_s::FcalHitList &hits = record->getFcalHits();
1650 hddm_s::FcalHitList::iterator iter;
1651 for (iter = hits.begin(); iter != hits.end(); ++iter) {
1652 int row = iter->getRow();
1653 int column = iter->getColumn();
1654
1655 // Filter out non-physical blocks here
1656 if (!fcalGeom.isBlockActive(row, column))
1657 continue;
1658
1659 // Get position of blocks on front face. (This should really come from
1660 // hdgeant directly so the positions can be shifted in mcsmear.)
1661 DVector2 pos = fcalGeom.positionOnFace(row, column);
1662
1663 DFCALHit *mchit = new DFCALHit();
1664 mchit->row = row;
1665 mchit->column = column;
1666 mchit->x = pos.X();
1667 mchit->y = pos.Y();
1668 mchit->E = iter->getE();
1669 mchit->t = iter->getT();
1670 mchit->intOverPeak = 6.;
1671 if(iter->getFcalDigihits().size() > 0) {
1672 mchit->intOverPeak = iter->getFcalDigihit().getIntegralOverPeak();
1673 }
1674 data.push_back(mchit);
1675 }
1676 }
1677 else if (tag == "TRUTH") {
1678 const hddm_s::FcalTruthHitList &hits = record->getFcalTruthHits();
1679 hddm_s::FcalTruthHitList::iterator iter;
1680 for (iter = hits.begin(); iter != hits.end(); ++iter) {
1681 int row = iter->getRow();
1682 int column = iter->getColumn();
1683
1684 // Filter out non-physical blocks here
1685 if (!fcalGeom.isBlockActive(row, column))
1686 continue;
1687
1688 // Get position of blocks on front face. (This should really come from
1689 // hdgeant directly so the positions can be shifted in mcsmear.)
1690 DVector2 pos = fcalGeom.positionOnFace(row, column);
1691
1692 DFCALHit *mchit = new DFCALHit();
1693 mchit->row = row;
1694 mchit->column = column;
1695 mchit->x = pos.X();
1696 mchit->y = pos.Y();
1697 mchit->E = iter->getE();
1698 mchit->t = iter->getT();
1699 mchit->intOverPeak = 6.;
1700 data.push_back(mchit);
1701 }
1702 }
1703
1704 // Copy into factory
1705 factory->CopyTo(data);
1706
1707 return NOERROR;
1708}
1709
1710//------------------
1711// Extract_DCCALTruthShower
1712//------------------
1713jerror_t DEventSourceHDDM::Extract_DCCALTruthShower(hddm_s::HDDM *record,
1714 JFactory<DCCALTruthShower> *factory,
1715 string tag)
1716{
1717 /// Copies the data from the given hddm_s structure. This is called
1718 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1719 /// returns OBJECT_NOT_AVAILABLE immediately.
1720
1721 if (factory == NULL__null)
1722 return OBJECT_NOT_AVAILABLE;
1723 if (tag != "")
1724 return OBJECT_NOT_AVAILABLE;
1725
1726 vector<DCCALTruthShower*> data;
1727 JObject::oid_t id=1;
1728
1729 const hddm_s::CcalTruthShowerList &shows = record->getCcalTruthShowers();
1730 hddm_s::CcalTruthShowerList::iterator iter;
1731 for (iter = shows.begin(); iter != shows.end(); ++iter) {
1732 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
1733 int itrack = (ids.size())? ids.begin()->getItrack() : 0;
1734 DCCALTruthShower *dccaltruthshower = new DCCALTruthShower(
1735 id++,
1736 iter->getX(),
1737 iter->getY(),
1738 iter->getZ(),
1739 iter->getPx(),
1740 iter->getPy(),
1741 iter->getPz(),
1742 iter->getE(),
1743 iter->getT(),
1744 iter->getPrimary(),
1745 iter->getTrack(),
1746 iter->getPtype(),
1747 itrack
1748 );
1749 data.push_back(dccaltruthshower);
1750 }
1751
1752 // Copy into factory
1753 factory->CopyTo(data);
1754
1755 return NOERROR;
1756}
1757
1758//------------------
1759// Extract_DCCALHit
1760//------------------
1761jerror_t DEventSourceHDDM::Extract_DCCALHit(hddm_s::HDDM *record,
1762 JFactory<DCCALHit> *factory, string tag,
1763 JEventLoop* eventLoop)
1764{
1765 /// Copies the data from the given hddm_s structure. This is called
1766 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1767 /// returs OBJECT_NOT_AVAILABLE immediately.
1768
1769 if (factory == NULL__null)
1770 return OBJECT_NOT_AVAILABLE;
1771 if (tag != "" && tag != "TRUTH")
1772 return OBJECT_NOT_AVAILABLE;
1773
1774 // extract the CCAL Geometry (for isBlockActive() and positionOnFace())
1775 vector<const DCCALGeometry*> ccalGeomVect;
1776 eventLoop->Get( ccalGeomVect );
1777 if (ccalGeomVect.size() < 1)
1778 return OBJECT_NOT_AVAILABLE;
1779 const DCCALGeometry& ccalGeom = *(ccalGeomVect[0]);
1780
1781 vector<DCCALHit*> data;
1782 int hitId = 0;
1783
1784 if (tag == "") {
1785 const hddm_s::CcalHitList &hits = record->getCcalHits();
1786 hddm_s::CcalHitList::iterator iter;
1787 for (iter = hits.begin(); iter != hits.end(); ++iter) {
1788 int row = iter->getRow();
1789 int column = iter->getColumn();
1790
1791 // Filter out non-physical blocks here
1792 if (!ccalGeom.isBlockActive(row, column))
1793 continue;
1794
1795 // Get position of blocks on front face. (This should really come from
1796 // hdgeant directly so the poisitions can be shifted in mcsmear.)
1797 DVector2 pos = ccalGeom.positionOnFace(row, column);
1798
1799 DCCALHit *mchit = new DCCALHit();
1800 mchit->row = row;
1801 mchit->column = column;
1802 mchit->x = pos.X();
1803 mchit->y = pos.Y();
1804 mchit->E = iter->getE();
1805 mchit->t = iter->getT();
1806 mchit->id = hitId++;
1807 data.push_back(mchit);
1808 }
1809 }
1810
1811 else if (tag == "TRUTH") {
1812 const hddm_s::CcalTruthHitList &hits = record->getCcalTruthHits();
1813 hddm_s::CcalTruthHitList::iterator iter;
1814 for (iter = hits.begin(); iter != hits.end(); ++iter) {
1815 int row = iter->getRow();
1816 int column = iter->getColumn();
1817
1818 // Filter out non-physical blocks here
1819 if (!ccalGeom.isBlockActive(row, column))
1820 continue;
1821
1822 // Get position of blocks on front face. (This should really come from
1823 // hdgeant directly so the poisitions can be shifted in mcsmear.)
1824 DVector2 pos = ccalGeom.positionOnFace(row, column);
1825
1826 DCCALHit *mchit = new DCCALHit();
1827 mchit->row = row;
1828 mchit->column = column;
1829 mchit->x = pos.X();
1830 mchit->y = pos.Y();
1831 mchit->E = iter->getE();
1832 mchit->t = iter->getT();
1833 mchit->id = hitId++;
1834 data.push_back(mchit);
1835 }
1836 }
1837
1838 // Copy into factory
1839 factory->CopyTo(data);
1840
1841 return NOERROR;
1842}
1843
1844//------------------
1845// Extract_DMCTrajectoryPoint
1846//------------------
1847jerror_t DEventSourceHDDM::Extract_DMCTrajectoryPoint(hddm_s::HDDM *record,
1848 JFactory<DMCTrajectoryPoint> *factory,
1849 string tag)
1850{
1851 /// Copies the data from the given hddm_s structure. This is called
1852 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1853 /// returns OBJECT_NOT_AVAILABLE immediately.
1854
1855 if (factory == NULL__null)
1856 return OBJECT_NOT_AVAILABLE;
1857 if (tag != "")
1858 return OBJECT_NOT_AVAILABLE;
1859
1860 vector<DMCTrajectoryPoint*> data;
1861
1862 const hddm_s::McTrajectoryPointList &pts = record->getMcTrajectoryPoints();
1863 hddm_s::McTrajectoryPointList::iterator iter;
1864 for (iter = pts.begin(); iter != pts.end(); ++iter) {
1865 DMCTrajectoryPoint *p = new DMCTrajectoryPoint;
1866 p->x = iter->getX();
1867 p->y = iter->getY();
1868 p->z = iter->getZ();
1869 p->t = iter->getT();
1870 p->px = iter->getPx();
1871 p->py = iter->getPy();
1872 p->pz = iter->getPz();
1873 p->E = iter->getE();
1874 p->dE = iter->getDE();
1875 p->primary_track = iter->getPrimary_track();
1876 p->track = iter->getTrack();
1877 p->part = iter->getPart();
1878 p->radlen = iter->getRadlen();
1879 p->step = iter->getStep();
1880 p->mech = iter->getMech();
1881 data.push_back(p);
1882 }
1883
1884 // Copy into factory
1885 factory->CopyTo(data);
1886
1887 return NOERROR;
1888}
1889
1890//------------------
1891// Extract_DTOFTruth
1892//------------------
1893jerror_t DEventSourceHDDM::Extract_DTOFTruth(hddm_s::HDDM *record,
1894 JFactory<DTOFTruth>* factory, string tag)
1895{
1896 /// Copies the data from the given hddm_s structure. This is called
1897 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1898 /// returns OBJECT_NOT_AVAILABLE immediately.
1899
1900 if (factory == NULL__null)
1901 return OBJECT_NOT_AVAILABLE;
1902 if (tag != "")
1903 return OBJECT_NOT_AVAILABLE;
1904
1905 vector<DTOFTruth*> data;
1906
1907 const hddm_s::FtofTruthPointList &points = record->getFtofTruthPoints();
1908 hddm_s::FtofTruthPointList::iterator iter;
1909 for (iter = points.begin(); iter != points.end(); ++iter) {
1910 DTOFTruth *toftruth = new DTOFTruth;
1911 toftruth->primary = iter->getPrimary();
1912 toftruth->track = iter->getTrack();
1913 toftruth->x = iter->getX();
1914 toftruth->y = iter->getY();
1915 toftruth->z = iter->getZ();
1916 toftruth->t = iter->getT();
1917 toftruth->px = iter->getPx();
1918 toftruth->py = iter->getPy();
1919 toftruth->pz = iter->getPz();
1920 toftruth->E = iter->getE();
1921 toftruth->ptype = iter->getPtype();
1922 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
1923 toftruth->itrack = (ids.size())? ids.begin()->getItrack() : 0;
1924 data.push_back(toftruth);
1925 }
1926
1927 // Copy into factory
1928 factory->CopyTo(data);
1929
1930 return NOERROR;
1931}
1932
1933//------------------
1934// Extract_DTOFHit
1935//------------------
1936jerror_t DEventSourceHDDM::Extract_DTOFHit( hddm_s::HDDM *record,
1937 JFactory<DTOFHit>* factory,
1938 JFactory<DTOFHitMC> *factoryMC,
1939 string tag)
1940{
1941 /// Copies the data from the given hddm_s structure. This is called
1942 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
1943 /// returns OBJECT_NOT_AVAILABLE immediately.
1944
1945 if (factory == NULL__null)
1946 return OBJECT_NOT_AVAILABLE;
1947 if (tag != "" && tag != "TRUTH")
1948 return OBJECT_NOT_AVAILABLE;
1949
1950 vector<DTOFHit*> data;
1951 vector<DTOFHitMC*> dataMC;
1952
1953 const hddm_s::FtofCounterList &ctrs = record->getFtofCounters();
1954 hddm_s::FtofCounterList::iterator iter;
1955 for (iter = ctrs.begin(); iter != ctrs.end(); ++iter) {
1956 if (tag == "") {
1957 vector<DTOFHit*> north_hits;
1958 vector<DTOFHit*> south_hits;
1959
1960 // Loop over north AND south hits
1961 const hddm_s::FtofHitList &hits = iter->getFtofHits();
1962 hddm_s::FtofHitList::iterator hiter;
1963 for (hiter = hits.begin(); hiter != hits.end(); ++hiter) {
1964 DTOFHit *tofhit = new DTOFHit;
1965 tofhit->bar = hiter->getBar();
1966 tofhit->plane = hiter->getPlane();
1967 tofhit->end = hiter->getEnd();
1968 tofhit->dE = hiter->getDE();
1969 tofhit->Amp = 0.;
1970 if(hiter->getFtofDigihits().size() > 0) {
1971 tofhit->Amp = hiter->getFtofDigihit().getPeakAmp();
1972 }
1973 tofhit->t = hiter->getT();
1974 tofhit->t_TDC = tofhit->t;
1975 tofhit->t_fADC= tofhit->t;
1976 tofhit->has_TDC=true;
1977 tofhit->has_fADC=true;
1978 data.push_back(tofhit);
1979 if (tofhit->end == 0)
1980 north_hits.push_back(tofhit);
1981 else
1982 south_hits.push_back(tofhit);
1983 }
1984
1985 // return truth hits in a different factory
1986 const hddm_s::FtofTruthHitList &truths = iter->getFtofTruthHits();
1987 hddm_s::FtofTruthHitList::iterator titer;
1988 unsigned int north_mchits = 0;
1989 unsigned int south_mchits = 0;
1990 for (titer = truths.begin(); titer != truths.end(); ++titer) {
1991 DTOFHitMC *tofmchit = new DTOFHitMC;
1992 tofmchit->bar = titer->getBar();
1993 tofmchit->plane = titer->getPlane();
1994 tofmchit->end = titer->getEnd();
1995 tofmchit->itrack = titer->getFtofTruthExtra(0).getItrack();
1996 tofmchit->ptype = titer->getFtofTruthExtra(0).getPtype();
1997 tofmchit->dist = titer->getFtofTruthExtra(0).getDist();
1998 tofmchit->x = titer->getFtofTruthExtra(0).getX();
1999 tofmchit->y = titer->getFtofTruthExtra(0).getY();
2000 tofmchit->z = titer->getFtofTruthExtra(0).getZ();
2001 tofmchit->px = titer->getFtofTruthExtra(0).getPx();
2002 tofmchit->py = titer->getFtofTruthExtra(0).getPy();
2003 tofmchit->pz = titer->getFtofTruthExtra(0).getPz();
2004 tofmchit->E = titer->getFtofTruthExtra(0).getE();
2005 dataMC.push_back(tofmchit);
2006
2007 // best-guess at tofhit-tofMChit association, not exact
2008 if (tofmchit->end == 0) {
2009 if (north_mchits < north_hits.size()) {
2010 north_hits[north_mchits]->AddAssociatedObject(tofmchit);
2011 }
2012 north_mchits++;
2013 }
2014 else {
2015 if (south_mchits < south_hits.size()) {
2016 south_hits[south_mchits]->AddAssociatedObject(tofmchit);
2017 }
2018 south_mchits++;
2019 }
2020 }
2021 }
2022
2023 else if (tag == "TRUTH") {
2024 const hddm_s::FtofTruthHitList &truths = iter->getFtofTruthHits();
2025 hddm_s::FtofTruthHitList::iterator titer;
2026 for (titer = truths.begin(); titer != truths.end(); ++titer) {
2027 DTOFHit *tofhit = new DTOFHit;
2028 tofhit->bar = titer->getBar();
2029 tofhit->plane = titer->getPlane();
2030 tofhit->end = titer->getEnd();
2031 tofhit->dE = titer->getDE();
2032 tofhit->t = titer->getT();
2033 tofhit->t_fADC= tofhit->t;
2034 tofhit->t_TDC = tofhit->t;
2035 tofhit->has_TDC=true;
2036 tofhit->has_fADC=true;
2037 data.push_back(tofhit);
2038
2039 DTOFHitMC *tofmchit = new DTOFHitMC;
2040 tofmchit->bar = tofhit->bar;
2041 tofmchit->plane = tofhit->plane;
2042 tofmchit->end = tofhit->end;
2043 tofmchit->itrack = titer->getFtofTruthExtra().getItrack();
2044 tofmchit->ptype = titer->getFtofTruthExtra().getPtype();
2045 tofmchit->dist = titer->getFtofTruthExtra().getDist();
2046 tofmchit->x = titer->getFtofTruthExtra().getX();
2047 tofmchit->y = titer->getFtofTruthExtra().getY();
2048 tofmchit->z = titer->getFtofTruthExtra().getZ();
2049 tofmchit->px = titer->getFtofTruthExtra().getPx();
2050 tofmchit->py = titer->getFtofTruthExtra().getPy();
2051 tofmchit->pz = titer->getFtofTruthExtra().getPz();
2052 tofmchit->E = titer->getFtofTruthExtra().getE();
2053 dataMC.push_back(tofmchit);
2054 tofhit->AddAssociatedObject(tofmchit);
2055 }
2056 }
2057 }
2058
2059 // Copy into factory
2060 factory->CopyTo(data);
2061 factoryMC->CopyTo(dataMC);
2062
2063 return NOERROR;
2064}
2065
2066//------------------
2067// Extract_DSCHit
2068//------------------
2069jerror_t DEventSourceHDDM::Extract_DSCHit(hddm_s::HDDM *record,
2070 JFactory<DSCHit>* factory, string tag)
2071{
2072 /// Copies the data from the given hddm_s structure. This is called
2073 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2074 /// returns OBJECT_NOT_AVAILABLE immediately.
2075
2076 if (factory == NULL__null)
2077 return OBJECT_NOT_AVAILABLE;
2078 if (tag != "" && tag != "TRUTH")
2079 return OBJECT_NOT_AVAILABLE;
2080
2081 vector<DSCHit*> data;
2082
2083 if (tag == "") {
2084 const hddm_s::StcHitList &hits = record->getStcHits();
2085 hddm_s::StcHitList::iterator iter;
2086 for (iter = hits.begin(); iter != hits.end(); ++iter) {
2087 DSCHit *hit = new DSCHit;
2088 hit->sector = iter->getSector();
2089 hit->dE = iter->getDE();
2090 hit->t = iter->getT();
2091 hit->t_TDC=hit->t;
2092 hit->t_fADC=hit->t;
2093 hit->pulse_height = 0.;
2094 if(iter->getStcDigihits().size() > 0) {
2095 hit->pulse_height = iter->getStcDigihit().getPeakAmp();
2096 }
2097 hit->has_TDC=true;
2098 hit->has_fADC=true;
2099 data.push_back(hit);
2100 }
2101 }
2102 else if (tag == "TRUTH") {
2103 const hddm_s::StcTruthHitList &hits = record->getStcTruthHits();
2104 hddm_s::StcTruthHitList::iterator iter;
2105 for (iter = hits.begin(); iter != hits.end(); ++iter) {
2106 DSCHit *hit = new DSCHit;
2107 hit->sector = iter->getSector();
2108 hit->dE = iter->getDE();
2109 hit->t = iter->getT();
2110 hit->t_TDC=hit->t;
2111 hit->t_fADC=hit->t;
2112 hit->has_TDC=true;
2113 hit->has_fADC=true;
2114 data.push_back(hit);
2115 }
2116 }
2117
2118 // Copy into factory
2119 factory->CopyTo(data);
2120
2121 return NOERROR;
2122}
2123
2124//------------------
2125// Extract_DSCTruthHit
2126//------------------
2127jerror_t DEventSourceHDDM::Extract_DSCTruthHit(hddm_s::HDDM *record,
2128 JFactory<DSCTruthHit>* factory, string tag)
2129{
2130 /// Copies the data from the given hddm_s structure. This is called
2131 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2132 /// returns OBJECT_NOT_AVAILABLE immediately.
2133
2134 if (factory == NULL__null)
2135 return OBJECT_NOT_AVAILABLE;
2136 if (tag != "")
2137 return OBJECT_NOT_AVAILABLE;
2138
2139 vector<DSCTruthHit*> data;
2140
2141 const hddm_s::StcTruthPointList &points = record->getStcTruthPoints();
2142 hddm_s::StcTruthPointList::iterator iter;
2143 for (iter = points.begin(); iter != points.end(); ++iter) {
2144 DSCTruthHit *hit = new DSCTruthHit;
2145 hit->dEdx = iter->getDEdx();
2146 hit->phi = iter->getPhi();
2147 hit->primary = iter->getPrimary();
2148 hit->ptype = iter->getPtype();
2149 hit->r = iter->getR();
2150 hit->t = iter->getT();
2151 hit->z = iter->getZ();
2152 hit->track = iter->getTrack();
2153 hit->sector = iter->getSector();
2154 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
2155 hit->itrack = (ids.size())? ids.begin()->getItrack() : 0;
2156 data.push_back(hit);
2157 }
2158
2159 // Copy into factory
2160 factory->CopyTo(data);
2161
2162 return NOERROR;
2163}
2164
2165//------------------
2166// Extract_DTrackTimeBased
2167//------------------
2168jerror_t DEventSourceHDDM::Extract_DTrackTimeBased(hddm_s::HDDM *record,
2169 JFactory<DTrackTimeBased> *factory,
2170 string tag, int32_t runnumber, JEventLoop* locEventLoop)
2171{
2172 // Note: Since this is a reconstructed factory, we want to generally return OBJECT_NOT_AVAILABLE
2173 // rather than NOERROR. The reason being that the caller interprets "NOERROR" to mean "yes I
2174 // usually can provide objects of that type, but this event has none." This will cause it to
2175 // skip any attempt at reconstruction. On the other hand, a value of "OBJECT_NOT_AVAILABLE" tells
2176 // it "I cannot provide those type of objects for this event."
2177
2178 if (factory == NULL__null)
2179 return OBJECT_NOT_AVAILABLE;
2180 if (tag != "")
2181 return OBJECT_NOT_AVAILABLE;
2182
2183 vector<DTrackTimeBased*> data;
2184 vector<DReferenceTrajectory*> rts;
2185
2186 const hddm_s::TracktimebasedList &ttbs = record->getTracktimebaseds();
2187 hddm_s::TracktimebasedList::iterator iter;
2188 for (iter = ttbs.begin(); iter != ttbs.end(); ++iter) {
2189 DVector3 mom(iter->getMomentum().getPx(),
2190 iter->getMomentum().getPy(),
2191 iter->getMomentum().getPz());
2192 DVector3 pos(iter->getOrigin().getVx(),
2193 iter->getOrigin().getVy(),
2194 iter->getOrigin().getVz());
2195 DTrackTimeBased *track = new DTrackTimeBased();
2196 track->setMomentum(mom);
2197 track->setPosition(pos);
2198 track->setPID(IDTrack(iter->getProperties().getCharge(),
2199 iter->getProperties().getMass()));
2200 track->chisq = iter->getChisq();
2201 track->Ndof = iter->getNdof();
2202 track->FOM = iter->getFOM();
2203 track->candidateid = iter->getCandidateid();
2204 track->id = iter->getId();
2205
2206 // Reconstitute errorMatrix
2207 auto locCovarianceMatrix = dResourcePool_TMatrixFSym->Get_SharedResource();
2208 locCovarianceMatrix->ResizeTo(7, 7);
2209 string str_vals = iter->getErrorMatrix().getVals();
2210 StringToTMatrixFSym(str_vals, locCovarianceMatrix.get(),
2211 iter->getErrorMatrix().getNrows(),
2212 iter->getErrorMatrix().getNcols());
2213 track->setErrorMatrix(locCovarianceMatrix);
2214
2215 // Reconstitute TrackingErrorMatrix
2216 str_vals = iter->getTrackingErrorMatrix().getVals();
2217 auto TrackingErrorMatrix = dResourcePool_TMatrixFSym->Get_SharedResource();
2218 TrackingErrorMatrix->ResizeTo(5, 5);
2219 StringToTMatrixFSym(str_vals, TrackingErrorMatrix.get(),
2220 iter->getTrackingErrorMatrix().getNrows(),
2221 iter->getTrackingErrorMatrix().getNcols());
2222 track->setTrackingErrorMatrix(TrackingErrorMatrix);
2223
2224 data.push_back(track);
2225 }
2226
2227 // Copy into factory
2228 if (ttbs.size() > 0){
2229 factory->CopyTo(data);
2230
2231 // If the event had a s_Tracktimebased_t pointer, then report
2232 // back that we read them in from the file. Otherwise, report
2233 // OBJECT_NOT_AVAILABLE
2234 return NOERROR;
2235 }
2236
2237 // If we get to here then there was not even a placeholder in the HDDM file.
2238 // Return OBJECT_NOT_AVAILABLE to indicate reconstruction should be tried.
2239 return OBJECT_NOT_AVAILABLE;
2240}
2241
2242
2243//-------------------------------
2244// StringToTMatrixFSym
2245//-------------------------------
2246string DEventSourceHDDM::StringToTMatrixFSym(string &str_vals, TMatrixFSym* mat,
2247 int Nrows, int Ncols)
2248{
2249 /// This is the inverse of the DMatrixDSymToString method in the
2250 /// danahddm plugin.
2251
2252 // Convert the given string into a symmetric matrix
2253 mat->ResizeTo(Nrows, Ncols);
2254 stringstream ss(str_vals);
2255 for (int irow=0; irow<mat->GetNrows(); irow++) {
2256 for (int icol=irow; icol<mat->GetNcols(); icol++) {
2257 ss >> (*mat)[irow][icol];
2258 (*mat)[icol][irow] = (*mat)[irow][icol];
2259 }
2260 }
2261
2262 return ss.str();
2263}
2264
2265//------------------
2266// Extract_DTAGMHit
2267//------------------
2268jerror_t DEventSourceHDDM::Extract_DTAGMHit(hddm_s::HDDM *record,
2269 JFactory<DTAGMHit>* factory,
2270 string tag)
2271{
2272 /// Copies the data from the given hddm_s structure. This is called
2273 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2274 /// returns OBJECT_NOT_AVAILABLE immediately.
2275
2276 if (factory == NULL__null)
2277 return OBJECT_NOT_AVAILABLE;
2278 if (tag != "" && tag != "TRUTH")
2279 return OBJECT_NOT_AVAILABLE;
2280
2281 vector<DTAGMHit*> data;
2282
2283 // loop over microChannel/taggerHit records
2284 const hddm_s::MicroChannelList &tags = record->getMicroChannels();
2285 hddm_s::MicroChannelList::iterator iter;
2286 for (iter = tags.begin(); iter != tags.end(); ++iter) {
2287 if (tag == "") {
2288 const hddm_s::TaggerHitList &hits = iter->getTaggerHits();
2289 hddm_s::TaggerHitList::iterator hiter;
2290 for (hiter = hits.begin(); hiter != hits.end(); ++hiter) {
2291 DTAGMHit *taghit = new DTAGMHit();
2292 taghit->E = hiter->getE();
2293 taghit->t = hiter->getT();
2294 taghit->npix_fadc = hiter->getNpe();
2295 taghit->time_fadc = hiter->getTADC();
2296 taghit->column = hiter->getColumn();
2297 taghit->row = hiter->getRow();
2298 taghit->has_fADC = true;
2299 taghit->has_TDC = true;
2300 data.push_back(taghit);
2301 }
2302 }
2303 else if (tag == "TRUTH") {
2304 const hddm_s::TaggerTruthHitList &hits = iter->getTaggerTruthHits();
2305 hddm_s::TaggerTruthHitList::iterator hiter;
2306 for (hiter = hits.begin(); hiter != hits.end(); ++hiter) {
2307 DTAGMHit *taghit = new DTAGMHit();
2308 taghit->E = hiter->getE();
2309 taghit->t = hiter->getT();
2310 taghit->npix_fadc = hiter->getDE() * 1e5; // ~1e5 pixels/GeV
2311 taghit->time_fadc = hiter->getT();
2312 taghit->column = hiter->getColumn();
2313 taghit->row = hiter->getRow();
2314 taghit->has_fADC = true;
2315 taghit->has_TDC = true;
2316 taghit->bg = hiter->getBg();
2317 data.push_back(taghit);
2318 }
2319 }
2320 }
2321
2322 // Copy into factory
2323 factory->CopyTo(data);
2324
2325 return NOERROR;
2326}
2327
2328//------------------
2329// Extract_DTAGHHit
2330//------------------
2331jerror_t DEventSourceHDDM::Extract_DTAGHHit( hddm_s::HDDM *record,
2332 JFactory<DTAGHHit>* factory,
2333 string tag)
2334{
2335 /// Copies the data from the given hddm_s structure. This is called
2336 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2337 /// returns OBJECT_NOT_AVAILABLE immediately.
2338
2339 if (factory == NULL__null)
2340 return OBJECT_NOT_AVAILABLE;
2341 if (tag != "" && tag != "TRUTH")
2342 return OBJECT_NOT_AVAILABLE;
2343
2344 vector<DTAGHHit*> data;
2345
2346 // loop over hodoChannel/taggerHit records
2347 const hddm_s::HodoChannelList &tags = record->getHodoChannels();
2348 hddm_s::HodoChannelList::iterator iter;
2349 for (iter = tags.begin(); iter != tags.end(); ++iter) {
2350 if (tag == "") {
2351 const hddm_s::TaggerHitList &hits = iter->getTaggerHits();
2352 hddm_s::TaggerHitList::iterator hiter;
2353 for (hiter = hits.begin(); hiter != hits.end(); ++hiter) {
2354 DTAGHHit *taghit = new DTAGHHit();
2355 taghit->E = hiter->getE();
2356 taghit->t = hiter->getT();
2357 taghit->npe_fadc = hiter->getNpe();
2358 taghit->time_fadc = hiter->getTADC();
2359 taghit->counter_id = hiter->getCounterId();
2360 taghit->has_fADC = true;
2361 taghit->has_TDC = true;
2362 data.push_back(taghit);
2363 }
2364 }
2365 else if (tag == "TRUTH") {
2366 const hddm_s::TaggerTruthHitList &hits = iter->getTaggerTruthHits();
2367 hddm_s::TaggerTruthHitList::iterator hiter;
2368 for (hiter = hits.begin(); hiter != hits.end(); ++hiter) {
2369 DTAGHHit *taghit = new DTAGHHit();
2370 taghit->E = hiter->getE();
2371 taghit->t = hiter->getT();
2372 taghit->npe_fadc = hiter->getDE() * 5e5; // ~5e5 pe/GeV
2373 taghit->time_fadc = hiter->getT();
2374 taghit->counter_id = hiter->getCounterId();
2375 taghit->has_fADC = true;
2376 taghit->has_TDC = true;
2377 taghit->bg = hiter->getBg();
2378
2379 data.push_back(taghit);
2380 }
2381 }
2382 }
2383
2384 // Copy into factory
2385 factory->CopyTo(data);
2386
2387 return NOERROR;
2388}
2389
2390//------------------
2391// Extract_DPSHit
2392//------------------
2393jerror_t DEventSourceHDDM::Extract_DPSHit(hddm_s::HDDM *record,
2394 JFactory<DPSHit>* factory, string tag)
2395{
2396 /// Copies the data from the given hddm_s structure. This is called
2397 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2398 /// returns OBJECT_NOT_AVAILABLE immediately.
2399
2400 if (factory == NULL__null)
2401 return OBJECT_NOT_AVAILABLE;
2402 if (tag != "" && tag != "TRUTH")
2403 return OBJECT_NOT_AVAILABLE;
2404
2405 vector<DPSHit*> data;
2406
2407 if (tag == "") {
2408 const hddm_s::PsHitList &hits = record->getPsHits();
2409 hddm_s::PsHitList::iterator iter;
2410 for (iter = hits.begin(); iter != hits.end(); ++iter) {
2411 DPSHit *hit = new DPSHit;
2412 if(iter->getArm() == 0)
2413 hit->arm = DPSGeometry::Arm::kNorth;
2414 else
2415 hit->arm = DPSGeometry::Arm::kSouth;
2416 hit->column = iter->getColumn();
2417 double npix_fadc = iter->getDE()*0.5e5; // 100 pixels in 2 MeV
2418 hit->npix_fadc = npix_fadc;
2419 hit->t = iter->getT();
2420
2421 hit->E = 0.5*(psGeom->getElow(hit->arm,hit->column) + psGeom->getEhigh(hit->arm,hit->column));
2422 hit->pulse_peak = npix_fadc*21; // 1 pixel 21 fadc counts
2423 hit->integral = npix_fadc*21*5.1; // integral/peak = 5.1
2424 data.push_back(hit);
2425 }
2426 }
2427 else if (tag == "TRUTH") {
2428 const hddm_s::PsTruthHitList &hits = record->getPsTruthHits();
2429 hddm_s::PsTruthHitList::iterator iter;
2430 for (iter = hits.begin(); iter != hits.end(); ++iter) {
2431 DPSHit *hit = new DPSHit;
2432 if(iter->getArm() == 0)
2433 hit->arm = DPSGeometry::Arm::kNorth;
2434 else
2435 hit->arm = DPSGeometry::Arm::kSouth;
2436 hit->column = iter->getColumn();
2437 hit->npix_fadc = iter->getDE() * 1e5; // ~1e5 pixels/GeV
2438 hit->t = iter->getT();
2439 data.push_back(hit);
2440 }
2441 }
2442
2443 // Copy into factory
2444 factory->CopyTo(data);
2445
2446 return NOERROR;
2447}
2448
2449//------------------
2450// Extract_DPSTruthHit
2451//------------------
2452jerror_t DEventSourceHDDM::Extract_DPSTruthHit(hddm_s::HDDM *record,
2453 JFactory<DPSTruthHit>* factory, string tag)
2454{
2455 /// Copies the data from the given hddm_s structure. This is called
2456 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2457 /// returns OBJECT_NOT_AVAILABLE immediately.
2458
2459 if (factory == NULL__null)
2460 return OBJECT_NOT_AVAILABLE;
2461 if (tag != "")
2462 return OBJECT_NOT_AVAILABLE;
2463
2464 vector<DPSTruthHit*> data;
2465
2466 const hddm_s::PsTruthPointList &points = record->getPsTruthPoints();
2467 hddm_s::PsTruthPointList::iterator iter;
2468 for (iter = points.begin(); iter != points.end(); ++iter) {
2469 DPSTruthHit *hit = new DPSTruthHit;
2470 hit->dEdx = iter->getDEdx();
2471 hit->primary = iter->getPrimary();
2472 hit->ptype = iter->getPtype();
2473 hit->t = iter->getT();
2474 hit->x = iter->getX();
2475 hit->y = iter->getY();
2476 hit->z = iter->getZ();
2477 hit->track = iter->getTrack();
2478 hit->column = iter->getColumn();
2479 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
2480 hit->itrack = (ids.size())? ids.begin()->getItrack() : 0;
2481 data.push_back(hit);
2482 }
2483
2484 // Copy into factory
2485 factory->CopyTo(data);
2486
2487 return NOERROR;
2488}
2489
2490//------------------
2491// Extract_DPSCHit
2492//------------------
2493jerror_t DEventSourceHDDM::Extract_DPSCHit(hddm_s::HDDM *record,
2494 JFactory<DPSCHit>* factory, string tag)
2495{
2496 /// Copies the data from the given hddm_s structure. This is called
2497 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2498 /// returns OBJECT_NOT_AVAILABLE immediately.
2499
2500 if (factory == NULL__null)
2501 return OBJECT_NOT_AVAILABLE;
2502 if (tag != "" && tag != "TRUTH")
2503 return OBJECT_NOT_AVAILABLE;
2504
2505 vector<DPSCHit*> data;
2506
2507 if (tag == "") {
2508 const hddm_s::PscHitList &hits = record->getPscHits();
2509 hddm_s::PscHitList::iterator iter;
2510 for (iter = hits.begin(); iter != hits.end(); ++iter) {
2511 DPSCHit *hit = new DPSCHit;
2512 if(iter->getArm() == 0)
2513 hit->arm = DPSGeometry::Arm::kNorth;
2514 else
2515 hit->arm = DPSGeometry::Arm::kSouth;
2516 hit->module = iter->getModule();
2517
2518 double npe_fadc = iter->getDE()*2.5e5;
2519 hit->npe_fadc = npe_fadc;
2520 hit->pulse_peak = npe_fadc*0.4; // 1000 pe - 400 fadc count
2521 hit->integral = npe_fadc*0.4*3; // integral/peak = 3.
2522
2523 hit->t = iter->getT();
2524 hit->time_tdc = iter->getT();
2525 hit->time_fadc = iter->getT();
2526
2527 hit->has_fADC = true;
2528 hit->has_TDC = true;
2529
2530 data.push_back(hit);
2531 }
2532 }
2533 else if (tag == "TRUTH") {
2534 const hddm_s::PscTruthHitList &hits = record->getPscTruthHits();
2535 hddm_s::PscTruthHitList::iterator iter;
2536 for (iter = hits.begin(); iter != hits.end(); ++iter) {
2537 DPSCHit *hit = new DPSCHit;
2538 if(iter->getArm() == 0)
2539 hit->arm = DPSGeometry::Arm::kNorth;
2540 else
2541 hit->arm = DPSGeometry::Arm::kSouth;
2542 hit->module = iter->getModule();
2543 hit->npe_fadc = iter->getDE() * 5e5; // ~5e5 pe/GeV
2544 hit->t = iter->getT();
2545 data.push_back(hit);
2546 }
2547 }
2548
2549 // Copy into factory
2550 factory->CopyTo(data);
2551
2552 return NOERROR;
2553}
2554
2555//------------------
2556// Extract_DPSCTruthHit
2557//------------------
2558jerror_t DEventSourceHDDM::Extract_DPSCTruthHit(hddm_s::HDDM *record,
2559 JFactory<DPSCTruthHit>* factory, string tag)
2560{
2561 /// Copies the data from the given hddm_s structure. This is called
2562 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2563 /// returns OBJECT_NOT_AVAILABLE immediately.
2564
2565 if (factory == NULL__null)
2566 return OBJECT_NOT_AVAILABLE;
2567 if (tag != "")
2568 return OBJECT_NOT_AVAILABLE;
2569
2570 vector<DPSCTruthHit*> data;
2571
2572 const hddm_s::PscTruthPointList &points = record->getPscTruthPoints();
2573 hddm_s::PscTruthPointList::iterator iter;
2574 for (iter = points.begin(); iter != points.end(); ++iter) {
2575 DPSCTruthHit *hit = new DPSCTruthHit;
2576 hit->dEdx = iter->getDEdx();
2577 hit->primary = iter->getPrimary();
2578 hit->ptype = iter->getPtype();
2579 hit->t = iter->getT();
2580 hit->x = iter->getX();
2581 hit->y = iter->getY();
2582 hit->z = iter->getZ();
2583 hit->track = iter->getTrack();
2584 hit->column = iter->getModule();
2585 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
2586 hit->itrack = (ids.size())? ids.begin()->getItrack() : 0;
2587 data.push_back(hit);
2588 }
2589
2590 // Copy into factory
2591 factory->CopyTo(data);
2592
2593 return NOERROR;
2594}
2595
2596//------------------
2597// Etract_DTPOLHit
2598//------------------
2599jerror_t DEventSourceHDDM::Extract_DTPOLHit(hddm_s::HDDM *record,
2600 JFactory<DTPOLHit>* factory, string tag)
2601{
2602 if (factory == NULL__null)
2603 return OBJECT_NOT_AVAILABLE;
2604 if (tag != "")
2605 return OBJECT_NOT_AVAILABLE;
2606
2607 vector<DTPOLHit*> data;
2608
2609 if (tag == "")
2610 {
2611 const hddm_s::TpolHitList &hits = record->getTpolHits();
2612 hddm_s::TpolHitList::iterator iter;
2613 for (iter = hits.begin(); iter != hits.end(); ++iter)
2614 {
2615 DTPOLHit *hit = new DTPOLHit;
2616 hit->sector = iter->getSector();
2617 hit->ring = iter->getRing();
2618 hit->dE = iter->getDE();
2619 hit->t = iter->getT();
2620
2621 data.push_back(hit);
2622 }
2623 }
2624 else if (tag == "Truth")
2625 {
2626 const hddm_s::TpolTruthHitList &truthHits = record->getTpolTruthHits();
2627 hddm_s::TpolTruthHitList::iterator iter;
2628 for (iter = truthHits.begin(); iter != truthHits.end(); ++iter)
2629 {
2630 DTPOLHit *hit = new DTPOLHit;
2631 hit->sector = iter->getSector();
2632 hit->t = iter->getT();
2633
2634 data.push_back(hit);
2635 }
2636 }
2637
2638 factory->CopyTo(data);
2639
2640 return NOERROR;
2641}
2642
2643//------------------------
2644// Extract_DTPOLTruthHit
2645//------------------------
2646jerror_t DEventSourceHDDM::Extract_DTPOLTruthHit(hddm_s::HDDM *record, JFactory<DTPOLTruthHit>* factory, string tag)
2647{
2648 if (factory == NULL__null)
2649 return OBJECT_NOT_AVAILABLE;
2650 if (tag != "")
2651 return OBJECT_NOT_AVAILABLE;
2652
2653 vector<DTPOLTruthHit*> data;
2654
2655 const hddm_s::TpolTruthPointList &points = record->getTpolTruthPoints();
2656 hddm_s::TpolTruthPointList::iterator iter;
2657 for (iter = points.begin(); iter != points.end(); ++iter)
2658 {
2659 DTPOLTruthHit *hit = new DTPOLTruthHit;
2660 hit->dEdx = iter->getDEdx();
2661 hit->primary = iter->getPrimary();
2662 hit->track = iter->getTrack();
2663 hit->ptype = iter->getPtype();
2664 hit->r = iter->getR();
2665 hit->phi = iter->getPhi();
2666 hit->t = iter->getT();
2667 const hddm_s::TrackIDList &ids = iter->getTrackIDs();
2668 hit->itrack = (ids.size())? ids.begin()->getItrack() : 0;
2669
2670 data.push_back(hit);
2671 }
2672
2673 factory->CopyTo(data);
2674
2675 return NOERROR;
2676}
2677
2678Particle_t DEventSourceHDDM::IDTrack(float locCharge, float locMass) const
2679{
2680 float locMassTolerance = 0.010;
2681 if (locCharge > 0.1) // Positive particles
2682 {
2683 if (fabs(locMass - ParticleMass(Proton)) < locMassTolerance) return Proton;
2684 if (fabs(locMass - ParticleMass(PiPlus)) < locMassTolerance) return PiPlus;
2685 if (fabs(locMass - ParticleMass(KPlus)) < locMassTolerance) return KPlus;
2686 if (fabs(locMass - ParticleMass(Positron)) < locMassTolerance) return Positron;
2687 if (fabs(locMass - ParticleMass(MuonPlus)) < locMassTolerance) return MuonPlus;
2688 }
2689 else if(locCharge < -0.1) // Negative particles
2690 {
2691 if (fabs(locMass - ParticleMass(PiMinus)) < locMassTolerance) return PiMinus;
2692 if (fabs(locMass - ParticleMass(KMinus)) < locMassTolerance) return KMinus;
2693 if (fabs(locMass - ParticleMass(MuonMinus)) < locMassTolerance) return MuonMinus;
2694 if (fabs(locMass - ParticleMass(Electron)) < locMassTolerance) return Electron;
2695 if (fabs(locMass - ParticleMass(AntiProton)) < locMassTolerance) return AntiProton;
2696 }
2697 else //Neutral Track
2698 {
2699 if (fabs(locMass - ParticleMass(Gamma)) < locMassTolerance) return Gamma;
2700 if (fabs(locMass - ParticleMass(Neutron)) < locMassTolerance) return Neutron;
2701 }
2702 return Unknown;
2703}
2704
2705//------------------
2706// Extract_DFMWPCTruthHit
2707//------------------
2708jerror_t DEventSourceHDDM::Extract_DFMWPCTruthHit(hddm_s::HDDM *record, JFactory<DFMWPCTruthHit> *factory, string tag)
2709{
2710 /// Copies the data from the given hddm_s record. This is called
2711 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2712 /// returns OBJECT_NOT_AVAILABLE immediately.
2713
2714 if (factory == NULL__null) return OBJECT_NOT_AVAILABLE;
2715 if (tag != "") return OBJECT_NOT_AVAILABLE;
2716
2717 vector<DFMWPCTruthHit*> data;
2718
2719 const hddm_s::FmwpcTruthHitList &points = record->getFmwpcTruthHits();
2720 hddm_s::FmwpcTruthHitList::iterator iter;
2721 for (iter = points.begin(); iter != points.end(); ++iter) {
2722 DFMWPCTruthHit *hit = new DFMWPCTruthHit;
2723 hit->layer = iter->getLayer();
2724 hit->wire = iter->getWire();
2725 hit->dE = iter->getDE();
2726 hit->dx = iter->getDx();
2727 hit->t = iter->getT();
2728 data.push_back(hit);
2729 }
2730
2731 // Copy into factory
2732 factory->CopyTo(data);
2733
2734 return NOERROR;
2735}
2736
2737//------------------
2738// Extract_DFMWPCHit
2739//------------------
2740jerror_t DEventSourceHDDM::Extract_DFMWPCHit(hddm_s::HDDM *record, JFactory<DFMWPCHit> *factory, string tag)
2741{
2742 /// Copies the data from the given hddm_s record. This is called
2743 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2744 /// returns OBJECT_NOT_AVAILABLE immediately.
2745
2746 if (factory == NULL__null) return OBJECT_NOT_AVAILABLE;
2747 if (tag != "") return OBJECT_NOT_AVAILABLE;
2748
2749 vector<DFMWPCHit*> data;
2750
2751 const hddm_s::FmwpcHitList &points = record->getFmwpcHits();
2752 hddm_s::FmwpcHitList::iterator iter;
2753 for (iter = points.begin(); iter != points.end(); ++iter) {
2754 DFMWPCHit *hit = new DFMWPCHit;
2755 hit->layer = iter->getLayer();
2756 hit->wire = iter->getWire();
2757 hit->dE = iter->getDE();
2758 hit->t = iter->getT();
2759 data.push_back(hit);
2760 }
2761
2762 // Copy into factory
2763 factory->CopyTo(data);
2764
2765 return NOERROR;
2766}
2767
2768//------------------
2769// Extract_DDIRCPmtHit
2770//------------------
2771jerror_t DEventSourceHDDM::Extract_DDIRCPmtHit(hddm_s::HDDM *record,
2772 JFactory<DDIRCPmtHit> *factory, string tag,
2773 JEventLoop* eventLoop)
2774{
2775 /// Copies the data from the given hddm_s structure. This is called
2776 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2777 /// returs OBJECT_NOT_AVAILABLE immediately.
2778
2779 if (factory == NULL__null)
2780 return OBJECT_NOT_AVAILABLE;
2781 if (tag != "")
2782 return OBJECT_NOT_AVAILABLE;
2783
2784 vector<DDIRCPmtHit*> data;
2785
2786 if (tag == "") {
2787 vector<const DDIRCTruthPmtHit*> locDIRCTruthPmtHit;
2788 eventLoop->Get(locDIRCTruthPmtHit);
2789
2790 const hddm_s::DircPmtHitList &hits = record->getDircPmtHits();
2791 hddm_s::DircPmtHitList::iterator iter;
2792 for (iter = hits.begin(); iter != hits.end(); ++iter) {
2793 double time = iter->getT();
2794 int channel = iter->getCh();
2795
2796 DDIRCPmtHit *hit = new DDIRCPmtHit();
2797 hit->t = time;
2798 hit->ch = channel;
2799
2800 for (auto& iterTruth : locDIRCTruthPmtHit) { //.begin(); iterTruth != locDIRCTruthPmtHit.end(); ++iterTruth) {
2801
2802 // must match channel and time
2803 if(channel == iterTruth->ch && fabs(time-iterTruth->t) < 5.0) {
2804
2805 hit->AddAssociatedObject(iterTruth);
2806
2807 break;
2808 }
2809 }
2810
2811 data.push_back(hit);
2812 }
2813 }
2814
2815 // Copy into factory
2816 factory->CopyTo(data);
2817
2818 return NOERROR;
2819}
2820
2821//------------------
2822// Extract_DCereHit
2823// added by yqiang Oct 11, 2012
2824//------------------
2825jerror_t DEventSourceHDDM::Extract_DCereHit(hddm_s::HDDM *record,
2826 JFactory<DCereHit>* factory, string tag)
2827{
2828 if (factory == NULL__null)
2829 return OBJECT_NOT_AVAILABLE;
2830 if (tag != "" && tag != "TRUTH")
2831 return OBJECT_NOT_AVAILABLE;
2832
2833 vector<DCereHit*> data;
2834
2835 if (tag == "") {
2836 const hddm_s::CereHitList &hits = record->getCereHits();
2837 hddm_s::CereHitList::iterator iter;
2838 for (iter = hits.begin(); iter != hits.end(); ++iter) {
2839 DCereHit *hit = new DCereHit;
2840 hit->sector = iter->getSector();
2841 hit->pe = iter->getPe();
2842 hit->t = iter->getT();
2843 data.push_back(hit);
2844 }
2845 }
2846 else if (tag == "TRUTH") {
2847 const hddm_s::CereTruthHitList &hits = record->getCereTruthHits();
2848 hddm_s::CereTruthHitList::iterator iter;
2849 for (iter = hits.begin(); iter != hits.end(); ++iter) {
2850 DCereHit *hit = new DCereHit;
2851 hit->sector = iter->getSector();
2852 hit->pe = iter->getPe();
2853 hit->t = iter->getT();
2854 data.push_back(hit);
2855 }
2856 }
2857
2858 // copy into factory
2859 factory->CopyTo(data);
2860
2861 return NOERROR;
2862}
2863
2864//------------------
2865// Extract_DDIRCTruthBarHit
2866//------------------
2867jerror_t DEventSourceHDDM::Extract_DDIRCTruthBarHit(hddm_s::HDDM *record,
2868 JFactory<DDIRCTruthBarHit>* factory, string tag)
2869{
2870 /// Copies the data from the given hddm_s structure. This is called
2871 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2872 /// returns OBJECT_NOT_AVAILABLE immediately.
2873
2874 if (factory == NULL__null)
2875 return OBJECT_NOT_AVAILABLE;
2876 if (tag != "")
2877 return OBJECT_NOT_AVAILABLE;
2878
2879 vector<DDIRCTruthBarHit*> data;
2880
2881 const hddm_s::DircTruthBarHitList &hits = record->getDircTruthBarHits();
2882 hddm_s::DircTruthBarHitList::iterator iter;
2883 for (iter = hits.begin(); iter != hits.end(); ++iter) {
2884 DDIRCTruthBarHit *hit = new DDIRCTruthBarHit;
2885 hit->x = iter->getX();
2886 hit->y = iter->getY();
2887 hit->z = iter->getZ();
2888 hit->px = iter->getPx();
2889 hit->py = iter->getPy();
2890 hit->pz = iter->getPz();
2891 hit->t = iter->getT();
2892 hit->E = iter->getE();
2893 hit->pdg = iter->getPdg();
2894 hit->bar = iter->getBar();
2895 hit->track = iter->getTrack();
2896 data.push_back(hit);
2897 }
2898
2899 // Copy into factory
2900 factory->CopyTo(data);
2901
2902 return NOERROR;
2903}
2904
2905//------------------
2906// Extract_DDIRCTruthPmtHit
2907//------------------
2908jerror_t DEventSourceHDDM::Extract_DDIRCTruthPmtHit(hddm_s::HDDM *record,
2909 JFactory<DDIRCTruthPmtHit>* factory, string tag)
2910{
2911 /// Copies the data from the given hddm_s structure. This is called
2912 /// from JEventSourceHDDM::GetObjects. If factory is NULL, this
2913 /// returns OBJECT_NOT_AVAILABLE immediately.
2914
2915 if (factory == NULL__null)
2916 return OBJECT_NOT_AVAILABLE;
2917 if (tag != "")
2918 return OBJECT_NOT_AVAILABLE;
2919
2920 vector<DDIRCTruthPmtHit*> data;
2921
2922
2923 const hddm_s::DircTruthPmtHitList &hits = record->getDircTruthPmtHits();
2924 hddm_s::DircTruthPmtHitList::iterator iter;
2925 for (iter = hits.begin(); iter != hits.end(); ++iter) {
2926 DDIRCTruthPmtHit *hit = new DDIRCTruthPmtHit;
2927 hit->x = iter->getX();
2928 hit->y = iter->getY();
2929 hit->z = iter->getZ();
2930 hit->t = iter->getT();
2931 hit->E = iter->getE();
2932 hit->ch = iter->getCh();
2933 hit->key_bar = iter->getKey_bar();
2934 hddm_s::DircTruthPmtHitExtraList &hitextras = iter->getDircTruthPmtHitExtras();
2935 if(hitextras.size() > 0) {
2936 hit->t_fixed = hitextras(0).getT_fixed();
2937 hit->path = hitextras(0).getPath();
2938 hit->refl = hitextras(0).getRefl();
2939 hit->bbrefl = hitextras(0).getBbrefl();
2940 }
2941 data.push_back(hit);
2942 }
2943
2944 // Copy into factory
2945 factory->CopyTo(data);
2946
2947 return NOERROR;
2948}
←

/usr/lib/gcc/x86_64-redhat-linux/4.8.5/../../../../include/c++/4.8.5/bits/basic_string.h

1// Components for manipulating sequences of characters -*- C++ -*-
2
3// Copyright (C) 1997-2013 Free Software Foundation, Inc.
4//
5// This file is part of the GNU ISO C++ Library. This library is free
6// software; you can redistribute it and/or modify it under the
7// terms of the GNU General Public License as published by the
8// Free Software Foundation; either version 3, or (at your option)
9// any later version.
10
11// This library is distributed in the hope that it will be useful,
12// but WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14// GNU General Public License for more details.
15
16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.
19
20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23// <http://www.gnu.org/licenses/>.
24
25/** @file bits/basic_string.h
26 * This is an internal header file, included by other library headers.
27 * Do not attempt to use it directly. @headername{string}
28 */
29
30//
31// ISO C++ 14882: 21 Strings library
32//
33
34#ifndef _BASIC_STRING_H1
35#define _BASIC_STRING_H1 1
36
37#pragma GCC system_header
38
39#include <ext/atomicity.h>
40#include <debug/debug.h>
41#if __cplusplus201103L >= 201103L
42#include <initializer_list>
43#endif
44
45namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
46{
47_GLIBCXX_BEGIN_NAMESPACE_VERSION
48
49 /**
50 * @class basic_string basic_string.h <string>
51 * @brief Managing sequences of characters and character-like objects.
52 *
53 * @ingroup strings
54 * @ingroup sequences
55 *
56 * @tparam _CharT Type of character
57 * @tparam _Traits Traits for character type, defaults to
58 * char_traits<_CharT>.
59 * @tparam _Alloc Allocator type, defaults to allocator<_CharT>.
60 *
61 * Meets the requirements of a <a href="tables.html#65">container</a>, a
62 * <a href="tables.html#66">reversible container</a>, and a
63 * <a href="tables.html#67">sequence</a>. Of the
64 * <a href="tables.html#68">optional sequence requirements</a>, only
65 * @c push_back, @c at, and @c %array access are supported.
66 *
67 * @doctodo
68 *
69 *
70 * Documentation? What's that?
71 * Nathan Myers <ncm@cantrip.org>.
72 *
73 * A string looks like this:
74 *
75 * @code
76 * [_Rep]
77 * _M_length
78 * [basic_string<char_type>] _M_capacity
79 * _M_dataplus _M_refcount
80 * _M_p ----------------> unnamed array of char_type
81 * @endcode
82 *
83 * Where the _M_p points to the first character in the string, and
84 * you cast it to a pointer-to-_Rep and subtract 1 to get a
85 * pointer to the header.
86 *
87 * This approach has the enormous advantage that a string object
88 * requires only one allocation. All the ugliness is confined
89 * within a single %pair of inline functions, which each compile to
90 * a single @a add instruction: _Rep::_M_data(), and
91 * string::_M_rep(); and the allocation function which gets a
92 * block of raw bytes and with room enough and constructs a _Rep
93 * object at the front.
94 *
95 * The reason you want _M_data pointing to the character %array and
96 * not the _Rep is so that the debugger can see the string
97 * contents. (Probably we should add a non-inline member to get
98 * the _Rep for the debugger to use, so users can check the actual
99 * string length.)
100 *
101 * Note that the _Rep object is a POD so that you can have a
102 * static <em>empty string</em> _Rep object already @a constructed before
103 * static constructors have run. The reference-count encoding is
104 * chosen so that a 0 indicates one reference, so you never try to
105 * destroy the empty-string _Rep object.
106 *
107 * All but the last paragraph is considered pretty conventional
108 * for a C++ string implementation.
109 */
110 // 21.3 Template class basic_string
111 template<typename _CharT, typename _Traits, typename _Alloc>
112 class basic_string
113 {
114 typedef typename _Alloc::template rebind<_CharT>::other _CharT_alloc_type;
115
116 // Types:
117 public:
118 typedef _Traits traits_type;
119 typedef typename _Traits::char_type value_type;
120 typedef _Alloc allocator_type;
121 typedef typename _CharT_alloc_type::size_type size_type;
122 typedef typename _CharT_alloc_type::difference_type difference_type;
123 typedef typename _CharT_alloc_type::reference reference;
124 typedef typename _CharT_alloc_type::const_reference const_reference;
125 typedef typename _CharT_alloc_type::pointer pointer;
126 typedef typename _CharT_alloc_type::const_pointer const_pointer;
127 typedef __gnu_cxx::__normal_iterator<pointer, basic_string> iterator;
128 typedef __gnu_cxx::__normal_iterator<const_pointer, basic_string>
129 const_iterator;
130 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
131 typedef std::reverse_iterator<iterator> reverse_iterator;
132
133 private:
134 // _Rep: string representation
135 // Invariants:
136 // 1. String really contains _M_length + 1 characters: due to 21.3.4
137 // must be kept null-terminated.
138 // 2. _M_capacity >= _M_length
139 // Allocated memory is always (_M_capacity + 1) * sizeof(_CharT).
140 // 3. _M_refcount has three states:
141 // -1: leaked, one reference, no ref-copies allowed, non-const.
142 // 0: one reference, non-const.
143 // n>0: n + 1 references, operations require a lock, const.
144 // 4. All fields==0 is an empty string, given the extra storage
145 // beyond-the-end for a null terminator; thus, the shared
146 // empty string representation needs no constructor.
147
148 struct _Rep_base
149 {
150 size_type _M_length;
151 size_type _M_capacity;
152 _Atomic_word _M_refcount;
153 };
154
155 struct _Rep : _Rep_base
156 {
157 // Types:
158 typedef typename _Alloc::template rebind<char>::other _Raw_bytes_alloc;
159
160 // (Public) Data members:
161
162 // The maximum number of individual char_type elements of an
163 // individual string is determined by _S_max_size. This is the
164 // value that will be returned by max_size(). (Whereas npos
165 // is the maximum number of bytes the allocator can allocate.)
166 // If one was to divvy up the theoretical largest size string,
167 // with a terminating character and m _CharT elements, it'd
168 // look like this:
169 // npos = sizeof(_Rep) + (m * sizeof(_CharT)) + sizeof(_CharT)
170 // Solving for m:
171 // m = ((npos - sizeof(_Rep))/sizeof(CharT)) - 1
172 // In addition, this implementation quarters this amount.
173 static const size_type _S_max_size;
174 static const _CharT _S_terminal;
175
176 // The following storage is init'd to 0 by the linker, resulting
177 // (carefully) in an empty string with one reference.
178 static size_type _S_empty_rep_storage[];
179
180 static _Rep&
181 _S_empty_rep()
182 {
183 // NB: Mild hack to avoid strict-aliasing warnings. Note that
184 // _S_empty_rep_storage is never modified and the punning should
185 // be reasonably safe in this case.
186 void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage);
187 return *reinterpret_cast<_Rep*>(__p);
188 }
189
190 bool
191 _M_is_leaked() const
192 { return this->_M_refcount < 0; }
193
194 bool
195 _M_is_shared() const
196 { return this->_M_refcount > 0; }
197
198 void
199 _M_set_leaked()
200 { this->_M_refcount = -1; }
201
202 void
203 _M_set_sharable()
204 { this->_M_refcount = 0; }
205
206 void
207 _M_set_length_and_sharable(size_type __n)
208 {
209#if _GLIBCXX_FULLY_DYNAMIC_STRING0 == 0
210 if (__builtin_expect(this != &_S_empty_rep(), false))
211#endif
212 {
213 this->_M_set_sharable(); // One reference.
214 this->_M_length = __n;
215 traits_type::assign(this->_M_refdata()[__n], _S_terminal);
216 // grrr. (per 21.3.4)
217 // You cannot leave those LWG people alone for a second.
218 }
219 }
220
221 _CharT*
222 _M_refdata() throw()
223 { return reinterpret_cast<_CharT*>(this + 1); }
224
225 _CharT*
226 _M_grab(const _Alloc& __alloc1, const _Alloc& __alloc2)
227 {
228 return (!_M_is_leaked() && __alloc1 == __alloc2)
229 ? _M_refcopy() : _M_clone(__alloc1);
230 }
231
232 // Create & Destroy
233 static _Rep*
234 _S_create(size_type, size_type, const _Alloc&);
235
236 void
237 _M_dispose(const _Alloc& __a)
238 {
239#if _GLIBCXX_FULLY_DYNAMIC_STRING0 == 0
240 if (__builtin_expect(this != &_S_empty_rep(), false))
241#endif
242 {
243 // Be race-detector-friendly. For more info see bits/c++config.
244 _GLIBCXX_SYNCHRONIZATION_HAPPENS_BEFORE(&this->_M_refcount);
245 if (__gnu_cxx::__exchange_and_add_dispatch(&this->_M_refcount,
246 -1) <= 0)
247 {
248 _GLIBCXX_SYNCHRONIZATION_HAPPENS_AFTER(&this->_M_refcount);
249 _M_destroy(__a);
250 }
251 }
252 } // XXX MT
253
254 void
255 _M_destroy(const _Alloc&) throw();
256
257 _CharT*
258 _M_refcopy() throw()
259 {
260#if _GLIBCXX_FULLY_DYNAMIC_STRING0 == 0
261 if (__builtin_expect(this != &_S_empty_rep(), false))
262#endif
263 __gnu_cxx::__atomic_add_dispatch(&this->_M_refcount, 1);
264 return _M_refdata();
265 } // XXX MT
266
267 _CharT*
268 _M_clone(const _Alloc&, size_type __res = 0);
269 };
270
271 // Use empty-base optimization: http://www.cantrip.org/emptyopt.html
272 struct _Alloc_hider : _Alloc
273 {
274 _Alloc_hider(_CharT* __dat, const _Alloc& __a)
275 : _Alloc(__a), _M_p(__dat) { }
276
277 _CharT* _M_p; // The actual data.
278 };
279
280 public:
281 // Data Members (public):
282 // NB: This is an unsigned type, and thus represents the maximum
283 // size that the allocator can hold.
284 /// Value returned by various member functions when they fail.
285 static const size_type npos = static_cast<size_type>(-1);
286
287 private:
288 // Data Members (private):
289 mutable _Alloc_hider _M_dataplus;
290
291 _CharT*
292 _M_data() const
293 { return _M_dataplus._M_p; }
294
295 _CharT*
296 _M_data(_CharT* __p)
297 { return (_M_dataplus._M_p = __p); }
298
299 _Rep*
300 _M_rep() const
301 { return &((reinterpret_cast<_Rep*> (_M_data()))[-1]); }
302
303 // For the internal use we have functions similar to `begin'/`end'
304 // but they do not call _M_leak.
305 iterator
306 _M_ibegin() const
307 { return iterator(_M_data()); }
308
309 iterator
310 _M_iend() const
311 { return iterator(_M_data() + this->size()); }
312
313 void
314 _M_leak() // for use in begin() & non-const op[]
315 {
316 if (!_M_rep()->_M_is_leaked())
317 _M_leak_hard();
318 }
319
320 size_type
321 _M_check(size_type __pos, const char* __s) const
322 {
323 if (__pos > this->size())
324 __throw_out_of_range(__N(__s)(__s));
325 return __pos;
326 }
327
328 void
329 _M_check_length(size_type __n1, size_type __n2, const char* __s) const
330 {
331 if (this->max_size() - (this->size() - __n1) < __n2)
332 __throw_length_error(__N(__s)(__s));
333 }
334
335 // NB: _M_limit doesn't check for a bad __pos value.
336 size_type
337 _M_limit(size_type __pos, size_type __off) const
338 {
339 const bool __testoff = __off < this->size() - __pos;
340 return __testoff ? __off : this->size() - __pos;
341 }
342
343 // True if _Rep and source do not overlap.
344 bool
345 _M_disjunct(const _CharT* __s) const
346 {
347 return (less<const _CharT*>()(__s, _M_data())
348 || less<const _CharT*>()(_M_data() + this->size(), __s));
349 }
350
351 // When __n = 1 way faster than the general multichar
352 // traits_type::copy/move/assign.
353 static void
354 _M_copy(_CharT* __d, const _CharT* __s, size_type __n)
355 {
356 if (__n == 1)
357 traits_type::assign(*__d, *__s);
358 else
359 traits_type::copy(__d, __s, __n);
360 }
361
362 static void
363 _M_move(_CharT* __d, const _CharT* __s, size_type __n)
364 {
365 if (__n == 1)
366 traits_type::assign(*__d, *__s);
367 else
368 traits_type::move(__d, __s, __n);
369 }
370
371 static void
372 _M_assign(_CharT* __d, size_type __n, _CharT __c)
373 {
374 if (__n == 1)
375 traits_type::assign(*__d, __c);
376 else
377 traits_type::assign(__d, __n, __c);
378 }
379
380 // _S_copy_chars is a separate template to permit specialization
381 // to optimize for the common case of pointers as iterators.
382 template<class _Iterator>
383 static void
384 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
385 {
386 for (; __k1 != __k2; ++__k1, ++__p)
387 traits_type::assign(*__p, *__k1); // These types are off.
388 }
389
390 static void
391 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
392 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
393
394 static void
395 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2)
396 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
397
398 static void
399 _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2)
400 { _M_copy(__p, __k1, __k2 - __k1); }
401
402 static void
403 _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2)
404 { _M_copy(__p, __k1, __k2 - __k1); }
405
406 static int
407 _S_compare(size_type __n1, size_type __n2)
408 {
409 const difference_type __d = difference_type(__n1 - __n2);
410
411 if (__d > __gnu_cxx::__numeric_traits<int>::__max)
412 return __gnu_cxx::__numeric_traits<int>::__max;
413 else if (__d < __gnu_cxx::__numeric_traits<int>::__min)
414 return __gnu_cxx::__numeric_traits<int>::__min;
415 else
416 return int(__d);
417 }
418
419 void
420 _M_mutate(size_type __pos, size_type __len1, size_type __len2);
421
422 void
423 _M_leak_hard();
424
425 static _Rep&
426 _S_empty_rep()
427 { return _Rep::_S_empty_rep(); }
428
429 public:
430 // Construct/copy/destroy:
431 // NB: We overload ctors in some cases instead of using default
432 // arguments, per 17.4.4.4 para. 2 item 2.
433
434 /**
435 * @brief Default constructor creates an empty string.
436 */
437 basic_string()
438#if _GLIBCXX_FULLY_DYNAMIC_STRING0 == 0
439 : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc()) { }
440#else
441 : _M_dataplus(_S_construct(size_type(), _CharT(), _Alloc()), _Alloc()){ }
442#endif
443
444 /**
445 * @brief Construct an empty string using allocator @a a.
446 */
447 explicit
448 basic_string(const _Alloc& __a);
449
450 // NB: per LWG issue 42, semantics different from IS:
451 /**
452 * @brief Construct string with copy of value of @a str.
453 * @param __str Source string.
454 */
455 basic_string(const basic_string& __str);
456 /**
457 * @brief Construct string as copy of a substring.
458 * @param __str Source string.
459 * @param __pos Index of first character to copy from.
460 * @param __n Number of characters to copy (default remainder).
461 */
462 basic_string(const basic_string& __str, size_type __pos,
463 size_type __n = npos);
464 /**
465 * @brief Construct string as copy of a substring.
466 * @param __str Source string.
467 * @param __pos Index of first character to copy from.
468 * @param __n Number of characters to copy.
469 * @param __a Allocator to use.
470 */
471 basic_string(const basic_string& __str, size_type __pos,
472 size_type __n, const _Alloc& __a);
473
474 /**
475 * @brief Construct string initialized by a character %array.
476 * @param __s Source character %array.
477 * @param __n Number of characters to copy.
478 * @param __a Allocator to use (default is default allocator).
479 *
480 * NB: @a __s must have at least @a __n characters, &apos;\\0&apos;
481 * has no special meaning.
482 */
483 basic_string(const _CharT* __s, size_type __n,
484 const _Alloc& __a = _Alloc());
485 /**
486 * @brief Construct string as copy of a C string.
487 * @param __s Source C string.
488 * @param __a Allocator to use (default is default allocator).
489 */
490 basic_string(const _CharT* __s, const _Alloc& __a = _Alloc());
491 /**
492 * @brief Construct string as multiple characters.
493 * @param __n Number of characters.
494 * @param __c Character to use.
495 * @param __a Allocator to use (default is default allocator).
496 */
497 basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc());
498
499#if __cplusplus201103L >= 201103L
500 /**
501 * @brief Move construct string.
502 * @param __str Source string.
503 *
504 * The newly-created string contains the exact contents of @a __str.
505 * @a __str is a valid, but unspecified string.
506 **/
507 basic_string(basic_string&& __str) noexcept
508 : _M_dataplus(__str._M_dataplus)
509 {
510#if _GLIBCXX_FULLY_DYNAMIC_STRING0 == 0
511 __str._M_data(_S_empty_rep()._M_refdata());
512#else
513 __str._M_data(_S_construct(size_type(), _CharT(), get_allocator()));
514#endif
515 }
516
517 /**
518 * @brief Construct string from an initializer %list.
519 * @param __l std::initializer_list of characters.
520 * @param __a Allocator to use (default is default allocator).
521 */
522 basic_string(initializer_list<_CharT> __l, const _Alloc& __a = _Alloc());
523#endif // C++11
524
525 /**
526 * @brief Construct string as copy of a range.
527 * @param __beg Start of range.
528 * @param __end End of range.
529 * @param __a Allocator to use (default is default allocator).
530 */
531 template<class _InputIterator>
532 basic_string(_InputIterator __beg, _InputIterator __end,
533 const _Alloc& __a = _Alloc());
534
535 /**
536 * @brief Destroy the string instance.
537 */
538 ~basic_string() _GLIBCXX_NOEXCEPTnoexcept
539 { _M_rep()->_M_dispose(this->get_allocator()); }
540
541 /**
542 * @brief Assign the value of @a str to this string.
543 * @param __str Source string.
544 */
545 basic_string&
546 operator=(const basic_string& __str)
547 { return this->assign(__str); }
548
549 /**
550 * @brief Copy contents of @a s into this string.
551 * @param __s Source null-terminated string.
552 */
553 basic_string&
554 operator=(const _CharT* __s)
555 { return this->assign(__s); }
556
557 /**
558 * @brief Set value to string of length 1.
559 * @param __c Source character.
560 *
561 * Assigning to a character makes this string length 1 and
562 * (*this)[0] == @a c.
563 */
564 basic_string&
565 operator=(_CharT __c)
566 {
567 this->assign(1, __c);
568 return *this;
569 }
570
571#if __cplusplus201103L >= 201103L
572 /**
573 * @brief Move assign the value of @a str to this string.
574 * @param __str Source string.
575 *
576 * The contents of @a str are moved into this string (without copying).
577 * @a str is a valid, but unspecified string.
578 **/
579 basic_string&
580 operator=(basic_string&& __str)
581 {
582 // NB: DR 1204.
583 this->swap(__str);
584 return *this;
585 }
586
587 /**
588 * @brief Set value to string constructed from initializer %list.
589 * @param __l std::initializer_list.
590 */
591 basic_string&
592 operator=(initializer_list<_CharT> __l)
593 {
594 this->assign(__l.begin(), __l.size());
595 return *this;
596 }
597#endif // C++11
598
599 // Iterators:
600 /**
601 * Returns a read/write iterator that points to the first character in
602 * the %string. Unshares the string.
603 */
604 iterator
605 begin() _GLIBCXX_NOEXCEPTnoexcept
606 {
607 _M_leak();
608 return iterator(_M_data());
609 }
610
611 /**
612 * Returns a read-only (constant) iterator that points to the first
613 * character in the %string.
614 */
615 const_iterator
616 begin() const _GLIBCXX_NOEXCEPTnoexcept
617 { return const_iterator(_M_data()); }
618
619 /**
620 * Returns a read/write iterator that points one past the last
621 * character in the %string. Unshares the string.
622 */
623 iterator
624 end() _GLIBCXX_NOEXCEPTnoexcept
625 {
626 _M_leak();
627 return iterator(_M_data() + this->size());
628 }
629
630 /**
631 * Returns a read-only (constant) iterator that points one past the
632 * last character in the %string.
633 */
634 const_iterator
635 end() const _GLIBCXX_NOEXCEPTnoexcept
636 { return const_iterator(_M_data() + this->size()); }
637
638 /**
639 * Returns a read/write reverse iterator that points to the last
640 * character in the %string. Iteration is done in reverse element
641 * order. Unshares the string.
642 */
643 reverse_iterator
644 rbegin() _GLIBCXX_NOEXCEPTnoexcept
645 { return reverse_iterator(this->end()); }
646
647 /**
648 * Returns a read-only (constant) reverse iterator that points
649 * to the last character in the %string. Iteration is done in
650 * reverse element order.
651 */
652 const_reverse_iterator
653 rbegin() const _GLIBCXX_NOEXCEPTnoexcept
654 { return const_reverse_iterator(this->end()); }
655
656 /**
657 * Returns a read/write reverse iterator that points to one before the
658 * first character in the %string. Iteration is done in reverse
659 * element order. Unshares the string.
660 */
661 reverse_iterator
662 rend() _GLIBCXX_NOEXCEPTnoexcept
663 { return reverse_iterator(this->begin()); }
664
665 /**
666 * Returns a read-only (constant) reverse iterator that points
667 * to one before the first character in the %string. Iteration
668 * is done in reverse element order.
669 */
670 const_reverse_iterator
671 rend() const _GLIBCXX_NOEXCEPTnoexcept
672 { return const_reverse_iterator(this->begin()); }
673
674#if __cplusplus201103L >= 201103L
675 /**
676 * Returns a read-only (constant) iterator that points to the first
677 * character in the %string.
678 */
679 const_iterator
680 cbegin() const noexcept
681 { return const_iterator(this->_M_data()); }
682
683 /**
684 * Returns a read-only (constant) iterator that points one past the
685 * last character in the %string.
686 */
687 const_iterator
688 cend() const noexcept
689 { return const_iterator(this->_M_data() + this->size()); }
690
691 /**
692 * Returns a read-only (constant) reverse iterator that points
693 * to the last character in the %string. Iteration is done in
694 * reverse element order.
695 */
696 const_reverse_iterator
697 crbegin() const noexcept
698 { return const_reverse_iterator(this->end()); }
699
700 /**
701 * Returns a read-only (constant) reverse iterator that points
702 * to one before the first character in the %string. Iteration
703 * is done in reverse element order.
704 */
705 const_reverse_iterator
706 crend() const noexcept
707 { return const_reverse_iterator(this->begin()); }
708#endif
709
710 public:
711 // Capacity:
712 /// Returns the number of characters in the string, not including any
713 /// null-termination.
714 size_type
715 size() const _GLIBCXX_NOEXCEPTnoexcept
716 { return _M_rep()->_M_length; }
717
718 /// Returns the number of characters in the string, not including any
719 /// null-termination.
720 size_type
721 length() const _GLIBCXX_NOEXCEPTnoexcept
722 { return _M_rep()->_M_length; }
723
724 /// Returns the size() of the largest possible %string.
725 size_type
726 max_size() const _GLIBCXX_NOEXCEPTnoexcept
727 { return _Rep::_S_max_size; }
728
729 /**
730 * @brief Resizes the %string to the specified number of characters.
731 * @param __n Number of characters the %string should contain.
732 * @param __c Character to fill any new elements.
733 *
734 * This function will %resize the %string to the specified
735 * number of characters. If the number is smaller than the
736 * %string's current size the %string is truncated, otherwise
737 * the %string is extended and new elements are %set to @a __c.
738 */
739 void
740 resize(size_type __n, _CharT __c);
741
742 /**
743 * @brief Resizes the %string to the specified number of characters.
744 * @param __n Number of characters the %string should contain.
745 *
746 * This function will resize the %string to the specified length. If
747 * the new size is smaller than the %string's current size the %string
748 * is truncated, otherwise the %string is extended and new characters
749 * are default-constructed. For basic types such as char, this means
750 * setting them to 0.
751 */
752 void
753 resize(size_type __n)
754 { this->resize(__n, _CharT()); }
755
756#if __cplusplus201103L >= 201103L
757 /// A non-binding request to reduce capacity() to size().
758 void
759 shrink_to_fit()
760 {
761 if (capacity() > size())
762 {
763 __trytry
764 { reserve(0); }
765 __catch(...)catch(...)
766 { }
767 }
768 }
769#endif
770
771 /**
772 * Returns the total number of characters that the %string can hold
773 * before needing to allocate more memory.
774 */
775 size_type
776 capacity() const _GLIBCXX_NOEXCEPTnoexcept
777 { return _M_rep()->_M_capacity; }
778
779 /**
780 * @brief Attempt to preallocate enough memory for specified number of
781 * characters.
782 * @param __res_arg Number of characters required.
783 * @throw std::length_error If @a __res_arg exceeds @c max_size().
784 *
785 * This function attempts to reserve enough memory for the
786 * %string to hold the specified number of characters. If the
787 * number requested is more than max_size(), length_error is
788 * thrown.
789 *
790 * The advantage of this function is that if optimal code is a
791 * necessity and the user can determine the string length that will be
792 * required, the user can reserve the memory in %advance, and thus
793 * prevent a possible reallocation of memory and copying of %string
794 * data.
795 */
796 void
797 reserve(size_type __res_arg = 0);
798
799 /**
800 * Erases the string, making it empty.
801 */
802 void
803 clear() _GLIBCXX_NOEXCEPTnoexcept
804 { _M_mutate(0, this->size(), 0); }
805
806 /**
807 * Returns true if the %string is empty. Equivalent to
808 * <code>*this == ""</code>.
809 */
810 bool
811 empty() const _GLIBCXX_NOEXCEPTnoexcept
812 { return this->size() == 0; }
813
814 // Element access:
815 /**
816 * @brief Subscript access to the data contained in the %string.
817 * @param __pos The index of the character to access.
818 * @return Read-only (constant) reference to the character.
819 *
820 * This operator allows for easy, array-style, data access.
821 * Note that data access with this operator is unchecked and
822 * out_of_range lookups are not defined. (For checked lookups
823 * see at().)
824 */
825 const_reference
826 operator[] (size_type __pos) const
827 {
828 _GLIBCXX_DEBUG_ASSERT(__pos <= size());
829 return _M_data()[__pos];
830 }
831
832 /**
833 * @brief Subscript access to the data contained in the %string.
834 * @param __pos The index of the character to access.
835 * @return Read/write reference to the character.
836 *
837 * This operator allows for easy, array-style, data access.
838 * Note that data access with this operator is unchecked and
839 * out_of_range lookups are not defined. (For checked lookups
840 * see at().) Unshares the string.
841 */
842 reference
843 operator[](size_type __pos)
844 {
845 // allow pos == size() as v3 extension:
846 _GLIBCXX_DEBUG_ASSERT(__pos <= size());
847 // but be strict in pedantic mode:
848 _GLIBCXX_DEBUG_PEDASSERT(__pos < size());
849 _M_leak();
850 return _M_data()[__pos];
851 }
852
853 /**
854 * @brief Provides access to the data contained in the %string.
855 * @param __n The index of the character to access.
856 * @return Read-only (const) reference to the character.
857 * @throw std::out_of_range If @a n is an invalid index.
858 *
859 * This function provides for safer data access. The parameter is
860 * first checked that it is in the range of the string. The function
861 * throws out_of_range if the check fails.
862 */
863 const_reference
864 at(size_type __n) const
865 {
866 if (__n >= this->size())
867 __throw_out_of_range(__N("basic_string::at")("basic_string::at"));
868 return _M_data()[__n];
869 }
870
871 /**
872 * @brief Provides access to the data contained in the %string.
873 * @param __n The index of the character to access.
874 * @return Read/write reference to the character.
875 * @throw std::out_of_range If @a n is an invalid index.
876 *
877 * This function provides for safer data access. The parameter is
878 * first checked that it is in the range of the string. The function
879 * throws out_of_range if the check fails. Success results in
880 * unsharing the string.
881 */
882 reference
883 at(size_type __n)
884 {
885 if (__n >= size())
886 __throw_out_of_range(__N("basic_string::at")("basic_string::at"));
887 _M_leak();
888 return _M_data()[__n];
889 }
890
891#if __cplusplus201103L >= 201103L
892 /**
893 * Returns a read/write reference to the data at the first
894 * element of the %string.
895 */
896 reference
897 front()
898 { return operator[](0); }
899
900 /**
901 * Returns a read-only (constant) reference to the data at the first
902 * element of the %string.
903 */
904 const_reference
905 front() const
906 { return operator[](0); }
907
908 /**
909 * Returns a read/write reference to the data at the last
910 * element of the %string.
911 */
912 reference
913 back()
914 { return operator[](this->size() - 1); }
915
916 /**
917 * Returns a read-only (constant) reference to the data at the
918 * last element of the %string.
919 */
920 const_reference
921 back() const
922 { return operator[](this->size() - 1); }
923#endif
924
925 // Modifiers:
926 /**
927 * @brief Append a string to this string.
928 * @param __str The string to append.
929 * @return Reference to this string.
930 */
931 basic_string&
932 operator+=(const basic_string& __str)
933 { return this->append(__str); }
934
935 /**
936 * @brief Append a C string.
937 * @param __s The C string to append.
938 * @return Reference to this string.
939 */
940 basic_string&
941 operator+=(const _CharT* __s)
942 { return this->append(__s); }
943
944 /**
945 * @brief Append a character.
946 * @param __c The character to append.
947 * @return Reference to this string.
948 */
949 basic_string&
950 operator+=(_CharT __c)
951 {
952 this->push_back(__c);
953 return *this;
954 }
955
956#if __cplusplus201103L >= 201103L
957 /**
958 * @brief Append an initializer_list of characters.
959 * @param __l The initializer_list of characters to be appended.
960 * @return Reference to this string.
961 */
962 basic_string&
963 operator+=(initializer_list<_CharT> __l)
964 { return this->append(__l.begin(), __l.size()); }
965#endif // C++11
966
967 /**
968 * @brief Append a string to this string.
969 * @param __str The string to append.
970 * @return Reference to this string.
971 */
972 basic_string&
973 append(const basic_string& __str);
974
975 /**
976 * @brief Append a substring.
977 * @param __str The string to append.
978 * @param __pos Index of the first character of str to append.
979 * @param __n The number of characters to append.
980 * @return Reference to this string.
981 * @throw std::out_of_range if @a __pos is not a valid index.
982 *
983 * This function appends @a __n characters from @a __str
984 * starting at @a __pos to this string. If @a __n is is larger
985 * than the number of available characters in @a __str, the
986 * remainder of @a __str is appended.
987 */
988 basic_string&
989 append(const basic_string& __str, size_type __pos, size_type __n);
990
991 /**
992 * @brief Append a C substring.
993 * @param __s The C string to append.
994 * @param __n The number of characters to append.
995 * @return Reference to this string.
996 */
997 basic_string&
998 append(const _CharT* __s, size_type __n);
999
1000 /**
1001 * @brief Append a C string.
1002 * @param __s The C string to append.
1003 * @return Reference to this string.
1004 */
1005 basic_string&
1006 append(const _CharT* __s)
1007 {
1008 __glibcxx_requires_string(__s);
1009 return this->append(__s, traits_type::length(__s));
1010 }
1011
1012 /**
1013 * @brief Append multiple characters.
1014 * @param __n The number of characters to append.
1015 * @param __c The character to use.
1016 * @return Reference to this string.
1017 *
1018 * Appends __n copies of __c to this string.
1019 */
1020 basic_string&
1021 append(size_type __n, _CharT __c);
1022
1023#if __cplusplus201103L >= 201103L
1024 /**
1025 * @brief Append an initializer_list of characters.
1026 * @param __l The initializer_list of characters to append.
1027 * @return Reference to this string.
1028 */
1029 basic_string&
1030 append(initializer_list<_CharT> __l)
1031 { return this->append(__l.begin(), __l.size()); }
1032#endif // C++11
1033
1034 /**
1035 * @brief Append a range of characters.
1036 * @param __first Iterator referencing the first character to append.
1037 * @param __last Iterator marking the end of the range.
1038 * @return Reference to this string.
1039 *
1040 * Appends characters in the range [__first,__last) to this string.
1041 */
1042 template<class _InputIterator>
1043 basic_string&
1044 append(_InputIterator __first, _InputIterator __last)
1045 { return this->replace(_M_iend(), _M_iend(), __first, __last); }
1046
1047 /**
1048 * @brief Append a single character.
1049 * @param __c Character to append.
1050 */
1051 void
1052 push_back(_CharT __c)
1053 {
1054 const size_type __len = 1 + this->size();
1055 if (__len > this->capacity() || _M_rep()->_M_is_shared())
1056 this->reserve(__len);
1057 traits_type::assign(_M_data()[this->size()], __c);
1058 _M_rep()->_M_set_length_and_sharable(__len);
1059 }
1060
1061 /**
1062 * @brief Set value to contents of another string.
1063 * @param __str Source string to use.
1064 * @return Reference to this string.
1065 */
1066 basic_string&
1067 assign(const basic_string& __str);
1068
1069#if __cplusplus201103L >= 201103L
1070 /**
1071 * @brief Set value to contents of another string.
1072 * @param __str Source string to use.
1073 * @return Reference to this string.
1074 *
1075 * This function sets this string to the exact contents of @a __str.
1076 * @a __str is a valid, but unspecified string.
1077 */
1078 basic_string&
1079 assign(basic_string&& __str)
1080 {
1081 this->swap(__str);
1082 return *this;
1083 }
1084#endif // C++11
1085
1086 /**
1087 * @brief Set value to a substring of a string.
1088 * @param __str The string to use.
1089 * @param __pos Index of the first character of str.
1090 * @param __n Number of characters to use.
1091 * @return Reference to this string.
1092 * @throw std::out_of_range if @a pos is not a valid index.
1093 *
1094 * This function sets this string to the substring of @a __str
1095 * consisting of @a __n characters at @a __pos. If @a __n is
1096 * is larger than the number of available characters in @a
1097 * __str, the remainder of @a __str is used.
1098 */
1099 basic_string&
1100 assign(const basic_string& __str, size_type __pos, size_type __n)
1101 { return this->assign(__str._M_data()
1102 + __str._M_check(__pos, "basic_string::assign"),
1103 __str._M_limit(__pos, __n)); }
1104
1105 /**
1106 * @brief Set value to a C substring.
1107 * @param __s The C string to use.
1108 * @param __n Number of characters to use.
1109 * @return Reference to this string.
1110 *
1111 * This function sets the value of this string to the first @a __n
1112 * characters of @a __s. If @a __n is is larger than the number of
1113 * available characters in @a __s, the remainder of @a __s is used.
1114 */
1115 basic_string&
1116 assign(const _CharT* __s, size_type __n);
1117
1118 /**
1119 * @brief Set value to contents of a C string.
1120 * @param __s The C string to use.
1121 * @return Reference to this string.
1122 *
1123 * This function sets the value of this string to the value of @a __s.
1124 * The data is copied, so there is no dependence on @a __s once the
1125 * function returns.
1126 */
1127 basic_string&
1128 assign(const _CharT* __s)
1129 {
1130 __glibcxx_requires_string(__s);
1131 return this->assign(__s, traits_type::length(__s));
1132 }
1133
1134 /**
1135 * @brief Set value to multiple characters.
1136 * @param __n Length of the resulting string.
1137 * @param __c The character to use.
1138 * @return Reference to this string.
1139 *
1140 * This function sets the value of this string to @a __n copies of
1141 * character @a __c.
1142 */
1143 basic_string&
1144 assign(size_type __n, _CharT __c)
1145 { return _M_replace_aux(size_type(0), this->size(), __n, __c); }
1146
1147 /**
1148 * @brief Set value to a range of characters.
1149 * @param __first Iterator referencing the first character to append.
1150 * @param __last Iterator marking the end of the range.
1151 * @return Reference to this string.
1152 *
1153 * Sets value of string to characters in the range [__first,__last).
1154 */
1155 template<class _InputIterator>
1156 basic_string&
1157 assign(_InputIterator __first, _InputIterator __last)
1158 { return this->replace(_M_ibegin(), _M_iend(), __first, __last); }
1159
1160#if __cplusplus201103L >= 201103L
1161 /**
1162 * @brief Set value to an initializer_list of characters.
1163 * @param __l The initializer_list of characters to assign.
1164 * @return Reference to this string.
1165 */
1166 basic_string&
1167 assign(initializer_list<_CharT> __l)
1168 { return this->assign(__l.begin(), __l.size()); }
1169#endif // C++11
1170
1171 /**
1172 * @brief Insert multiple characters.
1173 * @param __p Iterator referencing location in string to insert at.
1174 * @param __n Number of characters to insert
1175 * @param __c The character to insert.
1176 * @throw std::length_error If new length exceeds @c max_size().
1177 *
1178 * Inserts @a __n copies of character @a __c starting at the
1179 * position referenced by iterator @a __p. If adding
1180 * characters causes the length to exceed max_size(),
1181 * length_error is thrown. The value of the string doesn't
1182 * change if an error is thrown.
1183 */
1184 void
1185 insert(iterator __p, size_type __n, _CharT __c)
1186 { this->replace(__p, __p, __n, __c); }
1187
1188 /**
1189 * @brief Insert a range of characters.
1190 * @param __p Iterator referencing location in string to insert at.
1191 * @param __beg Start of range.
1192 * @param __end End of range.
1193 * @throw std::length_error If new length exceeds @c max_size().
1194 *
1195 * Inserts characters in range [__beg,__end). If adding
1196 * characters causes the length to exceed max_size(),
1197 * length_error is thrown. The value of the string doesn't
1198 * change if an error is thrown.
1199 */
1200 template<class _InputIterator>
1201 void
1202 insert(iterator __p, _InputIterator __beg, _InputIterator __end)
1203 { this->replace(__p, __p, __beg, __end); }
1204
1205#if __cplusplus201103L >= 201103L
1206 /**
1207 * @brief Insert an initializer_list of characters.
1208 * @param __p Iterator referencing location in string to insert at.
1209 * @param __l The initializer_list of characters to insert.
1210 * @throw std::length_error If new length exceeds @c max_size().
1211 */
1212 void
1213 insert(iterator __p, initializer_list<_CharT> __l)
1214 {
1215 _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
1216 this->insert(__p - _M_ibegin(), __l.begin(), __l.size());
1217 }
1218#endif // C++11
1219
1220 /**
1221 * @brief Insert value of a string.
1222 * @param __pos1 Iterator referencing location in string to insert at.
1223 * @param __str The string to insert.
1224 * @return Reference to this string.
1225 * @throw std::length_error If new length exceeds @c max_size().
1226 *
1227 * Inserts value of @a __str starting at @a __pos1. If adding
1228 * characters causes the length to exceed max_size(),
1229 * length_error is thrown. The value of the string doesn't
1230 * change if an error is thrown.
1231 */
1232 basic_string&
1233 insert(size_type __pos1, const basic_string& __str)
1234 { return this->insert(__pos1, __str, size_type(0), __str.size()); }
1235
1236 /**
1237 * @brief Insert a substring.
1238 * @param __pos1 Iterator referencing location in string to insert at.
1239 * @param __str The string to insert.
1240 * @param __pos2 Start of characters in str to insert.
1241 * @param __n Number of characters to insert.
1242 * @return Reference to this string.
1243 * @throw std::length_error If new length exceeds @c max_size().
1244 * @throw std::out_of_range If @a pos1 > size() or
1245 * @a __pos2 > @a str.size().
1246 *
1247 * Starting at @a pos1, insert @a __n character of @a __str
1248 * beginning with @a __pos2. If adding characters causes the
1249 * length to exceed max_size(), length_error is thrown. If @a
1250 * __pos1 is beyond the end of this string or @a __pos2 is
1251 * beyond the end of @a __str, out_of_range is thrown. The
1252 * value of the string doesn't change if an error is thrown.
1253 */
1254 basic_string&
1255 insert(size_type __pos1, const basic_string& __str,
1256 size_type __pos2, size_type __n)
1257 { return this->insert(__pos1, __str._M_data()
1258 + __str._M_check(__pos2, "basic_string::insert"),
1259 __str._M_limit(__pos2, __n)); }
1260
1261 /**
1262 * @brief Insert a C substring.
1263 * @param __pos Iterator referencing location in string to insert at.
1264 * @param __s The C string to insert.
1265 * @param __n The number of characters to insert.
1266 * @return Reference to this string.
1267 * @throw std::length_error If new length exceeds @c max_size().
1268 * @throw std::out_of_range If @a __pos is beyond the end of this
1269 * string.
1270 *
1271 * Inserts the first @a __n characters of @a __s starting at @a
1272 * __pos. If adding characters causes the length to exceed
1273 * max_size(), length_error is thrown. If @a __pos is beyond
1274 * end(), out_of_range is thrown. The value of the string
1275 * doesn't change if an error is thrown.
1276 */
1277 basic_string&
1278 insert(size_type __pos, const _CharT* __s, size_type __n);
1279
1280 /**
1281 * @brief Insert a C string.
1282 * @param __pos Iterator referencing location in string to insert at.
1283 * @param __s The C string to insert.
1284 * @return Reference to this string.
1285 * @throw std::length_error If new length exceeds @c max_size().
1286 * @throw std::out_of_range If @a pos is beyond the end of this
1287 * string.
1288 *
1289 * Inserts the first @a n characters of @a __s starting at @a __pos. If
1290 * adding characters causes the length to exceed max_size(),
1291 * length_error is thrown. If @a __pos is beyond end(), out_of_range is
1292 * thrown. The value of the string doesn't change if an error is
1293 * thrown.
1294 */
1295 basic_string&
1296 insert(size_type __pos, const _CharT* __s)
1297 {
1298 __glibcxx_requires_string(__s);
1299 return this->insert(__pos, __s, traits_type::length(__s));
1300 }
1301
1302 /**
1303 * @brief Insert multiple characters.
1304 * @param __pos Index in string to insert at.
1305 * @param __n Number of characters to insert
1306 * @param __c The character to insert.
1307 * @return Reference to this string.
1308 * @throw std::length_error If new length exceeds @c max_size().
1309 * @throw std::out_of_range If @a __pos is beyond the end of this
1310 * string.
1311 *
1312 * Inserts @a __n copies of character @a __c starting at index
1313 * @a __pos. If adding characters causes the length to exceed
1314 * max_size(), length_error is thrown. If @a __pos > length(),
1315 * out_of_range is thrown. The value of the string doesn't
1316 * change if an error is thrown.
1317 */
1318 basic_string&
1319 insert(size_type __pos, size_type __n, _CharT __c)
1320 { return _M_replace_aux(_M_check(__pos, "basic_string::insert"),
1321 size_type(0), __n, __c); }
1322
1323 /**
1324 * @brief Insert one character.
1325 * @param __p Iterator referencing position in string to insert at.
1326 * @param __c The character to insert.
1327 * @return Iterator referencing newly inserted char.
1328 * @throw std::length_error If new length exceeds @c max_size().
1329 *
1330 * Inserts character @a __c at position referenced by @a __p.
1331 * If adding character causes the length to exceed max_size(),
1332 * length_error is thrown. If @a __p is beyond end of string,
1333 * out_of_range is thrown. The value of the string doesn't
1334 * change if an error is thrown.
1335 */
1336 iterator
1337 insert(iterator __p, _CharT __c)
1338 {
1339 _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
1340 const size_type __pos = __p - _M_ibegin();
1341 _M_replace_aux(__pos, size_type(0), size_type(1), __c);
1342 _M_rep()->_M_set_leaked();
1343 return iterator(_M_data() + __pos);
1344 }
1345
1346 /**
1347 * @brief Remove characters.
1348 * @param __pos Index of first character to remove (default 0).
1349 * @param __n Number of characters to remove (default remainder).
1350 * @return Reference to this string.
1351 * @throw std::out_of_range If @a pos is beyond the end of this
1352 * string.
1353 *
1354 * Removes @a __n characters from this string starting at @a
1355 * __pos. The length of the string is reduced by @a __n. If
1356 * there are < @a __n characters to remove, the remainder of
1357 * the string is truncated. If @a __p is beyond end of string,
1358 * out_of_range is thrown. The value of the string doesn't
1359 * change if an error is thrown.
1360 */
1361 basic_string&
1362 erase(size_type __pos = 0, size_type __n = npos)
1363 {
1364 _M_mutate(_M_check(__pos, "basic_string::erase"),
1365 _M_limit(__pos, __n), size_type(0));
1366 return *this;
1367 }
1368
1369 /**
1370 * @brief Remove one character.
1371 * @param __position Iterator referencing the character to remove.
1372 * @return iterator referencing same location after removal.
1373 *
1374 * Removes the character at @a __position from this string. The value
1375 * of the string doesn't change if an error is thrown.
1376 */
1377 iterator
1378 erase(iterator __position)
1379 {
1380 _GLIBCXX_DEBUG_PEDASSERT(__position >= _M_ibegin()
1381 && __position < _M_iend());
1382 const size_type __pos = __position - _M_ibegin();
1383 _M_mutate(__pos, size_type(1), size_type(0));
1384 _M_rep()->_M_set_leaked();
1385 return iterator(_M_data() + __pos);
1386 }
1387
1388 /**
1389 * @brief Remove a range of characters.
1390 * @param __first Iterator referencing the first character to remove.
1391 * @param __last Iterator referencing the end of the range.
1392 * @return Iterator referencing location of first after removal.
1393 *
1394 * Removes the characters in the range [first,last) from this string.
1395 * The value of the string doesn't change if an error is thrown.
1396 */
1397 iterator
1398 erase(iterator __first, iterator __last);
1399
1400#if __cplusplus201103L >= 201103L
1401 /**
1402 * @brief Remove the last character.
1403 *
1404 * The string must be non-empty.
1405 */
1406 void
1407 pop_back()
1408 { erase(size()-1, 1); }
1409#endif // C++11
1410
1411 /**
1412 * @brief Replace characters with value from another string.
1413 * @param __pos Index of first character to replace.
1414 * @param __n Number of characters to be replaced.
1415 * @param __str String to insert.
1416 * @return Reference to this string.
1417 * @throw std::out_of_range If @a pos is beyond the end of this
1418 * string.
1419 * @throw std::length_error If new length exceeds @c max_size().
1420 *
1421 * Removes the characters in the range [__pos,__pos+__n) from
1422 * this string. In place, the value of @a __str is inserted.
1423 * If @a __pos is beyond end of string, out_of_range is thrown.
1424 * If the length of the result exceeds max_size(), length_error
1425 * is thrown. The value of the string doesn't change if an
1426 * error is thrown.
1427 */
1428 basic_string&
1429 replace(size_type __pos, size_type __n, const basic_string& __str)
1430 { return this->replace(__pos, __n, __str._M_data(), __str.size()); }
1431
1432 /**
1433 * @brief Replace characters with value from another string.
1434 * @param __pos1 Index of first character to replace.
1435 * @param __n1 Number of characters to be replaced.
1436 * @param __str String to insert.
1437 * @param __pos2 Index of first character of str to use.
1438 * @param __n2 Number of characters from str to use.
1439 * @return Reference to this string.
1440 * @throw std::out_of_range If @a __pos1 > size() or @a __pos2 >
1441 * __str.size().
1442 * @throw std::length_error If new length exceeds @c max_size().
1443 *
1444 * Removes the characters in the range [__pos1,__pos1 + n) from this
1445 * string. In place, the value of @a __str is inserted. If @a __pos is
1446 * beyond end of string, out_of_range is thrown. If the length of the
1447 * result exceeds max_size(), length_error is thrown. The value of the
1448 * string doesn't change if an error is thrown.
1449 */
1450 basic_string&
1451 replace(size_type __pos1, size_type __n1, const basic_string& __str,
1452 size_type __pos2, size_type __n2)
1453 { return this->replace(__pos1, __n1, __str._M_data()
1454 + __str._M_check(__pos2, "basic_string::replace"),
1455 __str._M_limit(__pos2, __n2)); }
1456
1457 /**
1458 * @brief Replace characters with value of a C substring.
1459 * @param __pos Index of first character to replace.
1460 * @param __n1 Number of characters to be replaced.
1461 * @param __s C string to insert.
1462 * @param __n2 Number of characters from @a s to use.
1463 * @return Reference to this string.
1464 * @throw std::out_of_range If @a pos1 > size().
1465 * @throw std::length_error If new length exceeds @c max_size().
1466 *
1467 * Removes the characters in the range [__pos,__pos + __n1)
1468 * from this string. In place, the first @a __n2 characters of
1469 * @a __s are inserted, or all of @a __s if @a __n2 is too large. If
1470 * @a __pos is beyond end of string, out_of_range is thrown. If
1471 * the length of result exceeds max_size(), length_error is
1472 * thrown. The value of the string doesn't change if an error
1473 * is thrown.
1474 */
1475 basic_string&
1476 replace(size_type __pos, size_type __n1, const _CharT* __s,
1477 size_type __n2);
1478
1479 /**
1480 * @brief Replace characters with value of a C string.
1481 * @param __pos Index of first character to replace.
1482 * @param __n1 Number of characters to be replaced.
1483 * @param __s C string to insert.
1484 * @return Reference to this string.
1485 * @throw std::out_of_range If @a pos > size().
1486 * @throw std::length_error If new length exceeds @c max_size().
1487 *
1488 * Removes the characters in the range [__pos,__pos + __n1)
1489 * from this string. In place, the characters of @a __s are
1490 * inserted. If @a __pos is beyond end of string, out_of_range
1491 * is thrown. If the length of result exceeds max_size(),
1492 * length_error is thrown. The value of the string doesn't
1493 * change if an error is thrown.
1494 */
1495 basic_string&
1496 replace(size_type __pos, size_type __n1, const _CharT* __s)
1497 {
1498 __glibcxx_requires_string(__s);
1499 return this->replace(__pos, __n1, __s, traits_type::length(__s));
1500 }
1501
1502 /**
1503 * @brief Replace characters with multiple characters.
1504 * @param __pos Index of first character to replace.
1505 * @param __n1 Number of characters to be replaced.
1506 * @param __n2 Number of characters to insert.
1507 * @param __c Character to insert.
1508 * @return Reference to this string.
1509 * @throw std::out_of_range If @a __pos > size().
1510 * @throw std::length_error If new length exceeds @c max_size().
1511 *
1512 * Removes the characters in the range [pos,pos + n1) from this
1513 * string. In place, @a __n2 copies of @a __c are inserted.
1514 * If @a __pos is beyond end of string, out_of_range is thrown.
1515 * If the length of result exceeds max_size(), length_error is
1516 * thrown. The value of the string doesn't change if an error
1517 * is thrown.
1518 */
1519 basic_string&
1520 replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
1521 { return _M_replace_aux(_M_check(__pos, "basic_string::replace"),
1522 _M_limit(__pos, __n1), __n2, __c); }
1523
1524 /**
1525 * @brief Replace range of characters with string.
1526 * @param __i1 Iterator referencing start of range to replace.
1527 * @param __i2 Iterator referencing end of range to replace.
1528 * @param __str String value to insert.
1529 * @return Reference to this string.
1530 * @throw std::length_error If new length exceeds @c max_size().
1531 *
1532 * Removes the characters in the range [__i1,__i2). In place,
1533 * the value of @a __str is inserted. If the length of result
1534 * exceeds max_size(), length_error is thrown. The value of
1535 * the string doesn't change if an error is thrown.
1536 */
1537 basic_string&
1538 replace(iterator __i1, iterator __i2, const basic_string& __str)
1539 { return this->replace(__i1, __i2, __str._M_data(), __str.size()); }
1540
1541 /**
1542 * @brief Replace range of characters with C substring.
1543 * @param __i1 Iterator referencing start of range to replace.
1544 * @param __i2 Iterator referencing end of range to replace.
1545 * @param __s C string value to insert.
1546 * @param __n Number of characters from s to insert.
1547 * @return Reference to this string.
1548 * @throw std::length_error If new length exceeds @c max_size().
1549 *
1550 * Removes the characters in the range [__i1,__i2). In place,
1551 * the first @a __n characters of @a __s are inserted. If the
1552 * length of result exceeds max_size(), length_error is thrown.
1553 * The value of the string doesn't change if an error is
1554 * thrown.
1555 */
1556 basic_string&
1557 replace(iterator __i1, iterator __i2, const _CharT* __s, size_type __n)
1558 {
1559 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1560 && __i2 <= _M_iend());
1561 return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n);
1562 }
1563
1564 /**
1565 * @brief Replace range of characters with C string.
1566 * @param __i1 Iterator referencing start of range to replace.
1567 * @param __i2 Iterator referencing end of range to replace.
1568 * @param __s C string value to insert.
1569 * @return Reference to this string.
1570 * @throw std::length_error If new length exceeds @c max_size().
1571 *
1572 * Removes the characters in the range [__i1,__i2). In place,
1573 * the characters of @a __s are inserted. If the length of
1574 * result exceeds max_size(), length_error is thrown. The
1575 * value of the string doesn't change if an error is thrown.
1576 */
1577 basic_string&
1578 replace(iterator __i1, iterator __i2, const _CharT* __s)
1579 {
1580 __glibcxx_requires_string(__s);
1581 return this->replace(__i1, __i2, __s, traits_type::length(__s));
1582 }
1583
1584 /**
1585 * @brief Replace range of characters with multiple characters
1586 * @param __i1 Iterator referencing start of range to replace.
1587 * @param __i2 Iterator referencing end of range to replace.
1588 * @param __n Number of characters to insert.
1589 * @param __c Character to insert.
1590 * @return Reference to this string.
1591 * @throw std::length_error If new length exceeds @c max_size().
1592 *
1593 * Removes the characters in the range [__i1,__i2). In place,
1594 * @a __n copies of @a __c are inserted. If the length of
1595 * result exceeds max_size(), length_error is thrown. The
1596 * value of the string doesn't change if an error is thrown.
1597 */
1598 basic_string&
1599 replace(iterator __i1, iterator __i2, size_type __n, _CharT __c)
1600 {
1601 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1602 && __i2 <= _M_iend());
1603 return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __c);
1604 }
1605
1606 /**
1607 * @brief Replace range of characters with range.
1608 * @param __i1 Iterator referencing start of range to replace.
1609 * @param __i2 Iterator referencing end of range to replace.
1610 * @param __k1 Iterator referencing start of range to insert.
1611 * @param __k2 Iterator referencing end of range to insert.
1612 * @return Reference to this string.
1613 * @throw std::length_error If new length exceeds @c max_size().
1614 *
1615 * Removes the characters in the range [__i1,__i2). In place,
1616 * characters in the range [__k1,__k2) are inserted. If the
1617 * length of result exceeds max_size(), length_error is thrown.
1618 * The value of the string doesn't change if an error is
1619 * thrown.
1620 */
1621 template<class _InputIterator>
1622 basic_string&
1623 replace(iterator __i1, iterator __i2,
1624 _InputIterator __k1, _InputIterator __k2)
1625 {
1626 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1627 && __i2 <= _M_iend());
1628 __glibcxx_requires_valid_range(__k1, __k2);
1629 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
1630 return _M_replace_dispatch(__i1, __i2, __k1, __k2, _Integral());
1631 }
1632
1633 // Specializations for the common case of pointer and iterator:
1634 // useful to avoid the overhead of temporary buffering in _M_replace.
1635 basic_string&
1636 replace(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2)
1637 {
1638 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1639 && __i2 <= _M_iend());
1640 __glibcxx_requires_valid_range(__k1, __k2);
1641 return this->replace(__i1 - _M_ibegin(), __i2 - __i1,
1642 __k1, __k2 - __k1);
1643 }
1644
1645 basic_string&
1646 replace(iterator __i1, iterator __i2,
1647 const _CharT* __k1, const _CharT* __k2)
1648 {
1649 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1650 && __i2 <= _M_iend());
1651 __glibcxx_requires_valid_range(__k1, __k2);
1652 return this->replace(__i1 - _M_ibegin(), __i2 - __i1,
1653 __k1, __k2 - __k1);
1654 }
1655
1656 basic_string&
1657 replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2)
1658 {
1659 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1660 && __i2 <= _M_iend());
1661 __glibcxx_requires_valid_range(__k1, __k2);
1662 return this->replace(__i1 - _M_ibegin(), __i2 - __i1,
1663 __k1.base(), __k2 - __k1);
1664 }
1665
1666 basic_string&
1667 replace(iterator __i1, iterator __i2,
1668 const_iterator __k1, const_iterator __k2)
1669 {
1670 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1671 && __i2 <= _M_iend());
1672 __glibcxx_requires_valid_range(__k1, __k2);
1673 return this->replace(__i1 - _M_ibegin(), __i2 - __i1,
1674 __k1.base(), __k2 - __k1);
1675 }
1676
1677#if __cplusplus201103L >= 201103L
1678 /**
1679 * @brief Replace range of characters with initializer_list.
1680 * @param __i1 Iterator referencing start of range to replace.
1681 * @param __i2 Iterator referencing end of range to replace.
1682 * @param __l The initializer_list of characters to insert.
1683 * @return Reference to this string.
1684 * @throw std::length_error If new length exceeds @c max_size().
1685 *
1686 * Removes the characters in the range [__i1,__i2). In place,
1687 * characters in the range [__k1,__k2) are inserted. If the
1688 * length of result exceeds max_size(), length_error is thrown.
1689 * The value of the string doesn't change if an error is
1690 * thrown.
1691 */
1692 basic_string& replace(iterator __i1, iterator __i2,
1693 initializer_list<_CharT> __l)
1694 { return this->replace(__i1, __i2, __l.begin(), __l.end()); }
1695#endif // C++11
1696
1697 private:
1698 template<class _Integer>
1699 basic_string&
1700 _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n,
1701 _Integer __val, __true_type)
1702 { return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); }
1703
1704 template<class _InputIterator>
1705 basic_string&
1706 _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,
1707 _InputIterator __k2, __false_type);
1708
1709 basic_string&
1710 _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
1711 _CharT __c);
1712
1713 basic_string&
1714 _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s,
1715 size_type __n2);
1716
1717 // _S_construct_aux is used to implement the 21.3.1 para 15 which
1718 // requires special behaviour if _InIter is an integral type
1719 template<class _InIterator>
1720 static _CharT*
1721 _S_construct_aux(_InIterator __beg, _InIterator __end,
1722 const _Alloc& __a, __false_type)
1723 {
1724 typedef typename iterator_traits<_InIterator>::iterator_category _Tag;
1725 return _S_construct(__beg, __end, __a, _Tag());
1726 }
1727
1728 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1729 // 438. Ambiguity in the "do the right thing" clause
1730 template<class _Integer>
1731 static _CharT*
1732 _S_construct_aux(_Integer __beg, _Integer __end,
1733 const _Alloc& __a, __true_type)
1734 { return _S_construct_aux_2(static_cast<size_type>(__beg),
1735 __end, __a); }
1736
1737 static _CharT*
1738 _S_construct_aux_2(size_type __req, _CharT __c, const _Alloc& __a)
1739 { return _S_construct(__req, __c, __a); }
1740
1741 template<class _InIterator>
1742 static _CharT*
1743 _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a)
1744 {
1745 typedef typename std::__is_integer<_InIterator>::__type _Integral;
1746 return _S_construct_aux(__beg, __end, __a, _Integral());
1747 }
1748
1749 // For Input Iterators, used in istreambuf_iterators, etc.
1750 template<class _InIterator>
1751 static _CharT*
1752 _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,
1753 input_iterator_tag);
1754
1755 // For forward_iterators up to random_access_iterators, used for
1756 // string::iterator, _CharT*, etc.
1757 template<class _FwdIterator>
1758 static _CharT*
1759 _S_construct(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a,
1760 forward_iterator_tag);
1761
1762 static _CharT*
1763 _S_construct(size_type __req, _CharT __c, const _Alloc& __a);
1764
1765 public:
1766
1767 /**
1768 * @brief Copy substring into C string.
1769 * @param __s C string to copy value into.
1770 * @param __n Number of characters to copy.
1771 * @param __pos Index of first character to copy.
1772 * @return Number of characters actually copied
1773 * @throw std::out_of_range If __pos > size().
1774 *
1775 * Copies up to @a __n characters starting at @a __pos into the
1776 * C string @a __s. If @a __pos is %greater than size(),
1777 * out_of_range is thrown.
1778 */
1779 size_type
1780 copy(_CharT* __s, size_type __n, size_type __pos = 0) const;
1781
1782 /**
1783 * @brief Swap contents with another string.
1784 * @param __s String to swap with.
1785 *
1786 * Exchanges the contents of this string with that of @a __s in constant
1787 * time.
1788 */
1789 void
1790 swap(basic_string& __s);
1791
1792 // String operations:
1793 /**
1794 * @brief Return const pointer to null-terminated contents.
1795 *
1796 * This is a handle to internal data. Do not modify or dire things may
1797 * happen.
1798 */
1799 const _CharT*
1800 c_str() const _GLIBCXX_NOEXCEPTnoexcept
1801 { return _M_data(); }
1802
1803 /**
1804 * @brief Return const pointer to contents.
1805 *
1806 * This is a handle to internal data. Do not modify or dire things may
1807 * happen.
1808 */
1809 const _CharT*
1810 data() const _GLIBCXX_NOEXCEPTnoexcept
1811 { return _M_data(); }
1812
1813 /**
1814 * @brief Return copy of allocator used to construct this string.
1815 */
1816 allocator_type
1817 get_allocator() const _GLIBCXX_NOEXCEPTnoexcept
1818 { return _M_dataplus; }
1819
1820 /**
1821 * @brief Find position of a C substring.
1822 * @param __s C string to locate.
1823 * @param __pos Index of character to search from.
1824 * @param __n Number of characters from @a s to search for.
1825 * @return Index of start of first occurrence.
1826 *
1827 * Starting from @a __pos, searches forward for the first @a
1828 * __n characters in @a __s within this string. If found,
1829 * returns the index where it begins. If not found, returns
1830 * npos.
1831 */
1832 size_type
1833 find(const _CharT* __s, size_type __pos, size_type __n) const;
1834
1835 /**
1836 * @brief Find position of a string.
1837 * @param __str String to locate.
1838 * @param __pos Index of character to search from (default 0).
1839 * @return Index of start of first occurrence.
1840 *
1841 * Starting from @a __pos, searches forward for value of @a __str within
1842 * this string. If found, returns the index where it begins. If not
1843 * found, returns npos.
1844 */
1845 size_type
1846 find(const basic_string& __str, size_type __pos = 0) const
1847 _GLIBCXX_NOEXCEPTnoexcept
1848 { return this->find(__str.data(), __pos, __str.size()); }
1849
1850 /**
1851 * @brief Find position of a C string.
1852 * @param __s C string to locate.
1853 * @param __pos Index of character to search from (default 0).
1854 * @return Index of start of first occurrence.
1855 *
1856 * Starting from @a __pos, searches forward for the value of @a
1857 * __s within this string. If found, returns the index where
1858 * it begins. If not found, returns npos.
1859 */
1860 size_type
1861 find(const _CharT* __s, size_type __pos = 0) const
1862 {
1863 __glibcxx_requires_string(__s);
1864 return this->find(__s, __pos, traits_type::length(__s));
1865 }
1866
1867 /**
1868 * @brief Find position of a character.
1869 * @param __c Character to locate.
1870 * @param __pos Index of character to search from (default 0).
1871 * @return Index of first occurrence.
1872 *
1873 * Starting from @a __pos, searches forward for @a __c within
1874 * this string. If found, returns the index where it was
1875 * found. If not found, returns npos.
1876 */
1877 size_type
1878 find(_CharT __c, size_type __pos = 0) const _GLIBCXX_NOEXCEPTnoexcept;
1879
1880 /**
1881 * @brief Find last position of a string.
1882 * @param __str String to locate.
1883 * @param __pos Index of character to search back from (default end).
1884 * @return Index of start of last occurrence.
1885 *
1886 * Starting from @a __pos, searches backward for value of @a
1887 * __str within this string. If found, returns the index where
1888 * it begins. If not found, returns npos.
1889 */
1890 size_type
1891 rfind(const basic_string& __str, size_type __pos = npos) const
1892 _GLIBCXX_NOEXCEPTnoexcept
1893 { return this->rfind(__str.data(), __pos, __str.size()); }
1894
1895 /**
1896 * @brief Find last position of a C substring.
1897 * @param __s C string to locate.
1898 * @param __pos Index of character to search back from.
1899 * @param __n Number of characters from s to search for.
1900 * @return Index of start of last occurrence.
1901 *
1902 * Starting from @a __pos, searches backward for the first @a
1903 * __n characters in @a __s within this string. If found,
1904 * returns the index where it begins. If not found, returns
1905 * npos.
1906 */
1907 size_type
1908 rfind(const _CharT* __s, size_type __pos, size_type __n) const;
1909
1910 /**
1911 * @brief Find last position of a C string.
1912 * @param __s C string to locate.
1913 * @param __pos Index of character to start search at (default end).
1914 * @return Index of start of last occurrence.
1915 *
1916 * Starting from @a __pos, searches backward for the value of
1917 * @a __s within this string. If found, returns the index
1918 * where it begins. If not found, returns npos.
1919 */
1920 size_type
1921 rfind(const _CharT* __s, size_type __pos = npos) const
1922 {
1923 __glibcxx_requires_string(__s);
1924 return this->rfind(__s, __pos, traits_type::length(__s));
1925 }
1926
1927 /**
1928 * @brief Find last position of a character.
1929 * @param __c Character to locate.
1930 * @param __pos Index of character to search back from (default end).
1931 * @return Index of last occurrence.
1932 *
1933 * Starting from @a __pos, searches backward for @a __c within
1934 * this string. If found, returns the index where it was
1935 * found. If not found, returns npos.
1936 */
1937 size_type
1938 rfind(_CharT __c, size_type __pos = npos) const _GLIBCXX_NOEXCEPTnoexcept;
1939
1940 /**
1941 * @brief Find position of a character of string.
1942 * @param __str String containing characters to locate.
1943 * @param __pos Index of character to search from (default 0).
1944 * @return Index of first occurrence.
1945 *
1946 * Starting from @a __pos, searches forward for one of the
1947 * characters of @a __str within this string. If found,
1948 * returns the index where it was found. If not found, returns
1949 * npos.
1950 */
1951 size_type
1952 find_first_of(const basic_string& __str, size_type __pos = 0) const
1953 _GLIBCXX_NOEXCEPTnoexcept
1954 { return this->find_first_of(__str.data(), __pos, __str.size()); }
1955
1956 /**
1957 * @brief Find position of a character of C substring.
1958 * @param __s String containing characters to locate.
1959 * @param __pos Index of character to search from.
1960 * @param __n Number of characters from s to search for.
1961 * @return Index of first occurrence.
1962 *
1963 * Starting from @a __pos, searches forward for one of the
1964 * first @a __n characters of @a __s within this string. If
1965 * found, returns the index where it was found. If not found,
1966 * returns npos.
1967 */
1968 size_type
1969 find_first_of(const _CharT* __s, size_type __pos, size_type __n) const;
1970
1971 /**
1972 * @brief Find position of a character of C string.
1973 * @param __s String containing characters to locate.
1974 * @param __pos Index of character to search from (default 0).
1975 * @return Index of first occurrence.
1976 *
1977 * Starting from @a __pos, searches forward for one of the
1978 * characters of @a __s within this string. If found, returns
1979 * the index where it was found. If not found, returns npos.
1980 */
1981 size_type
1982 find_first_of(const _CharT* __s, size_type __pos = 0) const
1983 {
1984 __glibcxx_requires_string(__s);
1985 return this->find_first_of(__s, __pos, traits_type::length(__s));
1986 }
1987
1988 /**
1989 * @brief Find position of a character.
1990 * @param __c Character to locate.
1991 * @param __pos Index of character to search from (default 0).
1992 * @return Index of first occurrence.
1993 *
1994 * Starting from @a __pos, searches forward for the character
1995 * @a __c within this string. If found, returns the index
1996 * where it was found. If not found, returns npos.
1997 *
1998 * Note: equivalent to find(__c, __pos).
1999 */
2000 size_type
2001 find_first_of(_CharT __c, size_type __pos = 0) const _GLIBCXX_NOEXCEPTnoexcept
2002 { return this->find(__c, __pos); }
2003
2004 /**
2005 * @brief Find last position of a character of string.
2006 * @param __str String containing characters to locate.
2007 * @param __pos Index of character to search back from (default end).
2008 * @return Index of last occurrence.
2009 *
2010 * Starting from @a __pos, searches backward for one of the
2011 * characters of @a __str within this string. If found,
2012 * returns the index where it was found. If not found, returns
2013 * npos.
2014 */
2015 size_type
2016 find_last_of(const basic_string& __str, size_type __pos = npos) const
2017 _GLIBCXX_NOEXCEPTnoexcept
2018 { return this->find_last_of(__str.data(), __pos, __str.size()); }
2019
2020 /**
2021 * @brief Find last position of a character of C substring.
2022 * @param __s C string containing characters to locate.
2023 * @param __pos Index of character to search back from.
2024 * @param __n Number of characters from s to search for.
2025 * @return Index of last occurrence.
2026 *
2027 * Starting from @a __pos, searches backward for one of the
2028 * first @a __n characters of @a __s within this string. If
2029 * found, returns the index where it was found. If not found,
2030 * returns npos.
2031 */
2032 size_type
2033 find_last_of(const _CharT* __s, size_type __pos, size_type __n) const;
2034
2035 /**
2036 * @brief Find last position of a character of C string.
2037 * @param __s C string containing characters to locate.
2038 * @param __pos Index of character to search back from (default end).
2039 * @return Index of last occurrence.
2040 *
2041 * Starting from @a __pos, searches backward for one of the
2042 * characters of @a __s within this string. If found, returns
2043 * the index where it was found. If not found, returns npos.
2044 */
2045 size_type
2046 find_last_of(const _CharT* __s, size_type __pos = npos) const
2047 {
2048 __glibcxx_requires_string(__s);
2049 return this->find_last_of(__s, __pos, traits_type::length(__s));
2050 }
2051
2052 /**
2053 * @brief Find last position of a character.
2054 * @param __c Character to locate.
2055 * @param __pos Index of character to search back from (default end).
2056 * @return Index of last occurrence.
2057 *
2058 * Starting from @a __pos, searches backward for @a __c within
2059 * this string. If found, returns the index where it was
2060 * found. If not found, returns npos.
2061 *
2062 * Note: equivalent to rfind(__c, __pos).
2063 */
2064 size_type
2065 find_last_of(_CharT __c, size_type __pos = npos) const _GLIBCXX_NOEXCEPTnoexcept
2066 { return this->rfind(__c, __pos); }
2067
2068 /**
2069 * @brief Find position of a character not in string.
2070 * @param __str String containing characters to avoid.
2071 * @param __pos Index of character to search from (default 0).
2072 * @return Index of first occurrence.
2073 *
2074 * Starting from @a __pos, searches forward for a character not contained
2075 * in @a __str within this string. If found, returns the index where it
2076 * was found. If not found, returns npos.
2077 */
2078 size_type
2079 find_first_not_of(const basic_string& __str, size_type __pos = 0) const
2080 _GLIBCXX_NOEXCEPTnoexcept
2081 { return this->find_first_not_of(__str.data(), __pos, __str.size()); }
2082
2083 /**
2084 * @brief Find position of a character not in C substring.
2085 * @param __s C string containing characters to avoid.
2086 * @param __pos Index of character to search from.
2087 * @param __n Number of characters from __s to consider.
2088 * @return Index of first occurrence.
2089 *
2090 * Starting from @a __pos, searches forward for a character not
2091 * contained in the first @a __n characters of @a __s within
2092 * this string. If found, returns the index where it was
2093 * found. If not found, returns npos.
2094 */
2095 size_type
2096 find_first_not_of(const _CharT* __s, size_type __pos,
2097 size_type __n) const;
2098
2099 /**
2100 * @brief Find position of a character not in C string.
2101 * @param __s C string containing characters to avoid.
2102 * @param __pos Index of character to search from (default 0).
2103 * @return Index of first occurrence.
2104 *
2105 * Starting from @a __pos, searches forward for a character not
2106 * contained in @a __s within this string. If found, returns
2107 * the index where it was found. If not found, returns npos.
2108 */
2109 size_type
2110 find_first_not_of(const _CharT* __s, size_type __pos = 0) const
2111 {
2112 __glibcxx_requires_string(__s);
2113 return this->find_first_not_of(__s, __pos, traits_type::length(__s));
2114 }
2115
2116 /**
2117 * @brief Find position of a different character.
2118 * @param __c Character to avoid.
2119 * @param __pos Index of character to search from (default 0).
2120 * @return Index of first occurrence.
2121 *
2122 * Starting from @a __pos, searches forward for a character
2123 * other than @a __c within this string. If found, returns the
2124 * index where it was found. If not found, returns npos.
2125 */
2126 size_type
2127 find_first_not_of(_CharT __c, size_type __pos = 0) const
2128 _GLIBCXX_NOEXCEPTnoexcept;
2129
2130 /**
2131 * @brief Find last position of a character not in string.
2132 * @param __str String containing characters to avoid.
2133 * @param __pos Index of character to search back from (default end).
2134 * @return Index of last occurrence.
2135 *
2136 * Starting from @a __pos, searches backward for a character
2137 * not contained in @a __str within this string. If found,
2138 * returns the index where it was found. If not found, returns
2139 * npos.
2140 */
2141 size_type
2142 find_last_not_of(const basic_string& __str, size_type __pos = npos) const
2143 _GLIBCXX_NOEXCEPTnoexcept
2144 { return this->find_last_not_of(__str.data(), __pos, __str.size()); }
2145
2146 /**
2147 * @brief Find last position of a character not in C substring.
2148 * @param __s C string containing characters to avoid.
2149 * @param __pos Index of character to search back from.
2150 * @param __n Number of characters from s to consider.
2151 * @return Index of last occurrence.
2152 *
2153 * Starting from @a __pos, searches backward for a character not
2154 * contained in the first @a __n characters of @a __s within this string.
2155 * If found, returns the index where it was found. If not found,
2156 * returns npos.
2157 */
2158 size_type
2159 find_last_not_of(const _CharT* __s, size_type __pos,
2160 size_type __n) const;
2161 /**
2162 * @brief Find last position of a character not in C string.
2163 * @param __s C string containing characters to avoid.
2164 * @param __pos Index of character to search back from (default end).
2165 * @return Index of last occurrence.
2166 *
2167 * Starting from @a __pos, searches backward for a character
2168 * not contained in @a __s within this string. If found,
2169 * returns the index where it was found. If not found, returns
2170 * npos.
2171 */
2172 size_type
2173 find_last_not_of(const _CharT* __s, size_type __pos = npos) const
2174 {
2175 __glibcxx_requires_string(__s);
2176 return this->find_last_not_of(__s, __pos, traits_type::length(__s));
2177 }
2178
2179 /**
2180 * @brief Find last position of a different character.
2181 * @param __c Character to avoid.
2182 * @param __pos Index of character to search back from (default end).
2183 * @return Index of last occurrence.
2184 *
2185 * Starting from @a __pos, searches backward for a character other than
2186 * @a __c within this string. If found, returns the index where it was
2187 * found. If not found, returns npos.
2188 */
2189 size_type
2190 find_last_not_of(_CharT __c, size_type __pos = npos) const
2191 _GLIBCXX_NOEXCEPTnoexcept;
2192
2193 /**
2194 * @brief Get a substring.
2195 * @param __pos Index of first character (default 0).
2196 * @param __n Number of characters in substring (default remainder).
2197 * @return The new string.
2198 * @throw std::out_of_range If __pos > size().
2199 *
2200 * Construct and return a new string using the @a __n
2201 * characters starting at @a __pos. If the string is too
2202 * short, use the remainder of the characters. If @a __pos is
2203 * beyond the end of the string, out_of_range is thrown.
2204 */
2205 basic_string
2206 substr(size_type __pos = 0, size_type __n = npos) const
2207 { return basic_string(*this,
2208 _M_check(__pos, "basic_string::substr"), __n); }
2209
2210 /**
2211 * @brief Compare to a string.
2212 * @param __str String to compare against.
2213 * @return Integer < 0, 0, or > 0.
2214 *
2215 * Returns an integer < 0 if this string is ordered before @a
2216 * __str, 0 if their values are equivalent, or > 0 if this
2217 * string is ordered after @a __str. Determines the effective
2218 * length rlen of the strings to compare as the smallest of
2219 * size() and str.size(). The function then compares the two
2220 * strings by calling traits::compare(data(), str.data(),rlen).
2221 * If the result of the comparison is nonzero returns it,
2222 * otherwise the shorter one is ordered first.
2223 */
2224 int
2225 compare(const basic_string& __str) const
2226 {
2227 const size_type __size = this->size();
2228 const size_type __osize = __str.size();
2229 const size_type __len = std::min(__size, __osize);
2230
2231 int __r = traits_type::compare(_M_data(), __str.data(), __len);
2232 if (!__r)
2233 __r = _S_compare(__size, __osize);
2234 return __r;
2235 }
2236
2237 /**
2238 * @brief Compare substring to a string.
2239 * @param __pos Index of first character of substring.
2240 * @param __n Number of characters in substring.
2241 * @param __str String to compare against.
2242 * @return Integer < 0, 0, or > 0.
2243 *
2244 * Form the substring of this string from the @a __n characters
2245 * starting at @a __pos. Returns an integer < 0 if the
2246 * substring is ordered before @a __str, 0 if their values are
2247 * equivalent, or > 0 if the substring is ordered after @a
2248 * __str. Determines the effective length rlen of the strings
2249 * to compare as the smallest of the length of the substring
2250 * and @a __str.size(). The function then compares the two
2251 * strings by calling
2252 * traits::compare(substring.data(),str.data(),rlen). If the
2253 * result of the comparison is nonzero returns it, otherwise
2254 * the shorter one is ordered first.
2255 */
2256 int
2257 compare(size_type __pos, size_type __n, const basic_string& __str) const;
2258
2259 /**
2260 * @brief Compare substring to a substring.
2261 * @param __pos1 Index of first character of substring.
2262 * @param __n1 Number of characters in substring.
2263 * @param __str String to compare against.
2264 * @param __pos2 Index of first character of substring of str.
2265 * @param __n2 Number of characters in substring of str.
2266 * @return Integer < 0, 0, or > 0.
2267 *
2268 * Form the substring of this string from the @a __n1
2269 * characters starting at @a __pos1. Form the substring of @a
2270 * __str from the @a __n2 characters starting at @a __pos2.
2271 * Returns an integer < 0 if this substring is ordered before
2272 * the substring of @a __str, 0 if their values are equivalent,
2273 * or > 0 if this substring is ordered after the substring of
2274 * @a __str. Determines the effective length rlen of the
2275 * strings to compare as the smallest of the lengths of the
2276 * substrings. The function then compares the two strings by
2277 * calling
2278 * traits::compare(substring.data(),str.substr(pos2,n2).data(),rlen).
2279 * If the result of the comparison is nonzero returns it,
2280 * otherwise the shorter one is ordered first.
2281 */
2282 int
2283 compare(size_type __pos1, size_type __n1, const basic_string& __str,
2284 size_type __pos2, size_type __n2) const;
2285
2286 /**
2287 * @brief Compare to a C string.
2288 * @param __s C string to compare against.
2289 * @return Integer < 0, 0, or > 0.
2290 *
2291 * Returns an integer < 0 if this string is ordered before @a __s, 0 if
2292 * their values are equivalent, or > 0 if this string is ordered after
2293 * @a __s. Determines the effective length rlen of the strings to
2294 * compare as the smallest of size() and the length of a string
2295 * constructed from @a __s. The function then compares the two strings
2296 * by calling traits::compare(data(),s,rlen). If the result of the
2297 * comparison is nonzero returns it, otherwise the shorter one is
2298 * ordered first.
2299 */
2300 int
2301 compare(const _CharT* __s) const;
2302
2303 // _GLIBCXX_RESOLVE_LIB_DEFECTS
2304 // 5 String::compare specification questionable
2305 /**
2306 * @brief Compare substring to a C string.
2307 * @param __pos Index of first character of substring.
2308 * @param __n1 Number of characters in substring.
2309 * @param __s C string to compare against.
2310 * @return Integer < 0, 0, or > 0.
2311 *
2312 * Form the substring of this string from the @a __n1
2313 * characters starting at @a pos. Returns an integer < 0 if
2314 * the substring is ordered before @a __s, 0 if their values
2315 * are equivalent, or > 0 if the substring is ordered after @a
2316 * __s. Determines the effective length rlen of the strings to
2317 * compare as the smallest of the length of the substring and
2318 * the length of a string constructed from @a __s. The
2319 * function then compares the two string by calling
2320 * traits::compare(substring.data(),__s,rlen). If the result of
2321 * the comparison is nonzero returns it, otherwise the shorter
2322 * one is ordered first.
2323 */
2324 int
2325 compare(size_type __pos, size_type __n1, const _CharT* __s) const;
2326
2327 /**
2328 * @brief Compare substring against a character %array.
2329 * @param __pos Index of first character of substring.
2330 * @param __n1 Number of characters in substring.
2331 * @param __s character %array to compare against.
2332 * @param __n2 Number of characters of s.
2333 * @return Integer < 0, 0, or > 0.
2334 *
2335 * Form the substring of this string from the @a __n1
2336 * characters starting at @a __pos. Form a string from the
2337 * first @a __n2 characters of @a __s. Returns an integer < 0
2338 * if this substring is ordered before the string from @a __s,
2339 * 0 if their values are equivalent, or > 0 if this substring
2340 * is ordered after the string from @a __s. Determines the
2341 * effective length rlen of the strings to compare as the
2342 * smallest of the length of the substring and @a __n2. The
2343 * function then compares the two strings by calling
2344 * traits::compare(substring.data(),s,rlen). If the result of
2345 * the comparison is nonzero returns it, otherwise the shorter
2346 * one is ordered first.
2347 *
2348 * NB: s must have at least n2 characters, &apos;\\0&apos; has
2349 * no special meaning.
2350 */
2351 int
2352 compare(size_type __pos, size_type __n1, const _CharT* __s,
2353 size_type __n2) const;
2354 };
2355
2356 // operator+
2357 /**
2358 * @brief Concatenate two strings.
2359 * @param __lhs First string.
2360 * @param __rhs Last string.
2361 * @return New string with value of @a __lhs followed by @a __rhs.
2362 */
2363 template<typename _CharT, typename _Traits, typename _Alloc>
2364 basic_string<_CharT, _Traits, _Alloc>
2365 operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2366 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2367 {
2368 basic_string<_CharT, _Traits, _Alloc> __str(__lhs);
2369 __str.append(__rhs);
2370 return __str;
2371 }
2372
2373 /**
2374 * @brief Concatenate C string and string.
2375 * @param __lhs First string.
2376 * @param __rhs Last string.
2377 * @return New string with value of @a __lhs followed by @a __rhs.
2378 */
2379 template<typename _CharT, typename _Traits, typename _Alloc>
2380 basic_string<_CharT,_Traits,_Alloc>
2381 operator+(const _CharT* __lhs,
2382 const basic_string<_CharT,_Traits,_Alloc>& __rhs);
2383
2384 /**
2385 * @brief Concatenate character and string.
2386 * @param __lhs First string.
2387 * @param __rhs Last string.
2388 * @return New string with @a __lhs followed by @a __rhs.
2389 */
2390 template<typename _CharT, typename _Traits, typename _Alloc>
2391 basic_string<_CharT,_Traits,_Alloc>
2392 operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs);
2393
2394 /**
2395 * @brief Concatenate string and C string.
2396 * @param __lhs First string.
2397 * @param __rhs Last string.
2398 * @return New string with @a __lhs followed by @a __rhs.
2399 */
2400 template<typename _CharT, typename _Traits, typename _Alloc>
2401 inline basic_string<_CharT, _Traits, _Alloc>
2402 operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2403 const _CharT* __rhs)
2404 {
2405 basic_string<_CharT, _Traits, _Alloc> __str(__lhs);
2406 __str.append(__rhs);
2407 return __str;
2408 }
2409
2410 /**
2411 * @brief Concatenate string and character.
2412 * @param __lhs First string.
2413 * @param __rhs Last string.
2414 * @return New string with @a __lhs followed by @a __rhs.
2415 */
2416 template<typename _CharT, typename _Traits, typename _Alloc>
2417 inline basic_string<_CharT, _Traits, _Alloc>
2418 operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs)
2419 {
2420 typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
2421 typedef typename __string_type::size_type __size_type;
2422 __string_type __str(__lhs);
2423 __str.append(__size_type(1), __rhs);
2424 return __str;
2425 }
2426
2427#if __cplusplus201103L >= 201103L
2428 template<typename _CharT, typename _Traits, typename _Alloc>
2429 inline basic_string<_CharT, _Traits, _Alloc>
2430 operator+(basic_string<_CharT, _Traits, _Alloc>&& __lhs,
2431 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2432 { return std::move(__lhs.append(__rhs)); }
2433
2434 template<typename _CharT, typename _Traits, typename _Alloc>
2435 inline basic_string<_CharT, _Traits, _Alloc>
2436 operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2437 basic_string<_CharT, _Traits, _Alloc>&& __rhs)
2438 { return std::move(__rhs.insert(0, __lhs)); }
2439
2440 template<typename _CharT, typename _Traits, typename _Alloc>
2441 inline basic_string<_CharT, _Traits, _Alloc>
2442 operator+(basic_string<_CharT, _Traits, _Alloc>&& __lhs,
2443 basic_string<_CharT, _Traits, _Alloc>&& __rhs)
2444 {
2445 const auto __size = __lhs.size() + __rhs.size();
2446 const bool __cond = (__size > __lhs.capacity()
2447 && __size <= __rhs.capacity());
2448 return __cond ? std::move(__rhs.insert(0, __lhs))
2449 : std::move(__lhs.append(__rhs));
2450 }
2451
2452 template<typename _CharT, typename _Traits, typename _Alloc>
2453 inline basic_string<_CharT, _Traits, _Alloc>
2454 operator+(const _CharT* __lhs,
2455 basic_string<_CharT, _Traits, _Alloc>&& __rhs)
2456 { return std::move(__rhs.insert(0, __lhs)); }
2457
2458 template<typename _CharT, typename _Traits, typename _Alloc>
2459 inline basic_string<_CharT, _Traits, _Alloc>
2460 operator+(_CharT __lhs,
2461 basic_string<_CharT, _Traits, _Alloc>&& __rhs)
2462 { return std::move(__rhs.insert(0, 1, __lhs)); }
2463
2464 template<typename _CharT, typename _Traits, typename _Alloc>
2465 inline basic_string<_CharT, _Traits, _Alloc>
2466 operator+(basic_string<_CharT, _Traits, _Alloc>&& __lhs,
2467 const _CharT* __rhs)
2468 { return std::move(__lhs.append(__rhs)); }
2469
2470 template<typename _CharT, typename _Traits, typename _Alloc>
2471 inline basic_string<_CharT, _Traits, _Alloc>
2472 operator+(basic_string<_CharT, _Traits, _Alloc>&& __lhs,
2473 _CharT __rhs)
2474 { return std::move(__lhs.append(1, __rhs)); }
2475#endif
2476
2477 // operator ==
2478 /**
2479 * @brief Test equivalence of two strings.
2480 * @param __lhs First string.
2481 * @param __rhs Second string.
2482 * @return True if @a __lhs.compare(@a __rhs) == 0. False otherwise.
2483 */
2484 template<typename _CharT, typename _Traits, typename _Alloc>
2485 inline bool
2486 operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2487 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2488 { return __lhs.compare(__rhs) == 0; }
2489
2490 template<typename _CharT>
2491 inline
2492 typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, bool>::__type
2493 operator==(const basic_string<_CharT>& __lhs,
2494 const basic_string<_CharT>& __rhs)
2495 { return (__lhs.size() == __rhs.size()
2496 && !std::char_traits<_CharT>::compare(__lhs.data(), __rhs.data(),
2497 __lhs.size())); }
2498
2499 /**
2500 * @brief Test equivalence of C string and string.
2501 * @param __lhs C string.
2502 * @param __rhs String.
2503 * @return True if @a __rhs.compare(@a __lhs) == 0. False otherwise.
2504 */
2505 template<typename _CharT, typename _Traits, typename _Alloc>
2506 inline bool
2507 operator==(const _CharT* __lhs,
2508 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2509 { return __rhs.compare(__lhs) == 0; }
2510
2511 /**
2512 * @brief Test equivalence of string and C string.
2513 * @param __lhs String.
2514 * @param __rhs C string.
2515 * @return True if @a __lhs.compare(@a __rhs) == 0. False otherwise.
2516 */
2517 template<typename _CharT, typename _Traits, typename _Alloc>
2518 inline bool
2519 operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2520 const _CharT* __rhs)
2521 { return __lhs.compare(__rhs) == 0; }
17
←
Assuming the condition is false
→
18
←
Returning zero, which participates in a condition later
→
22
←
Assuming the condition is false
→
23
←
Returning zero, which participates in a condition later
→
27
←
Assuming the condition is false
→
28
←
Returning zero, which participates in a condition later
→
32
←
Assuming the condition is false
→
33
←
Returning zero, which participates in a condition later
→
37
←
Assuming the condition is false
→
38
←
Returning zero, which participates in a condition later
→
42
←
Assuming the condition is false
→
43
←
Returning zero, which participates in a condition later
→
47
←
Assuming the condition is false
→
48
←
Returning zero, which participates in a condition later
→
52
←
Assuming the condition is false
→
53
←
Returning zero, which participates in a condition later
→
57
←
Assuming the condition is true
→
58
←
Returning the value 1, which participates in a condition later
→
65
←
Assuming the condition is true
→
66
←
Returning the value 1, which participates in a condition later
→
2522
2523 // operator !=
2524 /**
2525 * @brief Test difference of two strings.
2526 * @param __lhs First string.
2527 * @param __rhs Second string.
2528 * @return True if @a __lhs.compare(@a __rhs) != 0. False otherwise.
2529 */
2530 template<typename _CharT, typename _Traits, typename _Alloc>
2531 inline bool
2532 operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2533 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2534 { return !(__lhs == __rhs); }
2535
2536 /**
2537 * @brief Test difference of C string and string.
2538 * @param __lhs C string.
2539 * @param __rhs String.
2540 * @return True if @a __rhs.compare(@a __lhs) != 0. False otherwise.
2541 */
2542 template<typename _CharT, typename _Traits, typename _Alloc>
2543 inline bool
2544 operator!=(const _CharT* __lhs,
2545 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2546 { return !(__lhs == __rhs); }
2547
2548 /**
2549 * @brief Test difference of string and C string.
2550 * @param __lhs String.
2551 * @param __rhs C string.
2552 * @return True if @a __lhs.compare(@a __rhs) != 0. False otherwise.
2553 */
2554 template<typename _CharT, typename _Traits, typename _Alloc>
2555 inline bool
2556 operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2557 const _CharT* __rhs)
2558 { return !(__lhs == __rhs); }
64
←
Calling 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
67
←
Returning from 'operator==<char, std::char_traits<char>, std::allocator<char>>'
→
68
←
Returning zero, which participates in a condition later
→
2559
2560 // operator <
2561 /**
2562 * @brief Test if string precedes string.
2563 * @param __lhs First string.
2564 * @param __rhs Second string.
2565 * @return True if @a __lhs precedes @a __rhs. False otherwise.
2566 */
2567 template<typename _CharT, typename _Traits, typename _Alloc>
2568 inline bool
2569 operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2570 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2571 { return __lhs.compare(__rhs) < 0; }
2572
2573 /**
2574 * @brief Test if string precedes C string.
2575 * @param __lhs String.
2576 * @param __rhs C string.
2577 * @return True if @a __lhs precedes @a __rhs. False otherwise.
2578 */
2579 template<typename _CharT, typename _Traits, typename _Alloc>
2580 inline bool
2581 operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2582 const _CharT* __rhs)
2583 { return __lhs.compare(__rhs) < 0; }
2584
2585 /**
2586 * @brief Test if C string precedes string.
2587 * @param __lhs C string.
2588 * @param __rhs String.
2589 * @return True if @a __lhs precedes @a __rhs. False otherwise.
2590 */
2591 template<typename _CharT, typename _Traits, typename _Alloc>
2592 inline bool
2593 operator<(const _CharT* __lhs,
2594 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2595 { return __rhs.compare(__lhs) > 0; }
2596
2597 // operator >
2598 /**
2599 * @brief Test if string follows string.
2600 * @param __lhs First string.
2601 * @param __rhs Second string.
2602 * @return True if @a __lhs follows @a __rhs. False otherwise.
2603 */
2604 template<typename _CharT, typename _Traits, typename _Alloc>
2605 inline bool
2606 operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2607 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2608 { return __lhs.compare(__rhs) > 0; }
2609
2610 /**
2611 * @brief Test if string follows C string.
2612 * @param __lhs String.
2613 * @param __rhs C string.
2614 * @return True if @a __lhs follows @a __rhs. False otherwise.
2615 */
2616 template<typename _CharT, typename _Traits, typename _Alloc>
2617 inline bool
2618 operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2619 const _CharT* __rhs)
2620 { return __lhs.compare(__rhs) > 0; }
2621
2622 /**
2623 * @brief Test if C string follows string.
2624 * @param __lhs C string.
2625 * @param __rhs String.
2626 * @return True if @a __lhs follows @a __rhs. False otherwise.
2627 */
2628 template<typename _CharT, typename _Traits, typename _Alloc>
2629 inline bool
2630 operator>(const _CharT* __lhs,
2631 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2632 { return __rhs.compare(__lhs) < 0; }
2633
2634 // operator <=
2635 /**
2636 * @brief Test if string doesn't follow string.
2637 * @param __lhs First string.
2638 * @param __rhs Second string.
2639 * @return True if @a __lhs doesn't follow @a __rhs. False otherwise.
2640 */
2641 template<typename _CharT, typename _Traits, typename _Alloc>
2642 inline bool
2643 operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2644 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2645 { return __lhs.compare(__rhs) <= 0; }
2646
2647 /**
2648 * @brief Test if string doesn't follow C string.
2649 * @param __lhs String.
2650 * @param __rhs C string.
2651 * @return True if @a __lhs doesn't follow @a __rhs. False otherwise.
2652 */
2653 template<typename _CharT, typename _Traits, typename _Alloc>
2654 inline bool
2655 operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2656 const _CharT* __rhs)
2657 { return __lhs.compare(__rhs) <= 0; }
2658
2659 /**
2660 * @brief Test if C string doesn't follow string.
2661 * @param __lhs C string.
2662 * @param __rhs String.
2663 * @return True if @a __lhs doesn't follow @a __rhs. False otherwise.
2664 */
2665 template<typename _CharT, typename _Traits, typename _Alloc>
2666 inline bool
2667 operator<=(const _CharT* __lhs,
2668 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2669 { return __rhs.compare(__lhs) >= 0; }
2670
2671 // operator >=
2672 /**
2673 * @brief Test if string doesn't precede string.
2674 * @param __lhs First string.
2675 * @param __rhs Second string.
2676 * @return True if @a __lhs doesn't precede @a __rhs. False otherwise.
2677 */
2678 template<typename _CharT, typename _Traits, typename _Alloc>
2679 inline bool
2680 operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2681 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2682 { return __lhs.compare(__rhs) >= 0; }
2683
2684 /**
2685 * @brief Test if string doesn't precede C string.
2686 * @param __lhs String.
2687 * @param __rhs C string.
2688 * @return True if @a __lhs doesn't precede @a __rhs. False otherwise.
2689 */
2690 template<typename _CharT, typename _Traits, typename _Alloc>
2691 inline bool
2692 operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
2693 const _CharT* __rhs)
2694 { return __lhs.compare(__rhs) >= 0; }
2695
2696 /**
2697 * @brief Test if C string doesn't precede string.
2698 * @param __lhs C string.
2699 * @param __rhs String.
2700 * @return True if @a __lhs doesn't precede @a __rhs. False otherwise.
2701 */
2702 template<typename _CharT, typename _Traits, typename _Alloc>
2703 inline bool
2704 operator>=(const _CharT* __lhs,
2705 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
2706 { return __rhs.compare(__lhs) <= 0; }
2707
2708 /**
2709 * @brief Swap contents of two strings.
2710 * @param __lhs First string.
2711 * @param __rhs Second string.
2712 *
2713 * Exchanges the contents of @a __lhs and @a __rhs in constant time.
2714 */
2715 template<typename _CharT, typename _Traits, typename _Alloc>
2716 inline void
2717 swap(basic_string<_CharT, _Traits, _Alloc>& __lhs,
2718 basic_string<_CharT, _Traits, _Alloc>& __rhs)
2719 { __lhs.swap(__rhs); }
2720
2721 /**
2722 * @brief Read stream into a string.
2723 * @param __is Input stream.
2724 * @param __str Buffer to store into.
2725 * @return Reference to the input stream.
2726 *
2727 * Stores characters from @a __is into @a __str until whitespace is
2728 * found, the end of the stream is encountered, or str.max_size()
2729 * is reached. If is.width() is non-zero, that is the limit on the
2730 * number of characters stored into @a __str. Any previous
2731 * contents of @a __str are erased.
2732 */
2733 template<typename _CharT, typename _Traits, typename _Alloc>
2734 basic_istream<_CharT, _Traits>&
2735 operator>>(basic_istream<_CharT, _Traits>& __is,
2736 basic_string<_CharT, _Traits, _Alloc>& __str);
2737
2738 template<>
2739 basic_istream<char>&
2740 operator>>(basic_istream<char>& __is, basic_string<char>& __str);
2741
2742 /**
2743 * @brief Write string to a stream.
2744 * @param __os Output stream.
2745 * @param __str String to write out.
2746 * @return Reference to the output stream.
2747 *
2748 * Output characters of @a __str into os following the same rules as for
2749 * writing a C string.
2750 */
2751 template<typename _CharT, typename _Traits, typename _Alloc>
2752 inline basic_ostream<_CharT, _Traits>&
2753 operator<<(basic_ostream<_CharT, _Traits>& __os,
2754 const basic_string<_CharT, _Traits, _Alloc>& __str)
2755 {
2756 // _GLIBCXX_RESOLVE_LIB_DEFECTS
2757 // 586. string inserter not a formatted function
2758 return __ostream_insert(__os, __str.data(), __str.size());
2759 }
2760
2761 /**
2762 * @brief Read a line from stream into a string.
2763 * @param __is Input stream.
2764 * @param __str Buffer to store into.
2765 * @param __delim Character marking end of line.
2766 * @return Reference to the input stream.
2767 *
2768 * Stores characters from @a __is into @a __str until @a __delim is
2769 * found, the end of the stream is encountered, or str.max_size()
2770 * is reached. Any previous contents of @a __str are erased. If
2771 * @a __delim is encountered, it is extracted but not stored into
2772 * @a __str.
2773 */
2774 template<typename _CharT, typename _Traits, typename _Alloc>
2775 basic_istream<_CharT, _Traits>&
2776 getline(basic_istream<_CharT, _Traits>& __is,
2777 basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim);
2778
2779 /**
2780 * @brief Read a line from stream into a string.
2781 * @param __is Input stream.
2782 * @param __str Buffer to store into.
2783 * @return Reference to the input stream.
2784 *
2785 * Stores characters from is into @a __str until &apos;\n&apos; is
2786 * found, the end of the stream is encountered, or str.max_size()
2787 * is reached. Any previous contents of @a __str are erased. If
2788 * end of line is encountered, it is extracted but not stored into
2789 * @a __str.
2790 */
2791 template<typename _CharT, typename _Traits, typename _Alloc>
2792 inline basic_istream<_CharT, _Traits>&
2793 getline(basic_istream<_CharT, _Traits>& __is,
2794 basic_string<_CharT, _Traits, _Alloc>& __str)
2795 { return getline(__is, __str, __is.widen('\n')); }
2796
2797 template<>
2798 basic_istream<char>&
2799 getline(basic_istream<char>& __in, basic_string<char>& __str,
2800 char __delim);
2801
2802#ifdef _GLIBCXX_USE_WCHAR_T1
2803 template<>
2804 basic_istream<wchar_t>&
2805 getline(basic_istream<wchar_t>& __in, basic_string<wchar_t>& __str,
2806 wchar_t __delim);
2807#endif
2808
2809_GLIBCXX_END_NAMESPACE_VERSION
2810} // namespace
2811
2812#if ((__cplusplus201103L >= 201103L) && defined(_GLIBCXX_USE_C991) \
2813 && !defined(_GLIBCXX_HAVE_BROKEN_VSWPRINTF))
2814
2815#include <ext/string_conversions.h>
2816
2817namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
2818{
2819_GLIBCXX_BEGIN_NAMESPACE_VERSION
2820
2821 // 21.4 Numeric Conversions [string.conversions].
2822 inline int
2823 stoi(const string& __str, size_t* __idx = 0, int __base = 10)
2824 { return __gnu_cxx::__stoa<long, int>(&std::strtol, "stoi", __str.c_str(),
2825 __idx, __base); }
2826
2827 inline long
2828 stol(const string& __str, size_t* __idx = 0, int __base = 10)
2829 { return __gnu_cxx::__stoa(&std::strtol, "stol", __str.c_str(),
2830 __idx, __base); }
2831
2832 inline unsigned long
2833 stoul(const string& __str, size_t* __idx = 0, int __base = 10)
2834 { return __gnu_cxx::__stoa(&std::strtoul, "stoul", __str.c_str(),
2835 __idx, __base); }
2836
2837 inline long long
2838 stoll(const string& __str, size_t* __idx = 0, int __base = 10)
2839 { return __gnu_cxx::__stoa(&std::strtoll, "stoll", __str.c_str(),
2840 __idx, __base); }
2841
2842 inline unsigned long long
2843 stoull(const string& __str, size_t* __idx = 0, int __base = 10)
2844 { return __gnu_cxx::__stoa(&std::strtoull, "stoull", __str.c_str(),
2845 __idx, __base); }
2846
2847 // NB: strtof vs strtod.
2848 inline float
2849 stof(const string& __str, size_t* __idx = 0)
2850 { return __gnu_cxx::__stoa(&std::strtof, "stof", __str.c_str(), __idx); }
2851
2852 inline double
2853 stod(const string& __str, size_t* __idx = 0)
2854 { return __gnu_cxx::__stoa(&std::strtod, "stod", __str.c_str(), __idx); }
2855
2856 inline long double
2857 stold(const string& __str, size_t* __idx = 0)
2858 { return __gnu_cxx::__stoa(&std::strtold, "stold", __str.c_str(), __idx); }
2859
2860 // NB: (v)snprintf vs sprintf.
2861
2862 // DR 1261.
2863 inline string
2864 to_string(int __val)
2865 { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, 4 * sizeof(int),
2866 "%d", __val); }
2867
2868 inline string
2869 to_string(unsigned __val)
2870 { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf,
2871 4 * sizeof(unsigned),
2872 "%u", __val); }
2873
2874 inline string
2875 to_string(long __val)
2876 { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, 4 * sizeof(long),
2877 "%ld", __val); }
2878
2879 inline string
2880 to_string(unsigned long __val)
2881 { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf,
2882 4 * sizeof(unsigned long),
2883 "%lu", __val); }
2884
2885 inline string
2886 to_string(long long __val)
2887 { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf,
2888 4 * sizeof(long long),
2889 "%lld", __val); }
2890
2891 inline string
2892 to_string(unsigned long long __val)
2893 { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf,
2894 4 * sizeof(unsigned long long),
2895 "%llu", __val); }
2896
2897 inline string
2898 to_string(float __val)
2899 {
2900 const int __n =
2901 __gnu_cxx::__numeric_traits<float>::__max_exponent10 + 20;
2902 return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, __n,
2903 "%f", __val);
2904 }
2905
2906 inline string
2907 to_string(double __val)
2908 {
2909 const int __n =
2910 __gnu_cxx::__numeric_traits<double>::__max_exponent10 + 20;
2911 return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, __n,
2912 "%f", __val);
2913 }
2914
2915 inline string
2916 to_string(long double __val)
2917 {
2918 const int __n =
2919 __gnu_cxx::__numeric_traits<long double>::__max_exponent10 + 20;
2920 return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, __n,
2921 "%Lf", __val);
2922 }
2923
2924#ifdef _GLIBCXX_USE_WCHAR_T1
2925 inline int
2926 stoi(const wstring& __str, size_t* __idx = 0, int __base = 10)
2927 { return __gnu_cxx::__stoa<long, int>(&std::wcstol, "stoi", __str.c_str(),
2928 __idx, __base); }
2929
2930 inline long
2931 stol(const wstring& __str, size_t* __idx = 0, int __base = 10)
2932 { return __gnu_cxx::__stoa(&std::wcstol, "stol", __str.c_str(),
2933 __idx, __base); }
2934
2935 inline unsigned long
2936 stoul(const wstring& __str, size_t* __idx = 0, int __base = 10)
2937 { return __gnu_cxx::__stoa(&std::wcstoul, "stoul", __str.c_str(),
2938 __idx, __base); }
2939
2940 inline long long
2941 stoll(const wstring& __str, size_t* __idx = 0, int __base = 10)
2942 { return __gnu_cxx::__stoa(&std::wcstoll, "stoll", __str.c_str(),
2943 __idx, __base); }
2944
2945 inline unsigned long long
2946 stoull(const wstring& __str, size_t* __idx = 0, int __base = 10)
2947 { return __gnu_cxx::__stoa(&std::wcstoull, "stoull", __str.c_str(),
2948 __idx, __base); }
2949
2950 // NB: wcstof vs wcstod.
2951 inline float
2952 stof(const wstring& __str, size_t* __idx = 0)
2953 { return __gnu_cxx::__stoa(&std::wcstof, "stof", __str.c_str(), __idx); }
2954
2955 inline double
2956 stod(const wstring& __str, size_t* __idx = 0)
2957 { return __gnu_cxx::__stoa(&std::wcstod, "stod", __str.c_str(), __idx); }
2958
2959 inline long double
2960 stold(const wstring& __str, size_t* __idx = 0)
2961 { return __gnu_cxx::__stoa(&std::wcstold, "stold", __str.c_str(), __idx); }
2962
2963 // DR 1261.
2964 inline wstring
2965 to_wstring(int __val)
2966 { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, 4 * sizeof(int),
2967 L"%d", __val); }
2968
2969 inline wstring
2970 to_wstring(unsigned __val)
2971 { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf,
2972 4 * sizeof(unsigned),
2973 L"%u", __val); }
2974
2975 inline wstring
2976 to_wstring(long __val)
2977 { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, 4 * sizeof(long),
2978 L"%ld", __val); }
2979
2980 inline wstring
2981 to_wstring(unsigned long __val)
2982 { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf,
2983 4 * sizeof(unsigned long),
2984 L"%lu", __val); }
2985
2986 inline wstring
2987 to_wstring(long long __val)
2988 { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf,
2989 4 * sizeof(long long),
2990 L"%lld", __val); }
2991
2992 inline wstring
2993 to_wstring(unsigned long long __val)
2994 { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf,
2995 4 * sizeof(unsigned long long),
2996 L"%llu", __val); }
2997
2998 inline wstring
2999 to_wstring(float __val)
3000 {
3001 const int __n =
3002 __gnu_cxx::__numeric_traits<float>::__max_exponent10 + 20;
3003 return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, __n,
3004 L"%f", __val);
3005 }
3006
3007 inline wstring
3008 to_wstring(double __val)
3009 {
3010 const int __n =
3011 __gnu_cxx::__numeric_traits<double>::__max_exponent10 + 20;
3012 return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, __n,
3013 L"%f", __val);
3014 }
3015
3016 inline wstring
3017 to_wstring(long double __val)
3018 {
3019 const int __n =
3020 __gnu_cxx::__numeric_traits<long double>::__max_exponent10 + 20;
3021 return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, __n,
3022 L"%Lf", __val);
3023 }
3024#endif
3025
3026_GLIBCXX_END_NAMESPACE_VERSION
3027} // namespace
3028
3029#endif /* C++11 && _GLIBCXX_USE_C99 ... */
3030
3031#if __cplusplus201103L >= 201103L
3032
3033#include <bits/functional_hash.h>
3034
3035namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
3036{
3037_GLIBCXX_BEGIN_NAMESPACE_VERSION
3038
3039 // DR 1182.
3040
3041#ifndef _GLIBCXX_COMPATIBILITY_CXX0X
3042 /// std::hash specialization for string.
3043 template<>
3044 struct hash<string>
3045 : public __hash_base<size_t, string>
3046 {
3047 size_t
3048 operator()(const string& __s) const noexcept
3049 { return std::_Hash_impl::hash(__s.data(), __s.length()); }
3050 };
3051
3052 template<>
3053 struct __is_fast_hash<hash<string>> : std::false_type
3054 { };
3055
3056#ifdef _GLIBCXX_USE_WCHAR_T1
3057 /// std::hash specialization for wstring.
3058 template<>
3059 struct hash<wstring>
3060 : public __hash_base<size_t, wstring>
3061 {
3062 size_t
3063 operator()(const wstring& __s) const noexcept
3064 { return std::_Hash_impl::hash(__s.data(),
3065 __s.length() * sizeof(wchar_t)); }
3066 };
3067
3068 template<>
3069 struct __is_fast_hash<hash<wstring>> : std::false_type
3070 { };
3071#endif
3072#endif /* _GLIBCXX_COMPATIBILITY_CXX0X */
3073
3074#ifdef _GLIBCXX_USE_C99_STDINT_TR11
3075 /// std::hash specialization for u16string.
3076 template<>
3077 struct hash<u16string>
3078 : public __hash_base<size_t, u16string>
3079 {
3080 size_t
3081 operator()(const u16string& __s) const noexcept
3082 { return std::_Hash_impl::hash(__s.data(),
3083 __s.length() * sizeof(char16_t)); }
3084 };
3085
3086 template<>
3087 struct __is_fast_hash<hash<u16string>> : std::false_type
3088 { };
3089
3090 /// std::hash specialization for u32string.
3091 template<>
3092 struct hash<u32string>
3093 : public __hash_base<size_t, u32string>
3094 {
3095 size_t
3096 operator()(const u32string& __s) const noexcept
3097 { return std::_Hash_impl::hash(__s.data(),
3098 __s.length() * sizeof(char32_t)); }
3099 };
3100
3101 template<>
3102 struct __is_fast_hash<hash<u32string>> : std::false_type
3103 { };
3104#endif
3105
3106_GLIBCXX_END_NAMESPACE_VERSION
3107} // namespace
3108
3109#endif // C++11
3110
3111#endif /* _BASIC_STRING_H */