luke
/
klayout
mirror of https://github.com/KLayout/klayout.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Better snapping to vertexes - important for center point snapping

This commit is contained in:
Matthias Koefferlein 2025-11-10 23:21:28 +01:00
parent b51b15ac63
commit ea3e1e98b7
1 changed files with 8 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
src/laybasic/laybasic/laySnap.cc
View File

@ -444,7 +444,10 @@ private:
void void
find_closest_exact (const db::DPoint &p, const db::DEdge &e) find_closest_exact (const db::DPoint &p, const db::DEdge &e)
{ {
if (! m_any_exact || m_original.distance (p) < m_original.distance (m_closest_exact)) { bool was_vertex = m_edge1_exact.is_degenerate () && m_edge2_exact.is_degenerate ();
bool is_vertex = e.is_degenerate ();
if (! m_any_exact || (! (was_vertex && ! is_vertex) && (m_original.distance (p) < m_original.distance (m_closest_exact) || (! was_vertex && is_vertex)))) {
if (m_directed) { if (m_directed) {
for (std::vector<db::DEdge>::const_iterator cl = m_cutlines.begin (); cl != m_cutlines.end (); ++cl) { for (std::vector<db::DEdge>::const_iterator cl = m_cutlines.begin (); cl != m_cutlines.end (); ++cl) {
@ -465,7 +468,10 @@ private:
void void
find_closest (const db::DPoint &p, const db::DEdge &e) find_closest (const db::DPoint &p, const db::DEdge &e)
{ {
if (! m_any || m_original.distance (p) < m_original.distance (m_closest)) { bool was_vertex = m_edge1.is_degenerate () && m_edge2.is_degenerate ();
bool is_vertex = e.is_degenerate ();
if (! m_any || (! (was_vertex && ! is_vertex) && (m_original.distance (p) < m_original.distance (m_closest) || (! was_vertex && is_vertex)))) {
if (m_directed) { if (m_directed) {
for (std::vector<db::DEdge>::const_iterator cl = m_cutlines.begin (); cl != m_cutlines.end (); ++cl) { for (std::vector<db::DEdge>::const_iterator cl = m_cutlines.begin (); cl != m_cutlines.end (); ++cl) {