mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-22 16:45:31 +00:00
Code Activity

remove a lp_primal_simplex.cpp from CMakeLists

Browse source
This commit is contained in:
Lev Nachmanson 2023-03-03 15:26:06 -08:00
parent f986ac6a75
commit cd24c99739
2 changed files with 0 additions and 34 deletions
Download patch file Download diff file Expand all files Collapse all files

1
src/math/lp/CMakeLists.txt
View file

@ -22,7 +22,6 @@ z3_add_component(lp
lp_dual_core_solver.cpp
lp_dual_simplex.cpp
lp_primal_core_solver.cpp
lp_primal_simplex.cpp
lp_settings.cpp
lp_solver.cpp
lu.cpp

33
src/test/lp/lp.cpp
View file

@ -1459,16 +1459,6 @@ void update_settings(argument_parser & args_parser, lp_settings& settings) {
}
}
template <typename T, typename X>
void setup_solver(unsigned time_limit, bool look_for_min, argument_parser & args_parser, lp_solver<T, X> * solver) {
if (time_limit > 0)
solver->set_time_limit(time_limit);
if (look_for_min)
solver->flip_costs();
update_settings(args_parser, solver->settings());
}
bool values_are_one_percent_close(double a, double b);
@ -1572,29 +1562,6 @@ void add_random_cost(lp_primal_simplex<double, double> * solver, int cols) {
}
}
lp_primal_simplex<double, double> * generate_random_solver() {
int rows = get_random_rows();
int cols = get_random_columns();
auto * solver = new lp_primal_simplex<double, double>();
for (int i = 0; i < rows; i++) {
add_random_row(solver, cols, i);
}
add_random_cost(solver, cols);
return solver;
}
void random_test_on_i(unsigned i) {
if (i % 1000 == 0) {
std::cout << ".";
}
srand(i);
auto *solver = generate_random_solver();
solver->find_maximal_solution();
// std::cout << lp_status_to_string(solver->get_status()) << std::endl;
delete solver;
}
void random_test() {
for (unsigned i = 0; i < std::numeric_limits<unsigned>::max(); i++) {