307     for (const auto &[Chain, ChainEdge] : Edges) {  in getEdge()
315     auto It = Edges.begin();  in removeEdge()
316     while (It != Edges.end()) {  in removeEdge()
318         Edges.erase(It);  in removeEdge()
326     Edges.push_back(std::make_pair(Other, Edge));  in addEdge()
347     Edges.clear();  in clear()
348     Edges.shrink_to_fit();  in clear()
363   std::vector<std::pair<ChainT *, ChainEdge *>> Edges;  member
475   for (const auto &[DstChain, DstEdge] : Other->Edges) {  in mergeEdges()
755         for (const auto &[ChainSucc, Edge] : ChainPred->Edges) {  in mergeChainPairs()
975     for (auto EdgeIt : Into->Edges)  in mergeChains()
1143       for (const auto &[_, Edge] : Node.CurChain->Edges) {  in mergeChainPairs()
1169       for (const auto &[_, ChainEdge] : BestSrcChain->Edges)  in mergeChainPairs()
1171       for (const auto &[_, ChainEdge] : BestDstChain->Edges)  in mergeChainPairs()
1181       for (const auto &[_, Edge] : BestSrcChain->Edges) {  in mergeChainPairs()