LArSamples::PersistentAccessor Class Reference

#include <PersistentAccessor.h>

Inheritance diagram for LArSamples::PersistentAccessor:

Collaboration diagram for LArSamples::PersistentAccessor:

Public Member Functions
	PersistentAccessor (TTree &cellTree, TTree &SCTree, TTree &eventTree, TTree *runTree, TFile *file)
	Constructor More...
	PersistentAccessor (const TString &fileName)
	PersistentAccessor (const PersistentAccessor &)
PersistentAccessor &	operator= (const PersistentAccessor &)
virtual	~PersistentAccessor ()
unsigned int	historySize (unsigned int i) const
unsigned int	historySizeSC (unsigned int i) const
bool	save () const
const TTree &	cellTree () const
const TTree &	SCTree () const
const TTree &	eventTree () const
const TTree &	runTree () const
TFile *	file () const
TString	fileName () const
const HistoryContainer *	historyContainer (unsigned int i) const
const HistoryContainer *	historyContainerSC (unsigned int i) const
unsigned int	nEvents () const
const EventData *	eventData (unsigned int i) const
unsigned int	nRuns () const
const RunData *	runData (unsigned int i) const
void	add (HistoryContainer *cont)
void	addSC (HistoryContainer *cont)
void	addEvent (EventData *eventData)
void	addRun (RunData *runData)
HistoryContainer *	currentContainer () const
HistoryContainer *	currentContainerSC () const
int	getCellEntry (unsigned int i) const
int	getSCEntry (unsigned int i) const

Static Public Member Functions
static PersistentAccessor *	open (const TString &fileName)
static PersistentAccessor *	merge (const std::vector< const PersistentAccessor * > &accessors, const TString &fileName)
static PersistentAccessor *	merge (const std::vector< TString > &inputFiles, const TString &fileName)

Private Attributes
TTree *	m_cellTree
TTree *	m_SCTree
TTree *	m_eventTree
TTree *	m_runTree
TFile *	m_file
HistoryContainer *	m_historyCont
HistoryContainer *	m_historyContSC
EventData *	m_eventData
RunData *	m_runData
std::map< unsigned int, const RunData * >	m_runCache

Detailed Description

Definition at line 24 of file PersistentAccessor.h.

Constructor & Destructor Documentation

PersistentAccessor() [1/3]

PersistentAccessor::PersistentAccessor	(	TTree &	cellTree,
		TTree &	SCTree,
		TTree &	eventTree,
		TTree *	runTree,
		TFile *	file
	)

Constructor

Definition at line 26 of file PersistentAccessor.cxx.

  : m_cellTree(&cellTree), m_SCTree(&SCTree), m_eventTree(&eventTree), m_runTree(runTree), m_file(file), 
    m_historyCont(nullptr), m_historyContSC(nullptr), m_eventData(nullptr), m_runData(nullptr)
{
  ClassCounts::incrementInstanceCount("PersistentAccessor"); 
  m_cellTree->SetBranchAddress("history", &m_historyCont);
  m_SCTree->SetBranchAddress("historySC", &m_historyContSC);
  m_eventTree->SetBranchAddress("event", &m_eventData);
  m_eventTree->LoadBaskets(); // loads the tree to memory
  if (m_eventTree->MemoryFull(0)) {
    cout << "WARNING: could not load all the baskets of the event tree into memory -- processing will be very slow." << endl;
    cout << "Please check if the file you are loading is too large or corrupted." << endl;
  }
  if (m_runTree) {
    m_runTree->SetBranchAddress("run", &m_runData);
    m_runTree->LoadBaskets();
  }
}

PersistentAccessor() [2/3]

PersistentAccessor::PersistentAccessor

(

const TString &

fileName

)

Definition at line 46 of file PersistentAccessor.cxx.

  : m_cellTree(nullptr), m_SCTree(nullptr), m_eventTree(nullptr), m_runTree(nullptr), m_file(nullptr), 
    m_historyCont(nullptr), m_historyContSC(nullptr), m_eventData(nullptr), m_runData(nullptr)
{
  ClassCounts::incrementInstanceCount("PersistentAccessor"); 
  if (TString(fileName) != "") m_file = new TFile(fileName, "RECREATE");
  if (m_file && !m_file->IsOpen()) { delete m_file; m_file = nullptr; }
  m_cellTree = new TTree("cells", "");
  m_SCTree = new TTree("SC", "");
  m_eventTree = new TTree("events", "");
  m_runTree = new TTree("runs", "");
  m_cellTree->Branch("history", &m_historyCont, 32000, 0);
  m_SCTree->Branch("historySC", &m_historyContSC, 32000, 0);
  m_eventTree->Branch("event", &m_eventData, 32000, 0);
  m_runTree->Branch("run", &m_runData, 32000, 0);
  m_eventTree->SetAutoSave(0); // keep everything in memory
  m_eventTree->SetAutoFlush(0); // keep everything in memory
  m_runTree->SetAutoSave(0);   // keep everything in memory
  m_runTree->SetAutoFlush(0);   // keep everything in memory
}

