Flow.cc

// Matt.Dobbs@Cern.CH, January 2000
// particle's flow object

#include "HepMC/Flow.h"
#include "HepMC/GenParticle.h"
#include "HepMC/GenVertex.h"
#include "HepMC/SearchVector.h"

namespace HepMC {

    Flow::Flow( GenParticle* particle_owner ) 
        : m_particle_owner(particle_owner) 
    {}

    Flow::Flow( const Flow& inflow ) : 
        m_particle_owner(inflow.m_particle_owner),
        m_icode(inflow.m_icode)
    {
    }

    Flow::~Flow() {
        m_icode.clear();
    }

    void Flow::swap( Flow & other)
    {
        std::swap( m_particle_owner, other.m_particle_owner );
        m_icode.swap( other.m_icode );
    }

    void Flow::print( std::ostream& ostr ) const {
        ostr << "Flow(" << m_particle_owner << "): " << *this << std::endl;
    }
    
    std::vector<GenParticle*> Flow::connected_partners( int code, int code_index, 
                                                  int num_indices ) const {
        //
        std::vector<GenParticle*> output;
        for ( int i = code_index; i!=code_index+num_indices; ++i ) {
            if ( icode(i)==code ) {
                output.push_back(m_particle_owner);
                connected_partners( &output, code, code_index, num_indices );
                break;
            } 
        }
        return output;
    }

    void Flow::connected_partners( std::vector<HepMC::GenParticle*>* output, int code, 
                                   int code_index, int num_indices ) const
    {
        //
        if ( !m_particle_owner ) return; // nothing to do
        // look for connected partners joined to this m_particle_owner
        // through its end_vertex
        if ( m_particle_owner->end_vertex() ) {
            for ( GenVertex::particle_iterator p 
                     = m_particle_owner->end_vertex()->particles_begin(family);
                  p != m_particle_owner->end_vertex()->particles_end(family);
                  ++p ) {
                // if the particle has the correct flow code and is not yet in 
                // the set, then we recursively call connected_partners
                for ( int index = code_index; index!=code_index+num_indices; 
                      ++index ){
                    if ( (*p)->flow(index)==code && not_in_vector(output,(*p)) ) {
                        output->push_back(*p);
                        (*p)->flow().connected_partners( output, code,
                                                         code_index, 
                                                         num_indices );
                    }
                }
            }
        }
        // same for production_vertex
        if ( m_particle_owner->production_vertex() ) {
            for ( GenVertex::particle_iterator p 
                      = m_particle_owner->production_vertex()->
                      particles_begin( family );
                  p != m_particle_owner->production_vertex()->
                      particles_end( family ); ++p ) {
                // if the particle has the correct flow code and is not yet in 
                // the set, then we recursively call connected_partners
                for ( int index = code_index; index!=code_index+num_indices; 
                      ++index ){
                    if ( (*p)->flow(index)==code && not_in_vector(output,(*p)) ) {
                        output->push_back(*p);
                        (*p)->flow().connected_partners( output, code,
                                                         code_index, 
                                                         num_indices );
                    }
                }
            }
        }
    }

    std::vector<GenParticle*> Flow::dangling_connected_partners( int code, 
                                     int code_index, int num_indices ) const {
        std::vector<GenParticle*> output;
        std::vector<GenParticle*> visited_particles;
        for ( int i = code_index; i!=code_index+num_indices; ++i ) {
            if ( icode(i)==code ) {
                visited_particles.push_back(m_particle_owner);
                dangling_connected_partners( &output, &visited_particles, code,
                                             code_index, num_indices );
                break;
            }
        }
        return output;
    }

    void Flow::dangling_connected_partners( std::vector<HepMC::GenParticle*>* output, 
                                            std::vector<HepMC::GenParticle*>* 
                                            visited_particles,
                                            int code, int code_index, 
                                            int num_indices ) const 
    {
        //
        if ( !m_particle_owner ) return; // nothing to do
        int count_partners = 0;
        // look for connected partners joined to this m_particle_owner
        // through its end_vertex
        if ( m_particle_owner->end_vertex() ) {
            for ( GenVertex::particle_iterator p 
                     = m_particle_owner->end_vertex()->particles_begin(family);
                  p != m_particle_owner->end_vertex()->particles_end(family);
                  ++p ) {
                // if the particle has the correct flow code and is not yet in 
                // the set, then we recursively call connected_partners
                for ( int index = code_index; index!=code_index+num_indices; 
                      ++index ){
                    if ( (*p)->flow(index)==code ) {
                        if ( *p!=m_particle_owner ) ++count_partners;
                        if ( not_in_vector(visited_particles,(*p)) ) {
                            visited_particles->push_back(*p);
                            (*p)->flow().dangling_connected_partners( output, 
                                                     visited_particles, code,
                                                     code_index, num_indices );

                        }
                    }           
                }
            }
        }
        // same for production_vertex
        if ( m_particle_owner->production_vertex() ) {
            for ( GenVertex::particle_iterator p = m_particle_owner->
                                                production_vertex()->
                                                particles_begin( family );
                  p != m_particle_owner->production_vertex()->
                                                particles_end( family ); 
                  ++p ) {
                // if the particle has the correct flow code and is not yet in 
                // the set, then we recursively call connected_partners
                for ( int index = code_index; index!=code_index+num_indices; 
                      ++index ){
                    if ( (*p)->flow(index)==code ) {
                        if ( *p!=m_particle_owner ) ++count_partners;
                        if ( not_in_vector(visited_particles,(*p)) ) {
                            visited_particles->push_back(*p);
                            (*p)->flow().dangling_connected_partners( output, 
                                                     visited_particles, code,
                                                     code_index, num_indices );

                        }
                    }
                }
            }
        }
        if ( count_partners <= 1 ) output->push_back( m_particle_owner );
    }
        
    // Friends //

    std::ostream& operator<<( std::ostream& ostr, const Flow& f ) {
        ostr << f.m_icode.size();
        for ( std::map<int,int>::const_iterator i = f.m_icode.begin();
              i != f.m_icode.end(); ++i ) {
            ostr << " " << (*i).first << " " << (*i).second;
        }
        return ostr;
    }

} // HepMC