27 : column_(num_rows, 0.0), changed_(num_rows, false), row_change_() {}
32 const size_t num_changes = row_change_.size();
33 for (
int i = 0; i < num_changes; ++i) {
34 const RowIndex
row = row_change_[i];
36 changed_[
row] =
false;
42 if (num_rows <= column_.
size()) {
45 column_.
resize(num_rows, 0.0);
46 changed_.
resize(num_rows,
false);
61 sparse_column->
Clear();
62 const size_t num_changes = row_change_.size();
63 for (
int change_id = 0; change_id < num_changes; ++change_id) {
64 const RowIndex
row = row_change_[change_id];
#define DCHECK(condition)
RandomAccessSparseColumn(RowIndex num_rows)
void Resize(RowIndex num_rows)
void PopulateSparseColumn(SparseColumn *sparse_column) const
virtual ~RandomAccessSparseColumn()
void PopulateFromSparseColumn(const SparseColumn &sparse_column)
void SetCoefficient(RowIndex row, Fractional value)
bool CheckNoDuplicates() const
typename Iterator::Entry Entry
void SetCoefficient(Index index, Fractional value)
void resize(IntType size)
The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...
#define RETURN_IF_NULL(x)