#include <PileUpProducer.h>

Inheritance diagram for PileUpProducer:

Public Member Functions
virtual void	beginLuminosityBlock (edm::LuminosityBlock const &, edm::EventSetup const &) override

virtual void	beginRun (edm::Run const &, edm::EventSetup const &) override

virtual void	endRun (edm::Run const &, edm::EventSetup const &) override

	PileUpProducer (edm::ParameterSet const &p)

virtual void	produce (edm::Event &e, const edm::EventSetup &c) override

virtual	~PileUpProducer ()

Public Member Functions inherited from edm::EDProducer
	EDProducer ()

ModuleDescription const &	moduleDescription () const

virtual	~EDProducer ()

Public Member Functions inherited from edm::ProducerBase
	ProducerBase ()

void	registerProducts (ProducerBase , ProductRegistry , ModuleDescription const &)

std::function< void(BranchDescription const &)>	registrationCallback () const
	used by the fwk to register list of products More...

virtual	~ProducerBase ()

Public Member Functions inherited from edm::EDConsumerBase
	EDConsumerBase ()

ProductHolderIndexAndSkipBit	indexFrom (EDGetToken, BranchType, TypeID const &) const

void	itemsMayGet (BranchType, std::vector< ProductHolderIndexAndSkipBit > &) const

void	itemsToGet (BranchType, std::vector< ProductHolderIndexAndSkipBit > &) const

std::vector < ProductHolderIndexAndSkipBit > const &	itemsToGetFromEvent () const

void	labelsForToken (EDGetToken iToken, Labels &oLabels) const

void	modulesDependentUpon (const std::string &iProcessName, std::vector< const char * > &oModuleLabels) const

bool	registeredToConsume (ProductHolderIndex, bool, BranchType) const

bool	registeredToConsumeMany (TypeID const &, BranchType) const

void	updateLookup (BranchType iBranchType, ProductHolderIndexHelper const &)

virtual	~EDConsumerBase ()

Private Member Functions
bool	read (std::string inputFile)
	Read former minbias configuration (from previous run) More...

void	save ()
	Save current minbias configuration (for later use) More...

Private Attributes
double	averageNumber_

bool	currentValuesWereSet

std::vector< double >	dataProb

std::vector< int >	dataProbFunctionVar

TH1F *	hprob

std::string	inputFile

unsigned	myOutputBuffer

std::ofstream	myOutputFile

int	probSize

std::vector< TBranch * >	theBranches

std::vector< unsigned >	theCurrentEntry

std::vector< unsigned >	theCurrentMinBiasEvt

std::vector< std::string >	theFileNames

std::vector< TFile * >	theFiles

std::vector< unsigned >	theNumberOfEntries

unsigned	theNumberOfFiles

std::vector< unsigned >	theNumberOfMinBiasEvts

std::vector< PUEvent * >	thePUEvents

std::vector< TTree * >	theTrees

PrimaryVertexGenerator *	theVertexGenerator

bool	usePoisson_

int	varSize

Additional Inherited Members
Public Types inherited from edm::EDProducer
typedef EDProducer	ModuleType

Public Types inherited from edm::ProducerBase
typedef ProductRegistryHelper::TypeLabelList	TypeLabelList

Static Public Member Functions inherited from edm::EDProducer
static const std::string &	baseType ()

static void	fillDescriptions (ConfigurationDescriptions &descriptions)

static void	prevalidate (ConfigurationDescriptions &descriptions)

Protected Member Functions inherited from edm::ProducerBase
void	callWhenNewProductsRegistered (std::function< void(BranchDescription const &)> const &func)

Protected Member Functions inherited from edm::EDConsumerBase
template<typename ProductType , BranchType B = InEvent>
EDGetTokenT< ProductType >	consumes (edm::InputTag const &tag)

EDGetToken	consumes (const TypeToGet &id, edm::InputTag const &tag)

