WeightContainer.h

//--------------------------------------------------------------------------
#ifndef HEPMC_WEIGHT_CONTAINER_H
#define HEPMC_WEIGHT_CONTAINER_H

// Matt.Dobbs@Cern.CH, November 2000, refer to:
// M. Dobbs and J.B. Hansen, "The HepMC C++ Monte Carlo Event Record for
// High Energy Physics", Computer Physics Communications (to be published).
//
// Container for the Weights associated with an event or vertex.
//
// This implementation adds a map-like interface in addition to the 
// vector-like interface.

#include <iostream>
#include <vector>
#include <string>
#include <map>

namespace HepMC {


    class WeightContainer {
        friend class GenEvent;

    public:
        typedef std::size_t size_type;
        typedef std::vector<double>::iterator iterator;
        typedef std::vector<double>::const_iterator const_iterator;
        
        explicit WeightContainer( size_type n = 0, double value = 0. );
        WeightContainer( const std::vector<double>& weights );
        WeightContainer( const WeightContainer& in );
        ~WeightContainer();

        void swap( WeightContainer & other);
        WeightContainer& operator=( const WeightContainer& );
        WeightContainer& operator=( const std::vector<double>& in );

        void          print( std::ostream& ostr = std::cout ) const;
        void          write( std::ostream& ostr = std::cout ) const;

        size_type     size() const;
        bool          empty() const;
        void          push_back( const double& );
        void          pop_back();
        void          clear();

        bool          has_key( const std::string& s ) const;

        double&       operator[]( size_type n );  // unchecked access
        const double& operator[]( size_type n ) const;
        double&       operator[]( const std::string& s );  // unchecked access
        const double& operator[]( const std::string& s ) const;

        bool operator==( const WeightContainer & ) const;
        bool operator!=( const WeightContainer & ) const;
        
        double&       front();
        const double& front() const;   
        double&       back();
        const double& back() const;

        iterator            begin();
        iterator            end();
        const_iterator      begin() const;
        const_iterator      end() const;

    private:
        // for internal use only

        typedef std::map<std::string,size_type>::iterator       map_iterator;
        typedef std::map<std::string,size_type>::const_iterator const_map_iterator;
        map_iterator            map_begin();
        map_iterator            map_end();
        const_map_iterator      map_begin() const;
        const_map_iterator      map_end() const;
        
        void set_default_names( size_type n );
        
    private:
        std::vector<double>          m_weights;
        std::map<std::string,size_type> m_names;
    };

    // INLINES               //

    inline WeightContainer::WeightContainer( const WeightContainer& in )
        : m_weights(in.m_weights), m_names(in.m_names)
    {}

    inline WeightContainer::~WeightContainer() {}

    inline void WeightContainer::swap( WeightContainer & other)
    { 
        m_weights.swap( other.m_weights ); 
        m_names.swap( other.m_names ); 
    }

    inline WeightContainer& WeightContainer::operator=
    ( const WeightContainer& in ) {
        WeightContainer tmp( in );
        swap( tmp );
        return *this;
    }

    inline WeightContainer& WeightContainer::operator=
    ( const std::vector<double>& in ) {
        WeightContainer tmp( in );
        swap( tmp );
        return *this;
    }

    inline WeightContainer::size_type WeightContainer::size() const { return m_weights.size(); }

    inline bool WeightContainer::empty() const { return m_weights.empty(); }

    inline void WeightContainer::clear() 
    { 
        m_weights.clear(); 
        m_names.clear(); 
    }

    inline double& WeightContainer::operator[]( size_type n ) 
    { return m_weights[n]; }

    inline const double& WeightContainer::operator[]( size_type n ) const
    { return m_weights[n]; }

    inline double& WeightContainer::front() { return m_weights.front(); }

    inline const double& WeightContainer::front() const 
    { return m_weights.front(); }

    inline double& WeightContainer::back() { return m_weights.back(); }

    inline const double& WeightContainer::back() const 
    { return m_weights.back(); }

    inline WeightContainer::iterator WeightContainer::begin() 
    { return m_weights.begin(); }

    inline WeightContainer::iterator WeightContainer::end() 
    { return m_weights.end(); }

    inline WeightContainer::const_iterator WeightContainer::begin() const 
    { return m_weights.begin(); }

    inline WeightContainer::const_iterator WeightContainer::end() const 
    { return m_weights.end(); }

    inline WeightContainer::map_iterator WeightContainer::map_begin() 
    { return m_names.begin(); }

    inline WeightContainer::map_iterator WeightContainer::map_end() 
    { return m_names.end(); }

    inline WeightContainer::const_map_iterator WeightContainer::map_begin() const 
    { return m_names.begin(); }

    inline WeightContainer::const_map_iterator WeightContainer::map_end() const 
    { return m_names.end(); }

} // HepMC

#endif  // HEPMC_WEIGHT_CONTAINER_H
//--------------------------------------------------------------------------