6 auto const iter = lookup.find(item);
7 if(iter != lookup.end()) {
9 for(
BranchID const& branchID : branchIDs) {
12 if(itemSet.insert(branchID).second) {
13 append_(lookup, branchID, itemSet);
36 descendants.insert(parent);
void insertEmpty(BranchID parent)
void insertChild(BranchID parent, BranchID child)
std::set< BranchID > BranchIDSet
void append_(map_t const &lookup, BranchID item, BranchIDSet &itemSet) const
std::map< BranchID, BranchIDSet > map_t
void appendToDescendants(BranchID parent, BranchIDSet &descendants) const