/w/halld-scifs17exp/halld2/home/sdobbs/Software/jana/jana_0.8.2/Linux_CentOS7.7-x86

Bug Summary

File:	alld2/home/sdobbs/Software/jana/jana_0.8.2/Linux_CentOS7.7-x86_64-gcc4.8.5/include/JANA/JEventLoop.h
Warning:	line 398, column 7 Null pointer passed to 2nd parameter expecting 'nonnull'

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple x86_64-unknown-linux-gnu -analyze -disable-free -main-file-name DKinFitUtils_GlueX.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/ANALYSIS -I libraries/ANALYSIS -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/ANALYSIS/DKinFitUtils_GlueX.cc

libraries/ANALYSIS/DKinFitUtils_GlueX.cc

→

1#include "DKinFitUtils_GlueX.h"

3/******************************************************************** INITIALIZE *******************************************************************/

5DKinFitUtils_GlueX::DKinFitUtils_GlueX(const DMagneticFieldMap* locMagneticFieldMap, const DAnalysisUtilities* locAnalysisUtilities) : 
6dMagneticFieldMap(locMagneticFieldMap), dAnalysisUtilities(locAnalysisUtilities)
7{
dIncludeBeamlineInVertexFitFlag = false;
dWillBeamHaveErrorsFlag = false; //Until fixed!

dApplication = dynamic_cast<DApplication*>(japp);
gPARMS->SetDefaultParameter("KINFIT:LINKVERTICES", dLinkVerticesFlag);
13}

15DKinFitUtils_GlueX::DKinFitUtils_GlueX(JEventLoop* locEventLoop)
16{
Set_RunDependent_Data(locEventLoop);
1
Calling 'DKinFitUtils_GlueX::Set_RunDependent_Data'→

gPARMS->SetDefaultParameter("KINFIT:LINKVERTICES", dLinkVerticesFlag);
dWillBeamHaveErrorsFlag = false; //Until fixed!
dIncludeBeamlineInVertexFitFlag = false;
22}

24void DKinFitUtils_GlueX::Set_RunDependent_Data(JEventLoop *locEventLoop)
25{
locEventLoop->GetSingle(dAnalysisUtilities);
2
←
Calling 'JEventLoop::GetSingle'→

dApplication = dynamic_cast<DApplication*>(locEventLoop->GetJApplication());
dMagneticFieldMap = dApplication->GetBfield(locEventLoop->GetJEvent().GetRunNumber());
30}


33/*********************************************************** OVERRIDE BASE CLASS FUNCTIONS *********************************************************/

35void DKinFitUtils_GlueX::Reset_NewEvent(void)
36{
dParticleMap_SourceToInput_Beam.clear();
dParticleMap_SourceToInput_DetectedParticle.clear();
dParticleMap_SourceToInput_Shower.clear();
dParticleMap_SourceToInput_Target.clear();
dParticleMap_SourceToInput_Decaying.clear();
dParticleMap_SourceToInput_Missing.clear();

dParticleMap_InputToSource_JObject.clear();
dParticleMap_InputToSource_Decaying.clear();

DKinFitUtils::Reset_NewEvent();
48}

50bool DKinFitUtils_GlueX::Get_IncludeBeamlineInVertexFitFlag(void) const
51{
return dIncludeBeamlineInVertexFitFlag; //at least until covariance matrix is set for beam photons
53}

55bool DKinFitUtils_GlueX::Get_IsBFieldNearBeamline(void) const
56{
if(dMagneticFieldMap == NULL__null)
return false;

return (dynamic_cast<const DMagneticFieldMapNoField*>(dMagneticFieldMap) == NULL__null);
61}

63TVector3 DKinFitUtils_GlueX::Get_BField(const TVector3& locPosition) const
64{
if(dMagneticFieldMap == NULL__null)
return TVector3(0.0, 0.0, 0.0);

double locBx, locBy, locBz;
dMagneticFieldMap->GetField(locPosition.X(), locPosition.Y(), locPosition.Z(), locBx, locBy, locBz);
return (TVector3(locBx, locBy, locBz));
71}

73/****************************************************************** MAKE PARTICLES *****************************************************************/

75shared_ptr<DKinFitParticle> DKinFitUtils_GlueX::Make_BeamParticle(const DBeamPhoton* locBeamPhoton)
76{
pair<const DBeamPhoton*, const DEventRFBunch*> locSourcePair(locBeamPhoton, NULL__null);
if(dParticleMap_SourceToInput_Beam.find(locSourcePair) != dParticleMap_SourceToInput_Beam.end())
return dParticleMap_SourceToInput_Beam[locSourcePair]; //not unique, return existing

TLorentzVector locSpacetimeVertex(Make_TVector3(locBeamPhoton->position()), locBeamPhoton->time());
TVector3 locMomentum = Make_TVector3(locBeamPhoton->momentum());
Particle_t locPID = locBeamPhoton->PID();

auto locKinFitParticle = DKinFitUtils::Make_BeamParticle(PDGtype(locPID), ParticleCharge(locPID), ParticleMass(locPID), locSpacetimeVertex, locMomentum, locBeamPhoton->errorMatrix());
dParticleMap_SourceToInput_Beam[locSourcePair] = locKinFitParticle;
dParticleMap_InputToSource_JObject[locKinFitParticle] = locBeamPhoton;
return locKinFitParticle;
89}

91shared_ptr<DKinFitParticle> DKinFitUtils_GlueX::Make_BeamParticle(const DBeamPhoton* locBeamPhoton, const DEventRFBunch* locEventRFBunch)
92{
pair<const DBeamPhoton*, const DEventRFBunch*> locSourcePair(locBeamPhoton, locEventRFBunch);
if(dParticleMap_SourceToInput_Beam.find(locSourcePair) != dParticleMap_SourceToInput_Beam.end())
return dParticleMap_SourceToInput_Beam[locSourcePair]; //not unique, return existing

//set rf time for beam particle
TLorentzVector locSpacetimeVertex(Make_TVector3(locBeamPhoton->position()), locEventRFBunch->dTime);
TVector3 locMomentum = Make_TVector3(locBeamPhoton->momentum());
Particle_t locPID = locBeamPhoton->PID();

//set rf time variance in covariance matrix
auto locCovarianceMatrix = Get_SymMatrixResource(7);
*locCovarianceMatrix = *(locBeamPhoton->errorMatrix());
(*locCovarianceMatrix)(6, 6) = locEventRFBunch->dTimeVariance;
//zero the correlation terms
for(int loc_i = 0; loc_i < 6; ++loc_i)
{
(*locCovarianceMatrix)(6, loc_i) = 0.0;
(*locCovarianceMatrix)(loc_i, 6) = 0.0;
}

auto locKinFitParticle = DKinFitUtils::Make_BeamParticle(PDGtype(locPID), ParticleCharge(locPID), ParticleMass(locPID), locSpacetimeVertex, locMomentum, locCovarianceMatrix);
dParticleMap_SourceToInput_Beam[locSourcePair] = locKinFitParticle;
dParticleMap_InputToSource_JObject[locKinFitParticle] = locBeamPhoton;
return locKinFitParticle;
117}

119shared_ptr<DKinFitParticle> DKinFitUtils_GlueX::Make_DetectedParticle(const DKinematicData* locKinematicData)
120{
if(dParticleMap_SourceToInput_DetectedParticle.find(locKinematicData) != dParticleMap_SourceToInput_DetectedParticle.end())
return dParticleMap_SourceToInput_DetectedParticle[locKinematicData]; //not unique, return existing

TLorentzVector locSpacetimeVertex(Make_TVector3(locKinematicData->position()), locKinematicData->time());
TVector3 locMomentum = Make_TVector3(locKinematicData->momentum());
Particle_t locPID = locKinematicData->PID();

double locPathLength = 0.0;
auto locChargedHypo = dynamic_cast<const DChargedTrackHypothesis*>(locKinematicData);
if(locChargedHypo != nullptr)
locPathLength = locChargedHypo->Get_PathLength();
else
{
auto locNeutralHypo = dynamic_cast<const DNeutralParticleHypothesis*>(locKinematicData);
if(locNeutralHypo != nullptr)
	locPathLength = locNeutralHypo->Get_PathLength();
}

auto locKinFitParticle = DKinFitUtils::Make_DetectedParticle(PDGtype(locPID), ParticleCharge(locPID), ParticleMass(locPID), locSpacetimeVertex, locMomentum, locPathLength, locKinematicData->errorMatrix());
dParticleMap_SourceToInput_DetectedParticle[locKinematicData] = locKinFitParticle;
dParticleMap_InputToSource_JObject[locKinFitParticle] = locKinematicData;
return locKinFitParticle;
143}

145shared_ptr<DKinFitParticle> DKinFitUtils_GlueX::Make_DetectedShower(const DNeutralShower* locNeutralShower, Particle_t locPID)
146{
pair<const DNeutralShower*, Particle_t> locSourcePair(locNeutralShower, locPID);
if(dParticleMap_SourceToInput_Shower.find(locSourcePair) != dParticleMap_SourceToInput_Shower.end())
return dParticleMap_SourceToInput_Shower[locSourcePair]; //not unique, return existing

//use DNeutralShower object (doesn't make assumption about vertex!)
TLorentzVector locShowerSpacetime = Make_TLorentzVector(locNeutralShower->dSpacetimeVertex);
auto locKinFitParticle = DKinFitUtils::Make_DetectedShower(PDGtype(locPID), ParticleMass(locPID), locShowerSpacetime, locNeutralShower->dEnergy, locNeutralShower->dCovarianceMatrix);

dParticleMap_SourceToInput_Shower[locSourcePair] = locKinFitParticle;
dParticleMap_InputToSource_JObject[locKinFitParticle] = locNeutralShower;
return locKinFitParticle;
158}

160shared_ptr<DKinFitParticle> DKinFitUtils_GlueX::Make_TargetParticle(Particle_t locPID, size_t locInstance)
161{
auto locTargetPair = std::make_pair(locPID, locInstance);
if(dParticleMap_SourceToInput_Target.find(locTargetPair) != dParticleMap_SourceToInput_Target.end())
return dParticleMap_SourceToInput_Target[locTargetPair]; //not unique, return existing

auto locKinFitParticle = DKinFitUtils::Make_TargetParticle(PDGtype(locPID), ParticleCharge(locPID), ParticleMass(locPID));
dParticleMap_SourceToInput_Target[locTargetPair] = locKinFitParticle;
return locKinFitParticle;
169}

171shared_ptr<DKinFitParticle> DKinFitUtils_GlueX::Make_MissingParticle(Particle_t locPID)
172{
if(dParticleMap_SourceToInput_Missing.find(locPID) != dParticleMap_SourceToInput_Missing.end())
return dParticleMap_SourceToInput_Missing[locPID]; //not unique, return existing

auto locKinFitParticle = DKinFitUtils::Make_MissingParticle(PDGtype(locPID), ParticleCharge(locPID), ParticleMass(locPID));
dParticleMap_SourceToInput_Missing[locPID] = locKinFitParticle;
return locKinFitParticle;
179}

181shared_ptr<DKinFitParticle> DKinFitUtils_GlueX::Make_DecayingParticle(Particle_t locPID, const set<shared_ptr<DKinFitParticle>>& locFromInitialState, const set<shared_ptr<DKinFitParticle>>& locFromFinalState)
182{
DDecayingParticleInfo locDecayingParticleInfo(locPID, locFromInitialState, locFromFinalState);
if(dParticleMap_SourceToInput_Decaying.find(locDecayingParticleInfo) != dParticleMap_SourceToInput_Decaying.end())
return dParticleMap_SourceToInput_Decaying[locDecayingParticleInfo]; //not unique, return existing

auto locKinFitParticle = DKinFitUtils::Make_DecayingParticle(PDGtype(locPID), ParticleCharge(locPID), ParticleMass(locPID), locFromInitialState, locFromFinalState);
dParticleMap_SourceToInput_Decaying[locDecayingParticleInfo] = locKinFitParticle;
dParticleMap_InputToSource_Decaying.emplace(locKinFitParticle, locDecayingParticleInfo);
return locKinFitParticle;
191}

193/**************************************************************** MAKE DKINFITCHAIN ****************************************************************/

195shared_ptr<const DKinFitChain> DKinFitUtils_GlueX::Make_KinFitChain(const DReactionVertexInfo* locReactionVertexInfo, const DReaction* locReaction, const DParticleCombo* locParticleCombo, DKinFitType locKinFitType)
196{
//locKinFitType input in case want to do a different fit
if(dDebugLevel > 10)
cout << "DKinFitUtils_GlueX: Create DKinFitChain." << endl;

auto locKinFitChain = dResourcePool_KinFitChain->Get_SharedResource();
locKinFitChain->Set_DefinedParticleStepIndex(-1); //unless changed below

//Make chain, excluding decaying particles
//They must be created using the detected particles, so just create those first
for(size_t loc_i = 0; loc_i < locParticleCombo->Get_NumParticleComboSteps(); ++loc_i)
{
//Create it
auto locKinFitChainStep = Make_KinFitChainStep(locReactionVertexInfo, locReaction, locParticleCombo, locKinFitType, loc_i, locKinFitChain);
locKinFitChain->Add_KinFitChainStep(locKinFitChainStep);
}

//Now define the decaying particles using the detected & beam particles

//start looping from the back, using invariant mass wherever possible
//not possible if missing decay product: will then compute via missing mass in the next step
//but first, figure out which steps we must use missing mass for (and thus must skip on this pass below)
set<size_t> locMissingMassSteps;
auto locDefinedParticleStepIndices = DAnalysis::Get_DefinedParticleStepIndex(locReaction);
for(int locCurrentStepIndex : locDefinedParticleStepIndices)
{
while(locCurrentStepIndex != -1)
{
	if((locCurrentStepIndex == 0) && locKinFitChain->Get_KinFitChainStep(0)->Get_InitialParticles().empty())
		break; //is an open-ended decaying particle in the initial state: is ok to define via invariant mass
	locMissingMassSteps.insert(locCurrentStepIndex);
	locCurrentStepIndex = locKinFitChain->Get_KinFitChainStep(locCurrentStepIndex)->Get_InitialParticleDecayFromStepIndex();
}
}

auto locIsVertexFit = (locKinFitType != d_P4Fit);

//now create decaying particles
//do the invariant mass loop
set<size_t> locProcessedSteps;
for(int loc_i = locParticleCombo->Get_NumParticleComboSteps() - 1; loc_i >= 0; --loc_i)
{
//get steps
auto locReactionStep = locReaction->Get_ReactionStep(loc_i);
auto locKinFitChainStep = std::const_pointer_cast<DKinFitChainStep>(locKinFitChain->Get_KinFitChainStep(loc_i));

//skip steps that must defined via missing mass
if(locMissingMassSteps.find(loc_i) != locMissingMassSteps.end())
	continue; //decay products contain a missing or open-ended-decaying particle

//check if initial particle already created for this step (i.e. beam)
if(locKinFitChainStep->Get_InitialParticle(0) != nullptr)
	continue; //only do decaying particles

//mark the progress
locProcessedSteps.insert(loc_i);

//don't create particle for omega, etc. (will confuse kinfitter)
auto locPID = locReactionStep->Get_InitialPID();
if(!IsFixedMass(locPID))
	continue;

if(locIsVertexFit)
{
	//decaying particle MUST be defined by how it is used for finding the vertex (i.e. as in locReactionVertexInfo)
	//e.g. if Xi0 -> pi0, Lambda, and Xi0 defined BY Lambda (instead of missing mass), then the Xi0 constraints on the Xi0 decay vertex would depend on the lambda constraints: matrix determinant = 0, uninvertable
	auto locStepVertexInfo = locReactionVertexInfo->Get_StepVertexInfo(loc_i);
	auto locDecayParticlePair = std::make_pair(loc_i, DReactionStep::Get_ParticleIndex_Initial());
	auto locDecayingFullConstrainParticles = locStepVertexInfo->Get_DecayingParticles_FullConstrain(true);
	if(locDecayingFullConstrainParticles.find(locDecayParticlePair) != locDecayingFullConstrainParticles.end())
		continue; //must define particle by missing mass instead to be consistent with vertex fit
}

//since going in reverse order, all decay products are ready: create the decaying particle
auto locDecaySourceParticles = Get_StepParticles_NonNull(locKinFitChain, locReaction, loc_i, DReactionStep::Get_ParticleIndex_Initial());
auto locDecayingParticle = Make_DecayingParticle(locPID, locDecaySourceParticles.first, locDecaySourceParticles.second);

//set decaying particle in the chain
locKinFitChainStep->Set_InitialParticle(locDecayingParticle, 0);
auto locFromIndices = DAnalysis::Get_InitialParticleDecayFromIndices(locReaction, loc_i);
if((locFromIndices.first < 0) || (locFromIndices.first == loc_i))
	continue; //intial-state open-ended decaying particle

auto locProductionStep = std::const_pointer_cast<DKinFitChainStep>(locKinFitChain->Get_KinFitChainStep(locFromIndices.first));
locProductionStep->Set_FinalParticle(locDecayingParticle, locFromIndices.second);
locKinFitChain->Set_DecayStepIndex(locDecayingParticle, loc_i);
}

//now loop from the front, using missing mass for the rest
for(size_t loc_i = 0; loc_i < locParticleCombo->Get_NumParticleComboSteps(); ++loc_i)
{
auto locParticleComboStep = locParticleCombo->Get_ParticleComboStep(loc_i);
if(locProcessedSteps.find(loc_i) != locProcessedSteps.end())
	continue;

auto locReactionStep = locReaction->Get_ReactionStep(loc_i);
auto locKinFitChainStep = std::const_pointer_cast<DKinFitChainStep>(locKinFitChain->Get_KinFitChainStep(loc_i));

//create decaying particle in final state: first figure out which one needs a particle
for(size_t loc_j = 0; loc_j < locParticleComboStep->Get_NumFinalParticles(); ++loc_j)
{
	//DecayStepIndex: >= 0 if decaying, where the # is the step representing the particle decay
	int locDecayStepIndex = DAnalysis::Get_DecayStepIndex(locReaction, loc_i, loc_j);
	if(locDecayStepIndex < 0)
		continue; //not decaying

	if(locKinFitChain->Get_KinFitChainStep(locDecayStepIndex)->Get_InitialParticle(0) != nullptr)
		continue; //decaying particle already created

	//don't create particle for omega, etc. (will confuse kinfitter)
	auto locPID = locReactionStep->Get_FinalPID(loc_j);
	if(!IsFixedMass(locPID))
		continue;

	//make decaying particle
	auto locDecaySourceParticles = Get_StepParticles_NonNull(locKinFitChain, locReaction, loc_i, loc_j);
	auto locDecayingParticle = Make_DecayingParticle(locPID, locDecaySourceParticles.first, locDecaySourceParticles.second);
	locKinFitChainStep->Set_FinalParticle(locDecayingParticle, loc_j);

	auto locDecayStep = std::const_pointer_cast<DKinFitChainStep>(locKinFitChain->Get_KinFitChainStep(locDecayStepIndex));
	locDecayStep->Set_InitialParticle(locDecayingParticle, 0);
	locKinFitChain->Set_DecayStepIndex(locDecayingParticle, locDecayStepIndex);
}
}

if(dDebugLevel > 10)
{
cout << "DKinFitUtils_GlueX: DKinFitChain Created. Printing:" << endl;
locKinFitChain->Print_InfoToScreen();
}

return locKinFitChain;
328}

330pair<set<shared_ptr<DKinFitParticle>>, set<shared_ptr<DKinFitParticle>>> DKinFitUtils_GlueX::Get_StepParticles_NonNull(const shared_ptr<const DKinFitChain>& locKinFitChain, const DReaction* locReaction, size_t locStepIndex, int locNonFixedMassParticleIndex) const
331{
//If one of the final particles is null (decaying non-fixed-mass particle), remove it, AND go to its decay step and get ALL particles (put in init or final state)
auto locKinFitStep = locKinFitChain->Get_KinFitChainStep(locStepIndex);

//Get Initial particles, erase nulls
auto locGrabbedInitialParticles = locKinFitStep->Get_InitialParticles();
set<shared_ptr<DKinFitParticle>> locInitialParticles(locGrabbedInitialParticles.begin(), locGrabbedInitialParticles.end());
locInitialParticles.erase(nullptr); //remove any null particles

//Get Final particles, erase nulls
auto locGrabbedFinalParticles = locKinFitStep->Get_FinalParticles();
set<shared_ptr<DKinFitParticle>> locFinalParticles(locGrabbedFinalParticles.begin(), locGrabbedFinalParticles.end());
locFinalParticles.erase(nullptr); //remove any null particles

//If nulls in initial state: go to the previous step
for(size_t loc_i = 0; loc_i < locGrabbedInitialParticles.size(); ++loc_i)
{
if((locGrabbedInitialParticles[loc_i] != nullptr) || (locNonFixedMassParticleIndex == DReactionStep::Get_ParticleIndex_Initial()))
	continue;

//null particles in initial state: go to the previous step
auto locParticlePair = DAnalysis::Get_InitialParticleDecayFromIndices(locReaction, locStepIndex);
auto locStepParticles = Get_StepParticles_NonNull(locKinFitChain, locReaction, locParticlePair.first, locParticlePair.second);
locInitialParticles.insert(locStepParticles.first.begin(), locStepParticles.first.end());
locFinalParticles.insert(locStepParticles.second.begin(), locStepParticles.second.end());
}

//If nulls in final state: go to the next step
for(size_t loc_i = 0; loc_i < locGrabbedFinalParticles.size(); ++loc_i)
{
if((locGrabbedFinalParticles[loc_i] != nullptr) || (locNonFixedMassParticleIndex == int(loc_i)))
	continue;

auto locDecayStepIndex = DAnalysis::Get_DecayStepIndex(locReaction, locStepIndex, loc_i);
auto locStepParticles = Get_StepParticles_NonNull(locKinFitChain, locReaction, locDecayStepIndex, DReactionStep::Get_ParticleIndex_Initial());
locInitialParticles.insert(locStepParticles.first.begin(), locStepParticles.first.end());
locFinalParticles.insert(locStepParticles.second.begin(), locStepParticles.second.end());
}

if(dDebugLevel >= 10)
{
cout << "DKinFitUtils_GlueX::Get_StepParticles_NonNull:" << endl;
cout << "reaction, step-index, non-fixed-mass particle index: " << locReaction->Get_ReactionName() << ", " << locStepIndex << ", " << locNonFixedMassParticleIndex << endl;
cout << "Chain: " << endl;
locKinFitChain->Print_InfoToScreen();
cout << "Init-particles:" << endl;
for(auto& locParticle : locInitialParticles)
	cout << locParticle->Get_PID() << ", " << locParticle << endl;
cout << "Final-particles:" << endl;
for(auto& locParticle : locFinalParticles)
	cout << locParticle->Get_PID() << ", " << locParticle << endl;
}
return std::make_pair(locInitialParticles, locFinalParticles);
384}

386shared_ptr<DKinFitChainStep> DKinFitUtils_GlueX::Make_KinFitChainStep(const DReactionVertexInfo* locReactionVertexInfo, const DReaction* locReaction, const DParticleCombo* locParticleCombo, DKinFitType locKinFitType, size_t locStepIndex, const shared_ptr<DKinFitChain>& locKinFitChain)
387{
//Start and register new step
auto locKinFitChainStep = dResourcePool_KinFitChainStep->Get_SharedResource();
locKinFitChainStep->Set_ConstrainDecayingMassFlag(false); //unless changed later

//get the steps
auto locParticleComboStep = locParticleCombo->Get_ParticleComboStep(locStepIndex);
auto locReactionStep = locReaction->Get_ReactionStep(locStepIndex);
auto locStepVertexInfo = locReactionVertexInfo->Get_StepVertexInfo(locStepIndex);
int locKinFitStepIndex = locKinFitChain->Get_NumKinFitChainSteps();

//if doing a vertex fit, see which neutral particles can be treated as showers
bool locSpactimeIsFitFlag = ((locKinFitType == d_SpacetimeFit) || (locKinFitType == d_P4AndSpacetimeFit));
bool locVertexIsFitFlag = (locSpactimeIsFitFlag || (locKinFitType == d_VertexFit) || (locKinFitType == d_P4AndVertexFit));

//initial beam particle
locKinFitChainStep->Set_InitialParticleDecayFromStepIndex(-1); //unless set otherwise below (enclosed decaying particle)
auto locBeamPhoton = dynamic_cast<const DBeamPhoton*>(locParticleComboStep->Get_InitialParticle_Measured());
if(locBeamPhoton != NULL__null)
locKinFitChainStep->Add_InitialParticle(Make_BeamParticle(locBeamPhoton));
else //decaying particle
{
locKinFitChainStep->Add_InitialParticle(nullptr); //will change later
if(locStepIndex == 0) //open-ended
	locKinFitChain->Set_DefinedParticleStepIndex(locKinFitStepIndex);
else //enclosed
{
	int locDecayFromStepIndex = DAnalysis::Get_InitialParticleDecayFromIndices(locReaction, locStepIndex).first;
	locKinFitChainStep->Set_InitialParticleDecayFromStepIndex(locDecayFromStepIndex);
	auto locPID = locReactionStep->Get_InitialPID();
	auto locConstrainMassFlag = IsFixedMass(locPID) ? locReactionStep->Get_KinFitConstrainInitMassFlag() : false;
	locKinFitChainStep->Set_ConstrainDecayingMassFlag(locConstrainMassFlag);
}
//will create decaying particle later
}

//target particle
Particle_t locTargetPID = locReactionStep->Get_TargetPID();
if(locTargetPID != Unknown)
{
size_t locTargetInstance = 0;
for(size_t loc_i = 0; loc_i < locStepIndex; ++loc_i)
{
	auto locPreviousStep = locKinFitChain->Get_KinFitChainStep(loc_i);
	auto locInitialParticles = locPreviousStep->Get_InitialParticles();
	for(auto& loKinFitParticle : locInitialParticles)
	{
		if(loKinFitParticle == nullptr)
			continue;
		if(loKinFitParticle->Get_KinFitParticleType() == d_TargetParticle)
			++locTargetInstance;
	}
}
locKinFitChainStep->Add_InitialParticle(Make_TargetParticle(locTargetPID, locTargetInstance));
}

//final state particles
for(size_t loc_j = 0; loc_j < locParticleComboStep->Get_NumFinalParticles(); ++loc_j)
{
int locDecayStepIndex = DAnalysis::Get_DecayStepIndex(locReaction, locStepIndex, loc_j);
auto locKinematicData = locParticleComboStep->Get_FinalParticle_Measured(loc_j);
Particle_t locPID = locReactionStep->Get_FinalPID(loc_j);

if(locReactionStep->Get_MissingParticleIndex() == int(loc_j)) //missing particle
{
	locKinFitChain->Set_DefinedParticleStepIndex(locKinFitStepIndex);
	locKinFitChainStep->Add_FinalParticle(Make_MissingParticle(locPID));
}
else if(locDecayStepIndex >= 0) //decaying particle
	locKinFitChainStep->Add_FinalParticle(nullptr); //skip for now, will create later (unless not fixed mass)
else if(ParticleCharge(locPID) == 0) //detected neutral
{
	auto locNeutralParticleHypothesis = static_cast<const DNeutralParticleHypothesis*>(locKinematicData);

	//Determine whether we should use the particle or the shower object
	bool locNeutralShowerFlag = locVertexIsFitFlag && locStepVertexInfo->Get_FittableVertexFlag();
	if((ParticleMass(locPID) > 0.0) && !locSpactimeIsFitFlag)
		locNeutralShowerFlag = false; //massive shower momentum is defined by t, which isn't fit: use particle

	if(!locNeutralShowerFlag)
		locKinFitChainStep->Add_FinalParticle(Make_DetectedParticle(locNeutralParticleHypothesis));
	else //in a vertex constraint: make shower
	{
		auto locNeutralShower = locNeutralParticleHypothesis->Get_NeutralShower();
		locKinFitChainStep->Add_FinalParticle(Make_DetectedShower(locNeutralShower, locNeutralParticleHypothesis->PID()));
	}
}
else //detected charged track
{
	auto locChargedTrackHypothesis = static_cast<const DChargedTrackHypothesis*>(locKinematicData);
	locKinFitChainStep->Add_FinalParticle(Make_DetectedParticle(locChargedTrackHypothesis));
}
}

//Inclusive?
if(locReactionStep->Get_MissingParticleIndex() == DReactionStep::Get_ParticleIndex_Inclusive())
locKinFitChain->Set_IsInclusiveChannelFlag(true);

return locKinFitChainStep;
486}

488/**************************************************************** MAKE CONSTRAINTS *****************************************************************/

