luke/klayout
1
0
Fork 0
mirror of https://github.com/KLayout/klayout.git synced 2026-09-07 11:31:08 +02:00
Code Issues Packages Projects Releases Wiki Activity

RBA tests, reproducible order of edge events, all edges are reported - even those which do not have neighbors.

Browse Source
This commit is contained in:
Matthias Koefferlein
2024-10-31 23:43:27 +01:00
parent 3073c1917f
commit 2629700566
6 changed files with 136 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/db/db/dbEdgeNeighborhood.cc
+21 -5
View File
@@ -117,7 +117,7 @@ EdgeNeighborhoodCompoundOperationNode::EdgeNeighborhoodCompoundOperationNode (co
db::Coord
EdgeNeighborhoodCompoundOperationNode::computed_dist () const
{
return std::max (std::max (m_bext, m_eext), std::max (m_din, m_dout));
return std::max (std::max (m_bext, m_eext), std::max (m_din, m_dout)) + 1;
}
std::string
@@ -140,25 +140,41 @@ public:
// .. nothing yet ..
}
void add (const db::Edge *o1, const unsigned int & /*p1*/, const db::Polygon *o2, const unsigned int &p2)
void add (const db::Edge *o1, const unsigned int &p1, const db::Polygon *o2, const unsigned int &p2)
{
m_edge_neighbors[o1][p2].push_back (o2);
m_edge_neighbors[p1][p2].push_back (o2);
enter_edge (o1, p1);
}
void finish1 (const db::Edge *o1, const unsigned int &p1)
{
m_edge_neighbors[p1];
enter_edge (o1, p1);
}
void finalize (bool)
{
for (auto en = m_edge_neighbors.begin (); en != m_edge_neighbors.end (); ++en) {
commit_edge (*en->first, en->second);
commit_edge (m_edges[en->first], en->second);
}
}
private:
std::map<const db::Edge *, std::map<unsigned int, std::vector<const db::Polygon *> > > m_edge_neighbors;
std::map<unsigned int, std::map<unsigned int, std::vector<const db::Polygon *> > > m_edge_neighbors;
std::vector<db::Edge> m_edges;
db::EdgeNeighborhoodVisitor *mp_visitor;
const db::Layout *mp_layout;
const db::Cell *mp_cell;
db::Coord m_bext, m_eext, m_din, m_dout;
void enter_edge (const db::Edge *o1, const unsigned int &p1)
{
while (size_t (p1) >= m_edges.size ()) {
m_edges.push_back (db::Edge ());
}
m_edges[p1] = *o1;
}
void commit_edge (const db::Edge &edge, const std::map<unsigned int, std::vector<const db::Polygon *> > &neighbors) const
{
if (edge.is_degenerate ()) {
src/rba/unit_tests/rbaTests.cc
+1
View File
@@ -101,6 +101,7 @@ RUBYTEST (dbEdgePairsTest, "dbEdgePairsTest.rb")
RUBYTEST (dbEdgePairTest, "dbEdgePairTest.rb")
RUBYTEST (dbEdgesTest, "dbEdgesTest.rb")
RUBYTEST (dbEdgeTest, "dbEdgeTest.rb")
RUBYTEST (dbEdgeNeighborhood, "dbEdgeNeighborhood.rb")
RUBYTEST (dbGlyphs, "dbGlyphs.rb")
RUBYTEST (dbHierNetworkProcessorTests, "dbHierNetworkProcessorTests.rb")
RUBYTEST (dbInstanceTest, "dbInstanceTest.rb")