template<BranchType B>
EDGetToken	consumes (TypeToGet const &id, edm::InputTag const &tag)

ConsumesCollector	consumesCollector ()
	Use a ConsumesCollector to gather consumes information from helper functions. More...

template<typename ProductType , BranchType B = InEvent>
void	consumesMany ()

void	consumesMany (const TypeToGet &id)

template<BranchType B>
void	consumesMany (const TypeToGet &id)

template<typename ProductType , BranchType B = InEvent>
EDGetTokenT< ProductType >	mayConsume (edm::InputTag const &tag)

EDGetToken	mayConsume (const TypeToGet &id, edm::InputTag const &tag)

template<BranchType B>
EDGetToken	mayConsume (const TypeToGet &id, edm::InputTag const &tag)

Detailed Description

Definition at line 27 of file PileUpProducer.h.

Constructor & Destructor Documentation

PileUpProducer::PileUpProducer ( edm::ParameterSet const & p )

explicit

Definition at line 29 of file PileUpProducer.cc.

References averageNumber_, gather_cfg::cout, dataProb, dataProbFunctionVar, alignCSCRings::e, edm::hlt::Exception, edm::ParameterSet::getParameter(), edm::ParameterSet::getUntrackedParameter(), hprob, i, inputFile, j, LogDebug, probSize, AlCaHLTBitMon_QueryRunRegistry::string, theBranches, theCurrentEntry, theCurrentMinBiasEvt, theFileNames, theFiles, theNumberOfEntries, theNumberOfFiles, theNumberOfMinBiasEvts, thePUEvents, theTrees, theVertexGenerator, usePoisson_, varSize, SiStripMonitorClusterAlca_cfi::xmax, and SiStripMonitorClusterAlca_cfi::xmin.

                                                         : hprob(0), currentValuesWereSet(false)
 {    
 
   // This producer produces an object PileupMixingContent, needed by PileupSummaryInfo
   produces<PileupMixingContent>();
   // This producer produces a HepMCProduct, with all pileup vertices/particles
   produces<edm::HepMCProduct>("PileUpEvents");
   
   // Initialize the random number generator service
   edm::Service<edm::RandomNumberGenerator> rng;
   if ( ! rng.isAvailable() ) {
     throw cms::Exception("Configuration")
       << "PileUpProducer requires the RandomGeneratorService\n"
          "which is not present in the configuration file.\n"
          "You must add the service in the configuration file\n"
          "or remove the module that requires it";
   }
 
   // RANDOM_NUMBER_ERROR
   // Random number should be generated by the engines from the
   // RandomNumberGeneratorService. This appears to use the global
   // engine in ROOT. This is not thread safe unless the module using
   // it is a one module and declares a shared resource and all
   // other modules using it also declare the same shared resource.
   // This also breaks replay.
   gRandom->SetSeed(rng->mySeed());
 
   // The pile-up event generation condition
   const edm::ParameterSet& pu = p.getParameter<edm::ParameterSet>("PileUpSimulator");
   usePoisson_ = pu.getParameter<bool>("usePoisson");
   averageNumber_ = 0.;
   if (usePoisson_) {
     std::cout << " FastSimulation/PileUpProducer -> poissonian distribution" << std::endl;
     averageNumber_ = pu.getParameter<double>("averageNumber");
   } else {//take distribution from configuration
     dataProbFunctionVar = pu.getParameter<std::vector<int> >("probFunctionVariable");
     dataProb = pu.getParameter<std::vector<double> >("probValue");
     varSize = (int) dataProbFunctionVar.size();
     probSize = (int) dataProb.size();
     //    std::cout << " FastSimulation/PileUpProducer -> varSize = " << varSize  << std::endl;
     //    std::cout << " FastSimulation/PileUpProducer -> probSize = " << probSize  << std::endl;
     
     std::cout << " FastSimulation/PileUpProducer -> distribution from configuration file "  << std::endl;
     if (probSize < varSize){
       for (int i=0; i<(varSize - probSize); i++) dataProb.push_back(0);
       edm::LogWarning("") << " The probability function data will be completed with " 
               << (varSize - probSize) <<" values `0';"
                           << " the number of the P(x) data set after adding those 0's is " << dataProb.size();
       probSize = dataProb.size();
     }
     // Create an histogram with the data from the probability function provided by the user  
     int xmin = (int) dataProbFunctionVar[0];
     int xmax = (int) dataProbFunctionVar[varSize-1]+1;  // need upper edge to be one beyond last value
     int numBins = varSize;
     std::cout << " FastSimulation/PileUpProducer -> An histogram will be created with " << numBins 
           << " bins in the range ("<< xmin << "," << xmax << ")." << std::endl;
     hprob = new TH1F("h","Histo from the user's probability function",numBins,xmin,xmax); 
     LogDebug("") << " FastSimulation/PileUpProducer -> Filling histogram with the following data:";
     for (int j=0; j < numBins ; j++){
       LogDebug("") << " x = " << dataProbFunctionVar[j ]<< " P(x) = " << dataProb[j];
       hprob->Fill(dataProbFunctionVar[j]+0.5,dataProb[j]); // assuming integer values for the bins, fill bin centers, not edges 
     }
 
     // Check if the histogram is normalized
     if (((hprob->Integral() - 1) > 1.0e-02) && ((hprob->Integral() - 1) < -1.0e-02)) throw cms::Exception("BadHistoDistribution") << "The histogram should be normalized!" << std::endl;
     
     // Get the averageNumber from the histo 
     averageNumber_ = hprob->GetMean();
   }
   theFileNames = pu.getUntrackedParameter<std::vector<std::string> >("fileNames");
   inputFile = pu.getUntrackedParameter<std::string>("inputFile");
   theNumberOfFiles = theFileNames.size();
   theFiles.resize(theNumberOfFiles);
   theTrees.resize(theNumberOfFiles);
   theBranches.resize(theNumberOfFiles);
   thePUEvents.resize(theNumberOfFiles);
   theCurrentEntry.resize(theNumberOfFiles);
   theCurrentMinBiasEvt.resize(theNumberOfFiles);
   theNumberOfEntries.resize(theNumberOfFiles);
   theNumberOfMinBiasEvts.resize(theNumberOfFiles);
 
   // Initialize the primary vertex generator
   const edm::ParameterSet& vtx = p.getParameter<edm::ParameterSet>("VertexGenerator");
   std::string vtxType = vtx.getParameter<std::string>("type");
   if ( vtxType == "Gaussian" ) 
     theVertexGenerator = new GaussianPrimaryVertexGenerator(vtx);
   else if ( vtxType == "Flat" ) 
     theVertexGenerator = new FlatPrimaryVertexGenerator(vtx);
   else if ( vtxType == "BetaFunc" )
     theVertexGenerator = new BetaFuncPrimaryVertexGenerator(vtx);
   else
     theVertexGenerator = new NoPrimaryVertexGenerator();
 
 
 
   if (averageNumber_ > 0.)
     {
       std::cout << " FastSimulation/PileUpProducer -> MinBias events taken from " << theFileNames[0] << " et al., " ;
       std::cout << " with an average number of events of " << averageNumber_ << std::endl;
     }
   else std::cout << " FastSimulation/PileUpProducer -> No pileup " << std::endl;
 
 
 }

