diff --git a/tests/libslic3r/test_astar.cpp b/tests/libslic3r/test_astar.cpp index 867f5be470..4e540c3c1e 100644 --- a/tests/libslic3r/test_astar.cpp +++ b/tests/libslic3r/test_astar.cpp @@ -134,7 +134,7 @@ struct CellGridTracer2D_AllDirs { template void foreach_reachable(const Vec2i &src, Fn &&fn) const { - auto is_inside = [](const Vec2i& v) { return v.x() >= 0 && v.x() < Cols && v.y() >= 0 && v.y() < Rows; }; + auto is_inside = [](const Vec2i& v) { return v.x() >= 0 && v.x() < int(Cols) && v.y() >= 0 && v.y() < int(Rows); }; if (Vec2i crd = src + Vec2i{0, 1}; is_inside(crd) && grid[crd.y()] [crd.x()] == ON) fn(crd); if (Vec2i crd = src + Vec2i{1, 0}; is_inside(crd) && grid[crd.y()] [crd.x()] == ON) fn(crd); if (Vec2i crd = src + Vec2i{1, 1}; is_inside(crd) && grid[crd.y()] [crd.x()] == ON) fn(crd); @@ -171,7 +171,7 @@ struct CellGridTracer2D_Axis { template void foreach_reachable(const Vec2i &src, Fn &&fn) const { - auto is_inside = [](const Vec2i& v) { return v.x() >= 0 && v.x() < Cols && v.y() >= 0 && v.y() < Rows; }; + auto is_inside = [](const Vec2i& v) { return v.x() >= 0 && v.x() < int(Cols) && v.y() >= 0 && v.y() < int(Rows); }; if (Vec2i crd = src + Vec2i{0, 1}; is_inside(crd) && grid[crd.y()] [crd.x()] == ON) fn(crd); if (Vec2i crd = src + Vec2i{0, -1}; is_inside(crd) && grid[crd.y()] [crd.x()] == ON) fn(crd); if (Vec2i crd = src + Vec2i{1, 0}; is_inside(crd) && grid[crd.y()] [crd.x()] == ON) fn(crd); diff --git a/tests/libslic3r/test_kdtreeindirect.cpp b/tests/libslic3r/test_kdtreeindirect.cpp index 28d409bbbf..bc6ace7954 100644 --- a/tests/libslic3r/test_kdtreeindirect.cpp +++ b/tests/libslic3r/test_kdtreeindirect.cpp @@ -31,11 +31,6 @@ static double volume(const BoundingBox3Base &box) return sz.x() * sz.y() * sz.z(); } -static double volume(const Eigen::AlignedBox &box) -{ - return box.volume(); -} - TEST_CASE("Test kdtree query for a Box", "[KDTreeIndirect]") { auto vol = BoundingBox3Base{{0.f, 0.f, 0.f}, {10.f, 10.f, 10.f}};