490set<shared_ptr<DKinFitConstraint>> DKinFitUtils_GlueX::Create_Constraints(const DReactionVertexInfo* locReactionVertexInfo, const DReaction* locReaction, const DParticleCombo* locParticleCombo, const shared_ptr<const DKinFitChain>& locKinFitChain, DKinFitType locKinFitType, vector<shared_ptr<DKinFitConstraint_Vertex>>& locSortedVertexConstraints)
491{
if(dDebugLevel > 10)
cout << "DKinFitUtils_GlueX: Create constraints." << endl;

//All constraints
set<shared_ptr<DKinFitConstraint>> locAllConstraints;

//Create Mass Constraints
set<shared_ptr<DKinFitConstraint_Mass>> locMassConstraints;
map<shared_ptr<DKinFitParticle>, shared_ptr<DKinFitConstraint_Mass>> locParticleMassConstraintMap;
map<shared_ptr<DKinFitParticle>, size_t> locParticleDecayStepMap; //key is decaying particle, value is step index
map<size_t, shared_ptr<DKinFitConstraint_Mass>> locStepMassConstraintMap;
int locP4StepIndex = 0; //will use to define p4 constraint step, if requested
if((locKinFitType == d_P4Fit) || (locKinFitType == d_P4AndVertexFit) || (locKinFitType == d_P4AndSpacetimeFit))
{
//loop over steps, but skip init step (if open-ended decaying, do p4 constraint instead)
for(size_t loc_i = 1; loc_i < locKinFitChain->Get_NumKinFitChainSteps(); ++loc_i)
{
	auto locKinFitChainStep = locKinFitChain->Get_KinFitChainStep(loc_i);
	if(!locKinFitChainStep->Get_ConstrainDecayingMassFlag())
		continue; //don't apply mass constraint to this step

	for(auto locKinFitParticle : locKinFitChainStep->Get_InitialParticles())
	{
		if(locKinFitParticle == nullptr)
			continue;
		if(locKinFitParticle->Get_KinFitParticleType() != d_DecayingParticle)
			continue; //not a decaying particle

		//if this decay is defined by missing mass, the p4-constrain step CANNOT precede this decay: over-constrained system
		if(!Get_IsDecayingParticleDefinedByProducts(locKinFitParticle.get()))
			locP4StepIndex = loc_i; //this can (and must!) be overwritten by further steps if needed (if decay chain continually defined this way)

		auto locMassConstraint = Make_MassConstraint(locKinFitParticle);
		locMassConstraints.insert(locMassConstraint);
		locParticleMassConstraintMap[locKinFitParticle] = locMassConstraint;
		locParticleDecayStepMap[locKinFitParticle] = loc_i;
		locStepMassConstraintMap[loc_i] = locMassConstraint;
	}
}
}

//Create P4 Constraint
//don't do if inclusive reaction, or more than one missing particle
//pick the step containing the defined (missing or open-ended-decaying) particle
//if no defined particle, use the first step
shared_ptr<DKinFitConstraint_P4> locP4Constraint = nullptr;
auto locDefinedParticleStepIndices = DAnalysis::Get_DefinedParticleStepIndex(locReaction);
if(!locKinFitChain->Get_IsInclusiveChannelFlag() && (locDefinedParticleStepIndices.size() <= 1) && ((locKinFitType == d_P4Fit) || (locKinFitType == d_P4AndVertexFit) || (locKinFitType == d_P4AndSpacetimeFit)))
{
if(!locDefinedParticleStepIndices.empty()) //there is a missing or open-ended decaying particle
	locP4StepIndex = locDefinedParticleStepIndices.front(); //use it as the p4 constraint step instead
auto locStepParticles = Get_StepParticles_NonNull(locKinFitChain, locReaction, locP4StepIndex);
locP4Constraint = Make_P4Constraint(locStepParticles.first, locStepParticles.second);

//OK, now, check to see if the system is overly constrained: 
	//there must be at least one particle with non-zero errors in the p4 constraint that is NOT in ANY mass constraint
bool locNonZeroErrorFlag = false;
auto locAllParticles = locP4Constraint->Get_AllParticles();
set<size_t> locP4ConstrainedParticleSteps;
for(auto& locKinFitParticle : locAllParticles)
{
	DKinFitParticleType locKinFitParticleType = locKinFitParticle->Get_KinFitParticleType();

	//check if decaying particle mass is not constrained
	if(locKinFitParticleType == d_DecayingParticle)
	{
		if(locParticleMassConstraintMap.find(locKinFitParticle) == locParticleMassConstraintMap.end())
		{
			locNonZeroErrorFlag = true; //not constrained: we are OK
			break;
		}
		locP4ConstrainedParticleSteps.insert(locParticleDecayStepMap[locKinFitParticle]);
		continue;
	}

	if(locKinFitParticle->Get_CovarianceMatrix() == NULL__null)
		continue;
	if((locKinFitParticleType == d_BeamParticle) && !dWillBeamHaveErrorsFlag)
		continue;

	locNonZeroErrorFlag = true; //this particle has non-zero errors: we are OK
	break;
}

if(!locNonZeroErrorFlag)
{
	//system is over-constrained: we must delete a constraint
	//prefer to delete a mass constraint: it is only 1 degree of freedom, whereas p4 constraint can be 4

	//remove a mass constraint: delete the one in the earliest step (so consistent)
	size_t locEarliestStepIndex = *locP4ConstrainedParticleSteps.begin();
	locMassConstraints.erase(locStepMassConstraintMap[locEarliestStepIndex]); //remove constraint
}

//set init p3 guess
if(locP4Constraint->Get_DefinedParticle() != NULL__null)
{
	DLorentzVector locDefinedP4;
	if(locP4Constraint->Get_IsDefinedParticleInFinalState())
		locDefinedP4 = dAnalysisUtilities->Calc_MissingP4(locReaction, locParticleCombo, false);
	else
		locDefinedP4 = dAnalysisUtilities->Calc_FinalStateP4(locReaction, locParticleCombo, 0, false);
	TVector3 locInitP3Guess(locDefinedP4.Px(), locDefinedP4.Py(), locDefinedP4.Pz());
	locP4Constraint->Set_InitP3Guess(locInitP3Guess);
}
else
	locP4Constraint->Set_InitP3Guess(TVector3(0.0, 0.0, 0.0));
}

//Set P4 & Mass constraints
if(locP4Constraint != NULL__null)
locAllConstraints.insert(locP4Constraint);
locAllConstraints.insert(locMassConstraints.begin(), locMassConstraints.end());

//Create Vertex Constraints
//VERTEX OR SPACETIME: Group particles by detached vertex (one deque for each constraint/vertex)
locSortedVertexConstraints.clear();
if((locKinFitType == d_VertexFit) || (locKinFitType == d_SpacetimeFit) || (locKinFitType == d_P4AndVertexFit) || (locKinFitType == d_P4AndSpacetimeFit))
{
bool locSpacetimeFitFlag = ((locKinFitType == d_SpacetimeFit) || (locKinFitType == d_P4AndSpacetimeFit));
for(auto& locStepVertexInfo : locReactionVertexInfo->Get_StepVertexInfos())
{
	if(!locStepVertexInfo->Get_FittableVertexFlag())
		continue;
	auto locDX4 = locParticleCombo->Get_ParticleComboStep(locStepVertexInfo->Get_StepIndices().front())->Get_SpacetimeVertex();
	TLorentzVector locX4(locDX4.X(), locDX4.Y(), locDX4.Z(), locDX4.T());

	auto locFullConstrainParticles = Build_ParticleSet(locStepVertexInfo->Get_FullConstrainParticles(true), locKinFitChain);
	auto locNoConstrainParticles = Build_ParticleSet(locStepVertexInfo->Get_NoConstrainParticles(true), locKinFitChain);
	auto locOnlyConstrainTimeParticles = Build_ParticleSet(locStepVertexInfo->Get_OnlyConstrainTimeParticles(), locKinFitChain);
	if(locSpacetimeFitFlag)
		locSortedVertexConstraints.push_back(Make_SpacetimeConstraint(locFullConstrainParticles, locOnlyConstrainTimeParticles, locNoConstrainParticles, locX4));
	else
	{
		locNoConstrainParticles.insert(locOnlyConstrainTimeParticles.begin(), locOnlyConstrainTimeParticles.end());
		locSortedVertexConstraints.push_back(Make_VertexConstraint(locFullConstrainParticles, locNoConstrainParticles, locX4.Vect()));
	}
}
}
locAllConstraints.insert(locSortedVertexConstraints.begin(), locSortedVertexConstraints.end());

if(dDebugLevel > 10)
cout << "DKinFitUtils_GlueX: All Constraints Created." << endl;

return locAllConstraints;
637}

639set<shared_ptr<DKinFitParticle>> DKinFitUtils_GlueX::Build_ParticleSet(const vector<pair<int, int>>& locParticleIndices, const shared_ptr<const DKinFitChain>& locKinFitChain)
640{
set<shared_ptr<DKinFitParticle>> locParticles;
for(auto& locParticlePair : locParticleIndices)
{
auto locStep = locKinFitChain->Get_KinFitChainStep(locParticlePair.first);
if(locParticlePair.second >= 0)
{
	if(locStep->Get_FinalParticle(locParticlePair.second) != nullptr)
		locParticles.insert(locStep->Get_FinalParticle(locParticlePair.second));
}
else if(locParticlePair.second == DReactionStep::Get_ParticleIndex_Initial())
{
	if(locStep->Get_InitialParticle(0) != nullptr)
		locParticles.insert(locStep->Get_InitialParticle(0));
}
else
	locParticles.insert(locStep->Get_InitialParticle(1));
}
return locParticles;
659}

661/************************************************************** CONSTRAINT PREDICTORS **************************************************************/

663string DKinFitUtils_GlueX::Get_ConstraintInfo(const DReactionVertexInfo* locReactionVertexInfo, const DReaction* locReaction, size_t& locNumConstraints, size_t& locNumUnknowns) const
664{
//returns constraint string, sets # constraints & unknowns
//ASSUMES: Detected particles have non-zero errors!
string locAllConstraintsString;
locNumConstraints = 0;
locNumUnknowns = 0;

//P4 & Mass Constraints
DKinFitType locKinFitType = locReaction->Get_KinFitType();
auto locIsVertexFit = ((locKinFitType != d_NoFit) && (locKinFitType != d_P4Fit));
if((locKinFitType == d_P4Fit) || (locKinFitType == d_P4AndVertexFit) || (locKinFitType == d_P4AndSpacetimeFit))
{
//Mass Constraints
//loop over steps, but skip init step (if open-ended decaying, do p4 constraint instead)
map<size_t, string> locMassConstraintStrings;
int locP4StepIndex = 0; //may be changed below
for(size_t loc_i = 1; loc_i < locReaction->Get_NumReactionSteps(); ++loc_i)
{
	const DReactionStep* locReactionStep = locReaction->Get_ReactionStep(loc_i);
	if(!locReactionStep->Get_KinFitConstrainInitMassFlag())
		continue; //don't apply mass constraint to this step

	Particle_t locPID = locReactionStep->Get_InitialPID();
	if(!IsFixedMass(locPID))
		continue; //don't apply mass constraint to this step

	if(locIsVertexFit)
	{
		//decaying particle MUST be defined by how it is used for finding the vertex (i.e. as in locReactionVertexInfo)
		//e.g. if Xi0 -> pi0, Lambda, and Xi0 defined BY Lambda (instead of missing mass), then the Xi0 constraints on the Xi0 decay vertex would depend on the lambda constraints: matrix determinant = 0, uninvertable
		auto locStepVertexInfo = locReactionVertexInfo->Get_StepVertexInfo(loc_i);
		auto locDecayParticlePair = std::make_pair(loc_i, DReactionStep::Get_ParticleIndex_Initial());
		auto locDecayingFullConstrainParticles = locStepVertexInfo->Get_DecayingParticles_FullConstrain(true);

		//if following is true: must define particle by missing mass instead to be consistent with vertex fit
		//if true: because this decay is defined by missing mass, the p4-constrain step CANNOT precede this decay: over-constrained system
		if(locDecayingFullConstrainParticles.find(locDecayParticlePair) != locDecayingFullConstrainParticles.end())
			locP4StepIndex = loc_i; //this can (and must!) be overwritten by further steps if needed (if decay chain continually defined this way)
	}

	locMassConstraintStrings[loc_i] = string("#it{m}_{") + string(ParticleName_ROOT(locPID)) + string("}");
}

//P4 Constraint //don't do if inclusive reaction, or more than 1 missing particle
auto locDefinedParticleStepIndices = DAnalysis::Get_DefinedParticleStepIndex(locReaction);
if(!locReaction->Get_IsInclusiveFlag() && (locDefinedParticleStepIndices.size() <= 1))
{
	if(!locDefinedParticleStepIndices.empty())
		locP4StepIndex = locDefinedParticleStepIndices.front();
	//OK, now, check to see if the system is overly constrained: 
		//there must be at least one particle with non-zero errors in the p4 constraint that is NOT in a mass constraint
	bool locNonZeroErrorFlag = false;

	//Find step used for p4 constraint: the one with missing/open-ended-decaying particle (if any: else first step)
	const DReactionStep* locReactionStep = locReaction->Get_ReactionStep(locP4StepIndex);

	set<size_t> locP4ConstrainedParticleSteps;

	//check if initial & final states if have non-zero cov errors:
	if((locP4StepIndex == 0) && (locReactionStep->Get_TargetPID() != Unknown) && dWillBeamHaveErrorsFlag)
		locNonZeroErrorFlag = true; //beam: we're good
	else if((locP4StepIndex != 0) && (locMassConstraintStrings.find(locP4StepIndex) == locMassConstraintStrings.end()))
		locNonZeroErrorFlag = true; //decaying particle, but mass not constrained: we're good (unless it's e.g. an omega. ugh.)
	else //check final state
	{
		//check if final state has non-zero cov errors (detected):
		for(size_t loc_i = 0; loc_i < locReactionStep->Get_NumFinalPIDs(); ++loc_i)
		{
			if(locReactionStep->Get_MissingParticleIndex() == int(loc_i))
				continue; //missing

			int locDecayStepIndex = DAnalysis::Get_DecayStepIndex(locReaction, locP4StepIndex, loc_i);
			if(locDecayStepIndex > 0) //decaying
			{
				if(locMassConstraintStrings.find(locDecayStepIndex) != locMassConstraintStrings.end())
				{
					locP4ConstrainedParticleSteps.insert(locDecayStepIndex);
					continue; //mass constrained
				}
			}

			locNonZeroErrorFlag = true;
			break; //either detected particle, or unconstrained decaying particle: we're good (unless it's e.g. an omega. ugh.)
		}
	}

	if(!locNonZeroErrorFlag)
	{
		//system is over-constrained: we must delete a constraint
		//prefer to delete a mass constraint: it is only 1 degree of freedom, whereas p4 constraint can be 4

		//if initial particle is constrained, remove the constraint on that one
		if((locP4StepIndex != 0) && (locMassConstraintStrings.find(locP4StepIndex) != locMassConstraintStrings.end()))
			locMassConstraintStrings.erase(locP4StepIndex); //remove constraint
		else //else delete the one in the earliest step (so consistent)
		{
			size_t locEarliestStepIndex = *locP4ConstrainedParticleSteps.begin();
			locMassConstraintStrings.erase(locEarliestStepIndex); //remove constraint
		}
	}

	//Finally, add p4 constraint
	locAllConstraintsString = "#it{p}^{4}";
	locNumConstraints += 4;
	if(!locDefinedParticleStepIndices.empty())
		locNumUnknowns += 3;
}

//Finally, add remaining mass constraints
locNumConstraints += locMassConstraintStrings.size();
map<size_t, string>::iterator locStringIterator = locMassConstraintStrings.begin();
for(; locStringIterator != locMassConstraintStrings.end(); ++locStringIterator)
{
	if(locAllConstraintsString != "")
		locAllConstraintsString += ", ";
	locAllConstraintsString += locStringIterator->second;
}
}

//Create Vertex Constraints
//VERTEX OR SPACETIME: Group particles by detached vertex (one deque for each constraint/vertex)
if((locKinFitType == d_VertexFit) || (locKinFitType == d_SpacetimeFit) || (locKinFitType == d_P4AndVertexFit) || (locKinFitType == d_P4AndSpacetimeFit))
{
bool locSpacetimeFitFlag = ((locKinFitType == d_SpacetimeFit) || (locKinFitType == d_P4AndSpacetimeFit));
auto locConstraintTuple = Predict_VertexConstraints(locReactionVertexInfo, locSpacetimeFitFlag);
if(std::get<0>(locConstraintTuple) > 0)
{
	locNumConstraints += std::get<0>(locConstraintTuple);
	locNumUnknowns += std::get<1>(locConstraintTuple);
	if(locAllConstraintsString != "")
		locAllConstraintsString += ", ";
	locAllConstraintsString += std::get<2>(locConstraintTuple);
}
}

return locAllConstraintsString;
800}

