---

LeafCandidate.h

Go to the documentation of this file.

#ifndef Candidate_LeafCandidate_h
#define Candidate_LeafCandidate_h

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

namespace reco {
  
  class LeafCandidate : public Candidate {
  public:
    typedef CandidateCollection daughters;
    LeafCandidate() : Candidate() { }
    explicit LeafCandidate( const Particle & p ) : Candidate( p ) { }
    LeafCandidate( Charge q, const LorentzVector & p4, const Point & vtx = Point( 0, 0, 0 ),
                   int pdgId = 0, int status = 0, bool integerCharge = true ) : 
      Candidate( q, p4, vtx, pdgId, status, integerCharge ) { }
    LeafCandidate( Charge q, const PolarLorentzVector & p4, const Point & vtx = Point( 0, 0, 0 ),
                   int pdgId = 0, int status = 0, bool integerCharge = true ) : 
      Candidate( q, p4, vtx, pdgId, status, integerCharge ) { }
    virtual ~LeafCandidate();
    virtual LeafCandidate * clone() const;
    virtual const_iterator begin() const;
    virtual const_iterator end() const;
    virtual iterator begin();
    virtual iterator end();
    virtual size_t numberOfDaughters() const;
    virtual const Candidate * daughter( size_type ) const;
    virtual size_t numberOfMothers() const;
    virtual const Candidate * mother( size_type ) const;
    virtual Candidate * daughter( size_type );

  private:
    // const iterator implementation
    typedef candidate::const_iterator_imp_specific<daughters> const_iterator_imp_specific;
    // iterator implementation
    typedef candidate::iterator_imp_specific<daughters> iterator_imp_specific;
    virtual bool overlap( const Candidate & c ) const;
  };

}

#endif

---