HbookName.h File Reference

few useful function to construct names of Hbook histograms and directories functions are imported from Tools/LoKi and Calo/CaloUtils packages More...

#include <string>
#include <algorithm>

Include dependency graph for HbookName.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Defines
#define	GAUDIALG_HBOOKNAME_H   1
Functions
std::string	dirHbookName (const std::string &addr, const int maxLen=16)
	Simple function to convert any valid Gaudi address (name in Transient Store) to address, which is simultaneously valid for Hbook directory.
std::string	histoHbookName (const std::string &addr, const int maxLen=8)
	Simple function to convert any valid Gaudi address(name in Transient Store) to address, which is simultaneously valid for Hbook histogram.

---

Detailed Description

few useful function to construct names of Hbook histograms and directories functions are imported from Tools/LoKi and Calo/CaloUtils packages

Author:

Vanya BELYAEV Ivan.Belyaev@itep.ru

Date:

2002-07-25

Definition in file HbookName.h.

---

Define Documentation

#define GAUDIALG_HBOOKNAME_H   1

Definition at line 4 of file HbookName.h.

---

Function Documentation

std::string @32::dirHbookName	(	const std::string &	addr,
		const int	maxLen = 16
	)			[inline, static]

Simple function to convert any valid Gaudi address (name in Transient Store) to address, which is simultaneously valid for Hbook directory.

examples: "verylongname" --> "verylong/name"

Parameters:

	old	old address
	maxLen	maximum allowed length of directory name (16 for Hbook)

Returns:

new address

Author:

Vanya BELYAEV Ivan.Belyaev@itep.ru

Date:

06/07/2001

Definition at line 35 of file HbookName.h.

  {
    // ignore empty locations 
    if( addr.empty() ) { return std::string(); }
    //
    std::string old( addr );
    // remove long names
    if( 0 < maxLen &&  maxLen < (int) old.size() ) 
    { 
      std::string::iterator p1,p2;
      p1 = old.begin();
      const char sep('/');
      while( old.end() != p1 )
      {
        p1 = 
          std::find_if( p1        , 
                        old.end() , 
                        std::bind2nd(std::not_equal_to<char>(),sep));
        p2 = std::find( p1 , old.end() , sep ) ;
        if( ( p2 - p1 ) <= (int) maxLen  ) { p1 = p2 ; continue ; }
        old.insert( p1 + maxLen , sep ) ;  
        p1 = old.begin() ; 
      }
    }
    return old;
  }

std::string @32::histoHbookName	(	const std::string &	addr,
		const int	maxLen = 8
	)			[inline, static]

Simple function to convert any valid Gaudi address(name in Transient Store) to address, which is simultaneously valid for Hbook histogram.

examples: "verylongname/116" --> "verylong/name/116" "verylongname" --> "verylong/name/1" "somename/here/" --> "somename/here/1" "directory/object" --> "director/y/object/1"

Parameters:

	old	old address
	maxLen	maximum allowed length of directory name (8 for Hbook)

Returns:

new address

Author:

Vanya BELYAEV Ivan.Belyaev@itep.ru

Date:

06/07/2001

Definition at line 82 of file HbookName.h.

  {
    // ignore empty locations 
    if( addr.empty() ) { return std::string(); }
    //
    std::string old( addr );
    { // make valid histogram ID (integer)  
      std::string::size_type pos 
        = old.find_last_of( '/' );
      if      ( std::string::npos == pos ) { old += "/1" ; }
      else if ( old.size() - 1    == pos ) { old += '1'  ; }
      else
      {
        const int id = 
          atoi( std::string( old , pos + 1 , std::string::npos ).c_str() );
        if( 0 == id ) { old+="/1"; }
      }
    }
    // remove long names
    if( 0 < maxLen &&  maxLen < (int) old.size() ) 
    { 
      std::string::iterator p1,p2;
      p1 = old.begin();
      const char sep('/');
      while( old.end() != p1 )
      {
        p1 = 
          std::find_if( p1        , 
                        old.end() , 
                        std::bind2nd(std::not_equal_to<char>(),sep));
        p2 = std::find( p1 , old.end() , sep ) ;
        if( ( p2 - p1 ) <= (int) maxLen  ) { p1 = p2 ; continue ; }
        old.insert( p1 + maxLen , sep ) ;  
        p1 = old.begin() ; 
      }
    }
    //
    return old;
  }