3 #include "GaudiKernel/HashMap.h"
4 #include "GaudiKernel/Parsers.h"
10 template <
typename K,
typename V>
12 std::map<std::string, std::string> tmp;
16 result.
insert(tmp.begin(), tmp.end());
39 declareProperty(
"Nodes", m_nodeMap,
40 "Map of the type of nodes to be associated to paths (path -> data_type).");
41 declareProperty(
"Algorithms", m_algMap,
42 "Map of algorithms to be used to produce entries (path -> alg_name).");
Default implementation of a DataOnDemand mapper.
GaudiUtils::HashMap< std::string, std::string > m_nodeMap
bool isSuccess() const
Test for a status code of SUCCESS.
StatusCode parse(GaudiUtils::HashMap< K, V > &result, const std::string &input)
Basic parser for the types of HashMap used in DODBasicMapper.
std::string nodeTypeForPath(const std::string &path) override
Helper class to parse a string of format "type/name".
GaudiUtils::HashMap< std::string, Gaudi::Utils::TypeNameString > m_algMap
This class is used for returning status codes from appropriate routines.
#define DECLARE_COMPONENT(type)
Definition of the basic interface.
iterator find(const key_type &key)
Base class used to extend a class implementing other interfaces.
Common class providing an architecture-independent hash map.
std::pair< iterator, bool > insert(ValueType &&val)
Gaudi::Utils::TypeNameString algorithmForPath(const std::string &path) override
Helper functions to set/get the application return code.