LArSamples::TreeAccessor Class Reference

#include <TreeAccessor.h>

Inheritance diagram for LArSamples::TreeAccessor:

Collaboration diagram for LArSamples::TreeAccessor:

Public Member Functions
	TreeAccessor (TTree &cellTree, TTree &scTree, TTree &eventTree, TTree *runTree, TFile *file)
	Constructor.
	TreeAccessor (const TString &fileName)
virtual	~TreeAccessor ()
bool	writeToFile (const TString &fileName) const
unsigned int	historySize (unsigned int i) const
unsigned int	historySizeSC (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)
const History *	getCellHistory (unsigned int i) const
const History *	getSCHistory (unsigned int i) const
const CellInfo *	getCellInfo (unsigned int i) const
const CellInfo *	getSCInfo (unsigned int i) const
virtual const History *	newCellHistory (unsigned int i) const
virtual const History *	cellHistory (unsigned int i) const
virtual const CellInfo *	cellInfo (unsigned int i) const
virtual unsigned int	nChannels () const
virtual unsigned int	nChannelsSC () const
virtual void	resetCache () const
const CellInfo *	cellInfoCache (unsigned int i) const
const History *	pass (unsigned int i, const FilterParams &f) const
const History *	cellCache () const
unsigned int	cachePos () const
void	resetCellInfoCache ()
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
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 TreeAccessor *	open (const TString &fileName)
static TreeAccessor *	merge (const std::vector< const Accessor * > &accessors, const TString &fileName="")
static TreeAccessor *	merge (const std::vector< const Accessor * > &accessors, const TString &fileName, const TString &LBFile)
static TreeAccessor *	filter (const Accessor &accessor, const FilterParams &filterParams, const TString &fileName, const DataTweaker &tweaker)
static std::vector< TreeAccessor * >	filter (const Accessor &accessor, const FilterList &filterList, const DataTweaker &tweaker)
static TreeAccessor *	makeTemplate (const Accessor &accessor, 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
unsigned int	m_pos
const History *	m_cellCache
std::vector< CellInfo * >	m_cellInfoCache
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

Friends
class	Interface

Detailed Description

Definition at line 32 of file TreeAccessor.h.

Constructor & Destructor Documentation

TreeAccessor() [1/2]

LArSamples::TreeAccessor::TreeAccessor ( TTree & cellTree, TTree & scTree, TTree & eventTree, TTree * runTree, TFile * file )

inline

Constructor.

Definition at line 37 of file TreeAccessor.h.

       : PersistentAccessor(cellTree, scTree, eventTree, runTree, file) { }

TreeAccessor() [2/2]

LArSamples::TreeAccessor::TreeAccessor ( const TString & fileName )

inline

Definition at line 40 of file TreeAccessor.h.

: PersistentAccessor(fileName) { }

~TreeAccessor()

virtual LArSamples::TreeAccessor::~TreeAccessor ( )

inlinevirtual

Definition at line 44 of file TreeAccessor.h.

{ resetCache(); }

Member Function Documentation

add()

void LArSamples::TreeAccessor::add ( HistoryContainer * cont )

inline

Definition at line 70 of file TreeAccessor.h.

{ PersistentAccessor::add(cont); resetCache(); }

addEvent()

void PersistentAccessor::addEvent ( EventData * eventData )

inherited

Definition at line 175 of file PersistentAccessor.cxx.

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

addRun()

void PersistentAccessor::addRun ( RunData * runData )

inherited

Definition at line 183 of file PersistentAccessor.cxx.

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

addSC()

void PersistentAccessor::addSC ( HistoryContainer * cont )

inherited

Definition at line 167 of file PersistentAccessor.cxx.

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

cachePos()

unsigned int LArSamples::AbsLArCells::cachePos ( ) const

inlineinherited

Definition at line 48 of file AbsLArCells.h.

{ return m_pos; }

cellCache()

const History * LArSamples::AbsLArCells::cellCache ( ) const

inlineinherited

Definition at line 47 of file AbsLArCells.h.

{ return m_cellCache; }

cellHistory()

const History * AbsLArCells::cellHistory ( unsigned int i ) const

virtualinherited

Reimplemented in LArSamples::Interface.

Definition at line 59 of file AbsLArCells.cxx.

{ 
  if (m_pos == i) return m_cellCache;
  resetCache();
  const History* history = newCellHistory(i);
  if (!history) return nullptr;
  m_cellCache = history;
  m_pos = i;
  return m_cellCache;
}

cellInfo()

const CellInfo * AbsLArCells::cellInfo ( unsigned int i ) const

virtualinherited

Definition at line 71 of file AbsLArCells.cxx.

{
  const CellInfo* info = cellInfoCache(i);
  if (info) return (info->isValid() ? new CellInfo(*info) : nullptr);
  info = getCellInfo(i);
  if (info)  m_cellInfoCache[i] =  new CellInfo(*info, false); 
  //m_cellInfoCache[i] = (info ? new CellInfo(*info, false) : new CellInfo());
  return info;
}

cellInfoCache()

const CellInfo * AbsLArCells::cellInfoCache ( unsigned int i ) const

inherited

Definition at line 82 of file AbsLArCells.cxx.

{
  return m_cellInfoCache[i];
}

cellTree()

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

inlineinherited

Definition at line 44 of file PersistentAccessor.h.

{ return *m_cellTree; }

currentContainer()

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

inlineinherited

Definition at line 66 of file PersistentAccessor.h.

{ return m_historyCont; }

currentContainerSC()

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

inlineinherited

Definition at line 67 of file PersistentAccessor.h.

{ return m_historyContSC; }

eventData()

const EventData * LArSamples::TreeAccessor::eventData ( unsigned int i ) const

inlinevirtual

Implements LArSamples::Accessor.

Definition at line 65 of file TreeAccessor.h.

{ return PersistentAccessor::eventData(i); }

eventTree()

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

inlineinherited

Definition at line 46 of file PersistentAccessor.h.

{ return *m_eventTree; }

file()

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

inlineinherited

Definition at line 49 of file PersistentAccessor.h.

{ return m_file; }

fileName()

TString PersistentAccessor::fileName ( ) const

inherited

Definition at line 154 of file PersistentAccessor.cxx.

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

filter() [1/2]

std::vector< TreeAccessor * > TreeAccessor::filter ( const Accessor & accessor, const FilterList & filterList, const DataTweaker & tweaker )

static

Definition at line 362 of file TreeAccessor.cxx.

{
  if (filterList.size() == 0) {
    cout << "No filter categories specified, done! (?)" << endl;
    return std::vector<TreeAccessor*>();
  }
  
  for (unsigned int f = 0; f < filterList.size(); f++) {
    cout << "Skimming to " << filterList.fileName(f) << endl;
    if (!gSystem->AccessPathName(filterList.fileName(f))) {
      cout << "File already exists, exiting." << endl;
      return std::vector<TreeAccessor*>();
    }
  }
  
  std::vector<TreeAccessor*> newAccessors;
  for (unsigned int f = 0; f < filterList.size(); f++)
    newAccessors.push_back(new TreeAccessor(filterList.fileName(f)));
  std::map<std::pair<unsigned int, unsigned int>, unsigned int> eventIndices;
  std::vector< std::map<unsigned int, unsigned int> > eventsToKeep(filterList.size());
  std::vector< std::map<unsigned int, unsigned int> > runsToKeep(filterList.size());
  
  double nTot = 0, nPass = 0; 
  
  for (unsigned int i = 0; i < accessor.nEvents(); i++) {
    const EventData* eventData = accessor.eventData(i);
    eventIndices[std::pair<unsigned int, unsigned int>(eventData->run(), eventData->event())] = i;
  }  
 
  for (unsigned int i = 0; i < accessor.nChannels(); i++) {
    if (i % 25000 == 0) {
      cout << "Filtering " << i << "/" <<  accessor.nChannels() 
       << " (passing so far = " << nPass << ", total seen = " << nTot << ")" << endl;
      //ClassCounts::printCountsTable();
    }    
    bool first = true;
    
    const History* history = nullptr;
    for (unsigned int f = 0; f < filterList.size(); f++) {
      history = accessor.pass(i, filterList.filterParams(f));
      if (history) break;
    }
    for (unsigned int f = 0; f < filterList.size(); f++) {
      if (!history || !history->cellInfo() || !filterList.filterParams(f).passCell(*history->cellInfo())) {
        HistoryContainer* newHist = new HistoryContainer();
        newAccessors[f]->add(newHist);
        delete newHist;
        continue;
      }
      if (first) { nTot += history->nData(); first = false; }
      HistoryContainer* newHist = new HistoryContainer(new CellInfo(*history->cellInfo()));
      for (unsigned int k = 0; k < history->nData(); k++) {
        if (!filterList.filterParams(f).passEvent(*history->data(k))) continue;
        const EventData* eventData = history->data(k)->eventData();
        std::map<std::pair<unsigned int, unsigned int>, unsigned int>::const_iterator findIndex = 
          eventIndices.find(std::pair<unsigned int, unsigned int>(eventData->run(), eventData->event()));
        if (findIndex == eventIndices.end()) { 
          cout << "Inconsistent event numbering!!!" << endl; 
          delete newHist;
          return std::vector<TreeAccessor*>(); 
        }
        int oldEvtIndex = findIndex->second;
        bool isNewEvt = (eventsToKeep[f].find(oldEvtIndex) == eventsToKeep[f].end());
        unsigned int newEvtIndex = (isNewEvt ? eventsToKeep[f].size() : eventsToKeep[f][oldEvtIndex]);      
        if (isNewEvt) eventsToKeep[f][oldEvtIndex] = newEvtIndex;
 
        int oldRunIndex = history->data(k)->eventData()->runIndex();
        bool isNewRun = (runsToKeep[f].find(oldRunIndex) == runsToKeep[f].end());
        unsigned int newRunIndex = (isNewRun ? runsToKeep[f].size() : runsToKeep[f][oldRunIndex]);      
        if (isNewRun) runsToKeep[f][oldRunIndex] = newRunIndex;
 
        Data* newData = tweaker.tweak(*history->data(k), newEvtIndex);
        if (!newData) {
          cout << "Filtering failed on data " << k << " of cell " << i << ", aborting" << endl;
          delete newHist;
          for (unsigned int f = 0; f < filterList.size(); f++) delete newAccessors[f];
          return std::vector<TreeAccessor*>();
        }
        nPass++;
        newHist->add(newData->dissolve());
      }
      newAccessors[f]->add(newHist);
      delete newHist;
    }
  }
 
  for (unsigned int f = 0; f < filterList.size(); f++) {      
    cout << "Adding runs..." << endl;
    std::vector<unsigned int> runsToKeep_ordered(runsToKeep[f].size());
    for (const auto& runIndex : runsToKeep[f]) 
      runsToKeep_ordered[runIndex.second] = runIndex.first;
 
    for (unsigned int runIndex : runsToKeep_ordered) {
      RunData* newRun = new RunData(*accessor.runData(runIndex));
      newAccessors[f]->addRun(newRun);
      delete newRun;  
    }
    cout << "Adding events..." << endl;
    std::vector<unsigned int> eventsToKeep_ordered(eventsToKeep[f].size());
    for (const auto& eventIndex : eventsToKeep[f])
      eventsToKeep_ordered[eventIndex.second] = eventIndex.first;
 
    for (unsigned int eventIndex : eventsToKeep_ordered) {
      std::map<unsigned int, unsigned int>::const_iterator idx = runsToKeep[f].find(accessor.eventData(eventIndex)->runIndex());
      int newRunIndex = (idx == runsToKeep[f].end() ? 0 : idx->second);
      EventData* newEvent = tweaker.tweak(*accessor.eventData(eventIndex), newRunIndex);
      newAccessors[f]->addEvent(newEvent);
      delete newEvent;
    }
  }
  cout << "Filtering done! final size = " << nPass << endl;
  //ClassCounts::printCountsTable();
  for (unsigned int f = 0; f < filterList.size(); f++) {      
    cout << "Saving " << newAccessors[f]->fileName() << endl;    
    newAccessors[f]->save();
  }
  return newAccessors;
}

filter() [2/2]

TreeAccessor * TreeAccessor::filter ( const Accessor & accessor, const FilterParams & filterParams, const TString & fileName, const DataTweaker & tweaker )

static

Definition at line 351 of file TreeAccessor.cxx.

{
  FilterList filterList; filterList.add(filterParams, fileName);  
  std::vector<TreeAccessor*> result = filter(accessor, filterList, tweaker);
  return (!result.empty() ? result[0] : nullptr);
}

getCellEntry()

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

inlineinherited

Definition at line 72 of file PersistentAccessor.h.

{ return m_cellTree->GetEntry(i); }

getCellHistory()

const History * TreeAccessor::getCellHistory ( unsigned int i ) const

virtual

Implements LArSamples::AbsLArCells.

Definition at line 62 of file TreeAccessor.cxx.

{ 
  if (i >= cellTree().GetEntries()) return nullptr;
  getCellEntry(i);
 
  std::vector<const EventData*> eventDatas;
  
  for (unsigned int k = 0; k < currentContainer()->nDataContainers(); k++) {
    const EventData* evtData = eventData(currentContainer()->dataContainer(k)->eventIndex());
    EventData* newEvtData = (evtData ? new EventData(*evtData) : nullptr);
    eventDatas.push_back(newEvtData);
  }
  return (currentContainer()->cellInfo() ? new History(*currentContainer(), eventDatas, i) : nullptr);
}

getCellInfo()

const CellInfo * TreeAccessor::getCellInfo ( unsigned int i ) const

virtual

Reimplemented from LArSamples::AbsLArCells.

Definition at line 47 of file TreeAccessor.cxx.

{ 
  const HistoryContainer* cont = historyContainer(i);
  if (!cont || !cont->cellInfo()) return nullptr;
  return new CellInfo(*cont->cellInfo());
}

getSCEntry()

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

inlineinherited

Definition at line 73 of file PersistentAccessor.h.

{ return m_SCTree->GetEntry(i); }

getSCHistory()

const History * TreeAccessor::getSCHistory ( unsigned int i ) const

virtual

Implements LArSamples::AbsLArCells.

Definition at line 77 of file TreeAccessor.cxx.

{ 
  if (i >= SCTree().GetEntries()) return nullptr;
  getSCEntry(i);
 
  std::vector<const EventData*> eventDatas;
  
  for (unsigned int k = 0; k < currentContainerSC()->nDataContainers(); k++) {
    const EventData* evtData = eventData(currentContainerSC()->dataContainer(k)->eventIndex());
    EventData* newEvtData = (evtData ? new EventData(*evtData) : nullptr);
    eventDatas.push_back(newEvtData);
  }
  return (currentContainerSC()->cellInfo() ? new History(*currentContainerSC(), eventDatas, i) : nullptr);
}

getSCInfo()

const CellInfo * TreeAccessor::getSCInfo

(

unsigned int

i

)

const

Definition at line 54 of file TreeAccessor.cxx.

{ 
  const HistoryContainer* cont = historyContainerSC(i);
  if (!cont || !cont->cellInfo()) return nullptr;
  return new CellInfo(*cont->cellInfo());
}

historyContainer()

const HistoryContainer * PersistentAccessor::historyContainer ( unsigned int i ) const

inherited

Definition at line 106 of file PersistentAccessor.cxx.

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

historyContainerSC()

const HistoryContainer * PersistentAccessor::historyContainerSC ( unsigned int i ) const

inherited

Definition at line 112 of file PersistentAccessor.cxx.

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

historySize()

unsigned int LArSamples::TreeAccessor::historySize ( unsigned int i ) const

inlinevirtual

Implements LArSamples::Accessor.

Definition at line 61 of file TreeAccessor.h.

{ return PersistentAccessor::historySize(i); }

historySizeSC()

unsigned int LArSamples::TreeAccessor::historySizeSC ( unsigned int i ) const

inlinevirtual

Implements LArSamples::Accessor.

Definition at line 62 of file TreeAccessor.h.

{ return PersistentAccessor::historySizeSC(i); }

makeTemplate()

TreeAccessor * TreeAccessor::makeTemplate ( const Accessor & accessor, const TString & fileName )

static

Definition at line 484 of file TreeAccessor.cxx.

{
  TreeAccessor* newAccessor = new TreeAccessor(fileName);
  
  std::vector<short> samples(5, 0);
  std::vector<float> autoCorrs(4, 0);
  
  RunData* dummyRun = new RunData(0);
  newAccessor->addRun(dummyRun);
  delete dummyRun;
  
  EventData* dummyEvent = new EventData(0, 0, 0, 0);
  newAccessor->addEvent(dummyEvent);
  delete dummyEvent;
 
  for (unsigned int i = 0; i < accessor.nChannels(); i++) {
    if (i % 25000 == 0)
      cout << "Templating " << i << "/" <<  accessor.nChannels() << endl;
    const History* history = accessor.cellHistory(i);
    if (!history || !history->cellInfo()) {
      HistoryContainer* newHist = new HistoryContainer();
      newAccessor->add(newHist);
      delete newHist;
      continue;
    }
    HistoryContainer* newHist = new HistoryContainer(new CellInfo(*history->cellInfo()));
    DataContainer* dataContainer = new DataContainer(CaloGain::LARHIGHGAIN, samples, 0, 0, 0, 0, autoCorrs);
    newHist->add(dataContainer);
    newAccessor->add(newHist);
    delete newHist;
  }
 
  newAccessor->save();  
  return newAccessor;
}

merge() [1/4]

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

staticinherited

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;
  size=0;
  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/4]

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

