BRIDGE: simplify bridgegraph
This commit is contained in:
parent
2cac1af5de
commit
9bdf467ce7
|
@ -138,11 +138,7 @@ struct BridgeCFGraph
|
|||
return;
|
||||
auto found = parents.find(child);
|
||||
if(found == parents.end())
|
||||
{
|
||||
std::unordered_set<duint> p;
|
||||
p.insert(parent);
|
||||
parents[child] = p;
|
||||
}
|
||||
parents[child] = std::unordered_set<duint>(std::initializer_list<duint> { parent });
|
||||
else
|
||||
found->second.insert(parent);
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue