#include <Run2ToRun3TrigNavConverterV2.h>

Collaboration diagram for ConvProxy:

Public Member Functions
	ConvProxy (const HLT::TriggerElement *te)

bool	isChild (const ConvProxy *other) const

bool	isParent (const ConvProxy *other) const

bool	mergeAllowed (const ConvProxy *other) const

void	merge (ConvProxy *other)

std::string	description () const

Public Attributes
const HLT::TriggerElement *	te = nullptr

std::vector< HLT::te_id_type >	teIDs

std::set< ConvProxy * >	children

std::set< ConvProxy * >	parents

std::set< HLT::Identifier >	runChains

std::set< HLT::Identifier >	passChains

uint64_t	feaHash = MissingFEA

std::vector< HLT::TriggerElement::FeatureAccessHelper >	features

std::vector< HLT::TriggerElement::FeatureAccessHelper >	rois

std::vector< HLT::TriggerElement::FeatureAccessHelper >	tracks

TrigCompositeUtils::Decision *	l1Node {nullptr}

TrigCompositeUtils::Decision *	imNode {nullptr}

std::vector< TrigCompositeUtils::Decision * >	hNode

Static Public Attributes
static const uint64_t	MissingFEA = 0

Detailed Description

Definition at line 33 of file Run2ToRun3TrigNavConverterV2.h.

Constructor & Destructor Documentation

◆ ConvProxy()

ConvProxy::ConvProxy ( const HLT::TriggerElement * te )

Definition at line 21 of file Run2ToRun3TrigNavConverterV2.cxx.

                                                : te{t}
 {
   teIDs.push_back(te->getId());
 }

Member Function Documentation

◆ description()

std::string ConvProxy::description ( ) const

Definition at line 129 of file Run2ToRun3TrigNavConverterV2.cxx.

 {
   std::string ret;
   ret += " N parents: " + std::to_string(parents.size());
   ret += " N children: " + std::to_string(children.size());
   std::ostringstream os;
   for ( auto c: children )
     os << c << " ";
   ret += " ptrs: " + os.str();
   ret += " feaHash: " + std::to_string(feaHash);
   ret += " N run chains: " + std::to_string(runChains.size());
   return ret;
 }

◆ isChild()

bool ConvProxy::isChild ( const ConvProxy * other ) const

Definition at line 27 of file Run2ToRun3TrigNavConverterV2.cxx.

                                                      {
   for ( auto c: children ) {
     if (other == c)
       return true;
     if ( c->isChild(other) )
       return true;
   }
   return false;
 }

◆ isParent()

bool ConvProxy::isParent ( const ConvProxy * other ) const

Definition at line 37 of file Run2ToRun3TrigNavConverterV2.cxx.

                                                       {
   for ( auto c: parents ) {
     if (other == c)
       return true;
     if ( c->isParent(other) )
       return true;
   }
   return false;
 }

◆ merge()

void ConvProxy::merge ( ConvProxy * other )

Definition at line 60 of file Run2ToRun3TrigNavConverterV2.cxx.

 {
   if (other == this)
   {
     return;
   }
   // copy over chains
   runChains.insert(other->runChains.begin(), other->runChains.end());
   passChains.insert(other->passChains.begin(), other->passChains.end());
   teIDs.push_back(other->te->getId());
   /* the intention of the code below is following.
   Intial structure like is like this (the line is always bidirectional):
   P1 P2 P3 <- parents
    | | /
   T1 T2 <- "this" and "other"
    | |
   C1 C2 <- children
   1) Lets assume that the first proxies we treat are B1 & B2 ath they are mergable. The resulting structure should look like this:
   P1 P2 P3
    |/__/
   T1 T2
    |\
   C1 C2
  
   */
   auto add = [](ConvProxy *toadd, std::set<ConvProxy *> &coll)
   {
     if (std::find(coll.begin(), coll.end(), toadd) == coll.end())
     {
       coll.insert(toadd);
     }
   };
  
   auto remove = [](ConvProxy *torem, std::set<ConvProxy *> &coll)
   {
     auto place = std::find(coll.begin(), coll.end(), torem);
     if (place != coll.end())
     {
       coll.erase(place);
     }
   };
  
   // this is T <-> C connection
   for (auto otherChild : other->children)
   {
     add(otherChild, children);
     add(this, otherChild->parents);
   }
   // this is T <-> P connection rewiring
   for (auto otherParent : other->parents)
   {
     add(otherParent, parents);
     add(this, otherParent->children);
   }
  
   // now need to remove links back to the "other"
   for (auto otherParent : other->parents)
   {
     remove(other, otherParent->children);
   }
  
   for (auto otherChild : other->children)
   {
     remove(other, otherChild->parents);
   }
   other->children.clear();
   other->parents.clear();
 }

◆ mergeAllowed()

bool ConvProxy::mergeAllowed ( const ConvProxy * other ) const

Definition at line 48 of file Run2ToRun3TrigNavConverterV2.cxx.

 {
   if (this == other)
     return false; // no merging with self
   // never merge children with parents
   if ( isChild(other) )
     return false;
   if ( isParent(other) )
     return false;
   return true;
 }