TopProjectorAlgo.h

Go to the documentation of this file.

#ifndef CommonTools_ParticleFlow_TopProjectorAlgo
#define CommonTools_ParticleFlow_TopProjectorAlgo

// system include files
#include <iostream>
#include <memory>
#include <string>

// user include files
#include "FWCore/Framework/interface/Frameworkfwd.h"
#include "FWCore/ParameterSet/interface/ParameterSet.h"

#include "FWCore/Framework/interface/Event.h"
#include "FWCore/Framework/interface/MakerMacros.h"

#include "DataFormats/Provenance/interface/ProductID.h"

#include "DataFormats/ParticleFlowCandidate/interface/PFCandidateFwd.h"

#include "DataFormats/Candidate/interface/CandidateFwd.h"


#include <iostream>


namespace pf2pat {

template< class Top, class Bottom>
class TopProjectorAlgo {

 public:

  typedef std::vector<Top> TopCollection;
  typedef edm::Handle< std::vector<Top> > TopHandle;
  typedef std::vector<Bottom> BottomCollection;
  typedef edm::Handle< std::vector<Bottom> > BottomHandle;
  typedef edm::Ptr<Bottom> BottomPtr; 

  TopProjectorAlgo(const edm::ParameterSet&);

  ~TopProjectorAlgo() {};

  
  BottomCollection produce( const TopHandle& topHandle, 
                const BottomHandle& bottomHandle, 
                const edm::EventBase& iEvent );


 private:
 
  void
    ptrToAncestor( reco::CandidatePtr candRef,
           reco::CandidatePtrVector& ancestors,
           const edm::ProductID& ancestorsID,
           const edm::EventBase& iEvent ) const;

  void maskAncestors( const reco::CandidatePtrVector& ancestors,
              std::vector<bool>& masked ) const;
    
  
  void processCollection( const edm::Handle< std::vector<Top> >& handle,
              const edm::Handle< std::vector<Bottom> >& allPFCandidates ,
              std::vector<bool>& masked,
              const char* objectName,
              const edm::EventBase& iEvent ) const; 

  void  printAncestors( const reco::CandidatePtrVector& ancestors,
            const edm::Handle< std::vector<Bottom> >& allPFCandidates ) const;


  bool            verbose_;

