96 time_t *tmptime=
new time_t[2];
120 for (
std::map<
int,std::vector<BeamSpotFitPVData> >::const_iterator pvStore =
bxMap_.begin();
121 pvStore!=
bxMap_.end(); ++pvStore) {
197 std::map< int, std::vector<BeamSpotFitPVData> >
bxMap_;
std::vector< double > pvQualities_
void setFitLSRange(int ls0, int ls1)
void setTree(TTree *tree)
std::map< int, std::vector< BeamSpotFitPVData > > bxMap_
const std::map< int, int > & getNPVsperBX()
edm::InputTag vertexLabel_
void compressStore()
reduce size of primary vertex cache by increasing quality limit
std::map< int, reco::BeamSpot > getBeamSpotMap()
void FitPerBunchCrossing()
double dynamicQualityCut_
std::vector< BeamSpotFitPVData > pvStore_
void readEvent(const edm::Event &iEvent)
BeamSpotTreeData theBeamSpotTreeData_
bool fFitPerBunchCrossing
std::map< int, reco::BeamSpot > fbspotMap
double pvQuality(const reco::Vertex &pv) const
vertex quality measure
void setRefTime(std::time_t t0, std::time_t t1)
unsigned int maxNrVertices_
std::vector< BeamSpotFitPVData > getpvStore()
unsigned int minVtxTracks_
void resizepvStore(unsigned int rmSize)
unsigned int minNrVertices_
std::vector< std::vector< double > > tmp
reco::BeamSpot getBeamSpot()
std::map< int, int > npvsmap_
tuple size
Write out results.
bool IsFitPerBunchCrossing()