| # Gaudi Framework, version v21r7p1 |

Home |  | Generated: 15 Feb 2010

# HistoDecorator.cpp File Reference

Implementation file for class GaudiPython::HistoDecorator. More...

`#include "GaudiAlg/GaudiHistoAlg.h"`
`#include "GaudiAlg/GaudiHistoTool.h"`
`#include "GaudiPython/Vector.h"`
`#include "GaudiPython/HistoDecorator.h"`

Include dependency graph for HistoDecorator.cpp:

Go to the source code of this file.

## Functions
template<class KEY, class HISTO>
size_t | _getHistos (const GaudiUtils::HashMap< KEY, HISTO > &a, std::map< GaudiAlg::ID, HISTO > &b)
| collect the histograms
template<class HISTO>
size_t | fromMap (const std::map< GaudiAlg::ID, HISTO > &a, std::vector< GaudiAlg::ID > &b, std::vector< HISTO > &c)

## Detailed Description

Implementation file for class GaudiPython::HistoDecorator.

Date:
  2005-08-04

Author:
  Vanya BELYAEV Ivan.Belyaev@lapp.in2p3.fr

Definition in file HistoDecorator.cpp.

## Function Documentation

template<class KEY, class HISTO>

size_t @532::_getHistos | ( | const GaudiUtils::HashMap< KEY, HISTO > & | a,
|  | std::map< GaudiAlg::ID, HISTO > & | b |
| ) |  |  | `[inline, static]`

collect the histograms

Definition at line 728 of file HistoDecorator.cpp.

    00730   {
    00731     for  ( typename GaudiUtils::HashMap<KEY,HISTO>::const_iterator ih =
    00732              a.begin() ; a.end() != ih ; ++ih )
    00733     {
    00734       if ( 0 == ih->second ) { continue ; }
    00735       GaudiAlg::ID id ( ih->first ) ;
    00736       b [ id ] = ih->second ;
    00737     }
    00738     return b.size() ;
    00739   }

template<class HISTO>

size_t @532::fromMap | ( | const std::map< GaudiAlg::ID, HISTO > & | a,
|  | std::vector< GaudiAlg::ID > & | b,
|  | std::vector< HISTO > & | c |
| ) |  |  | `[inline, static]`

Definition at line 743 of file HistoDecorator.cpp.

    00746   {
    00747     b.clear() ;
    00748     c.clear() ;
    00749      for ( typename std::map<GaudiAlg::ID,HISTO>::const_iterator it =
    00750              a.begin() ; a.end() != it ; ++it )
    00751      {
    00752        if ( 0 == it->second ) { continue ; }
    00753        b.push_back ( it->first  ) ;
    00754        c.push_back ( it->second ) ;
    00755      }
    00756     return b.size () ;
    00757   }