Lines Matching full:successors
39 for (const auto &[Hash, Successor] : Current->Successors) in walkGraph()
45 for (const auto &P : Current->Successors) in walkGraph()
76 auto I = Current->Successors.find(StableHash); in insert()
77 if (I == Current->Successors.end()) { in insert()
81 Current->Successors.emplace(StableHash, std::move(Next)); in insert()
103 for (auto &[Hash, NextSrcNode] : SrcNode->Successors) { in merge()
105 auto I = DstNode->Successors.find(Hash); in merge()
106 if (I == DstNode->Successors.end()) { in merge()
110 DstNode->Successors.emplace(Hash, std::move(NextDst)); in merge()
123 const auto I = Current->Successors.find(StableHash); in find()
124 if (I == Current->Successors.end()) in find()