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

WIP (quad tree)

This commit is contained in:
Matthias Koefferlein 2025-03-16 16:43:56 +01:00
parent 4369835e8b
commit 477e2b5a31
1 changed files with 26 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
src/db/unit_tests/dbQuadTreeTests.cc
View File

@ -50,7 +50,7 @@ std::string find_all (const MyQuadTree &qt)
return tl::join (v, "/");
}
std::string find_touching (const MyQuadTree &qt, const db::DBox &box)
std::string find_touching (const MyQuadTree &qt, const db::DBox &box, bool report = false)
{
std::vector<std::string> v;
auto i = qt.begin_touching (box);
@ -58,6 +58,9 @@ std::string find_touching (const MyQuadTree &qt, const db::DBox &box)
v.push_back (i->to_string ());
++i;
}
if (report) {
tl::info << v.size () << " items found.";
}
std::sort (v.begin (), v.end ());
return tl::join (v, "/");
}
@ -76,7 +79,7 @@ std::string find_touching_from_all (const MyQuadTree &qt, const db::DBox &box)
return tl::join (v, "/");
}
std::string find_overlapping (const MyQuadTree &qt, const db::DBox &box)
std::string find_overlapping (const MyQuadTree &qt, const db::DBox &box, bool report = false)
{
std::vector<std::string> v;
auto i = qt.begin_overlapping (box);
@ -84,6 +87,9 @@ std::string find_overlapping (const MyQuadTree &qt, const db::DBox &box)
v.push_back (i->to_string ());
++i;
}
if (report) {
tl::info << v.size () << " items found.";
}
std::sort (v.begin (), v.end ());
return tl::join (v, "/");
}
@ -472,6 +478,7 @@ TEST(many)
MyQuadTree tree;
unsigned int n = 1000;
unsigned int ntests = 100;
for (unsigned int i = 0; i < n; ++i) {
tree.insert (rbox ());
@ -480,10 +487,27 @@ TEST(many)
EXPECT_EQ (tree.check (), true);
EXPECT_EQ (tree.size (), size_t (n));
bool report = false;
for (unsigned int i = 0; i < ntests; ++i) {
if (report) {
tl::info << "Test iteration " << i << " ...";
}
auto bx = rbox ();
EXPECT_EQ (find_overlapping (tree, bx, report), find_overlapping_from_all (tree, bx));
EXPECT_EQ (find_touching (tree, bx, report), find_touching_from_all (tree, bx));
bx = db::DBox (bx.center (), bx.center ());
EXPECT_EQ (find_touching (tree, bx, report), find_touching_from_all (tree, bx));
}
bool r = true;
while (r && ! tree.empty ()) {
r = tree.erase (*tree.begin ());
EXPECT_EQ (r, true);
EXPECT_EQ (tree.check (), true);
}
EXPECT_EQ (tree.empty (), true);
EXPECT_EQ (tree.check (), true);
EXPECT_EQ (tree.levels (), size_t (1));
EXPECT_EQ (tree.size (), size_t (0));
}