edm::PoolOutputModule::OutputItem::Sorter Class Reference

#include <PoolOutputModule.h>

Public Member Functions
bool	operator() (OutputItem const &lh, OutputItem const &rh) const
	Sorter (TTree *tree)

Private Attributes
std::shared_ptr< std::map < std::string, int > >	treeMap_

Detailed Description

Definition at line 71 of file PoolOutputModule.h.

Constructor & Destructor Documentation

edm::PoolOutputModule::OutputItem::Sorter::Sorter ( TTree *  tree )

explicit

Definition at line 124 of file PoolOutputModule.cc.

References beamvalidation::br, i, AlCaHLTBitMon_QueryRunRegistry::string, and treeMap_.

                                                      : treeMap_(new std::map<std::string, int>) {
    // Fill a map mapping branch names to an index specifying the order in the tree.
    if(tree != 0) {
      TObjArray* branches = tree->GetListOfBranches();
      for(int i = 0; i < branches->GetEntries(); ++i) {
        TBranchElement* br = (TBranchElement*)branches->At(i);
        treeMap_->insert(std::make_pair(std::string(br->GetName()), i));
      }
    }
  }

Member Function Documentation

bool edm::PoolOutputModule::OutputItem::Sorter::operator()	(	OutputItem const &	lh,
		OutputItem const &	rh
	)		const

Definition at line 136 of file PoolOutputModule.cc.

References edm::PoolOutputModule::OutputItem::branchDescription_, edm::BranchDescription::branchName(), and AlCaHLTBitMon_QueryRunRegistry::string.

                                                                                               {
    // Provides a comparison for sorting branches according to the index values in treeMap_.
    // Branches not found are always put at the end (i.e. not found > found).
    if(treeMap_->empty()) return lh < rh;
    std::string const& lstring = lh.branchDescription_->branchName();
    std::string const& rstring = rh.branchDescription_->branchName();
    std::map<std::string, int>::const_iterator lit = treeMap_->find(lstring);
    std::map<std::string, int>::const_iterator rit = treeMap_->find(rstring);
    bool lfound = (lit != treeMap_->end());
    bool rfound = (rit != treeMap_->end());
    if(lfound && rfound) {
      return lit->second < rit->second;
    } else if(lfound) {
      return true;
    } else if(rfound) {
      return false;
    }
    return lh < rh;
  }

Member Data Documentation

std::shared_ptr<std::map<std::string, int> > edm::PoolOutputModule::OutputItem::Sorter::treeMap_

private

Definition at line 76 of file PoolOutputModule.h.

Referenced by Sorter().