Tuples::ItemStore< VALUE > Class Template Reference

Simple class, which represents the local storage of N-tuple items of the given type. More...

#include <GaudiAlg/TuplePut.h>

Collaboration diagram for Tuples::ItemStore< VALUE >:

Public Member Functions
	ItemStore ()=default
	constructor : create empty map More...

Private Types
typedef GaudiUtils::HashMap< std::string, std::unique_ptr< NTuple::Item< VALUE > > >	Store

Private Member Functions
NTuple::Item< VALUE > *	getItem (const std::string &key, Tuples::TupleObj *tuple)
	the only one method: More...
	ItemStore (const ItemStore &)=delete
ItemStore &	operator= (const ItemStore &)=delete

Private Attributes
Store	m_map
	the underlying map More...

Friends
class	TupleObj

Detailed Description

template<class VALUE>
class Tuples::ItemStore< VALUE >

Simple class, which represents the local storage of N-tuple items of the given type.

Essentially it is a restricted GaudiUtils::HashMap with the ownership of the newly created entries

Author

Vanya BELYAEV ibely.nosp@m.aev@.nosp@m.physi.nosp@m.cs.s.nosp@m.yr.ed.nosp@m.u

Date

2007-04-08

Definition at line 38 of file TuplePut.h.

Member Typedef Documentation

template<class VALUE>

typedef GaudiUtils::HashMap<std::string, std::unique_ptr<NTuple::Item<VALUE> > > Tuples::ItemStore< VALUE >::Store

private

Definition at line 43 of file TuplePut.h.

Constructor & Destructor Documentation

template<class VALUE>

Tuples::ItemStore< VALUE >::ItemStore ( )

default

constructor : create empty map

template<class VALUE>

Tuples::ItemStore< VALUE >::ItemStore ( const ItemStore< VALUE > &  )

privatedelete

Member Function Documentation

template<class VALUE>

NTuple::Item<VALUE>* Tuples::ItemStore< VALUE >::getItem ( const std::string &  key, Tuples::TupleObj *  tuple  )

inlineprivate

the only one method:

Definition at line 51 of file TuplePut.h.

    {
      // find the item by name
      auto ifound = m_map.find( key );
      // existing item?
      if ( m_map.end() != ifound ) return ifound->second.get(); // RETURN
      // check the tuple for booking:
      if ( !tuple ) return nullptr;
      // check the existence of the name
      if ( !tuple->goodItem( key ) ) {
        tuple->Error( "ItemStore::getItem('" + key + "') item name is not unique" ).ignore();
        return nullptr; // RETURN
      }
      // get the underlying object
      NTuple::Tuple* tup = tuple->tuple();
      if ( !tup ) {
        tuple->Error( "ItemStore::getItem('" + key + "') invalid NTuple::Tuple*" ).ignore();
        return nullptr; // RETURN
      }
      // create new item:
      // add the newly created item into the store:
      auto stored = m_map.emplace( key, std::make_unique<NTuple::Item<VALUE>>() );
      if ( !stored.second ) {
        tuple->Warning( "ItemStore::getItem('" + key + "') item already exists, new one not inserted!" ).ignore();
        return nullptr;
      }
      auto& item = stored.first->second;
      // add it into N-tuple
      StatusCode sc = tup->addItem( key, *item ); // ATTENTION!
      if ( sc.isFailure() ) {
        tuple->Error( "ItemStore::getItem('" + key + "') cannot addItem", sc ).ignore();
        m_map.erase( stored.first );
        return nullptr; // RETURN
      }
      // check the name again
      if ( !tuple->addItem( key, System::typeinfoName( typeid( VALUE ) ) ) ) {
        tuple->Warning( "ItemStore::getItem('" + key + "') the item not unique " ).ignore();
        m_map.erase( stored.first );
        return nullptr;
      }
      //
      return item.get(); // RETURN
    }

template<class VALUE>

ItemStore& Tuples::ItemStore< VALUE >::operator= ( const ItemStore< VALUE > &  )

privatedelete

Friends And Related Function Documentation

template<class VALUE>

friend class TupleObj

friend

Definition at line 40 of file TuplePut.h.

Member Data Documentation

template<class VALUE>

Store Tuples::ItemStore< VALUE >::m_map

private

the underlying map

the underlying map

Definition at line 101 of file TuplePut.h.

---

The documentation for this class was generated from the following file:

• GaudiAlg/GaudiAlg/TuplePut.h