staticinherited

Definition at line 343 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;
}

merge() [3/4]

TreeAccessor * TreeAccessor::merge ( const std::vector< const Accessor * > & accessors, const TString & fileName, const TString & LBFile )

static

Definition at line 182 of file TreeAccessor.cxx.

{
  // O.Simard - 01.07.2011
  // Alternative version with LB cleaning.
 
  bool kBadLB=false;
  std::vector<unsigned int> LBList;
  std::ifstream infile(LBFile.Data());
  std::string line;
  // assume single-line format with coma-separated LBs (from python)
  std::getline(infile,line,'\n');
  TString filter(line.c_str());
  TObjArray* list = filter.Tokenize(", "); // coma\space delimiters
  if(list->GetEntries() == 0){
    printf("No LB filtering specified, or bad format. Exiting.\n");
    delete list;
    return nullptr;
  }
  
  for(int k = 0; k < list->GetEntries(); k++){
    TObjString* tobs = (TObjString*)(list->At(k));
    LBList.push_back((unsigned int)(tobs->String()).Atoi());
  }
  delete list;
  printf("LB List: %d\n",(int)LBList.size());
  
 
  // from here it is similar to other functions of this class
  TreeAccessor* newAcc = new TreeAccessor(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;
 
  cout << "Merging runs" << endl;
  for (const Accessor* 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 Accessor* accessor : accessors)
    nEventsTotal += accessor->nEvents();  
  for (const Accessor* accessor : accessors) {
    for (unsigned int i = 0; i < accessor->nEvents(); i++) {
      iEvt++;
      if (iEvt % 100000 == 0) cout << "Merging event " << iEvt << "/" << nEventsTotal << endl;
 
      // ----
      // skip LBs which are found in the list
      kBadLB=false;
      for(unsigned int ilb = 0 ; ilb < LBList.size() ; ilb++){
        if(LBList.at(ilb)==accessor->eventData(i)->lumiBlock()){
      kBadLB=true;
      //printf("  == Rejecting Event in LB %4d\n",accessor->eventData(i)->lumiBlock());
      break;
    }
      }
      if(kBadLB) continue;
      // ----
 
      std::pair<int, int> evtId(accessor->eventData(i)->run(), accessor->eventData(i)->event());
      if (evtMap.find(evtId) != evtMap.end()) continue;
      evtMap[evtId] = evtIndex;
      std::map<int, int>::const_iterator idx = runMap.find(accessor->eventData(i)->run());
      int newRunIndex = (idx == runMap.end() ? -999 : idx->second);
      EventData* newEvent = new EventData(*accessor->eventData(i), newRunIndex);
      newAcc->addEvent(newEvent);
      delete newEvent;
      evtIndex++;
    }
  } 
  
  cout << "Merging cells" << endl;
  for (unsigned int i = 0; i < newAcc->nChannels(); i++) {
    if (i % 10000 == 0) {
      cout << "Merging channel " << i << "/" <<  newAcc->nChannels() << " (current size = " << size << ")" << endl;
      //ClassCounts::printCountsTable();
    }
    HistoryContainer* historyContainer = nullptr;
  for (const Accessor* accessor : accessors) {
      const History* history = accessor->cellHistory(i);
      if (!history || !history->isValid()) continue;
      if (!historyContainer) {
        info = new CellInfo(*history->cellInfo());
        historyContainer = new HistoryContainer(info);
      }
      for (unsigned int j = 0; j < history->nData(); j++) {
        DataContainer* newDC = new DataContainer(history->data(j)->container());
        std::map<std::pair<int, int>, int>::const_iterator newIndex 
          = evtMap.find(std::make_pair(history->data(j)->run(), history->data(j)->event()));
        //if (newIndex == evtMap.end()) cout << "Event not found for cell " << i << ", data " << j << "." << endl;
        newDC->setEventIndex(newIndex != evtMap.end() ? newIndex->second : -1);
        historyContainer->add(newDC);
        if (!info->shape(history->data(j)->gain())) {
         const ShapeInfo* shape = history->cellInfo()->shape(history->data(j)->gain());
         if (!shape) 
           cout << "Shape not filled for hash = " << i << ", index = " << j << ", gain = " << Data::gainStr(history->data(j)->gain()) << endl;
          info->setShape(history->data(j)->gain(), (shape ? new ShapeInfo(*shape) : nullptr));
        }
      }
    }
    if(historyContainer){
      size += historyContainer->nDataContainers();
    }
    newAcc->add(historyContainer);
    delete historyContainer;
    historyContainer=nullptr;
    //}
  }
 
  cout << "Merging SC" << endl;
  for (unsigned int i = 0; i < newAcc->nChannelsSC(); i++) {
    if (i % 10000 == 0) {
      cout << "Merging channel " << i << "/" <<  newAcc->nChannelsSC() << " (current size = " << size << ")" << endl;
    }
    HistoryContainer* historyContainer = nullptr;
  for (const Accessor* accessor : accessors) {
      const History* history = accessor->getSCHistory(i);
      if (!history || !history->isValid()) continue;
      if (!historyContainer) {
        info = new CellInfo(*history->cellInfo());
        historyContainer = new HistoryContainer(info);
      }
      for (unsigned int j = 0; j < history->nData(); j++) {
        DataContainer* newDC = new DataContainer(history->data(j)->container());
        std::map<std::pair<int, int>, int>::const_iterator newIndex 
          = evtMap.find(std::make_pair(history->data(j)->run(), history->data(j)->event()));
        //if (newIndex == evtMap.end()) cout << "Event not found for cell " << i << ", data " << j << "." << endl;
        newDC->setEventIndex(newIndex != evtMap.end() ? newIndex->second : -1);
        historyContainer->add(newDC);
        if (!info->shape(history->data(j)->gain())) {
         const ShapeInfo* shape = history->cellInfo()->shape(history->data(j)->gain());
         if (!shape) 
           cout << "Shape not filled for hash = " << i << ", index = " << j << ", gain = " << Data::gainStr(history->data(j)->gain()) << endl;
          info->setShape(history->data(j)->gain(), (shape ? new ShapeInfo(*shape) : nullptr));
        }
      }
    }
    if(historyContainer){
      size += historyContainer->nDataContainers();
    }
    newAcc->addSC(historyContainer);
    delete historyContainer;
    historyContainer=nullptr;
    //}
  }
 
  cout << "Merging done, final size = " << size << endl;
  newAcc->save();
  return newAcc;
}

merge() [4/4]

TreeAccessor * TreeAccessor::merge ( const std::vector< const Accessor * > & accessors, const TString & fileName = "" )

static

Definition at line 92 of file TreeAccessor.cxx.

{
  cout << "Merging to " << fileName << endl;
  TreeAccessor* newAcc = new TreeAccessor(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;
 
  cout << "Merging runs" << endl;
  for (const Accessor* 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 Accessor* accessor : accessors)
    nEventsTotal += accessor->nEvents();  
  for (const Accessor* 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());
      if (evtMap.find(evtId) != evtMap.end()) continue;
      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++;
    }
  } 
  
  for (unsigned int i = 0; i < newAcc->nChannels(); i++) {
    if (i % 10000 == 0) {
      cout << "Merging channel " << i << "/" <<  newAcc->nChannels() << " (current size = " << size << ")" << endl;
      //ClassCounts::printCountsTable();
    }
    HistoryContainer* historyContainer = nullptr;
  for (const Accessor* accessor : accessors) {
      const History* history = accessor->cellHistory(i);
      if (!history || !history->isValid()) continue;
      if (!historyContainer) {
        info = new CellInfo(*history->cellInfo());
        historyContainer = new HistoryContainer(info);
      }
      for (unsigned int j = 0; j < history->nData(); j++) {
        DataContainer* newDC = new DataContainer(history->data(j)->container());
        std::map<std::pair<int, int>, int>::const_iterator newIndex 
          = evtMap.find(std::make_pair(history->data(j)->run(), history->data(j)->event()));
        if (newIndex == evtMap.end()) cout << "Event not found for cell " << i << ", data " << j << "." << endl;
        newDC->setEventIndex(newIndex != evtMap.end() ? newIndex->second : -1);
        historyContainer->add(newDC);
        if (!info->shape(history->data(j)->gain())) {
          const ShapeInfo* shape = history->cellInfo()->shape(history->data(j)->gain());
          if (!shape) 
            cout << "Shape not filled for hash = " << i << ", index = " << j << ", gain = " << Data::gainStr(history->data(j)->gain()) << endl;
          info->setShape(history->data(j)->gain(), (shape ? new ShapeInfo(*shape) : nullptr));
        }
      }
    }
    if (historyContainer) size += historyContainer->nDataContainers();
    newAcc->add(historyContainer);
    delete historyContainer;
  }
 
  cout << "Merging done, final size = " << size << endl;
  newAcc->save();
  return newAcc;
}

