45   EdgeIndexMap.insert({&TargetN, Edges.size()});  in insertEdgeInternal()
50   Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK);  in setEdgeKind()
54   auto IndexMapI = EdgeIndexMap.find(&TargetN);  in removeEdgeInternal()
55   if (IndexMapI == EdgeIndexMap.end())  in removeEdgeInternal()
59   EdgeIndexMap.erase(IndexMapI);  in removeEdgeInternal()
64                     DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap,  in addEdge()  argument
66   if (!EdgeIndexMap.insert({&N, Edges.size()}).second)  in addEdge()
108               addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee),  in populateSlow()
122     addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F),  in populateSlow()
130       addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F),  in populateSlow()
173     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref);  in LazyCallGraph()
188     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F),  in LazyCallGraph()
1387       SourceN->EdgeIndexMap.insert({&TargetN, SourceN->Edges.size()});  in insertTrivialCallEdge()
1420       SourceN->EdgeIndexMap.insert({&TargetN, SourceN->Edges.size()});  in insertTrivialRefEdge()