37 class ConsumesCollector;
53 void setTree(TTree*
tree);
62 std::vector<BeamSpotFitPVData>
getpvStore() {
return pvStore_; }
75 fbeginLumiOfFit = ls0;
85 dynamicQualityCut_ = 1.e30;
95 int*
tmp =
new int[2];
96 tmp[0] = fbeginLumiOfFit;
97 tmp[1] = fendLumiOfFit;
102 time_t* tmptime =
new time_t[2];
103 tmptime[0] = freftime[0];
104 tmptime[1] = freftime[1];
109 void resizepvStore(
unsigned int rmSize) { pvStore_.erase(pvStore_.begin(), pvStore_.begin() + rmSize); }
112 void compressStore();
122 for (
std::map<
int, std::vector<BeamSpotFitPVData> >::const_iterator pvStore = bxMap_.begin();
123 pvStore != bxMap_.end();
125 npvsmap_[pvStore->first] = (pvStore->second).
size();
156 std::time_t freftime[2];
174 std::map<int, std::vector<BeamSpotFitPVData> >
bxMap_;
std::vector< double > pvQualities_
static AlgebraicMatrix initialize()
void setFitLSRange(int ls0, int ls1)
const std::map< int, int > & getNPVsperBX()
std::map< int, std::vector< BeamSpotFitPVData > > bxMap_
std::map< int, reco::BeamSpot > getBeamSpotMap()
void FitPerBunchCrossing()
double dynamicQualityCut_
std::vector< BeamSpotFitPVData > pvStore_
BeamSpotTreeData theBeamSpotTreeData_
bool fFitPerBunchCrossing
edm::EDGetTokenT< reco::VertexCollection > vertexToken_
std::map< int, reco::BeamSpot > fbspotMap
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_
reco::BeamSpot getBeamSpot()
std::map< int, int > npvsmap_
bool IsFitPerBunchCrossing()