Searched refs:incomingDegreeMapCopy (Results 1 – 2 of 2) sorted by relevance
112 std::map<std::string, uint32_t> incomingDegreeMapCopy; in PreTopologicalLoopDetection() local113 incomingDegreeMapCopy.insert(incomingDegreeMap_.begin(), incomingDegreeMap_.end()); in PreTopologicalLoopDetection()119 … if (incomingDegreeMapCopy.find(node) == incomingDegreeMapCopy.end() || IsAnchorContainer(node)) { in PreTopologicalLoopDetection()122 incomingDegreeMapCopy[node] -= 1; in PreTopologicalLoopDetection()123 if (incomingDegreeMapCopy[node] == 0) { in PreTopologicalLoopDetection()127 incomingDegreeMapCopy.erase(currentNodeName); in PreTopologicalLoopDetection()132 for (const auto& node : incomingDegreeMapCopy) { in PreTopologicalLoopDetection()
1239 std::map<std::string, uint32_t> incomingDegreeMapCopy; in PreTopologicalLoopDetection() local1240 incomingDegreeMapCopy.insert(incomingDegreeMap_.begin(), incomingDegreeMap_.end()); in PreTopologicalLoopDetection()1246 auto it = incomingDegreeMapCopy.find(node); in PreTopologicalLoopDetection()1247 if (it == incomingDegreeMapCopy.end() || IsAnchorContainer(node)) { in PreTopologicalLoopDetection()1255 incomingDegreeMapCopy.erase(currentNodeInspectorId); in PreTopologicalLoopDetection()1258 if (!incomingDegreeMapCopy.empty()) { in PreTopologicalLoopDetection()1260 for (const auto& node : incomingDegreeMapCopy) { in PreTopologicalLoopDetection()