nChannels()

virtual unsigned int LArSamples::AbsLArCells::nChannels ( ) const

inlinevirtualinherited

Reimplemented in LArSamples::MonitorBase.

Definition at line 34 of file AbsLArCells.h.

{ return Definitions::nChannels; }

nChannelsSC()

virtual unsigned int LArSamples::AbsLArCells::nChannelsSC ( ) const

inlinevirtualinherited

Definition at line 35 of file AbsLArCells.h.

{ return Definitions::nChannelsSC; }

nEvents()

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

inlinevirtual

Implements LArSamples::Accessor.

Definition at line 64 of file TreeAccessor.h.

{ return PersistentAccessor::nEvents(); }

newCellHistory()

const History * AbsLArCells::newCellHistory ( unsigned int i ) const

virtualinherited

Definition at line 44 of file AbsLArCells.cxx.

{ 
  const History* history = getCellHistory(i);
  if (!history) return nullptr;
  if (!m_cellInfoCache[i]) {
    const CellInfo* ci=history->cellInfo();
    if (ci) {
      m_cellInfoCache[i]=new CellInfo(*ci,false);
    }
  }
  //  m_cellInfoCache[i] = (history->cellInfo() ? new CellInfo(*history->cellInfo(), false) : new CellInfo());
  return history;
}

nRuns()

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

inlinevirtual

Implements LArSamples::Accessor.

Definition at line 67 of file TreeAccessor.h.

{ return PersistentAccessor::nRuns(); }

open()

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

static

Definition at line 30 of file TreeAccessor.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");
  TreeAccessor* accessor = new TreeAccessor(*cellTree, *scTree, *eventTree, runTree, file);
  return accessor;
}

pass()

const History * AbsLArCells::pass ( unsigned int i, const FilterParams & f ) const

inherited

Definition at line 99 of file AbsLArCells.cxx.

{ 
  //std::cout << "Called AbsLArCells with hash " << i  << std::endl;
  if (!f.passHash(i)) return nullptr;
  const CellInfo* info = cellInfo(i);
  if (!info) {
    return nullptr;
  }
  //std::cout << "Called AbsLArCells::pass on a cell belonging to " << Id::str(info->calo()) << std::endl;
  bool result = f.passCell(*info);
  delete info;  
  return result ? cellHistory(i) : nullptr;
}

resetCache()

void AbsLArCells::resetCache ( ) const

virtualinherited

Definition at line 34 of file AbsLArCells.cxx.

{
  if (m_cellCache) {
    delete m_cellCache;
    m_cellCache = nullptr;
  }
  m_pos = nChannels() + 1;
}

