LArSamples::MultiTreeAccessor Class Reference

#include <MultiTreeAccessor.h>

Inheritance diagram for LArSamples::MultiTreeAccessor:

Collaboration diagram for LArSamples::MultiTreeAccessor:

Public Member Functions
	MultiTreeAccessor (const std::vector< const TreeAccessor * > &accessors)
	Constructor More...
virtual	~MultiTreeAccessor ()
unsigned int	nEvents () const
unsigned int	nRuns () const
const EventData *	eventData (unsigned int i) const
const RunData *	runData (unsigned int i) const
unsigned int	historySize (unsigned int i) const
bool	writeToFile (const TString &fileName) const
const TreeAccessor &	accessor (unsigned int i) const
unsigned int	nAccessors () const
std::vector< MultiTreeAccessor * >	filterComponents (const FilterList &filterList, const DataTweaker &tweaker) 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 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 ()

Static Public Member Functions
static MultiTreeAccessor *	open (const std::vector< TString > &files)
static MultiTreeAccessor *	openList (const TString &fileList)
static MultiTreeAccessor *	openWild (const TString &wcName)

Protected Member Functions
const History *	getCellHistory (unsigned int i) const
const CellInfo *	getCellInfo (unsigned int i) const

Private Attributes
std::vector< const TreeAccessor * >	m_accessors
unsigned int	m_pos
const History *	m_cellCache
std::vector< CellInfo * >	m_cellInfoCache

Detailed Description

Definition at line 27 of file MultiTreeAccessor.h.

Constructor & Destructor Documentation

MultiTreeAccessor()

LArSamples::MultiTreeAccessor::MultiTreeAccessor ( const std::vector< const TreeAccessor * > &  accessors )

inline

Constructor

Definition at line 32 of file MultiTreeAccessor.h.

        : m_accessors(accessors) { }

~MultiTreeAccessor()

MultiTreeAccessor::~MultiTreeAccessor ( )

virtual

Definition at line 95 of file MultiTreeAccessor.cxx.

{
  for (const TreeAccessor* accessor : m_accessors)
    delete accessor;
}

Member Function Documentation

accessor()

const TreeAccessor& LArSamples::MultiTreeAccessor::accessor ( unsigned int  i ) const

inline

Definition at line 51 of file MultiTreeAccessor.h.

{ return *m_accessors[i]; }

cachePos()

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

inlineinherited

Definition at line 45 of file AbsLArCells.h.

{ return m_pos; }

cellCache()

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

inlineinherited

Definition at line 44 of file AbsLArCells.h.

{ return m_cellCache; }

cellHistory()

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

virtualinherited

Reimplemented in LArSamples::Interface.

Definition at line 57 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 69 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 80 of file AbsLArCells.cxx.

{
  return m_cellInfoCache[i];
}

eventData()

const EventData * MultiTreeAccessor::eventData ( unsigned int  i ) const

virtual

Implements LArSamples::Accessor.

Definition at line 102 of file MultiTreeAccessor.cxx.

{
  unsigned int nEventsSoFar = 0;
  for (const TreeAccessor* accessor : m_accessors) {
    unsigned int n = accessor->nEvents();
    if (i < nEventsSoFar + n) return accessor->eventData(i - nEventsSoFar);
    nEventsSoFar += n;
  }
  return nullptr;
}

filterComponents()

std::vector< MultiTreeAccessor * > MultiTreeAccessor::filterComponents	(	const FilterList &	filterList,
		const DataTweaker &	tweaker
	)		const

Definition at line 223 of file MultiTreeAccessor.cxx.

{
  std::vector< std::vector<const TreeAccessor*> > filteredAccessors(filterList.size()); 
  
  for (unsigned int i = 0; i < nAccessors(); i++) {
    const TreeAccessor* treeAcc = dynamic_cast<const TreeAccessor*>(&accessor(i));
    cout << "Processing data " << i << " of " << nAccessors();
    if (treeAcc) cout << " (fileName = " << treeAcc->fileName() << ")";
    cout << endl;
    FilterList thisFilterList;
    //
    for (unsigned int f = 0; f < filterList.size(); f++) {
      std::string pathname = (string)filterList.fileName(f);
      if( pathname.find("eos/atlas/") < pathname.length() ){
    int nslashes = 0, slpos = 0;
    for( int k1 = 0; k1 < (int)pathname.length(); k1++ ){
      if( nslashes > 2 )break;
      if( pathname[k1] != '/' )continue;
      nslashes++;
      slpos = k1;
    }
    pathname.resize( slpos );
      }
      TString thisFN = Form("%s_filter%d.root", pathname.c_str(), i );//filterList.fileName(f).Data(), i);
      //if (treeAcc) thisFN = treeAcc->fileName() + Form("_filter%d.root", f);
      thisFilterList.add(filterList.filterParams(f), thisFN);
    }
    std::vector<TreeAccessor*> filteredTreeAccs = TreeAccessor::filter(accessor(i), thisFilterList, tweaker);
    if (filteredTreeAccs.size() != filterList.size()) {
      cout << "Filtering failed, exiting" << endl;
      return std::vector<MultiTreeAccessor*>();
    }
    for (unsigned int f = 0; f < filteredTreeAccs.size(); f++) filteredAccessors[f].push_back(filteredTreeAccs[f]);
    //if (treeAcc) treeAcc->resetCache(); // to save memory
  }
 
  std::vector<MultiTreeAccessor*> result;
  for (unsigned int f = 0; f < filteredAccessors.size(); f++) result.push_back(new MultiTreeAccessor(filteredAccessors[f]));
  return result;
}