802tuple<size_t, size_t, string> DKinFitUtils_GlueX::Predict_VertexConstraints(const DReactionVertexInfo* locReactionVertexInfo, bool locSpacetimeFitFlag) const
803{
//returned: #constraints, constraint string
size_t locNumConstraints = 0, locNumUnknowns = 0;
string locAllConstraintString;
auto locStepVertexInfos = locReactionVertexInfo->Get_StepVertexInfos();
for(auto& locVertexInfo : locStepVertexInfos)
{
if(!locVertexInfo->Get_FittableVertexFlag())
	continue;

auto locFullConstrainParticles = locVertexInfo->Get_FullConstrainParticles(true);
if(locSpacetimeFitFlag)
{
	locNumConstraints += 3*locFullConstrainParticles.size();
	locNumConstraints += locVertexInfo->Get_OnlyConstrainTimeParticles().size();
	locNumUnknowns += 4;
}
else //vertex only
{
	locNumConstraints += 2*locFullConstrainParticles.size();
	locNumUnknowns += 3;
}

//add to the full constraint string
if(locAllConstraintString != "")
	locAllConstraintString += ", ";
locAllConstraintString += Build_VertexConstraintString(locVertexInfo, locSpacetimeFitFlag);
}

return std::make_tuple(locNumConstraints, locNumUnknowns, locAllConstraintString);
833}

835string DKinFitUtils_GlueX::Build_VertexConstraintString(const DReactionStepVertexInfo* locVertexInfo, bool locSpacetimeFitFlag) const
836{
auto locReaction = locVertexInfo->Get_Reaction();
string locConstraintString = locSpacetimeFitFlag ? "#it{x}^{4}_{" : "#it{x}^{3}_{";

//if a decaying particle decays in-place at this vertex, we don't want to put it into the string
//this will happen if: the vertex-info represents more than one step
//they will be present in the info as non-constrain particles in the final-state
auto locStepIndices = locVertexInfo->Get_StepIndices(); //steps are listed in order
set<pair<int, int>> locExcludeDecayParticleIndices; //these are final-state indices
for(size_t loc_i = 1; loc_i < locStepIndices.size(); ++loc_i)
locExcludeDecayParticleIndices.insert(DAnalysis::Get_InitialParticleDecayFromIndices(locReaction, locStepIndices[loc_i]));

//initial state
auto locParticles = locVertexInfo->Get_Particles(d_InitialState);
auto locFullConstrainParticles = locVertexInfo->Get_FullConstrainParticles(true, d_InitialState);
for(auto locIndices : locParticles)
{
auto locStep = locReaction->Get_ReactionStep(locIndices.first);
Particle_t locPID = locStep->Get_PID(locIndices.second);
string locParticleString = ParticleName_ROOT(locPID);
if(locIndices.second == locStep->Get_MissingParticleIndex())
	locConstraintString += string("(") + locParticleString + string(")"); //missing
else if(std::binary_search(locFullConstrainParticles.begin(), locFullConstrainParticles.end(), locIndices)) //constraining
	locConstraintString += string("#color[4]{") + locParticleString + string("}"); //blue
else //no-constrain
	locConstraintString += locParticleString; //plain
}

//final state
locConstraintString += "#rightarrow";
locParticles = locVertexInfo->Get_Particles(d_FinalState);
locFullConstrainParticles = locVertexInfo->Get_FullConstrainParticles(true, d_FinalState);
auto locOnlyConstrainTimeParticles = locVertexInfo->Get_OnlyConstrainTimeParticles();
for(auto locIndices : locParticles)
{
if(locExcludeDecayParticleIndices.find(locIndices) != locExcludeDecayParticleIndices.end())
	continue; //exclude no-constrain decaying particle

auto locStep = locReaction->Get_ReactionStep(locIndices.first);
Particle_t locPID = locStep->Get_PID(locIndices.second);
string locParticleString = ParticleName_ROOT(locPID);

if(locIndices.second == locStep->Get_MissingParticleIndex())
	locConstraintString += string("(") + locParticleString + string(")"); //missing
else if(std::binary_search(locFullConstrainParticles.begin(), locFullConstrainParticles.end(), locIndices)) //constraining
	locConstraintString += string("#color[4]{") + locParticleString + string("}"); //blue
else if(locSpacetimeFitFlag && std::binary_search(locOnlyConstrainTimeParticles.begin(), locOnlyConstrainTimeParticles.end(), locIndices)) //time-only
	locConstraintString += string("#color[3]{") + locParticleString + string("}"); //green
else //no-constrain
	locConstraintString += locParticleString; //plain
}

locConstraintString += string("}"); //end of constraint

return locConstraintString;
891}

893/*************************************************************** CALCULATION ROUTINES **************************************************************/

895bool DKinFitUtils_GlueX::Propagate_TrackInfoToCommonVertex(DKinematicData* locKinematicData, DKinFitParticle* locKinFitParticle, const TMatrixDSym* locVXi)
896{
//locKinematicData must be generated from locKinFitParticle
//this function should only be used on decaying particles involved in two vertex fits:
	//propagates the track information from the vertex at which it is DEFINED to the OTHER vertex (e.g. production -> decay)

TVector3 locMomentum;
TLorentzVector locSpacetimeVertex;
pair<double, double> locPathLengthPair, locRestFrameLifetimePair;
TMatrixFSym locTempCovarianceMatrix(11);
if(!DKinFitUtils::Propagate_TrackInfoToCommonVertex(locKinFitParticle, locVXi, locMomentum, locSpacetimeVertex, locPathLengthPair, locRestFrameLifetimePair, &locTempCovarianceMatrix))
return false;

//Convert 10x10 to 7x7
auto locCovarianceMatrix = Get_SymMatrixResource(7);
*locCovarianceMatrix = locTempCovarianceMatrix.GetSub(0, 6, *locCovarianceMatrix);

locKinematicData->setMomentum(DVector3(locMomentum.X(),locMomentum.Y(),locMomentum.Z()));
locKinematicData->setPosition(DVector3(locSpacetimeVertex.Vect().X(),locSpacetimeVertex.Vect().Y(),locSpacetimeVertex.Vect().Z()));
locKinematicData->setTime(locSpacetimeVertex.T());
locKinematicData->setErrorMatrix(locCovarianceMatrix);
return true;
917}


←

/w/halld-scifs17exp/halld2/home/sdobbs/Software/jana/jana_0.8.2/Linux_CentOS7.7-x86_64-gcc4.8.5/include/JANA/JEventLoop.h

→