  //COLIN does not seem to be needed
  std::string     name_;
 
};




template< class Top, class Bottom>
TopProjectorAlgo< Top, Bottom >::TopProjectorAlgo(const edm::ParameterSet& iConfig) {

  verbose_ = iConfig.getUntrackedParameter<bool>("verbose",false);
  name_ = iConfig.getUntrackedParameter<std::string>("name","No Name");
}


template< class Top, class Bottom >
std::vector<Bottom> TopProjectorAlgo< Top, Bottom >::produce( const edm::Handle< std::vector<Top> >& tops, 
                                  const edm::Handle< std::vector<Bottom> >& bottoms, 
                                  const edm::EventBase& iEvent ) {
  
  edm::ProductID topsID = tops.id();
  edm::ProductID bottomsID = bottoms.id();

  cout<<"produce "<<tops.id()<<" "<<bottoms.id()<<endl;

  //COLIN had to comment all verbose stuff cause EventBase::getProvenance does not exist...
/*   if(verbose_) { */
/*     const Provenance& topProv = iEvent.getProvenance(tops.id()); */
/*     const Provenance& bottomProv = iEvent.getProvenance(bottoms.id()); */

/*     cout<<"Top projector: event "<<iEvent.id().event()<<endl; */
/*     cout<<"Inputs --------------------"<<endl; */
/*     cout<<"Top      :  " */
/*  <<tops.id()<<"\t"<<tops->size()<<endl */
/*  <<topProv.branchDescription()<<endl */
/*  <<"Bottom   :  " */
/*  <<bottoms.id()<<"\t"<<bottoms->size()<<endl */
/*  <<bottomProv.branchDescription()<<endl; */
/*   } */


  // output collection of objects,
  // selected from the Bottom collection

/*   auto_ptr< BottomCollection > */
/*     pBottomOutput( new BottomCollection ); */
  BottomCollection bottomOutput;
  bottomOutput.reserve( bottoms->size() );

  //COLIN to be cleaned up lated.
  BottomCollection* pBottomOutput = &bottomOutput;

  // mask for each bottom object.
  // at the beginning, all bottom objects are unmasked.
  vector<bool> masked( bottoms->size(), false);
    
  processCollection( tops, bottoms, masked, name_.c_str(), iEvent );

  const BottomCollection& inCands = *bottoms;

  if(verbose_)
    cout<<" Remaining candidates in the bottom collection ------ "<<endl;
  
  for(unsigned i=0; i<inCands.size(); i++) {
    
    if(masked[i]) {
      if(verbose_)
    cout<<"X "<<i<<" "<<inCands[i]<<endl;
      continue;
    }
    else {
      if(verbose_)
    cout<<"O "<<i<<" "<<inCands[i]<<endl;

      pBottomOutput->push_back( inCands[i] );
      BottomPtr motherPtr( bottoms, i );
      pBottomOutput->back().setSourceCandidatePtr(motherPtr); 
    }
  }

  return bottomOutput;
}



template< class Top, class Bottom > 
void TopProjectorAlgo< Top, Bottom >::processCollection( const edm::Handle< std::vector<Top> >& tops,
                             const edm::Handle< std::vector<Bottom> >& bottoms ,
                             std::vector<bool>& masked,
                             const char* objectName,
                             const edm::EventBase& iEvent) const {

  if( tops.isValid() && bottoms.isValid() ) {
    const std::vector<Top>& topCollection = *tops;
    
    if(verbose_) 
      std::cout<<" processing: "<<objectName
           <<" size = "<<topCollection.size()<<std::endl;
    
    for(unsigned i=0; i<topCollection.size(); i++) {
      
      
      edm::Ptr<Top>   ptr( tops, i);
      reco::CandidatePtr basePtr( ptr );
 
      
      reco::CandidatePtrVector ancestors;
      ptrToAncestor( basePtr,
             ancestors,
             bottoms.id(), 
             iEvent );
      
      if(verbose_) {
/*  std::cout<<"\t"<<objectName<<" "<<i */
/*       <<" pt,eta,phi = " */
/*       <<basePtr->pt()<<"," */
/*       <<basePtr->eta()<<"," */
/*       <<basePtr->phi()<<std::endl; */
    
    std::cout<<"\t"<<topCollection[i]<<std::endl;
    printAncestors( ancestors, bottoms );
      }
  
      maskAncestors( ancestors, masked );
    }
  }

}


template< class Top, class Bottom >
void  TopProjectorAlgo<Top,Bottom>::printAncestors( const reco::CandidatePtrVector& ancestors,
                      const edm::Handle< std::vector<Bottom> >& allPFCandidates ) const {
  

  std::vector<Bottom> pfs = *allPFCandidates;

  for(unsigned i=0; i<ancestors.size(); i++) {

    edm::ProductID id = ancestors[i].id();
    assert( id == allPFCandidates.id() );
 
    unsigned index = ancestors[i].key();
    assert( index < pfs.size() );
    
    std::cout<<"\t\t"<<pfs[index]<<std::endl;
  }
}



template< class Top, class Bottom >
void
TopProjectorAlgo<Top,Bottom>::ptrToAncestor( reco::CandidatePtr candPtr,
                     reco::CandidatePtrVector& ancestors,
                     const edm::ProductID& ancestorsID,
                     const edm::EventBase& iEvent) const {

  

  unsigned nSources = candPtr->numberOfSourceCandidatePtrs();

/*   if(verbose_) { */
/*     const Provenance& hereProv = iEvent.getProvenance(candPtr.id()); */

/*     cout<<"going down from "<<candPtr.id() */
/*  <<"/"<<candPtr.key()<<" #mothers "<<nSources */
/*  <<" ancestor id "<<ancestorsID<<endl */
/*  <<hereProv.branchDescription()<<endl; */
/*   }   */

  for(unsigned i=0; i<nSources; i++) {
    
    CandidatePtr mother = candPtr->sourceCandidatePtr(i);
/*     if( verbose_ ) { */
/*       const Provenance& motherProv = iEvent.getProvenance(mother.id()); */
/*       cout<<"  mother id "<<mother.id()<<endl */
/*    <<motherProv<<endl; */
/*     } */
    if(  mother.id() != ancestorsID ) {
      // the mother is not yet at lowest level
      ptrToAncestor( mother, ancestors, ancestorsID, iEvent );
    }
    else {
      // adding mother to the list of ancestors
      ancestors.push_back( mother ); 
    }
  }
}




template< class Top, class Bottom >
void TopProjectorAlgo<Top,Bottom>::maskAncestors( const reco::CandidatePtrVector& ancestors,
                     std::vector<bool>& masked ) const {
  
  for(unsigned i=0; i<ancestors.size(); i++) {
    unsigned index = ancestors[i].key();
    assert( index<masked.size() );
    
    //     if(verbose_) {
    //       ProductID id = ancestors[i].id();
    //       cout<<"\tmasking "<<index<<", ancestor "<<id<<"/"<<index<<endl;
    //     }
    masked[index] = true;
  }
}

}
#endif