@@ -5,7 +5,7 @@
#include <igl/readTGF.h>
#include <igl/bbw.h>
-TEST_CASE("bbw: decimated_knight", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("bbw: decimated_knight", "[igl]" "[slow]")
{
Eigen::MatrixXd V,C;
Eigen::MatrixXi T,F,E;
@@ -19,7 +19,7 @@ TEST_CASE("boundary_loop: cube", "[igl]")
REQUIRE (boundary.size() == 0);
}
-TEST_CASE("boundary_loop: bunny", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("boundary_loop: bunny", "[igl]" "[slow]")
Eigen::MatrixXd V;
Eigen::MatrixXi F;
@@ -2,7 +2,7 @@
#include <igl/PI.h>
#include <igl/cotmatrix.h>
-TEST_CASE("cotmatrix: constant_in_null_space", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("cotmatrix: constant_in_null_space", "[igl]" "[slow]")
const auto test_case = [](const std::string ¶m)
@@ -61,7 +61,7 @@ TEST_CASE("cotmatrix_intrinsic: periodic", "[igl]")
test_common::assert_near(L_d,L_gt,igl::EPS<double>());
-TEST_CASE("cotmatrix_intrinsic: manifold_meshes", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("cotmatrix_intrinsic: manifold_meshes", "[igl]" "[slow]")
auto test_case = [](const std::string ¶m)
@@ -1,7 +1,7 @@
#include <test_common.h>
#include <igl/doublearea.h>
-TEST_CASE("doublearea: VF_vs_ABC", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("doublearea: VF_vs_ABC", "[igl]" "[slow]")
#include <igl/edge_flaps.h>
-TEST_CASE("edge_flaps: verify", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("edge_flaps: verify", "[igl]" "[slow]")
@@ -52,7 +52,7 @@ TEST_CASE("fast_winding_number: one_point_cloud", "[igl]")
test_common::assert_near(WiP,WiP_cached,1e-15);
-TEST_CASE("fast_winding_number: meshes", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("fast_winding_number: meshes", "[igl]" "[slow]")
@@ -37,7 +37,7 @@ TEST_CASE("intrinsic_delaunay_cotmatrix: skewed_grid", "[igl]")
-TEST_CASE("intrinsic_delaunay_cotmatrix: manifold_meshes", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("intrinsic_delaunay_cotmatrix: manifold_meshes", "[igl]" "[slow]")
#include <igl/is_edge_manifold.h>
-TEST_CASE("is_edge_manifold: positive", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("is_edge_manifold: positive", "[igl]" "[slow]")
@@ -9,7 +9,7 @@
#include <igl/iterative_closest_point.h>
-TEST_CASE("iterative_closest_point: identity","[igl]" IGL_DEBUG_OFF)
+TEST_CASE("iterative_closest_point: identity","[igl]" "[slow]")
@@ -3,7 +3,7 @@
#include <igl/per_face_normals.h>
#include <Eigen/Geometry>
-TEST_CASE("per_face_normals: dot", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("per_face_normals: dot", "[igl]" "[slow]")
@@ -6,7 +6,7 @@
//#include <igl/hausdorff.h>
#include <igl/writePLY.h>
-TEST_CASE("qslim: cylinder", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("qslim: cylinder", "[igl]" "[slow]")
using namespace igl;
const int axis_devisions = 5;
#include <igl/triangle_triangle_adjacency.h>
-TEST_CASE("triangle_triangle_adjacency: dot", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("triangle_triangle_adjacency: dot", "[igl]" "[slow]")
@@ -27,7 +27,7 @@ TEST_CASE("upsample: single_triangle", "[igl]")
test_common::assert_eq(NV_groundtruth,NV);
-TEST_CASE("upsample: V_comes_first_F_ordering", "[igl]" IGL_DEBUG_OFF)
+TEST_CASE("upsample: V_comes_first_F_ordering", "[igl]" "[slow]")
@@ -17,12 +17,6 @@
#include <algorithm>
#include <tuple>
-#ifdef NDEBUG
-#define IGL_DEBUG_OFF ""
-#else
-#define IGL_DEBUG_OFF "[!hide]"
-#endif
-
namespace test_common
template<typename Param, typename Fun>