test sparse map

Author: alecjacobson

README.md

@@ -45,9 +45,11 @@ According to the [scikit-build-core documentation](https://scikit-build-core.rea
  2. Then use this very long command:
 
 ```
-python -m pip install --no-build-isolation --config-settings=editable.rebuild=true -Cbuild-dir=build -ve.
+CMAKE_BUILD_PARALLEL_LEVEL=10  python -m pip install --no-build-isolation --config-settings=editable.rebuild=true -Cbuild-dir=build -ve.
 ```
 
+The `CMAKE_BUILD_PARALLEL_LEVEL=10` will invoke with 10 parallel build threads.
+
 ### Adding a missing binding
 
 Bindings are fairly mechanical to write. For example, suppose we didn't have a

src/sparse_map_noop.cpp

@@ -0,0 +1,27 @@
+#include "default_types.h"
+#include <nanobind/nanobind.h>
+#include <nanobind/eigen/sparse.h>
+#include <nanobind/ndarray.h>
+#include <nanobind/stl/tuple.h>
+
+namespace nb = nanobind;
+using namespace nb::literals;
+
+namespace pyigl
+{
+  auto sparse_map_noop( const Eigen::Map<const Eigen::SparseMatrix<Integer>> &A)
+  {
+    return A;
+  }
+}
+
+// Bind the wrapper to the Python module
+void bind_sparse_map_noop(nb::module_ &m)
+{
+  m.def(
+    "sparse_map_noop",
+    &pyigl::sparse_map_noop,
+    "A"_a,
+R"("Returns input A)");
+}
+

src/sparse_map_shape.cpp

@@ -0,0 +1,29 @@
+#include "default_types.h"
+#include <nanobind/nanobind.h>
+#include <nanobind/eigen/sparse.h>
+#include <nanobind/ndarray.h>
+#include <nanobind/stl/tuple.h>
+
+namespace nb = nanobind;
+using namespace nb::literals;
+
+namespace pyigl
+{
+  auto sparse_map_shape( const Eigen::Map<const Eigen::SparseMatrix<Integer>> &A)
+  {
+    Eigen::Matrix<Integer,2,1> dims(A.rows(), A.cols());
+    return dims;
+  }
+}
+
+// Bind the wrapper to the Python module
+void bind_sparse_map_shape(nb::module_ &m)
+{
+  m.def(
+    "sparse_map_shape",
+    &pyigl::sparse_map_shape,
+    "A"_a,
+R"("Returns shape of A as 2-vector)");
+}
+
+

src/sparse_noop.cpp

@@ -9,7 +9,7 @@ using namespace nb::literals;
 
 namespace pyigl
 {
-  auto sparse_noop( const Eigen::Map<const Eigen::SparseMatrix<Integer>> &A)
+  auto sparse_noop( const Eigen::SparseMatrix<Integer> &A)
   {
     return A;
   }

src/sparse_shape.cpp

@@ -9,7 +9,7 @@ using namespace nb::literals;
 
 namespace pyigl
 {
-  auto sparse_shape( const Eigen::Map<const Eigen::SparseMatrix<Integer>> &A)
+  auto sparse_shape( const Eigen::SparseMatrix<Integer> &A)
   {
     Eigen::Matrix<Integer,2,1> dims(A.rows(), A.cols());
     return dims;

test_sparse.py

@@ -2,8 +2,14 @@
 import time
 
 V, F = igl.icosahedron()
+V, F = igl.upsample(V, F)
+V, F = igl.upsample(V, F)
+V, F = igl.upsample(V, F)
+V, F = igl.upsample(V, F)
+V, F = igl.upsample(V, F)
+V, F = igl.upsample(V, F)
 
-max_iters = 10
+max_iters = 6
 for i in range(max_iters):
     A = igl.adjacency_matrix(F)
     n = A.shape[0]
@@ -16,7 +22,15 @@
     A2 = igl.sparse_noop(A)
     t_noop = time.time() - start
 
-    print(f"{n} {t_shape:.6g} {t_noop:.6g}")
+    start = time.time()
+    dims = igl.sparse_map_shape(A)
+    t_map_shape = time.time() - start
+
+    start = time.time()
+    A2 = igl.sparse_map_noop(A)
+    t_map_noop = time.time() - start
+
+    print(f"{n} {t_shape:.6g} {t_noop:.6g} {t_map_shape:.6g} {t_map_noop:.6g}")
 
     if i != max_iters-1:
         V, F = igl.upsample(V, F)