1// $Id: JEventLoop.h 1763 2006-05-10 14:29:25Z davidl $
2//
3//    File: JEventLoop.h
4// Created: Wed Jun  8 12:30:51 EDT 2005
5// Creator: davidl (on Darwin wire129.jlab.org 7.8.0 powerpc)
6//
7 
8#ifndef _JEventLoop_
9#define _JEventLoop_
10 
11#include <sys/time.h>
12 
13#include <vector>
14#include <list>
15#include <string>
16#include <utility>
17#include <typeinfo>
18#include <string.h>
19#include <map>
20#include <utility>
21using std::vector;
22using std::list;
23using std::string;
24using std::type_info;
25 
26#include <JANA/jerror.h>
27#include <JANA/JObject.h>
28#include <JANA/JException.h>
29#include <JANA/JEvent.h>
30#include <JANA/JThread.h>
31#include <JANA/JFactory_base.h>
32#include <JANA/JCalibration.h>
33#include <JANA/JGeometry.h>
34#include <JANA/JResourceManager.h>
35#include <JANA/JStreamLog.h>
36 
37// The following is here just so we can use ROOT's THtml class to generate documentation.
38#include "cint.h"
39 
40 
41// Place everything in JANA namespace
42namespace jana{
43 
44 
45template<class T> class JFactory;
46class JApplication;
47class JEventProcessor;
48 
49 
50class JEventLoop{
51	public:
52	
53		friend class JApplication;
54	
55		enum data_source_t{
56			DATA_NOT_AVAILABLE = 1,
57			DATA_FROM_CACHE,
58			DATA_FROM_SOURCE,
59			DATA_FROM_FACTORY
60		};
61		
62		typedef struct{
63			string caller_name;
64			string caller_tag;
65			string callee_name;
66			string callee_tag;
67			double start_time;
68			double end_time;
69			data_source_t data_source;
70		}call_stack_t;
71		
72		typedef struct{
73			const char* factory_name;
74			string tag;
75			const char* filename;
76			int line;
77		}error_call_stack_t;
78 
79	                                   JEventLoop(JApplication *app); ///< Constructor
80							   virtual ~JEventLoop(); ////< Destructor
81				   virtual const char* className(void){return static_className();}
82					static const char* static_className(void){return "JEventLoop";}
83		
84						 JApplication* GetJApplication(void) const {return app;} ///< Get pointer to the JApplication object
85                                  void RefreshProcessorListFromJApplication(void); ///< Re-copy the list of JEventProcessors from JApplication
86                      virtual jerror_t AddFactory(JFactory_base* factory); ///< Add a factory
87							  jerror_t RemoveFactory(JFactory_base* factory); ///< Remove a factory
88                        JFactory_base* GetFactory(const string data_name, const char *tag="", bool allow_deftag=true); ///< Get a specific factory pointer
89                vector<JFactory_base*> GetFactories(void) const {return factories;} ///< Get all factory pointers
90                                  void GetFactoryNames(vector<string> &factorynames); ///< Get names of all factories in name:tag format
91                                  void GetFactoryNames(map<string,string> &factorynames); ///< Get names of all factories in map with key=name, value=tag
92                    map<string,string> GetDefaultTags(void) const {return default_tags;}
93                              jerror_t ClearFactories(void); ///< Reset all factories in preparation for next event.
94							  jerror_t PrintFactories(int sparsify=0); ///< Print a list of all factories.
95                              jerror_t Print(const string data_name, const char *tag=""); ///< Print the data of the given type
96 
97						 JCalibration* GetJCalibration();
98                template<class T> bool GetCalib(string namepath, map<string,T> &vals);
99                template<class T> bool GetCalib(string namepath, vector<T> &vals);
100                template<class T> bool GetCalib(string namepath, T &val);
101 
102                            JGeometry* GetJGeometry();
103                template<class T> bool GetGeom(string namepath, map<string,T> &vals);
104			    template<class T> bool GetGeom(string namepath, T &val);
105 
106                     JResourceManager* GetJResourceManager(void);
107                                string GetResource(string namepath);
108                template<class T> bool GetResource(string namepath, T vals, int event_number=0);
109 
110                                  void Initialize(void); ///< Do initializations just before event processing starts
111                              jerror_t Loop(void); ///< Loop over events
112                              jerror_t OneEvent(uint64_t event_number); ///< Process a specific single event (if source supports it)
113                              jerror_t OneEvent(void); ///< Process a single event
114                           inline void Pause(void){pause = 1;} ///< Pause event processing
115                           inline void Resume(void){pause = 0;} ///< Resume event processing
116                           inline void Quit(void){quit = 1;} ///< Clean up and exit the event loop
117                           inline bool GetQuit(void) const {return quit;}
118                                  void QuitProgram(void);
119 
120		                               // Support for random access of events
121		                          bool HasRandomAccess(void);
122		                          void AddToEventQueue(uint64_t event_number){ next_events_to_process.push_back(event_number); }
123		                          void AddToEventQueue(list<uint64_t> &event_numbers) { next_events_to_process.insert(next_events_to_process.end(), event_numbers.begin(), event_numbers.end()); }
124		                list<uint64_t> GetEventQueue(void){ return next_events_to_process; }
125		                          void ClearEventQueue(void){ next_events_to_process.clear(); }
126 
127        template<class T> JFactory<T>* GetSingle(const T* &t, const char *tag="", bool exception_if_not_one=true); ///< Get pointer to first data object from (source or factory).
128        template<class T> JFactory<T>* Get(vector<const T*> &t, const char *tag="", bool allow_deftag=true); ///< Get data object pointers from (source or factory)
129        template<class T> JFactory<T>* GetFromFactory(vector<const T*> &t, const char *tag="", data_source_t &data_source=null_data_source, bool allow_deftag=true); ///< Get data object pointers from factory
130            template<class T> jerror_t GetFromSource(vector<const T*> &t, JFactory_base *factory=NULL__null); ///< Get data object pointers from source.
131                        inline JEvent& GetJEvent(void){return event;} ///< Get pointer to the current JEvent object.
132                           inline void SetJEvent(JEvent *event){this->event = *event;} ///< Set the JEvent pointer.
133                           inline void SetAutoFree(int auto_free){this->auto_free = auto_free;} ///< Set the Auto-Free flag on/off
134                      inline pthread_t GetPThreadID(void) const {return pthread_id;} ///< Get the pthread of the thread to which this JEventLoop belongs
135                                double GetInstantaneousRate(void) const {return rate_instantaneous;} ///< Get the current event processing rate
136                                double GetIntegratedRate(void) const {return rate_integrated;} ///< Get the current event processing rate
137                                double GetLastEventProcessingTime(void) const {return delta_time_single;}
138                          unsigned int GetNevents(void) const {return Nevents;}
139 
140                           inline bool CheckEventBoundary(uint64_t event_numberA, uint64_t event_numberB);
141 
142                           inline bool GetCallStackRecordingStatus(void){ return record_call_stack; }
143                           inline void DisableCallStackRecording(void){ record_call_stack = false; }
144                           inline void EnableCallStackRecording(void){ record_call_stack = true; }
145		                     inline void CallStackStart(JEventLoop::call_stack_t &cs, const string &caller_name, const string &caller_tag, const string callee_name, const string callee_tag);
146		                     inline void CallStackEnd(JEventLoop::call_stack_t &cs);
147           inline vector<call_stack_t> GetCallStack(void){return call_stack;} ///< Get the current factory call stack
148                           inline void AddToCallStack(call_stack_t &cs){if(record_call_stack) call_stack.push_back(cs);} ///< Add specified item to call stack record but only if record_call_stack is true
149                           inline void AddToErrorCallStack(error_call_stack_t &cs){error_call_stack.push_back(cs);} ///< Add layer to the factory call stack
150     inline vector<error_call_stack_t> GetErrorCallStack(void){return error_call_stack;} ///< Get the current factory error call stack
151                                  void PrintErrorCallStack(void); ///< Print the current factory call stack
152 
153                        const JObject* FindByID(JObject::oid_t id); ///< Find a data object by its identifier.
154            template<class T> const T* FindByID(JObject::oid_t id); ///< Find a data object by its type and identifier
155                        JFactory_base* FindOwner(const JObject *t); ///< Find the factory that owns a data object by pointer
156                        JFactory_base* FindOwner(JObject::oid_t id); ///< Find a factory that owns a data object by identifier
157 
158                                       // User defined references
159                template<class T> void SetRef(T *t);    ///< Add a user reference to this JEventLoop (must be a pointer)
160                  template<class T> T* GetRef(void);   ///< Get a user-defined reference of a specific type
161          template<class T> vector<T*> GetRefsT(void); ///< Get all user-defined refrences of a specicif type
162     vector<pair<const char*, void*> > GetRefs(void){ return user_refs; }  ///< Get copy of full list of user-defined references
163                template<class T> void RemoveRef(T *t); ///< Remove user reference from list
164 
165									   // Convenience methods wrapping JEvent methods of same name
166		                      uint64_t GetStatus(void){return event.GetStatus();}
167		                          bool GetStatusBit(uint32_t bit){return event.GetStatusBit(bit);}
168		                          bool SetStatusBit(uint32_t bit, bool val=true){return event.SetStatusBit(bit, val);}
169		                          bool ClearStatusBit(uint32_t bit){return event.ClearStatusBit(bit);}
170		                          void ClearStatus(void){event.ClearStatus();}
171		                          void SetStatusBitDescription(uint32_t bit, string description){event.SetStatusBitDescription(bit, description);}
172		                        string GetStatusBitDescription(uint32_t bit){return event.GetStatusBitDescription(bit);}
173		                          void GetStatusBitDescriptions(map<uint32_t, string> &status_bit_descriptions){return event.GetStatusBitDescriptions(status_bit_descriptions);}
174                                string StatusWordToString(void);
175 
176	private:
177		JEvent event;
178		vector<JFactory_base*> factories;
179		vector<JEventProcessor*> processors;
180		vector<error_call_stack_t> error_call_stack;
181		vector<call_stack_t> call_stack;
182		JApplication *app;
183		JThread *jthread;
184		bool initialized;
185		bool print_parameters_called;
186		int pause;
187		int quit;
188		int auto_free;
189		pthread_t pthread_id;
190		map<string, string> default_tags;
191		vector<pair<string,string> > auto_activated_factories;
192		bool record_call_stack;
193		string caller_name;
194		string caller_tag;
195		vector<uint64_t> event_boundaries;
196		int32_t event_boundaries_run; ///< Run number boundaries were retrieved from (possbily 0)
197		list<uint64_t> next_events_to_process;
198		
199		uint64_t Nevents;			      ///< Total events processed (this thread)
200		uint64_t Nevents_rate;		   ///< Num. events accumulated for "instantaneous" rate
201		double delta_time_single;		///< Time spent processing last event
202		double delta_time_rate;			///< Integrated time accumulated "instantaneous" rate (partial number of events)
203		double delta_time;				///< Total time spent processing events (this thread)
204		double rate_instantaneous;		///< Latest instantaneous rate
205		double rate_integrated;			///< Rate integrated over all events
206   
207		static data_source_t null_data_source;
208 
209		vector<pair<const char*, void*> > user_refs;
210};
211 
212 
213// The following is here just so we can use ROOT's THtml class to generate documentation.
214#ifdef G__DICTIONARY
215typedef JEventLoop::call_stack_t call_stack_t;
216typedef JEventLoop::error_call_stack_t error_call_stack_t;
217#endif
218 
219#if !defined(__CINT__) && !defined(__CLING__)
220 
221//-------------
222// GetSingle
223//-------------
224template<class T>
225JFactory<T>* JEventLoop::GetSingle(const T* &t, const char *tag, bool exception_if_not_one)
226{
227	/// This is a convenience method that can be used to get a pointer to the single
228	/// object of type T from the specified factory. It simply calls the Get(vector<...>) method
229	/// and copies the first pointer into "t" (or NULL if something other than 1 object is returned).
230	/// 
231	/// This is intended to address the common situation in which there is an interest
232	/// in the event if and only if there is exactly 1 object of type T. If the event
233	/// has no objects of that type or more than 1 object of that type (for the specified
234	/// factory) then an exception of type "unsigned long" is thrown with the value
235	/// being the number of objects of type T. You can supress the exception by setting
236	/// exception_if_not_one to false. In that case, you will have to check if t==NULL to
237	/// know if the call succeeded.
238	vector<const T*> v;
239	JFactory<T> *fac = Get(v, tag);
3
←
Calling 'JEventLoop::Get'→
240 
241	if(v.size()!=1){
242		t = NULL__null;
243		if(exception_if_not_one) throw v.size();
244	}
245	
246	t = v[0];
247	
248	return fac;
249}
250 
251//-------------
252// Get
253//-------------
254template<class T> 
255JFactory<T>* JEventLoop::Get(vector<const T*> &t, const char *tag, bool allow_deftag)
256{
257	/// Retrieve or generate the array of objects of
258	/// type T for the curent event being processed
259	/// by this thread.
260	///
261	/// By default, preference is given to reading the
262	/// objects from the data source(e.g. file) before generating
263	/// them in the factory. A flag exists in the factory
264	/// however to change this so that the factory is
265	/// given preference.
266	///
267	/// Note that regardless of the setting of this flag,
268	/// the data are only either read in or generated once.
269	/// Ownership of the objects will always be with the
270	/// factory so subsequent calls will always return pointers to
271	/// the same data.
272	///
273	/// If the factory is called on to generate the data,
274	/// it is done by calling the factory's Get() method
275	/// which, in turn, calls the evnt() method. 
276	/// 
277	/// First, we just call the GetFromFactory() method.
278	/// It will make the initial decision as to whether
279	/// it should look in the source first or not. If
280	/// it returns NULL, then the factory couldn't be
281	/// found so we automatically try the file.
282	///
283	/// Note that if no factory exists to hold the objects
284	/// from the file, one can be created automatically
285	/// providing the <i>JANA:AUTOFACTORYCREATE</i>
286	/// configuration parameter is set.
287 
288	// Check if a tag was specified for this data type to use for the
289	// default.
290	const char *mytag = tag3.1
'tag' is not equal to NULL
3.1
'tag' is not equal to NULL
3.1
'tag' is not equal to NULL
==NULL__null ? "":tag; // protection against NULL tags
4
←
'?' condition is false→
291	if(strlen(mytag)==0 && allow_deftag4.1
'allow_deftag' is true
4.1
'allow_deftag' is true
4.1
'allow_deftag' is true
){
5
←
Taking true branch→
292		map<string, string>::const_iterator iter = default_tags.find(T::static_className());
293		if(iter!=default_tags.end())tag = iter->second.c_str();
6
←
Assuming the condition is true→
7
←
Taking true branch→
8
←
Value assigned to 'tag'→
294	}
295	
296	
297	// If we are trying to keep track of the call stack then we
298	// need to add a new call_stack_t object to the the list
299	// and initialize it with the start time and caller/callee
300	// info.
301	call_stack_t cs;
302 
303	// Optionally record starting info of call stack entry
304	if(record_call_stack) CallStackStart(cs, caller_name, caller_tag, T::static_className(), tag);
9
←
Assuming field 'record_call_stack' is false→
10
←
Taking false branch→
305 
306	// Get the data (or at least try to)
307	JFactory<T>* factory=NULL__null;
308	try{
309		factory = GetFromFactory(t, tag, cs.data_source, allow_deftag);
11
←
Passing value via 2nd parameter 'tag'→
12
←
Calling 'JEventLoop::GetFromFactory'→
310		if(!factory){
311			// No factory exists for this type and tag. It's possible
312			// that the source may be able to provide the objects
313			// but it will need a place to put them. We can create a
314			// dumb JFactory just to hold the data in case the source
315			// can provide the objects. Before we do though, make sure
316			// the user condones this via the presence of the
317			// "JANA:AUTOFACTORYCREATE" config parameter.
318			string p;
319			try{
320				gPARMS->GetParameter("JANA:AUTOFACTORYCREATE", p);
321			}catch(...){}
322			if(p.size()==0){
323				jout<<std::endl;
324				_DBG__std::cerr<<"/w/halld-scifs17exp/halld2/home/sdobbs/Software/jana/jana_0.8.2/Linux_CentOS7.7-x86_64-gcc4.8.5/include/JANA/JEventLoop.h"
<<":"<<324<<std::endl;
325				jout<<"No factory of type \""<<T::static_className()<<"\" with tag \""<<tag<<"\" exists."<<std::endl;
326				jout<<"If you are reading objects from a file, I can auto-create a factory"<<std::endl;
327				jout<<"of the appropriate type to hold the objects, but this feature is turned"<<std::endl;
328				jout<<"off by default. To turn it on, set the \"JANA:AUTOFACTORYCREATE\""<<std::endl;
329				jout<<"configuration parameter. This can usually be done by passing the"<<std::endl;
330				jout<<"following argument to the program from the command line:"<<std::endl;
331				jout<<std::endl;
332				jout<<"   -PJANA:AUTOFACTORYCREATE=1"<<std::endl;
333				jout<<std::endl;
334				jout<<"Note that since the most commonly expected occurance of this situation."<<std::endl;
335				jout<<"is an error, the program will now throw an exception so that the factory."<<std::endl;
336				jout<<"call stack can be printed."<<std::endl;
337				jout<<std::endl;
338				throw exception();
339			}else{
340				AddFactory(new JFactory<T>(tag));
341				jout<<__FILE__"/w/halld-scifs17exp/halld2/home/sdobbs/Software/jana/jana_0.8.2/Linux_CentOS7.7-x86_64-gcc4.8.5/include/JANA/JEventLoop.h"<<":"<<__LINE__341<<" Auto-created "<<T::static_className()<<":"<<tag<<" factory"<<std::endl;
342			
343				// Now try once more. The GetFromFactory method will call
344				// GetFromSource since it's empty.
345				factory = GetFromFactory(t, tag, cs.data_source, allow_deftag);
346			}
347		}
348	}catch(exception &e){
349		// Uh-oh, an exception was thrown. Add us to the call stack
350		// and re-throw the exception
351		error_call_stack_t ecs;
352		ecs.factory_name = T::static_className();
353		ecs.tag = tag;
354		ecs.filename = NULL__null;
355		error_call_stack.push_back(ecs);
356		throw e;
357	}
358	
359	// If recording the call stack, update the end_time field and add to stack
360	if(record_call_stack) CallStackEnd(cs);
361	
362	return factory;
363}
364 
365//-------------
366// GetFromFactory
367//-------------
368template<class T> 
369JFactory<T>* JEventLoop::GetFromFactory(vector<const T*> &t, const char *tag, data_source_t &data_source, bool allow_deftag)
370{
371	// We need to find the factory providing data type T with
372	// tag given by "tag". 
373	vector<JFactory_base*>::iterator iter=factories.begin();
374	JFactory<T> *factory = NULL__null;
375	string className(T::static_className());
376	
377	// Check if a tag was specified for this data type to use for the
378	// default.
379	const char *mytag = tag==NULL__null ? "":tag; // protection against NULL tags
13
←
Assuming 'tag' is equal to NULL→
14
←
Assuming pointer value is null→
15
←
'?' condition is true→
380	if(strlen(mytag)==0 && allow_deftag15.1
'allow_deftag' is true
15.1
'allow_deftag' is true
15.1
'allow_deftag' is true
){
16
←
Taking true branch→
381		map<string, string>::const_iterator iter = default_tags.find(className);
382		if(iter!=default_tags.end())tag = iter->second.c_str();
17
←
Assuming the condition is false→
18
←
Taking false branch→
383	}
384	
385	for(; iter!=factories.end(); iter++){
19
←
Calling 'operator!=<jana::JFactory_base **, std::vector<jana::JFactory_base *>>'→
22
←
Returning from 'operator!=<jana::JFactory_base **, std::vector<jana::JFactory_base *>>'→
23
←
Loop condition is true.  Entering loop body→
386		// It turns out a long standing bug in g++ makes dynamic_cast return
387		// zero improperly when used on objects created on one side of
388		// a dynamically shared object (DSO) and the cast occurs on the 
389		// other side. I saw bug reports ranging from 2001 to 2004. I saw
390		// saw it first-hand on LinuxEL4 using g++ 3.4.5. This is too bad
391		// since it is much more elegant (and safe) to use dynamic_cast.
392		// To avoid this problem which can occur with plugins, we check
393		// the name of the data classes are the same. (sigh)
394		//factory = dynamic_cast<JFactory<T> *>(*iter);
395		if(className == (*iter)->GetDataClassName())factory = (JFactory<T>*)(*iter);
24
←
Taking true branch→
396		if(factory == NULL__null)continue;
25
←
Assuming 'factory' is not equal to NULL→
26
←
Taking false branch→
397		const char *factag = factory->Tag()==NULL__null ? "":factory->Tag();
27
←
Assuming the condition is true→
28
←
'?' condition is true→
398		if(!strcmp(factag, tag)){
29
←
Null pointer passed to 2nd parameter expecting 'nonnull'
399			break;
400		}else{
401			factory=NULL__null;
402		}
403	}
404	
405	// If factory not found, just return now
406	if(!factory){
407		data_source = DATA_NOT_AVAILABLE;
408		return NULL__null;
409	}
410	
411	// OK, we found the factory. If the evnt() routine has already
412	// been called, then just call the factory's Get() routine
413	// to return a copy of the existing data
414	if(factory->evnt_was_called()){
415		factory->CopyFrom(t);
416		data_source = DATA_FROM_CACHE;
417		return factory;
418	}
419	
420	// Next option is to get the objects from the data source
421	if(factory->GetCheckSourceFirst()){
422		// If the object type/tag is found in the source, it
423		// will return NOERROR, even if there are zero instances
424		// of it. If it is not available in the source then it
425		// will return OBJECT_NOT_AVAILABLE.
426		
427		jerror_t err = GetFromSource(t, factory);
428		if(err == NOERROR){
429			// A return value of NOERROR means the source had the objects
430			// even if there were zero of them.(If the source had no
431			// information about the objects OBJECT_NOT_AVAILABLE would 
432			// have been returned.)
433			// The GetFromSource() call will eventually lead to a call to
434			// the GetObjects() method of the concrete class derived
435			// from JEventSource. That routine should copy the object
436			// pointers into the factory using the factory's CopyTo()
437			// method which also sets the evnt_called flag for the factory.
438			// Note also that the "t" vector is then filled with a call
439			// to the factory's CopyFrom() method in JEvent::GetObjects().
440			// All we need to do now is just set the factory pointers in
441			// the newly generated JObjects and return the factory pointer.
442 
443			factory->SetFactoryPointers();
444			data_source = DATA_FROM_SOURCE;
445 
446			return factory;
447		}
448	}
449		
450	// OK. It looks like we have to have the factory make this.
451	// Get pointers to data from the factory.
452	factory->Get(t);
453	factory->SetFactoryPointers();
454	data_source = DATA_FROM_FACTORY;
455	
456	return factory;
457}
458 
459//-------------
460// GetFromSource
461//-------------
462template<class T> 
463jerror_t JEventLoop::GetFromSource(vector<const T*> &t, JFactory_base *factory)
464{
465	/// This tries to get objects from the event source.
466	/// "factory" must be a valid pointer to a JFactory
467	/// object since that will take ownership of the objects
468	/// created by the source.
469	/// This should usually be called from JEventLoop::GetFromFactory
470	/// which is called from JEventLoop::Get. The latter will
471	/// create a dummy JFactory of the proper flavor and tag if
472	/// one does not already exist so if objects exist in the
473	/// file without a corresponding factory to create them, they
474	/// can still be used.
475	if(!factory)throw OBJECT_NOT_AVAILABLE;
476	
477	return event.GetObjects(t, factory);
478}
479 
480//-------------
481// CallStackStart
482//-------------
483inline void JEventLoop::CallStackStart(JEventLoop::call_stack_t &cs, const string &caller_name, const string &caller_tag, const string callee_name, const string callee_tag)
484{
485	/// This is used to fill initial info into a call_stack_t stucture
486	/// for recording the call stack. It should be matched with a call
487	/// to CallStackEnd. It is normally called from the Get() method
488	/// above, but may also be used by external actors to manipulate
489	/// the call stack (presumably for good and not evil).
490 
491	struct itimerval tmr;
492	getitimer(ITIMER_PROFITIMER_PROF, &tmr);
493 
494	cs.caller_name    = this->caller_name;
495	cs.caller_tag     = this->caller_tag;
496	this->caller_name = cs.callee_name = callee_name;
497	this->caller_tag  = cs.callee_tag  = callee_tag;
498	cs.start_time = tmr.it_value.tv_sec + tmr.it_value.tv_usec/1.0E6;
499}
500 
501//-------------
502// CallStackEnd
503//-------------
504inline void JEventLoop::CallStackEnd(JEventLoop::call_stack_t &cs)
505{
506	/// Complete a call stack entry. This should be matched
507	/// with a previous call to CallStackStart which was
508	/// used to fill the cs structure.
509 
510	struct itimerval tmr;
511	getitimer(ITIMER_PROFITIMER_PROF, &tmr);
512	cs.end_time = tmr.it_value.tv_sec + tmr.it_value.tv_usec/1.0E6;
513	caller_name = cs.caller_name;
514	caller_tag  = cs.caller_tag;
515	call_stack.push_back(cs);
516}
517 
518//-------------
519// CheckEventBoundary
520//-------------
521inline bool JEventLoop::CheckEventBoundary(uint64_t event_numberA, uint64_t event_numberB)
522{
523	/// Check whether the two event numbers span one or more boundaries
524	/// in the calibration/conditions database for the current run number.
525	/// Return true if they do and false if they don't. The first parameter
526	/// "event_numberA" is also checked if it lands on a boundary in which
527	/// case true is also returned. If event_numberB lands on a boundary,
528	/// but event_numberA does not, then false is returned.
529	///
530	/// This method is not expected to be called by a user. It is, however called,
531	/// everytime a JFactory's Get() method is called.
532 
533	// Make sure our copy of the boundaries is up to date
534	if(event.GetRunNumber()!=event_boundaries_run){
535		event_boundaries.clear(); // in case we can't get the JCalibration pointer
536		JCalibration *jcalib = GetJCalibration();
537		if(jcalib)jcalib->GetEventBoundaries(event_boundaries);
538		event_boundaries_run = event.GetRunNumber();
539	}
540	
541	// Loop over boundaries
542	for(unsigned int i=0; i<event_boundaries.size(); i++){
543		uint64_t eb = event_boundaries[i];
544		if((eb - event_numberA)*(eb - event_numberB) < 0.0 || eb==event_numberA){ // think about it ....
545			// events span a boundary or is on a boundary. Return true
546			return true;
547		}
548	}
549 
550	return false;
551}
552 
553//-------------
554// FindByID
555//-------------
556template<class T> 
557const T* JEventLoop::FindByID(JObject::oid_t id)
558{
559	/// This is a templated method that can be used in place
560	/// of the non-templated FindByID(oid_t) method if one knows
561	/// the class of the object with the specified id.
562	/// This method is faster than calling the non-templated
563	/// FindByID and dynamic_cast-ing the JObject since
564	/// this will only search the objects of factories that
565	/// produce the desired data type.
566	/// This method will cast the JObject pointer to one
567	/// of the specified type. To use this method,
568	/// a type is specified in the call as follows:
569	///
570	/// const DMyType *t = loop->FindByID<DMyType>(id);
571	
572	// Loop over factories looking for ones that provide
573	// specified data type.
574	for(unsigned int i=0; i<factories.size(); i++){
575		if(factories[i]->GetDataClassName() != T::static_className())continue;
576 
577		// This factory provides data of type T. Search it for
578		// the object with the specified id.
579		const JObject *my_obj = factories[i]->GetByID(id);
580		if(my_obj)return dynamic_cast<const T*>(my_obj);
581	}
582 
583	return NULL__null;
584}
585 
586//-------------
587// GetCalib (map)
588//-------------
589template<class T>
590bool JEventLoop::GetCalib(string namepath, map<string,T> &vals)
591{
592	/// Get the JCalibration object from JApplication for the run number of
593	/// the current event and call its Get() method to get the constants.
594 
595	// Note that we could do this by making "vals" a generic type T thus, combining
596	// this with the vector version below. However, doing this explicitly will make
597	// it easier for the user to understand how to call us.
598 
599	vals.clear();
600 
601	JCalibration *calib = GetJCalibration();
602	if(!calib){
603		_DBG_std::cerr<<"/w/halld-scifs17exp/halld2/home/sdobbs/Software/jana/jana_0.8.2/Linux_CentOS7.7-x86_64-gcc4.8.5/include/JANA/JEventLoop.h"
<<":"<<603<<" "<<"Unable to get JCalibration object for run "<<event.GetRunNumber()<<std::endl;
604		return true;
605	}
606	
607	return calib->Get(namepath, vals, event.GetEventNumber());
608}
609 
610//-------------
611// GetCalib (vector)
612//-------------
613template<class T> bool JEventLoop::GetCalib(string namepath, vector<T> &vals)
614{
615	/// Get the JCalibration object from JApplication for the run number of
616	/// the current event and call its Get() method to get the constants.
617 
618	vals.clear();
619 
620	JCalibration *calib = GetJCalibration();
621	if(!calib){
622		_DBG_std::cerr<<"/w/halld-scifs17exp/halld2/home/sdobbs/Software/jana/jana_0.8.2/Linux_CentOS7.7-x86_64-gcc4.8.5/include/JANA/JEventLoop.h"
<<":"<<622<<" "<<"Unable to get JCalibration object for run "<<event.GetRunNumber()<<std::endl;
623		return true;
624	}
625	
626	return calib->Get(namepath, vals, event.GetEventNumber());
627}
628 
629//-------------
630// GetCalib (single)
631//-------------
632template<class T> bool JEventLoop::GetCalib(string namepath, T &val)
633{
634	/// This is a convenience method for getting a single entry. It
635	/// simply calls the vector version and returns the first entry.
636	/// It returns true if the vector version returns true AND there
637	/// is at least one entry in the vector. No check is made for there
638	/// there being more than one entry in the vector.
639 
640	vector<T> vals;
641	bool ret = GetCalib(namepath, vals);
642	if(vals.empty()) return true;
643	val = vals[0];
644	
645	return ret;
646}
647 
648//-------------
649// GetGeom (map)
650//-------------
651template<class T>
652bool JEventLoop::GetGeom(string namepath, map<string,T> &vals)
653{
654	/// Get the JGeometry object from JApplication for the run number of
655	/// the current event and call its Get() method to get the constants.
656 
657	// Note that we could do this by making "vals" a generic type T thus, combining
658	// this with the vector version below. However, doing this explicitly will make
659	// it easier for the user to understand how to call us.
660 
661	vals.clear();
662 
663	JGeometry *geom = GetJGeometry();
664	if(!geom){
665		_DBG_std::cerr<<"/w/halld-scifs17exp/halld2/home/sdobbs/Software/jana/jana_0.8.2/Linux_CentOS7.7-x86_64-gcc4.8.5/include/JANA/JEventLoop.h"
<<":"<<665<<" "<<"Unable to get JGeometry object for run "<<event.GetRunNumber()<<std::endl;
666		return true;
667	}
668	
669	return geom->Get(namepath, vals);
670}
671 
672//-------------
673// GetGeom (atomic)
674//-------------
675template<class T> bool JEventLoop::GetGeom(string namepath, T &val)
676{
677	/// Get the JCalibration object from JApplication for the run number of
678	/// the current event and call its Get() method to get the constants.
679 
680	JGeometry *geom = GetJGeometry();
681	if(!geom){
682		_DBG_std::cerr<<"/w/halld-scifs17exp/halld2/home/sdobbs/Software/jana/jana_0.8.2/Linux_CentOS7.7-x86_64-gcc4.8.5/include/JANA/JEventLoop.h"
<<":"<<682<<" "<<"Unable to get JGeometry object for run "<<event.GetRunNumber()<<std::endl;
683		return true;
684	}
685	
686	return geom->Get(namepath, val);
687}
688 
689//-------------
690// SetRef
691//-------------
692template<class T>
693void JEventLoop::SetRef(T *t)
694{
695	pair<const char*, void*> p(typeid(T).name(), (void*)t);
696	user_refs.push_back(p);
697}
698 
699//-------------
700// GetResource
701//-------------
702template<class T> bool JEventLoop::GetResource(string namepath, T vals, int event_number)
703{
704	JResourceManager *resource_manager = GetJResourceManager();
705	if(!resource_manager){
706		string mess = string("Unable to get the JResourceManager object (namepath=\"")+namepath+"\")";
707		throw JException(mess);
708	}
709 
710	return resource_manager->Get(namepath, vals, event_number);
711}
712 
713//-------------
714// GetRef
715//-------------
716template<class T>
717T* JEventLoop::GetRef(void)
718{
719	/// Get a user-defined reference (a pointer)
720	for(unsigned int i=0; i<user_refs.size(); i++){
721		if(user_refs[i].first == typeid(T).name()) return (T*)user_refs[i].second;
722	}
723 
724	return NULL__null;
725}
726 
727//-------------
728// GetRefsT
729//-------------
730template<class T>
731vector<T*> JEventLoop::GetRefsT(void)
732{
733	vector<T*> refs;
734	for(unsigned int i=0; i<user_refs.size(); i++){
735		if(user_refs[i].first == typeid(T).name()){
736			refs.push_back((T*)user_refs[i].second);
737		}
738	}
739 
740	return refs;
741}
742 
743//-------------
744// RemoveRef
745//-------------
746template<class T>
747void JEventLoop::RemoveRef(T *t)
748{
749	vector<pair<const char*, void*> >::iterator iter;
750	for(iter=user_refs.begin(); iter!= user_refs.end(); iter++){
751		if(iter->second == (void*)t){
752			user_refs.erase(iter);
753			return;
754		}
755	}
756	_DBG_std::cerr<<"/w/halld-scifs17exp/halld2/home/sdobbs/Software/jana/jana_0.8.2/Linux_CentOS7.7-x86_64-gcc4.8.5/include/JANA/JEventLoop.h"
<<":"<<756<<" "<<" Attempt to remove user reference not in event loop!" << std::endl;
757}
758 
759 
760#endif //__CINT__  __CLING__
761 
762} // Close JANA namespace
763 
764 
765 
766#endif // _JEventLoop_
767 

←

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

1// Iterators -*- C++ -*-

3// Copyright (C) 2001-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.

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.

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.

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/>.

25/*
*
* Copyright (c) 1994
* Hewlett-Packard Company
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appear in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation.  Hewlett-Packard Company makes no
* representations about the suitability of this software for any
* purpose.  It is provided "as is" without express or implied warranty.
*
*
* Copyright (c) 1996-1998
* Silicon Graphics Computer Systems, Inc.
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appear in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation.  Silicon Graphics makes no
* representations about the suitability of this software for any
* purpose.  It is provided "as is" without express or implied warranty.
*/

51/** @file bits/stl_iterator.h
*  This is an internal header file, included by other library headers.
*  Do not attempt to use it directly. @headername{iterator}
*
*  This file implements reverse_iterator, back_insert_iterator,
*  front_insert_iterator, insert_iterator, __normal_iterator, and their
*  supporting functions and overloaded operators.
*/

60#ifndef _STL_ITERATOR_H1
61#define _STL_ITERATOR_H1 1

63#include <bits/cpp_type_traits.h>
64#include <ext/type_traits.h>
65#include <bits/move.h>

67namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
68{
69_GLIBCXX_BEGIN_NAMESPACE_VERSION

/**
 * @addtogroup iterators
 * @{
 */

// 24.4.1 Reverse iterators
/**
 *  Bidirectional and random access iterators have corresponding reverse
 *  %iterator adaptors that iterate through the data structure in the
 *  opposite direction.  They have the same signatures as the corresponding
 *  iterators.  The fundamental relation between a reverse %iterator and its
 *  corresponding %iterator @c i is established by the identity:
 *  @code
 *      &*(reverse_iterator(i)) == &*(i - 1)
 *  @endcode
 *
 *  <em>This mapping is dictated by the fact that while there is always a
 *  pointer past the end of an array, there might not be a valid pointer
 *  before the beginning of an array.</em> [24.4.1]/1,2
 *
 *  Reverse iterators can be tricky and surprising at first.  Their
 *  semantics make sense, however, and the trickiness is a side effect of
 *  the requirement that the iterators must be safe.
*/
template<typename _Iterator>
  class reverse_iterator
  : public iterator<typename iterator_traits<_Iterator>::iterator_category,
      typename iterator_traits<_Iterator>::value_type,
      typename iterator_traits<_Iterator>::difference_type,
      typename iterator_traits<_Iterator>::pointer,
                    typename iterator_traits<_Iterator>::reference>
  {
  protected:
    _Iterator current;

    typedef iterator_traits<_Iterator>		__traits_type;

  public:
    typedef _Iterator					iterator_type;
    typedef typename __traits_type::difference_type	difference_type;
    typedef typename __traits_type::pointer		pointer;
    typedef typename __traits_type::reference		reference;

    /**
     *  The default constructor value-initializes member @p current.
     *  If it is a pointer, that means it is zero-initialized.
    */
    // _GLIBCXX_RESOLVE_LIB_DEFECTS
    // 235 No specification of default ctor for reverse_iterator
    reverse_iterator() : current() { }

    /**
     *  This %iterator will move in the opposite direction that @p x does.
    */
    explicit
    reverse_iterator(iterator_type __x) : current(__x) { }

    /**
     *  The copy constructor is normal.
    */
    reverse_iterator(const reverse_iterator& __x)
    : current(__x.current) { }

    /**
     *  A %reverse_iterator across other types can be copied if the
     *  underlying %iterator can be converted to the type of @c current.
    */
    template<typename _Iter>
      reverse_iterator(const reverse_iterator<_Iter>& __x)
: current(__x.base()) { }

    /**
     *  @return  @c current, the %iterator used for underlying work.
    */
    iterator_type
    base() const
    { return current; }

    /**
     *  @return  A reference to the value at @c --current
     *
     *  This requires that @c --current is dereferenceable.
     *
     *  @warning This implementation requires that for an iterator of the
     *           underlying iterator type, @c x, a reference obtained by
     *           @c *x remains valid after @c x has been modified or
     *           destroyed. This is a bug: http://gcc.gnu.org/PR51823
    */
    reference
    operator*() const
    {
_Iterator __tmp = current;
return *--__tmp;
    }

    /**
     *  @return  A pointer to the value at @c --current
     *
     *  This requires that @c --current is dereferenceable.
    */
    pointer
    operator->() const
    { return &(operator*()); }

    /**
     *  @return  @c *this
     *
     *  Decrements the underlying iterator.
    */
    reverse_iterator&
    operator++()
    {
--current;
return *this;
    }

    /**
     *  @return  The original value of @c *this
     *
     *  Decrements the underlying iterator.
    */
    reverse_iterator
    operator++(int)
    {
reverse_iterator __tmp = *this;
--current;
return __tmp;
    }

    /**
     *  @return  @c *this
     *
     *  Increments the underlying iterator.
    */
    reverse_iterator&
    operator--()
    {
++current;
return *this;
    }

    /**
     *  @return  A reverse_iterator with the previous value of @c *this
     *
     *  Increments the underlying iterator.
    */
    reverse_iterator
    operator--(int)
    {
reverse_iterator __tmp = *this;
++current;
return __tmp;
    }

    /**
     *  @return  A reverse_iterator that refers to @c current - @a __n
     *
     *  The underlying iterator must be a Random Access Iterator.
    */
    reverse_iterator
    operator+(difference_type __n) const
    { return reverse_iterator(current - __n); }

    /**
     *  @return  *this
     *
     *  Moves the underlying iterator backwards @a __n steps.
     *  The underlying iterator must be a Random Access Iterator.
    */
    reverse_iterator&
    operator+=(difference_type __n)
    {
current -= __n;
return *this;
    }

    /**
     *  @return  A reverse_iterator that refers to @c current - @a __n
     *
     *  The underlying iterator must be a Random Access Iterator.
    */
    reverse_iterator
    operator-(difference_type __n) const
    { return reverse_iterator(current + __n); }

    /**
     *  @return  *this
     *
     *  Moves the underlying iterator forwards @a __n steps.
     *  The underlying iterator must be a Random Access Iterator.
    */
    reverse_iterator&
    operator-=(difference_type __n)
    {
current += __n;
return *this;
    }

    /**
     *  @return  The value at @c current - @a __n - 1
     *
     *  The underlying iterator must be a Random Access Iterator.
    */
    reference
    operator[](difference_type __n) const
    { return *(*this + __n); }
  };

//@{
/**
 *  @param  __x  A %reverse_iterator.
 *  @param  __y  A %reverse_iterator.
 *  @return  A simple bool.
 *
 *  Reverse iterators forward many operations to their underlying base()
 *  iterators.  Others are implemented in terms of one another.
 *
*/
template<typename _Iterator>
  inline bool
  operator==(const reverse_iterator<_Iterator>& __x,
      const reverse_iterator<_Iterator>& __y)
  { return __x.base() == __y.base(); }

template<typename _Iterator>
  inline bool
  operator<(const reverse_iterator<_Iterator>& __x,
     const reverse_iterator<_Iterator>& __y)
  { return __y.base() < __x.base(); }

template<typename _Iterator>
  inline bool
  operator!=(const reverse_iterator<_Iterator>& __x,
      const reverse_iterator<_Iterator>& __y)
  { return !(__x == __y); }

template<typename _Iterator>
  inline bool
  operator>(const reverse_iterator<_Iterator>& __x,
     const reverse_iterator<_Iterator>& __y)
  { return __y < __x; }

template<typename _Iterator>
  inline bool
  operator<=(const reverse_iterator<_Iterator>& __x,
      const reverse_iterator<_Iterator>& __y)
  { return !(__y < __x); }

template<typename _Iterator>
  inline bool
  operator>=(const reverse_iterator<_Iterator>& __x,
      const reverse_iterator<_Iterator>& __y)
  { return !(__x < __y); }

template<typename _Iterator>
  inline typename reverse_iterator<_Iterator>::difference_type
  operator-(const reverse_iterator<_Iterator>& __x,
     const reverse_iterator<_Iterator>& __y)
  { return __y.base() - __x.base(); }

template<typename _Iterator>
  inline reverse_iterator<_Iterator>
  operator+(typename reverse_iterator<_Iterator>::difference_type __n,
     const reverse_iterator<_Iterator>& __x)
  { return reverse_iterator<_Iterator>(__x.base() - __n); }

// _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 280. Comparison of reverse_iterator to const reverse_iterator.
template<typename _IteratorL, typename _IteratorR>
  inline bool
  operator==(const reverse_iterator<_IteratorL>& __x,
      const reverse_iterator<_IteratorR>& __y)
  { return __x.base() == __y.base(); }

template<typename _IteratorL, typename _IteratorR>
  inline bool
  operator<(const reverse_iterator<_IteratorL>& __x,
     const reverse_iterator<_IteratorR>& __y)
  { return __y.base() < __x.base(); }

template<typename _IteratorL, typename _IteratorR>
  inline bool
  operator!=(const reverse_iterator<_IteratorL>& __x,
      const reverse_iterator<_IteratorR>& __y)
  { return !(__x == __y); }

template<typename _IteratorL, typename _IteratorR>
  inline bool
  operator>(const reverse_iterator<_IteratorL>& __x,
     const reverse_iterator<_IteratorR>& __y)
  { return __y < __x; }

template<typename _IteratorL, typename _IteratorR>
  inline bool
  operator<=(const reverse_iterator<_IteratorL>& __x,
      const reverse_iterator<_IteratorR>& __y)
  { return !(__y < __x); }

template<typename _IteratorL, typename _IteratorR>
  inline bool
  operator>=(const reverse_iterator<_IteratorL>& __x,
      const reverse_iterator<_IteratorR>& __y)
  { return !(__x < __y); }

template<typename _IteratorL, typename _IteratorR>
376#if __cplusplus201103L >= 201103L
  // DR 685.
  inline auto
  operator-(const reverse_iterator<_IteratorL>& __x,
     const reverse_iterator<_IteratorR>& __y)
  -> decltype(__y.base() - __x.base())
382#else
  inline typename reverse_iterator<_IteratorL>::difference_type
  operator-(const reverse_iterator<_IteratorL>& __x,
     const reverse_iterator<_IteratorR>& __y)
386#endif
  { return __y.base() - __x.base(); }
//@}

// 24.4.2.2.1 back_insert_iterator
/**
 *  @brief  Turns assignment into insertion.
 *
 *  These are output iterators, constructed from a container-of-T.
 *  Assigning a T to the iterator appends it to the container using
 *  push_back.
 *
 *  Tip:  Using the back_inserter function to create these iterators can
 *  save typing.
*/
template<typename _Container>
  class back_insert_iterator
  : public iterator<output_iterator_tag, void, void, void, void>
  {
  protected:
    _Container* container;

  public:
    /// A nested typedef for the type of whatever container you used.
    typedef _Container          container_type;

    /// The only way to create this %iterator is with a container.
    explicit
    back_insert_iterator(_Container& __x) : container(&__x) { }

    /**
     *  @param  __value  An instance of whatever type
     *                 container_type::const_reference is; presumably a
     *                 reference-to-const T for container<T>.
     *  @return  This %iterator, for chained operations.
     *
     *  This kind of %iterator doesn't really have a @a position in the
     *  container (you can think of the position as being permanently at
     *  the end, if you like).  Assigning a value to the %iterator will
     *  always append the value to the end of the container.
    */
427#if __cplusplus201103L < 201103L
    back_insert_iterator&
    operator=(typename _Container::const_reference __value)
    {
container->push_back(__value);
return *this;
    }
434#else
    back_insert_iterator&
    operator=(const typename _Container::value_type& __value)
    {
container->push_back(__value);
return *this;
    }

    back_insert_iterator&
    operator=(typename _Container::value_type&& __value)
    {
container->push_back(std::move(__value));
return *this;
    }
448#endif

    /// Simply returns *this.
    back_insert_iterator&
    operator*()
    { return *this; }

    /// Simply returns *this.  (This %iterator does not @a move.)
    back_insert_iterator&
    operator++()
    { return *this; }

    /// Simply returns *this.  (This %iterator does not @a move.)
    back_insert_iterator
    operator++(int)
    { return *this; }
  };

/**
 *  @param  __x  A container of arbitrary type.
 *  @return  An instance of back_insert_iterator working on @p __x.
 *
 *  This wrapper function helps in creating back_insert_iterator instances.
 *  Typing the name of the %iterator requires knowing the precise full
 *  type of the container, which can be tedious and impedes generic
 *  programming.  Using this function lets you take advantage of automatic
 *  template parameter deduction, making the compiler match the correct
 *  types for you.
*/
template<typename _Container>
  inline back_insert_iterator<_Container>
  back_inserter(_Container& __x)
  { return back_insert_iterator<_Container>(__x); }

/**
 *  @brief  Turns assignment into insertion.
 *
 *  These are output iterators, constructed from a container-of-T.
 *  Assigning a T to the iterator prepends it to the container using
 *  push_front.
 *
 *  Tip:  Using the front_inserter function to create these iterators can
 *  save typing.
*/
template<typename _Container>
  class front_insert_iterator
  : public iterator<output_iterator_tag, void, void, void, void>
  {
  protected:
    _Container* container;

  public:
    /// A nested typedef for the type of whatever container you used.
    typedef _Container          container_type;

    /// The only way to create this %iterator is with a container.
    explicit front_insert_iterator(_Container& __x) : container(&__x) { }

    /**
     *  @param  __value  An instance of whatever type
     *                 container_type::const_reference is; presumably a
     *                 reference-to-const T for container<T>.
     *  @return  This %iterator, for chained operations.
     *
     *  This kind of %iterator doesn't really have a @a position in the
     *  container (you can think of the position as being permanently at
     *  the front, if you like).  Assigning a value to the %iterator will
     *  always prepend the value to the front of the container.
    */
517#if __cplusplus201103L < 201103L
    front_insert_iterator&
    operator=(typename _Container::const_reference __value)
    {
container->push_front(__value);
return *this;
    }
524#else
    front_insert_iterator&
    operator=(const typename _Container::value_type& __value)
    {
container->push_front(__value);
return *this;
    }

    front_insert_iterator&
    operator=(typename _Container::value_type&& __value)
    {
container->push_front(std::move(__value));
return *this;
    }
538#endif

    /// Simply returns *this.
    front_insert_iterator&
    operator*()
    { return *this; }

    /// Simply returns *this.  (This %iterator does not @a move.)
    front_insert_iterator&
    operator++()
    { return *this; }

    /// Simply returns *this.  (This %iterator does not @a move.)
    front_insert_iterator
    operator++(int)
    { return *this; }
  };

/**
 *  @param  __x  A container of arbitrary type.
 *  @return  An instance of front_insert_iterator working on @p x.
 *
 *  This wrapper function helps in creating front_insert_iterator instances.
 *  Typing the name of the %iterator requires knowing the precise full
 *  type of the container, which can be tedious and impedes generic
 *  programming.  Using this function lets you take advantage of automatic
 *  template parameter deduction, making the compiler match the correct
 *  types for you.
*/
template<typename _Container>
  inline front_insert_iterator<_Container>
  front_inserter(_Container& __x)
  { return front_insert_iterator<_Container>(__x); }

/**
 *  @brief  Turns assignment into insertion.
 *
 *  These are output iterators, constructed from a container-of-T.
 *  Assigning a T to the iterator inserts it in the container at the
 *  %iterator's position, rather than overwriting the value at that
 *  position.
 *
 *  (Sequences will actually insert a @e copy of the value before the
 *  %iterator's position.)
 *
 *  Tip:  Using the inserter function to create these iterators can
 *  save typing.
*/
template<typename _Container>
  class insert_iterator
  : public iterator<output_iterator_tag, void, void, void, void>
  {
  protected:
    _Container* container;
    typename _Container::iterator iter;

  public:
    /// A nested typedef for the type of whatever container you used.
    typedef _Container          container_type;

    /**
     *  The only way to create this %iterator is with a container and an
     *  initial position (a normal %iterator into the container).
    */
    insert_iterator(_Container& __x, typename _Container::iterator __i)
    : container(&__x), iter(__i) {}

    /**
     *  @param  __value  An instance of whatever type
     *                 container_type::const_reference is; presumably a
     *                 reference-to-const T for container<T>.
     *  @return  This %iterator, for chained operations.
     *
     *  This kind of %iterator maintains its own position in the
     *  container.  Assigning a value to the %iterator will insert the
     *  value into the container at the place before the %iterator.
     *
     *  The position is maintained such that subsequent assignments will
     *  insert values immediately after one another.  For example,
     *  @code
     *     // vector v contains A and Z
     *
     *     insert_iterator i (v, ++v.begin());
     *     i = 1;
     *     i = 2;
     *     i = 3;
     *
     *     // vector v contains A, 1, 2, 3, and Z
     *  @endcode
    */
628#if __cplusplus201103L < 201103L
    insert_iterator&
    operator=(typename _Container::const_reference __value)
    {
iter = container->insert(iter, __value);
++iter;
return *this;
    }
636#else
    insert_iterator&
    operator=(const typename _Container::value_type& __value)
    {
iter = container->insert(iter, __value);
++iter;
return *this;
    }

    insert_iterator&
    operator=(typename _Container::value_type&& __value)
    {
iter = container->insert(iter, std::move(__value));
++iter;
return *this;
    }
652#endif

    /// Simply returns *this.
    insert_iterator&
    operator*()
    { return *this; }

    /// Simply returns *this.  (This %iterator does not @a move.)
    insert_iterator&
    operator++()
    { return *this; }

    /// Simply returns *this.  (This %iterator does not @a move.)
    insert_iterator&
    operator++(int)
    { return *this; }
  };

/**
 *  @param __x  A container of arbitrary type.
 *  @return  An instance of insert_iterator working on @p __x.
 *
 *  This wrapper function helps in creating insert_iterator instances.
 *  Typing the name of the %iterator requires knowing the precise full
 *  type of the container, which can be tedious and impedes generic
 *  programming.  Using this function lets you take advantage of automatic
 *  template parameter deduction, making the compiler match the correct
 *  types for you.
*/
template<typename _Container, typename _Iterator>
  inline insert_iterator<_Container>
  inserter(_Container& __x, _Iterator __i)
  {
    return insert_iterator<_Container>(__x,
			 typename _Container::iterator(__i));
  }

// @} group iterators

691_GLIBCXX_END_NAMESPACE_VERSION
692} // namespace

694namespace __gnu_cxx _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
695{
696_GLIBCXX_BEGIN_NAMESPACE_VERSION

// This iterator adapter is @a normal in the sense that it does not
// change the semantics of any of the operators of its iterator
// parameter.  Its primary purpose is to convert an iterator that is
// not a class, e.g. a pointer, into an iterator that is a class.
// The _Container parameter exists solely so that different containers
// using this template can instantiate different types, even if the
// _Iterator parameter is the same.
using std::iterator_traits;
using std::iterator;
template<typename _Iterator, typename _Container>
  class __normal_iterator
  {
  protected:
    _Iterator _M_current;

    typedef iterator_traits<_Iterator>		__traits_type;

  public:
    typedef _Iterator					iterator_type;
    typedef typename __traits_type::iterator_category iterator_category;
    typedef typename __traits_type::value_type  	value_type;
    typedef typename __traits_type::difference_type 	difference_type;
    typedef typename __traits_type::reference 	reference;
    typedef typename __traits_type::pointer   	pointer;

    _GLIBCXX_CONSTEXPRconstexpr __normal_iterator() : _M_current(_Iterator()) { }

    explicit
    __normal_iterator(const _Iterator& __i) : _M_current(__i) { }

    // Allow iterator to const_iterator conversion
    template<typename _Iter>
      __normal_iterator(const __normal_iterator<_Iter,
	  typename __enable_if<
    	       (std::__are_same<_Iter, typename _Container::pointer>::__value),
      _Container>::__type>& __i)
      : _M_current(__i.base()) { }

    // Forward iterator requirements
    reference
    operator*() const
    { return *_M_current; }

    pointer
    operator->() const
    { return _M_current; }

    __normal_iterator&
    operator++()
    {
++_M_current;
return *this;
    }

    __normal_iterator
    operator++(int)
    { return __normal_iterator(_M_current++); }

    // Bidirectional iterator requirements
    __normal_iterator&
    operator--()
    {
--_M_current;
return *this;
    }

    __normal_iterator
    operator--(int)
    { return __normal_iterator(_M_current--); }

    // Random access iterator requirements
    reference
    operator[](const difference_type& __n) const
    { return _M_current[__n]; }

    __normal_iterator&
    operator+=(const difference_type& __n)
    { _M_current += __n; return *this; }

    __normal_iterator
    operator+(const difference_type& __n) const
    { return __normal_iterator(_M_current + __n); }

    __normal_iterator&
    operator-=(const difference_type& __n)
    { _M_current -= __n; return *this; }

    __normal_iterator
    operator-(const difference_type& __n) const
    { return __normal_iterator(_M_current - __n); }

    const _Iterator&
    base() const
    { return _M_current; }
  };

// Note: In what follows, the left- and right-hand-side iterators are
// allowed to vary in types (conceptually in cv-qualification) so that
// comparison between cv-qualified and non-cv-qualified iterators be
// valid.  However, the greedy and unfriendly operators in std::rel_ops
// will make overload resolution ambiguous (when in scope) if we don't
// provide overloads whose operands are of the same type.  Can someone
// remind me what generic programming is about? -- Gaby

// Forward iterator requirements
template<typename _IteratorL, typename _IteratorR, typename _Container>
  inline bool
  operator==(const __normal_iterator<_IteratorL, _Container>& __lhs,
      const __normal_iterator<_IteratorR, _Container>& __rhs)
  { return __lhs.base() == __rhs.base(); }

template<typename _Iterator, typename _Container>
  inline bool
  operator==(const __normal_iterator<_Iterator, _Container>& __lhs,
      const __normal_iterator<_Iterator, _Container>& __rhs)
  { return __lhs.base() == __rhs.base(); }

template<typename _IteratorL, typename _IteratorR, typename _Container>
  inline bool
  operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs,
      const __normal_iterator<_IteratorR, _Container>& __rhs)
  { return __lhs.base() != __rhs.base(); }

template<typename _Iterator, typename _Container>
  inline bool
  operator!=(const __normal_iterator<_Iterator, _Container>& __lhs,
      const __normal_iterator<_Iterator, _Container>& __rhs)
  { return __lhs.base() != __rhs.base(); }
20
←
Assuming the condition is true→
21
←
Returning the value 1, which participates in a condition later→

// Random access iterator requirements
template<typename _IteratorL, typename _IteratorR, typename _Container>
  inline bool
  operator<(const __normal_iterator<_IteratorL, _Container>& __lhs,
     const __normal_iterator<_IteratorR, _Container>& __rhs)
  { return __lhs.base() < __rhs.base(); }

template<typename _Iterator, typename _Container>
  inline bool
  operator<(const __normal_iterator<_Iterator, _Container>& __lhs,
     const __normal_iterator<_Iterator, _Container>& __rhs)
  { return __lhs.base() < __rhs.base(); }

template<typename _IteratorL, typename _IteratorR, typename _Container>
  inline bool
  operator>(const __normal_iterator<_IteratorL, _Container>& __lhs,
     const __normal_iterator<_IteratorR, _Container>& __rhs)
  { return __lhs.base() > __rhs.base(); }

template<typename _Iterator, typename _Container>
  inline bool
  operator>(const __normal_iterator<_Iterator, _Container>& __lhs,
     const __normal_iterator<_Iterator, _Container>& __rhs)
  { return __lhs.base() > __rhs.base(); }

template<typename _IteratorL, typename _IteratorR, typename _Container>
  inline bool
  operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs,
      const __normal_iterator<_IteratorR, _Container>& __rhs)
  { return __lhs.base() <= __rhs.base(); }

template<typename _Iterator, typename _Container>
  inline bool
  operator<=(const __normal_iterator<_Iterator, _Container>& __lhs,
      const __normal_iterator<_Iterator, _Container>& __rhs)
  { return __lhs.base() <= __rhs.base(); }

template<typename _IteratorL, typename _IteratorR, typename _Container>
  inline bool
  operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs,
      const __normal_iterator<_IteratorR, _Container>& __rhs)
  { return __lhs.base() >= __rhs.base(); }

template<typename _Iterator, typename _Container>
  inline bool
  operator>=(const __normal_iterator<_Iterator, _Container>& __lhs,
      const __normal_iterator<_Iterator, _Container>& __rhs)
  { return __lhs.base() >= __rhs.base(); }

// _GLIBCXX_RESOLVE_LIB_DEFECTS
// According to the resolution of DR179 not only the various comparison
// operators but also operator- must accept mixed iterator/const_iterator
// parameters.
template<typename _IteratorL, typename _IteratorR, typename _Container>
881#if __cplusplus201103L >= 201103L
  // DR 685.
  inline auto
  operator-(const __normal_iterator<_IteratorL, _Container>& __lhs,
     const __normal_iterator<_IteratorR, _Container>& __rhs)
  -> decltype(__lhs.base() - __rhs.base())
887#else
  inline typename __normal_iterator<_IteratorL, _Container>::difference_type
  operator-(const __normal_iterator<_IteratorL, _Container>& __lhs,
     const __normal_iterator<_IteratorR, _Container>& __rhs)
891#endif
  { return __lhs.base() - __rhs.base(); }

template<typename _Iterator, typename _Container>
  inline typename __normal_iterator<_Iterator, _Container>::difference_type
  operator-(const __normal_iterator<_Iterator, _Container>& __lhs,
     const __normal_iterator<_Iterator, _Container>& __rhs)
  { return __lhs.base() - __rhs.base(); }

template<typename _Iterator, typename _Container>
  inline __normal_iterator<_Iterator, _Container>
  operator+(typename __normal_iterator<_Iterator, _Container>::difference_type
     __n, const __normal_iterator<_Iterator, _Container>& __i)
  { return __normal_iterator<_Iterator, _Container>(__i.base() + __n); }

906_GLIBCXX_END_NAMESPACE_VERSION
907} // namespace

909#if __cplusplus201103L >= 201103L

911namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
912{
913_GLIBCXX_BEGIN_NAMESPACE_VERSION

/**
 * @addtogroup iterators
 * @{
 */

// 24.4.3  Move iterators
/**
 *  Class template move_iterator is an iterator adapter with the same
 *  behavior as the underlying iterator except that its dereference
 *  operator implicitly converts the value returned by the underlying
 *  iterator's dereference operator to an rvalue reference.  Some
 *  generic algorithms can be called with move iterators to replace
 *  copying with moving.
 */
template<typename _Iterator>
  class move_iterator
  {
  protected:
    _Iterator _M_current;

    typedef iterator_traits<_Iterator>		__traits_type;

  public:
    typedef _Iterator					iterator_type;
    typedef typename __traits_type::iterator_category iterator_category;
    typedef typename __traits_type::value_type  	value_type;
    typedef typename __traits_type::difference_type	difference_type;
    // NB: DR 680.
    typedef _Iterator					pointer;
    typedef value_type&&				reference;

    move_iterator()
    : _M_current() { }

    explicit
    move_iterator(iterator_type __i)
    : _M_current(__i) { }

    template<typename _Iter>
move_iterator(const move_iterator<_Iter>& __i)
: _M_current(__i.base()) { }

    iterator_type
    base() const
    { return _M_current; }

    reference
    operator*() const
    { return std::move(*_M_current); }

    pointer
    operator->() const
    { return _M_current; }

    move_iterator&
    operator++()
    {
++_M_current;
return *this;
    }

    move_iterator
    operator++(int)
    {
move_iterator __tmp = *this;
++_M_current;
return __tmp;
    }

    move_iterator&
    operator--()
    {
--_M_current;
return *this;
    }

    move_iterator
    operator--(int)
    {
move_iterator __tmp = *this;
--_M_current;
return __tmp;
    }

    move_iterator
    operator+(difference_type __n) const
    { return move_iterator(_M_current + __n); }

    move_iterator&
    operator+=(difference_type __n)
    {
_M_current += __n;
return *this;
    }

    move_iterator
    operator-(difference_type __n) const
    { return move_iterator(_M_current - __n); }
  
    move_iterator&
    operator-=(difference_type __n)
    { 
_M_current -= __n;
return *this;
    }

    reference
    operator[](difference_type __n) const
    { return std::move(_M_current[__n]); }
  };

// Note: See __normal_iterator operators note from Gaby to understand
// why there are always 2 versions for most of the move_iterator
// operators.
template<typename _IteratorL, typename _IteratorR>
  inline bool
  operator==(const move_iterator<_IteratorL>& __x,
      const move_iterator<_IteratorR>& __y)
  { return __x.base() == __y.base(); }

template<typename _Iterator>
  inline bool
  operator==(const move_iterator<_Iterator>& __x,
      const move_iterator<_Iterator>& __y)
  { return __x.base() == __y.base(); }

template<typename _IteratorL, typename _IteratorR>
  inline bool
  operator!=(const move_iterator<_IteratorL>& __x,
      const move_iterator<_IteratorR>& __y)
  { return !(__x == __y); }

template<typename _Iterator>
  inline bool
  operator!=(const move_iterator<_Iterator>& __x,
      const move_iterator<_Iterator>& __y)
  { return !(__x == __y); }

template<typename _IteratorL, typename _IteratorR>
  inline bool
  operator<(const move_iterator<_IteratorL>& __x,
     const move_iterator<_IteratorR>& __y)
  { return __x.base() < __y.base(); }

template<typename _Iterator>
  inline bool
  operator<(const move_iterator<_Iterator>& __x,
     const move_iterator<_Iterator>& __y)
  { return __x.base() < __y.base(); }

template<typename _IteratorL, typename _IteratorR>
  inline bool
  operator<=(const move_iterator<_IteratorL>& __x,
      const move_iterator<_IteratorR>& __y)
  { return !(__y < __x); }

template<typename _Iterator>
  inline bool
  operator<=(const move_iterator<_Iterator>& __x,
      const move_iterator<_Iterator>& __y)
  { return !(__y < __x); }

template<typename _IteratorL, typename _IteratorR>
  inline bool
  operator>(const move_iterator<_IteratorL>& __x,
     const move_iterator<_IteratorR>& __y)
  { return __y < __x; }

template<typename _Iterator>
  inline bool
  operator>(const move_iterator<_Iterator>& __x,
     const move_iterator<_Iterator>& __y)
  { return __y < __x; }

template<typename _IteratorL, typename _IteratorR>
  inline bool
  operator>=(const move_iterator<_IteratorL>& __x,
      const move_iterator<_IteratorR>& __y)
  { return !(__x < __y); }

template<typename _Iterator>
  inline bool
  operator>=(const move_iterator<_Iterator>& __x,
      const move_iterator<_Iterator>& __y)
  { return !(__x < __y); }

// DR 685.
template<typename _IteratorL, typename _IteratorR>
  inline auto
  operator-(const move_iterator<_IteratorL>& __x,
     const move_iterator<_IteratorR>& __y)
  -> decltype(__x.base() - __y.base())
  { return __x.base() - __y.base(); }

template<typename _Iterator>
  inline auto
  operator-(const move_iterator<_Iterator>& __x,
     const move_iterator<_Iterator>& __y)
  -> decltype(__x.base() - __y.base())
  { return __x.base() - __y.base(); }

template<typename _Iterator>
  inline move_iterator<_Iterator>
  operator+(typename move_iterator<_Iterator>::difference_type __n,
     const move_iterator<_Iterator>& __x)
  { return __x + __n; }

template<typename _Iterator>
  inline move_iterator<_Iterator>
  make_move_iterator(_Iterator __i)
  { return move_iterator<_Iterator>(__i); }

template<typename _Iterator, typename _ReturnType
  = typename conditional<__move_if_noexcept_cond
    <typename iterator_traits<_Iterator>::value_type>::value,
              _Iterator, move_iterator<_Iterator>>::type>
  inline _ReturnType
  __make_move_if_noexcept_iterator(_Iterator __i)
  { return _ReturnType(__i); }

// @} group iterators

1137_GLIBCXX_END_NAMESPACE_VERSION
1138} // namespace

1140#define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter)std::make_move_iterator(_Iter) std::make_move_iterator(_Iter)
1141#define _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(_Iter)std::__make_move_if_noexcept_iterator(_Iter) \
std::__make_move_if_noexcept_iterator(_Iter)
1143#else
1144#define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter)std::make_move_iterator(_Iter) (_Iter)
1145#define _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(_Iter)std::__make_move_if_noexcept_iterator(_Iter) (_Iter)
1146#endif // C++11

1148#endif