38 class ConsumesCollector;
98 int*
tmp =
new int[2];
105 time_t* tmptime =
new time_t[2];
125 for (std::map<
int, std::vector<BeamSpotFitPVData> >::const_iterator pvStore =
bxMap_.begin();
177 std::map<int, std::vector<BeamSpotFitPVData> >
bxMap_;
std::vector< double > pvQualities_
void setFitLSRange(int ls0, int ls1)
void setTree(TTree *tree)
const std::map< int, int > & getNPVsperBX()
void initialize(const edm::ParameterSet &iConfig, edm::ConsumesCollector &iColl)
std::map< int, std::vector< BeamSpotFitPVData > > bxMap_
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)
std::unique_ptr< TH2F > hPVx
BeamSpotTreeData theBeamSpotTreeData_
bool fFitPerBunchCrossing
edm::EDGetTokenT< reco::VertexCollection > vertexToken_
double pvQuality(const reco::Vertex &pv) const
vertex quality measure
std::map< int, reco::BeamSpot > fbspotMap
void setRefTime(std::time_t t0, std::time_t t1)
unsigned int maxNrVertices_
std::vector< BeamSpotFitPVData > getpvStore()
static void fillDescription(edm::ParameterSetDescription &)
unsigned int minVtxTracks_
std::unique_ptr< TH2F > hPVy
void resizepvStore(unsigned int rmSize)
unsigned int minNrVertices_
reco::BeamSpot getBeamSpot()
std::map< int, int > npvsmap_
tuple size
Write out results.
bool IsFitPerBunchCrossing()