rm square_sparse_matrix

Z3Prover · Mar 8, 2023 · 0fb65de · 0fb65de
1 parent 1781354
commit 0fb65de
Show file tree

Hide file tree

Showing 8 changed files with 3 additions and 1,867 deletions.
diff --git a/src/math/lp/CMakeLists.txt b/src/math/lp/CMakeLists.txt
@@ -41,7 +41,6 @@ z3_add_component(lp
     permutation_matrix.cpp
     random_updater.cpp      
     row_eta_matrix.cpp
-    square_sparse_matrix.cpp
     static_matrix.cpp
   COMPONENT_DEPENDENCIES
     util

diff --git a/src/math/lp/lar_solver.cpp b/src/math/lp/lar_solver.cpp
@@ -783,13 +783,6 @@ namespace lp {
         return r;
     }
 
-
-    template <typename K, typename L>
-    void lar_solver::add_last_rows_to_lu(lp_primal_core_solver<K, L>& s) {
-        lp_assert(false);
-
-    }
-
     bool lar_solver::x_is_correct() const {
         if (m_mpq_lar_core_solver.m_r_x.size() != A_r().column_count()) {
             return false;

diff --git a/src/math/lp/lar_solver.h b/src/math/lp/lar_solver.h
@@ -222,8 +222,6 @@ class lar_solver : public column_namer {
     void update_x_and_inf_costs_for_columns_with_changed_bounds_tableau();
     void solve_with_core_solver();
     numeric_pair<mpq> get_basic_var_value_from_row(unsigned i);
-    template <typename K, typename L>
-    void add_last_rows_to_lu(lp_primal_core_solver<K,L> & s);
     bool x_is_correct() const;
     void fill_last_row_of_A_r(static_matrix<mpq, numeric_pair<mpq>> & A, const lar_term * ls);
     template <typename U, typename V>

diff --git a/src/math/lp/lp_primal_core_solver.h b/src/math/lp/lp_primal_core_solver.h
@@ -926,7 +926,7 @@ class lp_primal_core_solver:public lp_core_solver_base<T, X> {
         m_lower_bounds_dummy.resize(A.column_count(), zero_of_type<T>());
         m_enter_price_eps = numeric_traits<T>::precise() ? numeric_traits<T>::zero() : T(1e-5);
 #ifdef Z3DEBUG
-        // check_correctness();
+        lp_assert(false);
 #endif
     }
 

diff --git a/src/math/lp/square_sparse_matrix.cpp b/src/math/lp/square_sparse_matrix.cpp