PersistentAccessor() [3/3]

LArSamples::PersistentAccessor::PersistentAccessor

(

const PersistentAccessor &

)

~PersistentAccessor()

PersistentAccessor::~PersistentAccessor ( )

virtual

Definition at line 85 of file PersistentAccessor.cxx.

{
  ClassCounts::decrementInstanceCount("PersistentAccessor"); 
  for (std::map<unsigned int, const RunData*>::iterator run = m_runCache.begin();
      run != m_runCache.end(); ++run) 
    delete run->second;
  if (m_file) 
    delete m_file;
  else {
    delete m_cellTree;
    delete m_SCTree;
    delete m_eventTree;
    delete m_runTree;
  }
  if (m_historyCont) delete m_historyCont;
  if (m_historyContSC) delete m_historyContSC;
  if (m_eventData) delete m_eventData;
  if (m_runData) delete m_runData;
}

Member Function Documentation

add()

void PersistentAccessor::add

(

HistoryContainer *

cont

)

Definition at line 160 of file PersistentAccessor.cxx.

{
  m_historyCont = cont;
  m_cellTree->Fill();
  m_historyCont = nullptr;
}

addEvent()

void PersistentAccessor::addEvent

(

EventData *

eventData

)

Definition at line 175 of file PersistentAccessor.cxx.

{
  m_eventData = eventData;
  m_eventTree->Fill();
  m_eventData = nullptr;
}

addRun()

void PersistentAccessor::addRun

(

RunData *

runData

)

Definition at line 183 of file PersistentAccessor.cxx.

{
  m_runData = runData;
  m_runTree->Fill();
  m_runData = nullptr;
}

addSC()

void PersistentAccessor::addSC

(

HistoryContainer *

cont

)

Definition at line 167 of file PersistentAccessor.cxx.

{
  m_historyContSC = cont;
  m_SCTree->Fill();
  m_historyContSC = nullptr;
}

cellTree()

const TTree& LArSamples::PersistentAccessor::cellTree ( ) const

inline

Definition at line 44 of file PersistentAccessor.h.

{ return *m_cellTree; }

currentContainer()

HistoryContainer* LArSamples::PersistentAccessor::currentContainer ( ) const

inline

Definition at line 66 of file PersistentAccessor.h.

{ return m_historyCont; }

currentContainerSC()

HistoryContainer* LArSamples::PersistentAccessor::currentContainerSC ( ) const

inline

Definition at line 67 of file PersistentAccessor.h.

{ return m_historyContSC; }

eventData()

const EventData * PersistentAccessor::eventData

(

unsigned int

i

)

const

Definition at line 132 of file PersistentAccessor.cxx.

{
  if (i >= nEvents()) return nullptr;
  m_eventTree->GetEntry(i);
  m_eventData->setRunData(runData(m_eventData->runIndex()));
  return m_eventData;
}

eventTree()

const TTree& LArSamples::PersistentAccessor::eventTree ( ) const

inline

Definition at line 46 of file PersistentAccessor.h.

{ return *m_eventTree; }

file()

TFile* LArSamples::PersistentAccessor::file ( ) const

inline

Definition at line 49 of file PersistentAccessor.h.

{ return m_file; }

fileName()

TString PersistentAccessor::fileName

(

)

const

Definition at line 154 of file PersistentAccessor.cxx.

{ 
  return (m_file ? m_file->GetName() : ""); 
}

getCellEntry()

int LArSamples::PersistentAccessor::getCellEntry ( unsigned int  i ) const

inline

Definition at line 72 of file PersistentAccessor.h.

{ return m_cellTree->GetEntry(i); }

getSCEntry()

int LArSamples::PersistentAccessor::getSCEntry ( unsigned int  i ) const

inline