resetCellInfoCache()

void AbsLArCells::resetCellInfoCache ( )

inherited

Definition at line 114 of file AbsLArCells.cxx.

{
  unsigned int i = 0;
  for (std::vector<CellInfo*>::iterator cellInfo = m_cellInfoCache.begin();
       cellInfo != m_cellInfoCache.end(); ++cellInfo, i++)
    if (*cellInfo) {
      delete *cellInfo;
      *cellInfo = 0;
    }
}

runData()

const RunData * LArSamples::TreeAccessor::runData ( unsigned int i ) const

inlinevirtual

Implements LArSamples::Accessor.

Definition at line 68 of file TreeAccessor.h.

{ return PersistentAccessor::runData(i); }

runTree()

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

inlineinherited

Definition at line 47 of file PersistentAccessor.h.

{ return *m_runTree; }

save()

bool PersistentAccessor::save ( ) const

inherited

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

inlineinherited

Definition at line 45 of file PersistentAccessor.h.

{ return *m_SCTree; }

writeToFile()

bool TreeAccessor::writeToFile ( const TString & fileName ) const

virtual

Implements LArSamples::Accessor.

Definition at line 520 of file TreeAccessor.cxx.

{
  TFile* newFile = new TFile(fileName, "RECREATE");
  if (newFile && !newFile->IsOpen()) { delete newFile; newFile = nullptr; }
  if (!newFile) return false;
  
  cellTree().Write();
  eventTree().Write();
 
  delete newFile;
  
  return true;
}

