Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Issue1111 #205

Merged
merged 2 commits into from
Jul 9, 2024
Merged

Issue1111 #205

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
e3cb9e8
Prevent returning nullpointer if data array is empty.
ClemensBuechner Jan 8, 2024
fd9345b
Fix style.
ClemensBuechner Jan 9, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
39 changes: 27 additions & 12 deletions src/search/lp/cplex_solver_interface.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,6 +11,21 @@
#include <cplex.h>

namespace lp {
template<typename T>
static T *to_cplex_array(std::vector<T> &v) {
/*
CPLEX expects a non-nullptr even for empty arrays but the C++ standard
does not guarantee any particular value for data for empty vectors (see
issue1111).
*/
if (v.empty()) {
static T dummy;
return &dummy;
} else {
return v.data();
}
}

class CplexSolverInterface : public SolverInterface {
CPXENVptr env;
CPXLPptr problem;
Expand Down Expand Up @@ -90,10 +105,10 @@ class CplexSolverInterface : public SolverInterface {
void assign_row_by_row(
const named_vector::NamedVector<LPConstraint> &constraints);

double *get_coefficients() {return coefficients.data();}
int *get_indices() {return indices.data();}
int *get_starts() {return starts.data();}
int *get_counts() {return counts.data();}
double *get_coefficients() {return to_cplex_array(coefficients);}
int *get_indices() {return to_cplex_array(indices);}
int *get_starts() {return to_cplex_array(starts);}
int *get_counts() {return to_cplex_array(counts);}
int get_num_nonzeros() {return coefficients.size();}
};

Expand All @@ -108,10 +123,10 @@ class CplexSolverInterface : public SolverInterface {
std::vector<double> objective;
public:
void assign(const named_vector::NamedVector<LPVariable> &variables);
double *get_lb() {return lb.data();}
double *get_ub() {return ub.data();}
char *get_type() {return type.data();}
double *get_objective() {return objective.data();}
double *get_lb() {return to_cplex_array(lb);}
double *get_ub() {return to_cplex_array(ub);}
char *get_type() {return to_cplex_array(type);}
double *get_objective() {return to_cplex_array(objective);}
};

class CplexRowsInfo {
Expand All @@ -131,10 +146,10 @@ class CplexSolverInterface : public SolverInterface {
std::vector<int> range_indices;
public:
void assign(const named_vector::NamedVector<LPConstraint> &constraints, int offset = 0, bool dense_range_values = true);
double *get_rhs() {return rhs.data();}
char *get_sense() {return sense.data();}
double *get_range_values() {return range_values.data();}
int *get_range_indices() {return range_indices.data();}
double *get_rhs() {return to_cplex_array(rhs);}
char *get_sense() {return to_cplex_array(sense);}
double *get_range_values() {return to_cplex_array(range_values);}
int *get_range_indices() {return to_cplex_array(range_indices);}
int get_num_ranged_rows() {return range_indices.size();}
};

Expand Down
Loading