PileUpProducer::~PileUpProducer ( )

virtual

Definition at line 134 of file PileUpProducer.cc.

References hprob, and theVertexGenerator.

                                 { 
 
   delete theVertexGenerator;
   if (hprob) delete hprob;
 
 }

Member Function Documentation

void PileUpProducer::beginLuminosityBlock	(	edm::LuminosityBlock const &	lumi,
		edm::EventSetup const &
	)

overridevirtual

Reimplemented from edm::EDProducer.

Definition at line 193 of file PileUpProducer.cc.

References currentValuesWereSet, mergeVDriftHistosByStation::file, edm::LuminosityBlock::index(), random, theCurrentEntry, theCurrentMinBiasEvt, theNumberOfEntries, theNumberOfFiles, theNumberOfMinBiasEvts, thePUEvents, and theTrees.

                                                                                               {
   if ( !currentValuesWereSet ) {
     currentValuesWereSet = true;
 
     RandomEngineAndDistribution random(lumi.index());
 
     for ( unsigned file=0; file < theNumberOfFiles; ++file ) {
       theCurrentEntry[file] =
         (unsigned) (theNumberOfEntries[file] * random.flatShoot());
 
       theTrees[file]->GetEntry(theCurrentEntry[file]);
       unsigned NMinBias = thePUEvents[file]->nMinBias();
       theNumberOfMinBiasEvts[file] = NMinBias;
 
       theCurrentMinBiasEvt[file] =
         (unsigned) (theNumberOfMinBiasEvts[file] * random.flatShoot());
     }
   }
 }

