44   EdgeIndexMap.insert({&TargetN, Edges.size()});  in insertEdgeInternal()
49   Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK);  in setEdgeKind()
53   auto IndexMapI = EdgeIndexMap.find(&TargetN);  in removeEdgeInternal()
54   if (IndexMapI == EdgeIndexMap.end())  in removeEdgeInternal()
58   EdgeIndexMap.erase(IndexMapI);  in removeEdgeInternal()
63                     DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap,  in addEdge()  argument
65   if (!EdgeIndexMap.insert({&N, Edges.size()}).second)  in addEdge()
107               addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee),  in populateSlow()
121     addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F),  in populateSlow()
129       addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F),  in populateSlow()
176     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref);  in LazyCallGraph()
188       addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(*F), Edge::Ref);  in LazyCallGraph()
204     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F),  in LazyCallGraph()
1412       SourceN->EdgeIndexMap.insert({&TargetN, SourceN->Edges.size()});  in insertTrivialCallEdge()
1445       SourceN->EdgeIndexMap.insert({&TargetN, SourceN->Edges.size()});  in insertTrivialRefEdge()