Definition at line 73 of file PersistentAccessor.h.

{ return m_SCTree->GetEntry(i); }

historyContainer()

const HistoryContainer * PersistentAccessor::historyContainer

(

unsigned int

i

)

const

Definition at line 106 of file PersistentAccessor.cxx.

{
  m_cellTree->GetEntry(i);
  return m_historyCont;
}

historyContainerSC()

const HistoryContainer * PersistentAccessor::historyContainerSC

(

unsigned int

i

)

const

Definition at line 112 of file PersistentAccessor.cxx.

{
  m_SCTree->GetEntry(i);
  return m_historyContSC;
}

historySize()

unsigned int PersistentAccessor::historySize

(

unsigned int

i

)

const

Definition at line 119 of file PersistentAccessor.cxx.

{
  const HistoryContainer* cont = historyContainer(i);
  return (cont ? cont->nDataContainers() : 0);
}

historySizeSC()

unsigned int PersistentAccessor::historySizeSC

(

unsigned int

i

)

const

Definition at line 125 of file PersistentAccessor.cxx.

{
  const HistoryContainer* cont = historyContainerSC(i);
  return (cont ? cont->nDataContainers() : 0);
}

merge() [1/2]

PersistentAccessor * PersistentAccessor::merge ( const std::vector< const PersistentAccessor * > &  accessors, const TString &  fileName  )

static

Definition at line 209 of file PersistentAccessor.cxx.