getCellHistory()

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

protectedvirtual

Implements LArSamples::AbsLArCells.

Definition at line 156 of file MultiTreeAccessor.cxx.

{ 
  CellInfo* cellInfo = nullptr;
  std::vector<const Data*> allData;
  std::vector<const EventData*> allEventData;
  for (const TreeAccessor* accessor : m_accessors) {
    //cout << "---> Getting history for a treeAccessor..." << endl; 
    const History* thisHistory = accessor->getCellHistory(i);
    //cout << "---> done Getting history for a treeAccessor..." << endl; 
    if (!thisHistory) continue;
    if (!cellInfo) {
      cellInfo = new CellInfo(*thisHistory->cellInfo());
    //cout << "---> done new cell info" << endl; 
    }
    //cout << "---> Creating new event data N = " << thisHistory->eventData().size() << endl; 
    const std::vector<const EventData*>& thisEventData = thisHistory->eventData();
    std::map<const EventData*, const EventData*> eventMap;
    for (const EventData* event : thisEventData) {
      if (eventMap.find(event) != eventMap.end()) continue;
      EventData* newED = new EventData(*event);
      eventMap[event] = newED;
      allEventData.push_back(newED);
    }
    //cout << "---> Creating new data N = " << thisHistory->nData() << endl; 
   
    for (unsigned int i = 0; i < thisHistory->nData(); i++) {
     //cout << "------> Creating new data " << i << endl; 
      allData.push_back(new Data(*thisHistory->data(i), eventMap[thisHistory->data(i)->eventData()], nullptr, -1));
     //cout << "------> done Creating new data " << i << endl; 
      if (!cellInfo->shape(thisHistory->data(i)->gain())) {
        const ShapeInfo* thisShape = thisHistory->cellInfo()->shape(thisHistory->data(i)->gain());
        cellInfo->setShape(thisHistory->data(i)->gain(), thisShape ? new ShapeInfo(*thisShape) : nullptr);
      }
     //cout << "------> done shape " << i << endl; 
    }
     //cout << "---> done Creating new data, deleting treeAcc history" << endl; 
    delete thisHistory;
  }
  //cout << "--->returning new history..." << endl; 
  return (cellInfo ? new History(allData, *cellInfo, allEventData, i) : nullptr); 
}

getCellInfo()

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

protectedvirtual

Reimplemented from LArSamples::AbsLArCells.

Definition at line 199 of file MultiTreeAccessor.cxx.

{
  resetCache();
  for (const TreeAccessor* accessor : m_accessors) {
    const HistoryContainer* cont = accessor->historyContainer(i);
    if (cont && cont->cellInfo()) return new CellInfo(*cont->cellInfo());
  }
  return nullptr;
}

historySize()

unsigned int MultiTreeAccessor::historySize ( unsigned int  i ) const

virtual

Implements LArSamples::Accessor.

Definition at line 144 of file MultiTreeAccessor.cxx.

{
  resetCache();
  unsigned int size = 0;
  for (const TreeAccessor* accessor : m_accessors) {
    const HistoryContainer* cont = accessor->historyContainer(i);
    if (cont) size += cont->nDataContainers();
  }
  return size;
}

nAccessors()

unsigned int LArSamples::MultiTreeAccessor::nAccessors ( ) const

inline

Definition at line 52 of file MultiTreeAccessor.h.

{ return m_accessors.size(); }

nChannels()

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

inlinevirtualinherited

Reimplemented in LArSamples::MonitorBase.

Definition at line 34 of file AbsLArCells.h.

{ return Definitions::nChannels; }

nEvents()

unsigned int MultiTreeAccessor::nEvents ( ) const

virtual

Implements LArSamples::Accessor.

Definition at line 126 of file MultiTreeAccessor.cxx.

{
  unsigned int n = 0;
  for (const TreeAccessor* accessor : m_accessors)
     n += accessor->nEvents();
  return n;
}