void PileUpProducer::beginRun	(	edm::Run const &	,
		edm::EventSetup const &
	)

overridevirtual

Reimplemented from edm::EDProducer.

Definition at line 141 of file PileUpProducer.cc.

References gather_cfg::cout, currentValuesWereSet, edm::hlt::Exception, mergeVDriftHistosByStation::file, spr::find(), contentValuesFiles::fullPath, edm::FileInPath::fullPath(), inputFile, myOutputBuffer, myOutputFile, read(), AlCaHLTBitMon_QueryRunRegistry::string, theBranches, theCurrentEntry, theFileNames, theFiles, theNumberOfEntries, theNumberOfFiles, theNumberOfMinBiasEvts, thePUEvents, and theTrees.

 {
   std::string fullPath;
   
   // Read the information from a previous run (to keep reproducibility)
   currentValuesWereSet = this->read(inputFile);
   if ( currentValuesWereSet )
     std::cout << "***WARNING*** You are reading pile-up information from the file "
           << inputFile << " created in an earlier run."
           << std::endl;
 
   // Open the file for saving the information of the current run
   myOutputFile.open ("PileUpOutputFile.txt");
   myOutputBuffer = 0;
 
   // Open the root files
   for ( unsigned file=0; file<theNumberOfFiles; ++file ) {
 
     if (theFileNames[file].find("file:")==0) {
       fullPath = theFileNames[file].erase(0,5);
     }
     else {
       edm::FileInPath myDataFile("FastSimulation/PileUpProducer/data/"+theFileNames[file]);
       fullPath = myDataFile.fullPath();
     }
     //    theFiles[file] = TFile::Open(theFileNames[file].c_str());
     theFiles[file] = TFile::Open(fullPath.c_str());
     if ( !theFiles[file] ) throw cms::Exception("FastSimulation/PileUpProducer") 
       << "File " << theFileNames[file] << " " << fullPath <<  " not found ";
     //
     theTrees[file] = (TTree*) theFiles[file]->Get("MinBiasEvents"); 
     if ( !theTrees[file] ) throw cms::Exception("FastSimulation/PileUpProducer") 
       << "Tree with name MinBiasEvents not found in " << theFileNames[file];
     //
     theBranches[file] = theTrees[file]->GetBranch("puEvent");
     if ( !theBranches[file] ) throw cms::Exception("FastSimulation/PileUpProducer") 
       << "Branch with name puEvent not found in " << theFileNames[file];
     //
     thePUEvents[file] = new PUEvent();
     theBranches[file]->SetAddress(&thePUEvents[file]);
     //
     theNumberOfEntries[file] = theTrees[file]->GetEntries();
 
     if ( currentValuesWereSet ) {
       theTrees[file]->GetEntry(theCurrentEntry[file]);
       unsigned NMinBias = thePUEvents[file]->nMinBias();
       theNumberOfMinBiasEvts[file] = NMinBias;
     }
   }
   gROOT->cd();
 }