{
  PersistentAccessor* newAcc = new PersistentAccessor(fileName);
  unsigned int size = 0;
  CellInfo* info = nullptr;
 
  int evtIndex = 0, runIndex = 0;
  std::map<std::pair<int, int>, int> evtMap;
  std::map<int, int> runMap;
  std::map< std::pair<const PersistentAccessor*, int>, int > evtAccMap;
  
  cout << "Merging runs" << endl;
  for (const PersistentAccessor* accessor : accessors) {
    if (!accessor) {
      cout << "Cannot merge: one of the inputs is null!" << endl;
      delete newAcc;
      return nullptr;
    }
    for (unsigned int i = 0; i < accessor->nRuns(); i++) {
      int run = accessor->runData(i)->run();
      if (runMap.find(run) != runMap.end()) continue;
      runMap[run] = runIndex;
      RunData* newRun = new RunData(*accessor->runData(i));
      newAcc->addRun(newRun);
      delete newRun;
      runIndex++;
    }
  }
  
  cout << "Merging events" << endl;
  unsigned int nEventsTotal = 0, iEvt = 0;
  for (const PersistentAccessor* accessor : accessors) {
    nEventsTotal += accessor->nEvents();
  }
  for (const PersistentAccessor* accessor : accessors) {
    for (unsigned int i = 0; i < accessor->nEvents(); i++) {
      iEvt++;
      if (iEvt % 100000 == 0) cout << "Merging event " << iEvt << "/" << nEventsTotal << endl;
      std::pair<int, int> evtId(accessor->eventData(i)->run(), accessor->eventData(i)->event());
      std::pair<const PersistentAccessor*, int> evtAccId(accessor, i);
      if (evtMap.find(evtId) != evtMap.end()) {
        cout << "ERROR: Skipping duplicate entry for run " << accessor->eventData(i)->run() << ", event " << accessor->eventData(i)->event() << endl;
        continue;
      }
      evtAccMap[evtAccId] = evtIndex;
      evtMap[evtId] = evtIndex;
      std::map<int, int>::const_iterator idx = runMap.find(accessor->eventData(i)->run());
      int newRunIndex = (idx == runMap.end() ? -999 : idx->second);
      //cout << "Storing eventData for run " << accessor->eventData(i)->run() << " at index " << newRunIndex << " instead of " << accessor->eventData(i)->runIndex() << endl;
      EventData* newEvent = new EventData(*accessor->eventData(i), newRunIndex);
      newAcc->addEvent(newEvent);
      delete newEvent;
      evtIndex++;
    }
  } 
  
  
  cout << "Merging cells" << endl;
  for (unsigned int i = 0; i < Definitions::nChannels; i++) {
    if (i % 10000 == 0) {
      cout << "Merging channel " << i << "/" << Definitions::nChannels << " (current size = " << size << ")" << endl;
      //ClassCounts::printCountsTable();
    }
    HistoryContainer* newHistory = nullptr;
    for (const PersistentAccessor* accessor : accessors) {
      const HistoryContainer* history = accessor->historyContainer(i);
      if (!history || !history->isValid()) continue;
      if (!newHistory) {
        info = new CellInfo(*history->cellInfo());
        newHistory = new HistoryContainer(info);
      }
      for (unsigned int j = 0; j < history->nDataContainers(); j++) {
        DataContainer* newDC = new DataContainer(*history->dataContainer(j));
        std::map<std::pair<const PersistentAccessor*, int>, int>::const_iterator newIndex 
          = evtAccMap.find(std::make_pair(accessor, history->dataContainer(j)->eventIndex()));
        if (newIndex == evtAccMap.end()) cout << "Event not found for cell " << i << ", data " << j << "." << endl;
        newDC->setEventIndex(newIndex != evtAccMap.end() ? newIndex->second : -1);
        newHistory->add(newDC);
        if (!info->shape(history->dataContainer(j)->gain())) {
         const ShapeInfo* shape = history->cellInfo()->shape(history->dataContainer(j)->gain());
         //if (!shape) 
         //  cout << "Shape not filled for hash = " << i << ", index = " << j << ", gain = " << history->dataContainer(j)->gain() << endl;
         info->setShape(history->dataContainer(j)->gain(), (shape ? new ShapeInfo(*shape) : nullptr));
        }
      }
    }
    if (newHistory) size += newHistory->nDataContainers();
    newAcc->add(newHistory);
    delete newHistory;
  }
  
 
  cout << "Merging SC" << endl;
  for (unsigned int i = 0; i < Definitions::nChannelsSC; i++) {
    if (i % 10000 == 0) {
      cout << "Merging channel " << i << "/" << Definitions::nChannelsSC << " (current size = " << size << ")" << endl;
      //ClassCounts::printCountsTable();
    }
    HistoryContainer* newHistory = nullptr;
    for (const PersistentAccessor* accessor : accessors) {
      const HistoryContainer* history = accessor->historyContainerSC(i);
      if (!history || !history->isValid()) continue;
      if (!newHistory) {
        info = new CellInfo(*history->cellInfo());
        newHistory = new HistoryContainer(info);
      }
      for (unsigned int j = 0; j < history->nDataContainers(); j++) {
        DataContainer* newDC = new DataContainer(*history->dataContainer(j));
        std::map<std::pair<const PersistentAccessor*, int>, int>::const_iterator newIndex 
          = evtAccMap.find(std::make_pair(accessor, history->dataContainer(j)->eventIndex()));
        if (newIndex == evtAccMap.end()) cout << "Event not found for cell " << i << ", data " << j << "." << endl;
        newDC->setEventIndex(newIndex != evtAccMap.end() ? newIndex->second : -1);
        newHistory->add(newDC);
        if (!info->shape(history->dataContainer(j)->gain())) {
         const ShapeInfo* shape = history->cellInfo()->shape(history->dataContainer(j)->gain());
         //if (!shape) 
         //  cout << "Shape not filled for hash = " << i << ", index = " << j << ", gain = " << history->dataContainer(j)->gain() << endl;
         info->setShape(history->dataContainer(j)->gain(), (shape ? new ShapeInfo(*shape) : nullptr));
        }
      }
    }
    if (newHistory) size += newHistory->nDataContainers();
    newAcc->addSC(newHistory);
    delete newHistory;
  }
 
  cout << "Merging done, final size = " << size << endl;
  newAcc->save();
  return newAcc;
}

merge() [2/2]

PersistentAccessor * PersistentAccessor::merge ( const std::vector< TString > &  inputFiles, const TString &  fileName  )

static

Definition at line 342 of file PersistentAccessor.cxx.

{
  std::vector<const PersistentAccessor*> accessors;
  for (const TString& inputFile : inputFiles) {
    PersistentAccessor* accessor = open(inputFile);
    if (!accessor) {
      cout << "ERROR : could not open file " << inputFile << endl;
      return nullptr;
    }
    accessors.push_back(accessor);
  }
  PersistentAccessor* result = merge(accessors, fileName);
  for (const PersistentAccessor* accessor : accessors) {
    delete accessor;
  }
  return result;
}

nEvents()

unsigned int LArSamples::PersistentAccessor::nEvents ( ) const

inline

Definition at line 55 of file PersistentAccessor.h.

{ return m_eventTree->GetEntries(); }

nRuns()

