42   EdgeIndexMap.try_emplace(&TargetN, Edges.size());  in insertEdgeInternal()
47   Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK);  in setEdgeKind()
51   auto IndexMapI = EdgeIndexMap.find(&TargetN);  in removeEdgeInternal()
52   if (IndexMapI == EdgeIndexMap.end())  in removeEdgeInternal()
56   EdgeIndexMap.erase(IndexMapI);  in removeEdgeInternal()
61                     DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap,  in addEdge()  argument
63   if (!EdgeIndexMap.try_emplace(&N, Edges.size()).second)  in addEdge()
105               addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee),  in populateSlow()
119     addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F),  in populateSlow()
127       addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F),  in populateSlow()
174     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref);  in LazyCallGraph()
186       addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(*F), Edge::Ref);  in LazyCallGraph()
202     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F),  in LazyCallGraph()
1409       SourceN->EdgeIndexMap.try_emplace(&TargetN, SourceN->Edges.size());  in insertTrivialCallEdge()
1436       SourceN->EdgeIndexMap.try_emplace(&TargetN, SourceN->Edges.size());  in insertTrivialRefEdge()