art::RootBranchInfoList Class Reference

#include <RootBranchInfoList.h>

Public Member Functions
	RootBranchInfoList ()
	RootBranchInfoList (TTree *tree)
void	reset (TTree *tree)
template<class PROD >
bool	findBranchInfo (InputTag const &tag, RootBranchInfo &rbInfo) const
bool	findBranchInfo (TypeID const &type, InputTag const &tag, RootBranchInfo &rbInfo) const

Private Attributes
std::vector< RootBranchInfo >	data_

Detailed Description

Definition at line 16 of file RootBranchInfoList.h.

Constructor & Destructor Documentation

art::RootBranchInfoList::RootBranchInfoList

(

)

Definition at line 11 of file RootBranchInfoList.cc.

: data_() {}

art::RootBranchInfoList::RootBranchInfoList ( TTree *  tree )

explicit

Definition at line 13 of file RootBranchInfoList.cc.

                                                     : data_()
{
  reset(tree);
}

Member Function Documentation

template<class PROD >

bool art::RootBranchInfoList::findBranchInfo	(	InputTag const &	tag,
		RootBranchInfo &	rbInfo
	)		const

Definition at line 35 of file RootBranchInfoList.h.

{
  return findBranchInfo(TypeID{typeid(PROD)}, tag, rbInfo);
}

bool art::RootBranchInfoList::findBranchInfo	(	TypeID const &	type,
		InputTag const &	tag,
		RootBranchInfo &	rbInfo
	)		const

Definition at line 42 of file RootBranchInfoList.cc.

{
  std::ostringstream pat_s;
  pat_s << '^' << type.friendlyClassName() << '_' << tag.label() << '_'
        << tag.instance() << '_';
  if (tag.process().empty()) {
    pat_s << ".*";
  } else {
    pat_s << tag.process();
  }
  pat_s << "\\.$";
  std::regex const r{pat_s.str()};
  // data_ is ordered so that the first match is the best.
  for (auto const& datum : data_) {
    if (std::regex_match(datum.branchName(), r)) {
      rbInfo = datum;
      return true;
    }
  }
  return false;
}

void art::RootBranchInfoList::reset

(

TTree *

tree

)

Definition at line 19 of file RootBranchInfoList.cc.

{
  if (!tree) {
    throw Exception(errors::NullPointerError)
      << "RootInfoBranchList given null TTree pointer.\n";
  }
  TObjArray* branches = tree->GetListOfBranches();
  size_t nBranches = branches->GetEntriesFast();
  data_.clear();
  data_.reserve(nBranches);
  TIter it(branches, kIterBackward);
  // Load the list backward, then searches can take place in the forward
  // direction.
  while (TBranch* b = dynamic_cast<TBranch*>(it.Next())) {
    data_.push_back(RootBranchInfo(b));
  }
  if (nBranches != data_.size()) {
    throw Exception(errors::DataCorruption, "RootBranchInfoList")
      << "Could not read expected number of branches from TTree's list.\n";
  }
}

Member Data Documentation

std::vector<RootBranchInfo> art::RootBranchInfoList::data_

private

Definition at line 30 of file RootBranchInfoList.h.

---

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

• art/art/Framework/IO/Root/RootBranchInfoList.h
• art/art/Framework/IO/Root/RootBranchInfoList.cc