Searched refs:InverseMap (Results 1 – 4 of 4) sorted by relevance
342 InterExplodedGraphMap *InverseMap) const{ in trim()408 if (InverseMap) (*InverseMap)[NewN] = N; in trim()
2827 InterExplodedGraphMap InverseMap; member in __anon9d1265590311::TrimmedGraph2877 G.reset(OriginalGraph->trim(Nodes, &ForwardMap, &InverseMap)); in TrimmedGraph()2955 InterExplodedGraphMap::const_iterator IMitr = InverseMap.find(OrigN); in popNextReportGraph()2956 assert(IMitr != InverseMap.end() && "No mapping to original node."); in popNextReportGraph()
522 InverseMapTy InverseMap;552 typename InverseMapTy::iterator IMI = InverseMap.find(CP);553 assert(IMI != InverseMap.end() && IMI->second != Map.end() &&580 InverseMap.insert(std::make_pair(Result, I));611 InverseMap.erase(CP);632 InverseMap[C] = I;
377 InterExplodedGraphMap *InverseMap = nullptr) const;