9 #include "TClonesArray.h"
18 fPersistanceCheck(kTRUE),
28 fPersistanceCheck(persistanceCheck),
37 fPersistanceCheck(persistanceCheck),
49 fPersistanceCheck(persistanceCheck),
59 if (pos < (Int_t)
fLinks.size()) {
60 std::set<FairLink>::iterator
it =
fLinks.begin();
61 for (
int i = 0; i <
pos; i++) { it++; }
64 std::cout <<
"-E- FairMultiLinkedData:GetLink(pos) pos " << pos <<
" outside range " <<
fLinks.size() << std::endl;
90 std::set<FairLink> myLinks = links.
GetLinks();
91 for (std::set<FairLink>::iterator
it = myLinks.begin();
it != myLinks.end();
it++) {
105 Float_t weight = link.
GetWeight() * mult;
112 std::cout <<
"-W- no IOManager present!" << std::endl;
116 std::cout <<
"Add FairLink: " << link << std::endl;
126 if (bypass == kFALSE) {
132 std::cout <<
"BYPASS!" << std::endl;
138 if (bypass == kTRUE) {
143 std::cout <<
"Entries in " << ioman->
GetBranchName(link.
GetType()) <<
" Array: " << array->GetEntries() << std::endl;
147 std::cout <<
"FairMultiLinkedData has " << links->
GetNLinks() <<
" Entries: " << std::endl;
148 std::cout << *links << std::endl;
163 std::set<FairLink>::iterator
it =
fLinks.find(link);
168 fLinks.insert(myTempLink);
188 return std::distance(
fLinks.begin(),
it);
206 if (
it->GetType() == type) {
219 TClonesArray* myArray = (TClonesArray*)ioman->
GetObject(branchName);
221 if (myArray->GetEntries() > myLink.
GetIndex()) {
222 return myArray->At(myLink.
GetIndex());
223 }
else { std::cout <<
"-E- FairMultiLinkedData::GetData index out of bounds" << std::endl; }
224 }
else { std::cout <<
"-E- FairMultiLinkedData::GetData no TClonesArray" << std::endl; }
225 }
else { std::cout <<
"-E- FairMultiLinkedData::GetData Branch does not exist in Memory" << std::endl; }
232 std::set<FairLink> tempLinks;
236 tempLinks.insert(tempLink);
243 std::set<FairLink> tempLinks;
247 tempLinks.insert(tempLink);
254 std::set<FairLink> tempLinks;
258 tempLinks.insert(tempLink);