Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <cstdint>
#include <initializer_list>
#include <limits>
#include <list>
#include <optional>
#include <string>
#include <utility>
#include <vector>
#include "absl/algorithm/container.h"
#include "absl/container/flat_hash_map.h"
#include "absl/log/check.h"
#include "absl/status/status.h"
#include "absl/status/statusor.h"
#include "absl/strings/string_view.h"
#include "absl/types/span.h"
#include "ortools/base/linked_hash_map.h"
#include "ortools/base/status_macros.h"
#include "ortools/math_opt/model.pb.h"
#include "ortools/math_opt/model_update.pb.h"
Go to the source code of this file.
Classes | |
class | operations_research::math_opt::IdNameBiMap |
struct | operations_research::math_opt::ModelSummary |
Namespaces | |
namespace | operations_research |
In SWIG mode, we don't want anything besides these top-level includes. | |
namespace | operations_research::math_opt |
An object oriented wrapper for quadratic constraints in ModelStorage. | |
namespace | operations_research::math_opt::internal |
Functions | |
absl::Status | operations_research::math_opt::internal::CheckIdsRangeAndStrictlyIncreasing2 (absl::Span< const int64_t > ids) |
template<typename DataProto > | |
absl::Status | operations_research::math_opt::internal::UpdateBiMapFromMappedData (const absl::Span< const int64_t > deleted_ids, const google::protobuf::Map< int64_t, DataProto > &proto_map, IdNameBiMap &bimap) |