Skip to content

Commit

Permalink
rm dead code
Browse files Browse the repository at this point in the history
  • Loading branch information
levnach committed Mar 8, 2023
1 parent c6be67b commit 13549af
Show file tree
Hide file tree
Showing 5 changed files with 2 additions and 35 deletions.
1 change: 0 additions & 1 deletion src/math/lp/CMakeLists.txt
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,6 @@ z3_add_component(lp
lp_core_solver_base.cpp
lp_primal_core_solver.cpp
lp_settings.cpp
lp_utils.cpp
matrix.cpp
mon_eq.cpp
monomial_bounds.cpp
Expand Down
2 changes: 0 additions & 2 deletions src/math/lp/lp_primal_core_solver.h
Original file line number Diff line number Diff line change
Expand Up @@ -618,8 +618,6 @@ class lp_primal_core_solver:public lp_core_solver_base<T, X> {

void print_bound_info_and_x(unsigned j, std::ostream & out);

unsigned solve_with_tableau();

bool basis_column_is_set_correctly(unsigned j) const {
return this->m_A.m_columns[j].size() == 1;

Expand Down
5 changes: 0 additions & 5 deletions src/math/lp/lp_primal_core_solver_def.h
Original file line number Diff line number Diff line change
Expand Up @@ -315,11 +315,6 @@ template <typename T, typename X> unsigned lp_primal_core_solver<T, X>::get_num
}


// returns the number of iterations
template <typename T, typename X> unsigned lp_primal_core_solver<T, X>::solve() {
TRACE("lar_solver", tout << "solve " << this->get_status() << "\n";);
return solve_with_tableau();
}

// calling it stage1 is too cryptic
template <typename T, typename X> void lp_primal_core_solver<T, X>::find_feasible_solution() {
Expand Down
3 changes: 2 additions & 1 deletion src/math/lp/lp_primal_core_solver_tableau_def.h
Original file line number Diff line number Diff line change
Expand Up @@ -87,7 +87,8 @@ template <typename T, typename X> void lp_primal_core_solver<T, X>::advance_on_e
}

template <typename T, typename X>
unsigned lp_primal_core_solver<T, X>::solve_with_tableau() {
unsigned lp_primal_core_solver<T, X>::solve() {
TRACE("lar_solver", tout << "solve " << this->get_status() << "\n";);
init_run_tableau();
if (this->current_x_is_feasible() && this->m_look_for_feasible_solution_only) {
this->set_status(lp_status::FEASIBLE);
Expand Down
26 changes: 0 additions & 26 deletions src/math/lp/lp_utils.cpp

This file was deleted.

0 comments on commit 13549af

Please sign in to comment.