unittest/sparse: add checks for results.info.backend_sparse

Author: fabinsch

test/src/sparse_qp_solve.py

@@ -308,7 +308,6 @@ def test_case_different_matrix_free_sparse_backend(self):
             l=np.asfortranarray(l),
             u=np.asfortranarray(u),
             eps_abs=1.0e-9,
-            verbose=false,
             sparse_backend=proxsuite.proxqp.SparseBackend.MatrixFree,
         )
         dua_res = normInf(

test/src/sparse_qp_wrapper.cpp

@@ -286,6 +286,8 @@ TEST_CASE("ProxQP::sparse: sparse random strongly convex qp with equality and "
                                   qp_random.C * qp.results.x - qp_random.l)));
     CHECK(dua_res <= 1e-9);
     CHECK(pri_res <= 1E-9);
+    CHECK(qp.results.info.sparse_backend ==
+          proxsuite::proxqp::SparseBackend::MatrixFree);
     std::cout << "--n = " << n << " n_eq " << n_eq << " n_in " << n_in
               << std::endl;
     std::cout << "dual residual " << dua_res << "; primal residual " << pri_res
@@ -328,6 +330,8 @@ TEST_CASE("ProxQP::sparse: sparse random strongly convex qp with equality and "
                                   qp_random.C * qp2.results.x - qp_random.l)));
     CHECK(dua_res2 <= 1e-9);
     CHECK(pri_res2 <= 1E-9);
+    CHECK(qp2.results.info.sparse_backend ==
+          proxsuite::proxqp::SparseBackend::SparseCholesky);
     std::cout << "--n = " << n << " n_eq " << n_eq << " n_in " << n_in
               << std::endl;
     std::cout << "dual residual " << dua_res2 << "; primal residual "

test/src/sparse_qp_wrapper.py

@@ -124,6 +124,9 @@ def test_case_setting_SparseBackend(self):
         )
         assert dua_res <= 1e-9
         assert pri_res <= 1e-9
+        assert (
+            qp.results.info.sparse_backend == proxsuite.proxqp.SparseBackend.MatrixFree
+        )
         print("--n = {} ; n_eq = {} ; n_in = {}".format(n, n_eq, n_in))
         print("dual residual = {} ; primal residual = {}".format(dua_res, pri_res))
         print("total number of iteration: {}".format(qp.results.info.iter))
@@ -132,13 +135,14 @@ def test_case_setting_SparseBackend(self):
                 qp.results.info.setup_time, qp.results.info.solve_time
             )
         )
-
         qp2 = proxsuite.proxqp.sparse.QP(H_, A_, C_)
         qp2.settings.eps_abs = 1.0e-9
         qp2.settings.verbose = True
         assert qp2.settings.sparse_backend == proxsuite.proxqp.SparseBackend.Automatic
-        qp2.settings.sparse_backend = proxsuite.proxqp.SparseBackend.MatrixFree
-        assert qp2.settings.sparse_backend == proxsuite.proxqp.SparseBackend.MatrixFree
+        qp2.settings.sparse_backend = proxsuite.proxqp.SparseBackend.SparseCholesky
+        assert (
+            qp2.settings.sparse_backend == proxsuite.proxqp.SparseBackend.SparseCholesky
+        )
         qp2.init(H=H, g=g, A=A, b=b, C=C, u=u, l=l, rho=1.0e-7)
         qp2.solve()
         dua_res = normInf(
@@ -156,6 +160,10 @@ def test_case_setting_SparseBackend(self):
         )
         assert dua_res <= 1e-9
         assert pri_res <= 1e-9
+        assert (
+            qp2.results.info.sparse_backend
+            == proxsuite.proxqp.SparseBackend.SparseCholesky
+        )
         print("--n = {} ; n_eq = {} ; n_in = {}".format(n, n_eq, n_in))
         print("dual residual = {} ; primal residual = {}".format(dua_res, pri_res))
         print("total number of iteration: {}".format(qp2.results.info.iter))