| The Gaudi Framework v30r0 (c919700c)

- Main Page
- Related Pages
- Modules
- Namespaces
- Classes
- Files

- File List
- File Members

DataHandleHolderVisitor.cpp
Go to the documentation of this file.
1 #include "GaudiKernel/DataHandleHolderVisitor.h"
2 #include "GaudiKernel/DataHandle.h"
3 #include "GaudiKernel/DataObjID.h"
4 #include "GaudiKernel/IDataHandleHolder.h"
5 #include <functional>
6 #include <tuple>
7 #include <typeinfo>
8
9 namespace
10 {
11 using std::make_tuple;
12 }
13
14 DHHVisitor::DHHVisitor( DataObjIDColl& ido, DataObjIDColl& odo ) : m_ido( ido ), m_odo( odo ) {}
15
16 void DHHVisitor::visit( const IDataHandleHolder* v )
17 {
18 if ( !v ) {
19 return;
20 }
21
22 // Loop over inputs and outputs of handles, extra dependiencies and objects to
23 // collect all of them.
24 // Handles and extra dependencies are those of a specific algorith or tool, while
25 // the collection of data objects also contains those of the tree of tools and
26 // algorithms below it.
27
28 // Loop over input handles and output handles and store those with with non-empty keys
29 // in the container of input objects passed to us and the others in a container of those
30 // we ignore for debug purposes. To avoid multiple for loops, make some tuples and loop
31 // over those.
32 for ( auto& hs : {make_tuple( v->inputHandles(), std::ref( m_ido ), std::ref( m_ign_i ) ),
33 make_tuple( v->outputHandles(), std::ref( m_odo ), std::ref( m_ign_o ) )} ) {
34 for ( const auto& h : std::get<0>( hs ) ) {
35 if ( !h->objKey().empty() ) {
36 std::get<1>( hs ).emplace( h->fullKey() );
37 } else {
38 std::get<2>( hs ).emplace( h->fullKey() );
39 }
40 }
41 }
42
43 // The containers of handles are a different type than the on of input deps and input
44 // objects, so we need another loop here.
45 // NOTE: perhaps a view from range v3 can be used to also avoid this second loop.
46 for ( auto& hs : {make_tuple( v->extraInputDeps(), std::ref( m_ido ), std::ref( m_ign_i ) ),
47 make_tuple( v->extraOutputDeps(), std::ref( m_odo ), std::ref( m_ign_o ) ),
48 make_tuple( v->inputDataObjs(), std::ref( m_ido ), std::ref( m_ign_i ) ),
49 make_tuple( v->outputDataObjs(), std::ref( m_odo ), std::ref( m_ign_o ) )} ) {
50 for ( const auto& h : std::get<0>( hs ) ) {
51 if ( !h.key().empty() ) {
52 std::get<1>( hs ).emplace( h );
53 } else {
54 std::get<2>( hs ).emplace( h );
55 }
56 }
57 }
58 }
IDataHandleHolder.h
DHHVisitor::visit
void visit(const IDataHandleHolder *visitee) override
Definition: DataHandleHolderVisitor.cpp:16
DHHVisitor::m_ign_o
DataObjIDColl m_ign_o
Definition: DataHandleHolderVisitor.h:20
std::make_tuple
T make_tuple(T...args)
DHHVisitor::m_ign_i
DataObjIDColl m_ign_i
Definition: DataHandleHolderVisitor.h:20
DHHVisitor::m_ido
DataObjIDColl & m_ido
Definition: DataHandleHolderVisitor.h:19
IDataHandleHolder::inputHandles
virtual std::vector< Gaudi::DataHandle * > inputHandles() const =0
IDataHandleHolder::outputHandles
virtual std::vector< Gaudi::DataHandle * > outputHandles() const =0
IDataHandleHolder
Definition: IDataHandleHolder.h:14
IDataHandleHolder::extraOutputDeps
virtual const DataObjIDColl & extraOutputDeps() const =0
IDataHandleHolder::extraInputDeps
virtual const DataObjIDColl & extraInputDeps() const =0
IDataHandleHolder::inputDataObjs
virtual const DataObjIDColl & inputDataObjs() const =0
std::unordered_set< DataObjID, DataObjID_Hasher >
DataHandleHolderVisitor.h
DataObjID.h
std::ref
T ref(T...args)
DHHVisitor::m_odo
DataObjIDColl & m_odo
Definition: DataHandleHolderVisitor.h:19
DHHVisitor::DHHVisitor
DHHVisitor(DataObjIDColl &ido, DataObjIDColl &odo)
Definition: DataHandleHolderVisitor.cpp:14
IDataHandleHolder::outputDataObjs
virtual const DataObjIDColl & outputDataObjs() const =0
DataHandle.h