Friends And Related Symbol Documentation

Interface

friend class Interface

friend

Definition at line 55 of file TreeAccessor.h.

Member Data Documentation

m_cellCache

const History* LArSamples::AbsLArCells::m_cellCache

mutableprivateinherited

Definition at line 55 of file AbsLArCells.h.

m_cellInfoCache

std::vector<CellInfo*> LArSamples::AbsLArCells::m_cellInfoCache

mutableprivateinherited

Definition at line 56 of file AbsLArCells.h.

m_cellTree

TTree* LArSamples::PersistentAccessor::m_cellTree

privateinherited

Definition at line 77 of file PersistentAccessor.h.

m_eventData

EventData* LArSamples::PersistentAccessor::m_eventData

mutableprivateinherited

Definition at line 81 of file PersistentAccessor.h.

m_eventTree

TTree * LArSamples::PersistentAccessor::m_eventTree

privateinherited

Definition at line 77 of file PersistentAccessor.h.

m_file

TFile* LArSamples::PersistentAccessor::m_file

mutableprivateinherited

Definition at line 78 of file PersistentAccessor.h.

m_historyCont

HistoryContainer* LArSamples::PersistentAccessor::m_historyCont

mutableprivateinherited

Definition at line 79 of file PersistentAccessor.h.

m_historyContSC

HistoryContainer* LArSamples::PersistentAccessor::m_historyContSC

mutableprivateinherited

Definition at line 80 of file PersistentAccessor.h.

m_pos

unsigned int LArSamples::AbsLArCells::m_pos

mutableprivateinherited

Definition at line 54 of file AbsLArCells.h.

m_runCache

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

mutableprivateinherited

Definition at line 83 of file PersistentAccessor.h.

m_runData

RunData* LArSamples::PersistentAccessor::m_runData

mutableprivateinherited

Definition at line 82 of file PersistentAccessor.h.

m_runTree

TTree * LArSamples::PersistentAccessor::m_runTree

privateinherited

Definition at line 77 of file PersistentAccessor.h.

m_SCTree

TTree * LArSamples::PersistentAccessor::m_SCTree

privateinherited

Definition at line 77 of file PersistentAccessor.h.

---

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

• TreeAccessor.h
• TreeAccessor.cxx