unsigned int LArSamples::PersistentAccessor::nRuns ( ) const

inline

Definition at line 58 of file PersistentAccessor.h.

{ return m_runTree->GetEntries(); }

open()

PersistentAccessor * PersistentAccessor::open ( const TString &  fileName )

static

Definition at line 68 of file PersistentAccessor.cxx.

{
  TFile* file = TFile::Open(fileName);
  if (!file) return nullptr;
  if (!file->IsOpen()) { delete file; return nullptr; }
  TTree* cellTree = (TTree*)file->Get("cells");
  if (!cellTree) return nullptr;
  TTree* SCTree = (TTree*)file->Get("SC");
  if (!SCTree) return nullptr;
  TTree* eventTree = (TTree*)file->Get("events");
  if (!eventTree) return nullptr;
  TTree* runTree = (TTree*)file->Get("runs");
  PersistentAccessor* accessor = new PersistentAccessor(*cellTree, *SCTree, *eventTree, runTree, file);
  return accessor;
}

operator=()

PersistentAccessor& LArSamples::PersistentAccessor::operator=

(

const PersistentAccessor &

)

runData()

const RunData * PersistentAccessor::runData

(

unsigned int

i

)

const

Definition at line 141 of file PersistentAccessor.cxx.

{
  if (i >= nRuns()) return nullptr;
  std::map<unsigned int, const RunData*>::const_iterator cache = m_runCache.find(i);
  if (cache != m_runCache.end()) return cache->second;
 
  m_runTree->GetEntry(i);
  RunData* newRunData = new RunData(*m_runData);
  m_runCache[m_eventData->runIndex()] = newRunData;
  return newRunData;
}

runTree()

const TTree& LArSamples::PersistentAccessor::runTree ( ) const

inline

Definition at line 47 of file PersistentAccessor.h.

{ return *m_runTree; }

save()

bool PersistentAccessor::save

(

)

const

Definition at line 191 of file PersistentAccessor.cxx.

{
  if (!m_file) return 0;
  m_file->cd();
  cout << "Writing " << m_runTree->GetEntries() << " run(s)..." << endl;
  m_runTree->Write();
  cout << "Writing " << m_eventTree->GetEntries() << " event(s)..." << endl;
  m_eventTree->Write();
  cout << "Writing " << m_cellTree->GetEntries() << " cell(s)..." << endl;
  m_cellTree->Write();
  cout << "Writing " << m_SCTree->GetEntries() << " SC(s)..." << endl;
  m_SCTree->Write();
  m_file->Flush();
  cout << "Writing done!" << endl;
  return true;
}

SCTree()

const TTree& LArSamples::PersistentAccessor::SCTree ( ) const

inline

Definition at line 45 of file PersistentAccessor.h.

{ return *m_SCTree; }

Member Data Documentation

m_cellTree

TTree* LArSamples::PersistentAccessor::m_cellTree

private

Definition at line 77 of file PersistentAccessor.h.

m_eventData

EventData* LArSamples::PersistentAccessor::m_eventData

mutableprivate

Definition at line 81 of file PersistentAccessor.h.

m_eventTree

TTree * LArSamples::PersistentAccessor::m_eventTree

private

Definition at line 77 of file PersistentAccessor.h.

m_file

TFile* LArSamples::PersistentAccessor::m_file

mutableprivate

Definition at line 78 of file PersistentAccessor.h.

m_historyCont

HistoryContainer* LArSamples::PersistentAccessor::m_historyCont

mutableprivate

Definition at line 79 of file PersistentAccessor.h.

m_historyContSC

HistoryContainer* LArSamples::PersistentAccessor::m_historyContSC

mutableprivate

Definition at line 80 of file PersistentAccessor.h.

m_runCache

std::map<unsigned int, const RunData*> LArSamples::PersistentAccessor::m_runCache

mutableprivate

Definition at line 83 of file PersistentAccessor.h.

m_runData

RunData* LArSamples::PersistentAccessor::m_runData

mutableprivate

Definition at line 82 of file PersistentAccessor.h.

m_runTree

TTree * LArSamples::PersistentAccessor::m_runTree

private

Definition at line 77 of file PersistentAccessor.h.

m_SCTree

TTree * LArSamples::PersistentAccessor::m_SCTree

private

Definition at line 77 of file PersistentAccessor.h.

---

The documentation for this class was generated from the following files:

• PersistentAccessor.h
• PersistentAccessor.cxx