#include <BranchChildren.h>

Public Member Functions
void	appendToDescendants (BranchDescription const &parent, BranchIDSet &descendants, std::map< BranchID, BranchID > const &droppedToKeptAlias) const

map_t const &	childLookup () const

void	clear ()

void	insertChild (BranchID parent, BranchID child)

void	insertEmpty (BranchID parent)

Private Types
typedef std::set< BranchID >	BranchIDSet

typedef std::map< BranchID, BranchIDSet >	map_t

Private Member Functions
void	append_ (map_t const &lookup, BranchID item, BranchIDSet &itemSet, std::map< BranchID, BranchID > const &droppedToKeptAlias) const

Private Attributes
map_t	childLookup_

Detailed Description

Definition at line 18 of file BranchChildren.h.

Member Typedef Documentation

◆ BranchIDSet

typedef std::set<BranchID> edm::BranchChildren::BranchIDSet

private

Definition at line 20 of file BranchChildren.h.

◆ map_t

typedef std::map<BranchID, BranchIDSet> edm::BranchChildren::map_t

private

Definition at line 21 of file BranchChildren.h.

Member Function Documentation

◆ append_()

void edm::BranchChildren::append_	(	map_t const &	lookup,
		BranchID	item,
		BranchIDSet &	itemSet,
		std::map< BranchID, BranchID > const &	droppedToKeptAlias
	)		const

private

Definition at line 6 of file BranchChildren.cc.

References ALPAKA_ACCELERATOR_NAMESPACE::vertexFinder::it, and B2GTnPMonitor_cfi::item.

Referenced by appendToDescendants().

                                                                                            {
     auto const iter = lookup.find(item);
     if (iter != lookup.end()) {
       BranchIDSet const& branchIDs = iter->second;
       for (BranchID const& branchID : branchIDs) {
         auto it = droppedToKeptAlias.find(branchID);
         // Insert the BranchID of the children into the set of descendants.
         // If the insert succeeds, append recursively.
         if (it == droppedToKeptAlias.end()) {
           // Normal case. Not an EDAlias.
           if (itemSet.insert(branchID).second) {
             append_(lookup, branchID, itemSet, droppedToKeptAlias);
           }
         } else {
           // In this case, we want to put the EDAlias in the
           // set of things to drop because that is what really
           // needs to be dropped, but the recursive search in
           // the lookup map must continue with the original BranchID
           // because that is what the lookup map contains.
           if (itemSet.insert(it->second).second) {
             append_(lookup, branchID, itemSet, droppedToKeptAlias);
           }
         }
       }
     }
   }

◆ appendToDescendants()

void edm::BranchChildren::appendToDescendants	(	BranchDescription const &	parent,
		BranchIDSet &	descendants,
		std::map< BranchID, BranchID > const &	droppedToKeptAlias
	)		const

Definition at line 42 of file BranchChildren.cc.

References append_(), childLookup_, and class-composition::parent.

                                                                                                        {
     descendants.insert(parent.branchID());
     // A little tricky here. The child lookup map is filled with the
     // BranchID of the original product even if there was an EDAlias
     // and the EDAlias was saved and the original branch dropped.
     append_(childLookup_, parent.originalBranchID(), descendants, droppedToKeptAlias);
   }