newCellHistory()

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

virtualinherited

Definition at line 42 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 MultiTreeAccessor::nRuns ( ) const

virtual

Implements LArSamples::Accessor.

Definition at line 135 of file MultiTreeAccessor.cxx.

{
  unsigned int n = 0;
  for (const TreeAccessor* accessor : m_accessors)
     n += accessor->nRuns();
  return n;
}

open()

MultiTreeAccessor * MultiTreeAccessor::open ( const std::vector< TString > &  files )

static

Definition at line 25 of file MultiTreeAccessor.cxx.

{
  std::vector<const TreeAccessor*> accessors;
  for (const TString& fileName : files) {
    const TreeAccessor* accessor = TreeAccessor::open(fileName);
    if (!accessor) {
      cout << "Skipping invalid file " << fileName << endl;
      continue;
    }
    accessors.push_back(accessor);
  }
  
  if (accessors.empty()) return nullptr;
  return new MultiTreeAccessor(accessors);
}

openList()

MultiTreeAccessor * MultiTreeAccessor::openList ( const TString &  fileList )

static

Definition at line 42 of file MultiTreeAccessor.cxx.

{
  std::ifstream f(fileList);
  if (!f) {
    cout << "file " << fileList << " not accessible" << endl;
    return nullptr;
  }
 
  std::string fileName;  
  unsigned int i = 0;
 
  std::vector<const TreeAccessor*> accessors;
  
  while (f >> fileName) {
    //gSystem->Exec("free");
    const TreeAccessor* accessor = TreeAccessor::open(fileName.c_str());
    if (!accessor) {
      cout << "Skipping invalid file " << fileName << endl;
      continue;
    }
    cout << std::setw(2) << ++i << " - " << fileName << endl;
    accessors.push_back(accessor);
  }
  
  if (accessors.empty()) return nullptr;
  return new MultiTreeAccessor(accessors);
}

openWild()

MultiTreeAccessor * MultiTreeAccessor::openWild ( const TString &  wcName )

static

Definition at line 71 of file MultiTreeAccessor.cxx.

{
  // Piggyback on TChain wildcarding feature...
  TChain chain("");
  chain.Add(wcName);
  
  std::vector<const TreeAccessor*> accessors;
  
  for (int i = 0; i < chain.GetListOfFiles()->GetEntries(); i++) {
    std::string fileName = chain.GetListOfFiles()->At(i)->GetTitle();
    const TreeAccessor* accessor = TreeAccessor::open(fileName.c_str());
    if (!accessor) {
      cout << "Skipping invalid file " << fileName << endl;
      continue;
    }
    cout << std::setw(2) << i+1 << " - " << fileName <<  " , nEvents = " << accessor->nEvents() << ", nRuns = " << accessor->nRuns() << endl;
    accessors.push_back(accessor);
  }
  
  if (accessors.empty()) return nullptr;
  return new MultiTreeAccessor(accessors);
}

pass()

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

inherited

Definition at line 97 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 32 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 112 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 * MultiTreeAccessor::runData ( unsigned int  i ) const

virtual

Implements LArSamples::Accessor.

Definition at line 114 of file MultiTreeAccessor.cxx.

{ 
  unsigned int nRunsSoFar = 0;
  for (const TreeAccessor* accessor : m_accessors) {
    unsigned int n = accessor->nRuns();
    if (i < nRunsSoFar + n) return accessor->runData(i - nRunsSoFar);
    nRunsSoFar += n;
  }
  return nullptr;
}

writeToFile()

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

virtual

Implements LArSamples::Accessor.

Definition at line 210 of file MultiTreeAccessor.cxx.

{
  std::vector<const Accessor*> accessors;
  for (unsigned int i = 0; i < m_accessors.size(); i++)
    accessors.push_back(m_accessors[i]);
  cout << "Merging data..." << endl;
  TreeAccessor* singleContainer = TreeAccessor::merge(accessors, fileName);
  if (!singleContainer) return false;
  delete singleContainer;
  return true;
}

Member Data Documentation

m_accessors

std::vector<const TreeAccessor*> LArSamples::MultiTreeAccessor::m_accessors

private

Definition at line 63 of file MultiTreeAccessor.h.

m_cellCache

const History* LArSamples::AbsLArCells::m_cellCache

mutableprivateinherited

Definition at line 52 of file AbsLArCells.h.

m_cellInfoCache

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

mutableprivateinherited

Definition at line 53 of file AbsLArCells.h.

m_pos

unsigned int LArSamples::AbsLArCells::m_pos

mutableprivateinherited

Definition at line 51 of file AbsLArCells.h.

---

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

• MultiTreeAccessor.h
• MultiTreeAccessor.cxx