b027e57e95
- Currently not implemented... Add abseil patch - Add patches/absl-config.cmake Makefile: Add abseil-cpp on unix - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake Makefile: Add abseil-cpp on windows - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake CMake: Add abseil-cpp - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake port to absl: C++ Part - Fix warning with the use of ABSL_MUST_USE_RESULT > The macro must appear as the very first part of a function declaration or definition: ... Note: past advice was to place the macro after the argument list. src: dependencies/sources/abseil-cpp-master/absl/base/attributes.h:418 - Rename enum after windows clash - Remove non compact table constraints - Change index type from int64 to int in routing library - Fix file_nonport compilation on windows - Fix another naming conflict with windows (NO_ERROR is a macro) - Cleanup hash containers; work on sat internals - Add optional_boolean sub-proto Sync cpp examples with internal code - reenable issue173 after reducing number of loops port to absl: Python Part - Add back cp_model.INT32_MIN|MAX for examples Update Python examples - Add random_tsp.py - Run words_square example - Run magic_square in python tests port to absl: Java Part - Fix compilation of the new routing parameters in java - Protect some code from SWIG parsing Update Java Examples port to absl: .Net Part Update .Net examples work on sat internals; Add C++ CP-SAT CpModelBuilder API; update sample code and recipes to use the new API; sync with internal code Remove VS 2015 in Appveyor-CI - abseil-cpp does not support VS 2015... improve tables upgrade C++ sat examples to use the new API; work on sat internals update license dates rewrite jobshop_ft06_distance.py to use the CP-SAT solver rename last example revert last commit more work on SAT internals fix
75 lines
2.3 KiB
C++
75 lines
2.3 KiB
C++
// Copyright 2010-2018 Google LLC
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
#include "ortools/lp_data/sparse_column.h"
|
|
#include <algorithm>
|
|
|
|
#include "ortools/lp_data/lp_types.h"
|
|
|
|
namespace operations_research {
|
|
namespace glop {
|
|
|
|
// --------------------------------------------------------
|
|
// RandomAccessSparseColumn
|
|
// --------------------------------------------------------
|
|
RandomAccessSparseColumn::RandomAccessSparseColumn(RowIndex num_rows)
|
|
: column_(num_rows, 0.0), changed_(num_rows, false), row_change_() {}
|
|
|
|
RandomAccessSparseColumn::~RandomAccessSparseColumn() {}
|
|
|
|
void RandomAccessSparseColumn::Clear() {
|
|
const size_t num_changes = row_change_.size();
|
|
for (int i = 0; i < num_changes; ++i) {
|
|
const RowIndex row = row_change_[i];
|
|
column_[row] = Fractional(0.0);
|
|
changed_[row] = false;
|
|
}
|
|
row_change_.clear();
|
|
}
|
|
|
|
void RandomAccessSparseColumn::Resize(RowIndex num_rows) {
|
|
if (num_rows <= column_.size()) {
|
|
return;
|
|
}
|
|
column_.resize(num_rows, 0.0);
|
|
changed_.resize(num_rows, false);
|
|
}
|
|
|
|
void RandomAccessSparseColumn::PopulateFromSparseColumn(
|
|
const SparseColumn& sparse_column) {
|
|
Clear();
|
|
for (const SparseColumn::Entry e : sparse_column) {
|
|
SetCoefficient(e.row(), e.coefficient());
|
|
}
|
|
}
|
|
|
|
void RandomAccessSparseColumn::PopulateSparseColumn(
|
|
SparseColumn* sparse_column) const {
|
|
RETURN_IF_NULL(sparse_column);
|
|
|
|
sparse_column->Clear();
|
|
const size_t num_changes = row_change_.size();
|
|
for (int change_id = 0; change_id < num_changes; ++change_id) {
|
|
const RowIndex row = row_change_[change_id];
|
|
const Fractional value = column_[row];
|
|
|
|
// TODO(user): Do that only if (value != 0.0) ?
|
|
sparse_column->SetCoefficient(row, value);
|
|
}
|
|
|
|
DCHECK(sparse_column->CheckNoDuplicates());
|
|
}
|
|
|
|
} // namespace glop
|
|
} // namespace operations_research
|