00001 // $Id: LeafCandidate.cc,v 1.11 2007/09/21 14:13:05 llista Exp $ 00002 #include "DataFormats/Candidate/interface/LeafCandidate.h" 00003 00004 using namespace reco; 00005 00006 LeafCandidate::~LeafCandidate() { } 00007 00008 LeafCandidate * LeafCandidate::clone() const { 00009 return new LeafCandidate( * this ); 00010 } 00011 00012 Candidate::const_iterator LeafCandidate::begin() const { 00013 return const_iterator( new const_iterator_imp_specific ); 00014 } 00015 00016 Candidate::const_iterator LeafCandidate::end() const { 00017 return const_iterator( new const_iterator_imp_specific ); 00018 } 00019 00020 Candidate::iterator LeafCandidate::begin() { 00021 return iterator( new iterator_imp_specific ); 00022 } 00023 00024 Candidate::iterator LeafCandidate::end() { 00025 return iterator( new iterator_imp_specific ); 00026 } 00027 00028 size_t LeafCandidate::numberOfDaughters() const { 00029 return 0; 00030 } 00031 00032 size_t LeafCandidate::numberOfMothers() const { 00033 return 0; 00034 } 00035 00036 bool LeafCandidate::overlap( const Candidate & o ) const { 00037 return p4() == o.p4() && vertex() == o.vertex() && charge() == o.charge(); 00038 } 00039 00040 const Candidate * LeafCandidate::daughter( size_type ) const { 00041 return 0; 00042 } 00043 00044 const Candidate * LeafCandidate::mother( size_type ) const { 00045 return 0; 00046 } 00047 00048 Candidate * LeafCandidate::daughter( size_type ) { 00049 return 0; 00050 } 00051