mirror of
https://github.com/Z3Prover/z3
synced 2025-04-23 17:15:31 +00:00
Tabs, formatting.
This commit is contained in:
parent
56e20da3ce
commit
db398eca7a
26 changed files with 331 additions and 335 deletions
|
@ -19,7 +19,7 @@ z3_add_component(lp
|
|||
lu_instances.cpp
|
||||
matrix_instances.cpp
|
||||
permutation_matrix_instances.cpp
|
||||
quick_xplain.cpp
|
||||
quick_xplain.cpp
|
||||
row_eta_matrix_instances.cpp
|
||||
scaler_instances.cpp
|
||||
sparse_matrix_instances.cpp
|
||||
|
|
|
@ -98,8 +98,8 @@ pivot_for_tableau_on_basis() {
|
|||
// i is the pivot row, and j is the pivot column
|
||||
template <typename T, typename X> void lp_core_solver_base<T, X>::
|
||||
pivot_to_reduced_costs_tableau(unsigned i, unsigned j) {
|
||||
if (j >= m_d.size())
|
||||
return;
|
||||
if (j >= m_d.size())
|
||||
return;
|
||||
T &a = m_d[j];
|
||||
if (is_zero(a))
|
||||
return;
|
||||
|
|
|
@ -318,7 +318,7 @@ template <typename T, typename X> void lp_primal_core_solver<T, X>::init_run_tab
|
|||
this->m_basis_sort_counter = 0; // to initiate the sort of the basis
|
||||
this->set_total_iterations(0);
|
||||
this->iters_with_no_cost_growing() = 0;
|
||||
SASSERT(this->inf_set_is_correct());
|
||||
SASSERT(this->inf_set_is_correct());
|
||||
if (this->current_x_is_feasible() && this->m_look_for_feasible_solution_only)
|
||||
return;
|
||||
if (this->m_settings.backup_costs)
|
||||
|
|
|
@ -48,9 +48,9 @@ template <typename T, typename X> bool static_matrix<T, X>::pivot_row_to_row_giv
|
|||
SASSERT(i < row_count() && ii < column_count());
|
||||
SASSERT(i != ii);
|
||||
|
||||
m_became_zeros.reset();
|
||||
m_became_zeros.reset();
|
||||
T alpha = -get_val(c);
|
||||
SASSERT(!is_zero(alpha));
|
||||
SASSERT(!is_zero(alpha));
|
||||
auto & ii_row_vals = m_rows[ii];
|
||||
remove_element(ii_row_vals, ii_row_vals[c.m_offset]);
|
||||
scan_row_ii_to_offset_vector(ii);
|
||||
|
@ -61,7 +61,7 @@ template <typename T, typename X> bool static_matrix<T, X>::pivot_row_to_row_giv
|
|||
unsigned j = iv.m_j;
|
||||
if (j == pivot_col) continue;
|
||||
T alv = alpha * iv.m_value;
|
||||
SASSERT(!is_zero(iv.m_value));
|
||||
SASSERT(!is_zero(iv.m_value));
|
||||
int j_offs = m_vector_of_row_offsets[j];
|
||||
if (j_offs == -1) { // it is a new element
|
||||
add_new_element(ii, j, alv);
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue