mirror of
https://github.com/ethereum/solidity
synced 2023-10-03 13:03:40 +00:00
fixup! Implementation of Lengauer-Tarjan algorithm to find dominators
This commit is contained in:
parent
37af76405a
commit
1e2069bdfc
@ -47,22 +47,22 @@ public:
|
|||||||
buildDominatorTree();
|
buildDominatorTree();
|
||||||
}
|
}
|
||||||
|
|
||||||
std::vector<Vertex> vertices() const
|
std::vector<Vertex> const& vertices() const
|
||||||
{
|
{
|
||||||
return m_vertex;
|
return m_vertex;
|
||||||
}
|
}
|
||||||
|
|
||||||
std::map<Vertex, size_t> vertexIndices() const
|
std::map<Vertex, size_t> const& vertexIndices() const
|
||||||
{
|
{
|
||||||
return m_vertexIndex;
|
return m_vertexIndex;
|
||||||
}
|
}
|
||||||
|
|
||||||
std::vector<size_t> immediateDominators() const
|
std::vector<size_t> const& immediateDominators() const
|
||||||
{
|
{
|
||||||
return m_immediateDominator;
|
return m_immediateDominator;
|
||||||
}
|
}
|
||||||
|
|
||||||
std::map<size_t, std::vector<size_t>> dominatorTree() const
|
std::map<size_t, std::vector<size_t>> const& dominatorTree() const
|
||||||
{
|
{
|
||||||
return m_dominatorTree;
|
return m_dominatorTree;
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user