void PileUpProducer::endRun	(	edm::Run const &	,
		edm::EventSetup const &
	)

overridevirtual

Reimplemented from edm::EDProducer.

Definition at line 213 of file PileUpProducer.cc.

References mergeVDriftHistosByStation::file, myOutputFile, and theFiles.

 { 
   // Close all local files
   // Among other things, this allows the TROOT destructor to end up 
   // without crashing, while trying to close these files from outside
   for ( unsigned file=0; file<theFiles.size(); ++file ) {
     
     // std::cout << "Closing " << theFileNames[file] << std::endl;
     theFiles[file]->Close();
     
   }
   
   // Close the output file
   myOutputFile.close();
 }

void PileUpProducer::produce	(	edm::Event &	e,
		const edm::EventSetup &	c
	)

overridevirtual

Implements edm::EDProducer.

Definition at line 229 of file PileUpProducer.cc.

References averageNumber_, PrimaryVertexGenerator::boost(), funct::cos(), relval_parameters_module::energy, mergeVDriftHistosByStation::file, PUEvent::PUMinBiasEvt::first, PrimaryVertexGenerator::generate(), configurableAnalysis::GenParticle, hprob, PUEvent::PUParticle::id, PUEvent::PUParticle::mass, edm::Event::put(), PUEvent::PUParticle::px, PUEvent::PUParticle::py, PUEvent::PUParticle::pz, random, save(), funct::sin(), PUEvent::PUMinBiasEvt::size, mathSSE::sqrt(), edm::Event::streamID(), theCurrentEntry, theCurrentMinBiasEvt, theNumberOfEntries, theNumberOfFiles, theNumberOfMinBiasEvts, thePUEvents, theTrees, theVertexGenerator, and usePoisson_.

Referenced by JSONExport.JsonExport::export(), HTMLExport.HTMLExport::export(), and HTMLExport.HTMLExportStatic::export().

 {
   // Create the GenEvent and the HepMCProduct
   std::auto_ptr<edm::HepMCProduct> pu_product(new edm::HepMCProduct());  
   HepMC::GenEvent* evt = new HepMC::GenEvent();
   
   RandomEngineAndDistribution random(iEvent.streamID());
 
   // How many pile-up events?
   int PUevts; float truePUevts;
   if (usePoisson_) {
     PUevts = (int) random.poissonShoot(averageNumber_);
     truePUevts = (float) averageNumber_;
   }
   else {
     // RANDOM_NUMBER_ERROR
     // Random number should be generated by the engines from the
     // RandomNumberGeneratorService. This appears to use the global
     // engine in ROOT. This is not thread safe unless the module using
     // it is a one module and declares a shared resource and all
     // other modules using it also declare the same shared resource.
     // This also breaks replay.
     float d = (float) hprob->GetRandom();
     PUevts = (int) d;
     truePUevts = d;
   }
   //  std::cout << "PUevts = " << PUevts << std::endl;
 
   // Save this information in the PileupMixingContent object
   // IMPORTANT: the bunch crossing number is always 0 because FastSim has no out-of-time PU
   std::auto_ptr< PileupMixingContent > PileupMixing_;
 
   std::vector<int> bunchCrossingList;
   bunchCrossingList.push_back(0);
 
   std::vector<int> numInteractionList;
   numInteractionList.push_back(PUevts);
   
   std::vector<float> trueInteractionList;
   trueInteractionList.push_back(truePUevts);
   
   PileupMixing_ = std::auto_ptr< PileupMixingContent >(new PileupMixingContent(bunchCrossingList,numInteractionList,trueInteractionList));
   iEvent.put(PileupMixing_);
 
   // Get N events from random files
   for ( int ievt=0; ievt<PUevts; ++ievt ) { 
     
     // Draw a file in a ramdom manner 
     unsigned file = (unsigned) (theNumberOfFiles * random.flatShoot());
     /*
     if ( debug )  
       std::cout << "The file chosen for event " << ievt 
         << " is the file number " << file << std::endl; 
     */
 
     // Smear the primary vertex and express it in mm (stupid GenEvent convention...)
     theVertexGenerator->generate(&random);
     HepMC::FourVector smearedVertex =  
       HepMC::FourVector(theVertexGenerator->X()*10.,
             theVertexGenerator->Y()*10.,
             theVertexGenerator->Z()*10.,
             0.);
     HepMC::GenVertex* aVertex = new HepMC::GenVertex(smearedVertex);
     evt->add_vertex(aVertex);
 
     // Some rotation around the z axis, for more randomness
     double theAngle = random.flatShoot() * 2. * 3.14159265358979323;
     double cAngle = std::cos(theAngle);
     double sAngle = std::sin(theAngle);
 
     /*
     if ( debug ) 
       std::cout << "File chosen : " << file 
         << " Current entry in this file " << theCurrentEntry[file] 
         << " Current minbias in this chunk= " << theCurrentMinBiasEvt[file] 
         << " Total number of minbias in this chunk = " << theNumberOfMinBiasEvts[file] << std::endl;
     */
 
     //      theFiles[file]->cd();
     //      gDirectory->ls();
     // Check we are not either at the end of a minbias bunch 
     // or at the end of a file
     if ( theCurrentMinBiasEvt[file] == theNumberOfMinBiasEvts[file] ) {
       // if ( debug ) std::cout << "End of MinBias bunch ! ";
       ++theCurrentEntry[file];
       // if ( debug) std::cout << "Read the next entry " << theCurrentEntry[file] << std::endl;
       theCurrentMinBiasEvt[file] = 0;
       if ( theCurrentEntry[file] == theNumberOfEntries[file] ) { 
     theCurrentEntry[file] = 0;
     // if ( debug ) std::cout << "End of file - Rewind! " << std::endl;
       }
       // if ( debug ) std::cout << "The PUEvent is reset ... "; 
       thePUEvents[file]->reset();
       unsigned myEntry = theCurrentEntry[file];
       /* 
       if ( debug ) std::cout << "The new entry " << myEntry 
                  << " is read ... in TTree " << theTrees[file] << " "; 
       */
       theTrees[file]->GetEntry(myEntry);
       /*
       if ( debug ) 
     std::cout << "The number of interactions in the new entry is ... ";     
       */
       theNumberOfMinBiasEvts[file] = thePUEvents[file]->nMinBias();
       // if ( debug ) std::cout << theNumberOfMinBiasEvts[file] << std::endl;
     }
   
     // Read a minbias event chunk
     const PUEvent::PUMinBiasEvt& aMinBiasEvt 
       = thePUEvents[file]->thePUMinBiasEvts()[theCurrentMinBiasEvt[file]];
   
     // Find corresponding particles
     unsigned firstTrack = aMinBiasEvt.first; 
     unsigned trackSize = firstTrack + aMinBiasEvt.size;
     /*
     if ( debug ) std::cout << "First and last+1 tracks are " 
                << firstTrack << " " << trackSize << std::endl;
     */
 
     // Loop on particles
     for ( unsigned iTrack=firstTrack; iTrack<trackSize; ++iTrack ) {
       
       const PUEvent::PUParticle& aParticle 
     = thePUEvents[file]->thePUParticles()[iTrack];
       /*
       if ( debug) 
     std::cout << "Track " << iTrack 
           << " id/px/py/pz/mass "
           << aParticle.id << " " 
           << aParticle.px << " " 
           << aParticle.py << " " 
           << aParticle.pz << " " 
           << aParticle.mass << " " << std::endl; 
       */
       
       // Create a FourVector, with rotation 
       double energy = std::sqrt( aParticle.px*aParticle.px
                    + aParticle.py*aParticle.py
                    + aParticle.pz*aParticle.pz
                    + aParticle.mass*aParticle.mass );
 
       HepMC::FourVector myPart(cAngle * aParticle.px + sAngle * aParticle.py,
                   -sAngle * aParticle.px + cAngle * aParticle.py,
                    aParticle.pz, energy);
 
       // Add a GenParticle
       HepMC::GenParticle* aGenParticle = new HepMC::GenParticle(myPart,aParticle.id);
       aVertex->add_particle_out(aGenParticle);
 
     }
     // End of particle loop
 
     // ERROR The way this loops through the pileup events breaks
     // replay. Which events are retrieved for pileup depends on
     // which previous events were processed.
 
     // Increment for next time
     ++theCurrentMinBiasEvt[file];
     
   }
   // End of pile-up event loop
 
   // evt->print();
 
   // Fill the HepMCProduct from the GenEvent
   if ( evt )  { 
     pu_product->addHepMCData( evt );
     // Boost in case of beam crossing angle
     TMatrixD* boost = theVertexGenerator->boost();
     if ( boost ) pu_product->boostToLab(boost,"momentum");
   }
 
   // Put the HepMCProduct onto the event
   iEvent.put(pu_product,"PileUpEvents");
   // delete evt;
 
   // Save the current location in each pile-up event files
   this->save();
 
 }

bool PileUpProducer::read ( std::string inputFile )

private

Read former minbias configuration (from previous run)

Definition at line 433 of file PileUpProducer.cc.

References python.entryComment::results, findQualityFiles::size, theCurrentEntry, and theCurrentMinBiasEvt.

Referenced by beginRun(), Vispa.Plugins.EdmBrowser.EdmDataAccessor.EdmDataAccessor::goto(), and Vispa.Plugins.EdmBrowser.EdmDataAccessor.EdmDataAccessor::setFilterBranches().

                                         {
 
   std::ifstream myInputFile;
   struct stat results;
   unsigned size1 = theCurrentEntry.size()*sizeof(unsigned);
   unsigned size2 = theCurrentMinBiasEvt.size()*sizeof(unsigned);
   unsigned size = 0;
 
 
   // Open the file (if any)
   myInputFile.open (inputFile.c_str());
   if ( myInputFile.is_open() ) { 
 
     // Get the size of the file
     if ( stat(inputFile.c_str(), &results) == 0 ) size = results.st_size;
     else return false; // Something is wrong with that file !
   
     // Position the pointer just before the last record
     myInputFile.seekg(size-size1-size2);
 
     // Read the information
     myInputFile.read((char*)(&theCurrentEntry.front()),size1);
     myInputFile.read((char*)&theCurrentMinBiasEvt.front(),size2);
     myInputFile.close();
 
     return true;
 
   } 
 
   return false;
 
 }

void PileUpProducer::save ( )

private

Save current minbias configuration (for later use)

Definition at line 411 of file PileUpProducer.cc.

References myOutputBuffer, myOutputFile, theCurrentEntry, and theCurrentMinBiasEvt.

Referenced by Vispa.Main.TabController.TabController::allowClose(), Vispa.Main.TabController.TabController::checkModificationTimestamp(), and produce().

                      {
 
   // Size of buffer
   ++myOutputBuffer;
 
   // Periodically close the current file and open a new one
   if ( myOutputBuffer/1000*1000 == myOutputBuffer ) { 
     myOutputFile.close();
     myOutputFile.open ("PileUpOutputFile.txt");
     //    myOutputFile.seekp(0); // No need to rewind in that case
   }
 
   // Save the current position to file
   myOutputFile.write((const char*)(&theCurrentEntry.front()),
              theCurrentEntry.size()*sizeof(unsigned));
   myOutputFile.write((const char*)&theCurrentMinBiasEvt.front(),
              theCurrentMinBiasEvt.size()*sizeof(unsigned));
   myOutputFile.flush();
 
 }