DoubleLinearExpr
diff --git a/docs/cpp/astar_8cc_source.html b/docs/cpp/astar_8cc_source.html
index d2647fe83a..fde9c0513a 100644
--- a/docs/cpp/astar_8cc_source.html
+++ b/docs/cpp/astar_8cc_source.html
@@ -102,181 +102,180 @@ $(document).ready(function(){initNavTree('astar_8cc_source.html',''); initResiza
- 14#include <absl/container/flat_hash_map.h>
- 15#include <absl/container/flat_hash_set.h>
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
- 30 : heap_index_(-1), distance_(0), node_(-1), distance_with_heuristic_(0) {}
-
-
-
- 34 bool operator<(
const Element& other)
const {
- 35 return distance_with_heuristic_ > other.distance_with_heuristic_;
-
- 37 void SetHeapIndex(
int h) { heap_index_ = h; }
- 38 int GetHeapIndex()
const {
return heap_index_; }
-
- 40 void set_distance_with_heuristic(int64_t distance_with_heuristic) {
- 41 distance_with_heuristic_ = distance_with_heuristic;
-
- 43 int64_t distance_with_heuristic() {
return distance_with_heuristic_; }
-
- 45 int64_t
distance()
const {
return distance_; }
- 46 void set_node(
int node) { node_ = node; }
- 47 int node()
const {
return node_; }
-
-
-
-
- 52 int64_t distance_with_heuristic_;
-
-
-
-
-
-
-
-
- 61 AStarSP(
int node_count,
int start_node, std::function<int64_t(
int,
int)> graph,
- 62 std::function<int64_t(
int)> heuristic, int64_t disconnected_distance)
- 63 : node_count_(node_count),
- 64 start_node_(start_node),
- 65 graph_(
std::move(graph)),
+ 17#include "absl/container/flat_hash_map.h"
+ 18#include "absl/container/flat_hash_set.h"
+
+
+
+
+
+
+
+
+
+
+ 29 : heap_index_(-1), distance_(0), distance_with_heuristic_(0), node_(-1) {}
+
+
+
+ 33 bool operator<(
const Element& other)
const {
+ 34 return distance_with_heuristic_ > other.distance_with_heuristic_;
+
+ 36 void SetHeapIndex(
int h) { heap_index_ = h; }
+ 37 int GetHeapIndex()
const {
return heap_index_; }
+
+ 39 void set_distance_with_heuristic(int64_t distance_with_heuristic) {
+ 40 distance_with_heuristic_ = distance_with_heuristic;
+
+ 42 int64_t distance_with_heuristic() {
return distance_with_heuristic_; }
+
+ 44 int64_t
distance()
const {
return distance_; }
+ 45 void set_node(
int node) { node_ = node; }
+ 46 int node()
const {
return node_; }
+
+
+
+
+ 51 int64_t distance_with_heuristic_;
+
+
+
+
+
+
+
+
+ 60 AStarSP(
int node_count,
int start_node, std::function<int64_t(
int,
int)> graph,
+ 61 std::function<int64_t(
int)> heuristic, int64_t disconnected_distance)
+ 62 : node_count_(node_count),
+ 63 start_node_(start_node),
+ 64 graph_(
std::move(graph)),
+ 65 heuristic_(
std::move(heuristic)),
66 disconnected_distance_(disconnected_distance),
67 predecessor_(new int[node_count]),
- 68 elements_(node_count),
- 69 heuristic_(
std::move(heuristic)) {}
-
-
-
-
- 74 int SelectClosestNode(int64_t*
distance);
- 75 void Update(
int label);
- 76 void FindPath(
int dest, std::vector<int>*
nodes);
-
- 78 const int node_count_;
- 79 const int start_node_;
- 80 std::function<int64_t(
int,
int)> graph_;
- 81 std::function<int64_t(
int)> heuristic_;
- 82 const int64_t disconnected_distance_;
- 83 std::unique_ptr<int[]> predecessor_;
-
- 85 std::vector<Element> elements_;
- 86 absl::flat_hash_set<int> not_visited_;
- 87 absl::flat_hash_set<int> added_to_the_frontier_;
-
-
- 90void AStarSP::Initialize() {
- 91 for (
int i = 0; i < node_count_; i++) {
- 92 elements_[i].set_node(i);
- 93 if (i == start_node_) {
-
- 95 elements_[i].set_distance(0);
- 96 elements_[i].set_distance_with_heuristic(heuristic_(i));
- 97 frontier_.Add(&elements_[i]);
-
-
- 100 elements_[i].set_distance_with_heuristic(
kInfinity);
- 101 predecessor_[i] = start_node_;
- 102 not_visited_.insert(i);
-
-
-
-
- 107int AStarSP::SelectClosestNode(int64_t*
distance) {
- 108 const int node = frontier_.Top()->node();
- 109 *
distance = frontier_.Top()->distance();
-
- 111 not_visited_.erase(node);
- 112 added_to_the_frontier_.erase(node);
-
-
-
- 116void AStarSP::Update(
int node) {
- 117 for (absl::flat_hash_set<int>::const_iterator it = not_visited_.begin();
- 118 it != not_visited_.end(); ++it) {
- 119 const int other_node = *it;
- 120 const int64_t graph_node_i = graph_(node, other_node);
- 121 if (graph_node_i != disconnected_distance_) {
- 122 if (added_to_the_frontier_.find(other_node) ==
- 123 added_to_the_frontier_.end()) {
- 124 frontier_.Add(&elements_[other_node]);
- 125 added_to_the_frontier_.insert(other_node);
-
-
- 128 const int64_t other_distance = elements_[node].distance() + graph_node_i;
- 129 if (elements_[other_node].
distance() > other_distance) {
- 130 elements_[other_node].set_distance(other_distance);
- 131 elements_[other_node].set_distance_with_heuristic(
- 132 other_distance + heuristic_(other_node));
- 133 frontier_.NoteChangedPriority(&elements_[other_node]);
- 134 predecessor_[other_node] = node;
-
-
-
-
-
- 140void AStarSP::FindPath(
int dest, std::vector<int>*
nodes) {
-
-
- 143 while (predecessor_[j] != -1) {
- 144 nodes->push_back(predecessor_[j]);
-
-
-
-
-
-
-
- 152 while (!frontier_.IsEmpty()) {
-
- 154 int node = SelectClosestNode(&
distance);
-
-
-
- 158 }
else if (node == end_node) {
-
-
-
-
-
-
- 165 FindPath(end_node,
nodes);
-
-
-
-
-
- 171 std::function<int64_t(
int,
int)> graph,
- 172 std::function<int64_t(
int)> heuristic,
- 173 int64_t disconnected_distance, std::vector<int>*
nodes) {
- 174 AStarSP bf(node_count, start_node, std::move(graph), std::move(heuristic),
- 175 disconnected_distance);
-
-
-
+ 68 elements_(node_count) {}
+
+
+
+
+ 73 int SelectClosestNode(int64_t*
distance);
+ 74 void Update(
int label);
+ 75 void FindPath(
int dest, std::vector<int>*
nodes);
+
+ 77 const int node_count_;
+ 78 const int start_node_;
+ 79 std::function<int64_t(
int,
int)> graph_;
+ 80 std::function<int64_t(
int)> heuristic_;
+ 81 const int64_t disconnected_distance_;
+ 82 std::unique_ptr<int[]> predecessor_;
+
+ 84 std::vector<Element> elements_;
+ 85 absl::flat_hash_set<int> not_visited_;
+ 86 absl::flat_hash_set<int> added_to_the_frontier_;
+
+
+ 89void AStarSP::Initialize() {
+ 90 for (
int i = 0; i < node_count_; i++) {
+ 91 elements_[i].set_node(i);
+ 92 if (i == start_node_) {
+
+ 94 elements_[i].set_distance(0);
+ 95 elements_[i].set_distance_with_heuristic(heuristic_(i));
+ 96 frontier_.Add(&elements_[i]);
+
+
+ 99 elements_[i].set_distance_with_heuristic(
kInfinity);
+ 100 predecessor_[i] = start_node_;
+ 101 not_visited_.insert(i);
+
+
+
+
+ 106int AStarSP::SelectClosestNode(int64_t*
distance) {
+ 107 const int node = frontier_.Top()->node();
+ 108 *
distance = frontier_.Top()->distance();
+
+ 110 not_visited_.erase(node);
+ 111 added_to_the_frontier_.erase(node);
+
+
+
+ 115void AStarSP::Update(
int node) {
+ 116 for (absl::flat_hash_set<int>::const_iterator it = not_visited_.begin();
+ 117 it != not_visited_.end(); ++it) {
+ 118 const int other_node = *it;
+ 119 const int64_t graph_node_i = graph_(node, other_node);
+ 120 if (graph_node_i != disconnected_distance_) {
+ 121 if (added_to_the_frontier_.find(other_node) ==
+ 122 added_to_the_frontier_.end()) {
+ 123 frontier_.Add(&elements_[other_node]);
+ 124 added_to_the_frontier_.insert(other_node);
+
+
+ 127 const int64_t other_distance = elements_[node].distance() + graph_node_i;
+ 128 if (elements_[other_node].
distance() > other_distance) {
+ 129 elements_[other_node].set_distance(other_distance);
+ 130 elements_[other_node].set_distance_with_heuristic(
+ 131 other_distance + heuristic_(other_node));
+ 132 frontier_.NoteChangedPriority(&elements_[other_node]);
+ 133 predecessor_[other_node] = node;
+
+
+
+
+
+ 139void AStarSP::FindPath(
int dest, std::vector<int>*
nodes) {
+
+
+ 142 while (predecessor_[j] != -1) {
+ 143 nodes->push_back(predecessor_[j]);
+
+
+
+
+
+
+
+ 151 while (!frontier_.IsEmpty()) {
+
+ 153 int node = SelectClosestNode(&
distance);
+
+
+
+ 157 }
else if (node == end_node) {
+
+
+
+
+
+
+ 164 FindPath(end_node,
nodes);
+
+
+
+
+
+ 170 std::function<int64_t(
int,
int)> graph,
+ 171 std::function<int64_t(
int)> heuristic,
+ 172 int64_t disconnected_distance, std::vector<int>*
nodes) {
+ 173 AStarSP bf(node_count, start_node, std::move(graph), std::move(heuristic),
+ 174 disconnected_distance);
+
+
+
-
-bool ShortestPath(int end_node, std::vector< int > *nodes)
static const int64_t kInfinity
AStarSP(int node_count, int start_node, std::function< int64_t(int, int)> graph, std::function< int64_t(int)> heuristic, int64_t disconnected_distance)
bool ShortestPath(int end_node, std::vector< int > *nodes)
static const int64_t kInfinity
AStarSP(int node_count, int start_node, std::function< int64_t(int, int)> graph, std::function< int64_t(int)> heuristic, int64_t disconnected_distance)
static const int64_t kint64max
Collection of objects used to extend the Constraint Solver library.
bool AStarShortestPath(int node_count, int start_node, int end_node, std::function< int64_t(int, int)> graph, std::function< int64_t(int)> heuristic, int64_t disconnected_distance, std::vector< int > *nodes)
bool AStarShortestPath(int node_count, int start_node, int end_node, std::function< int64_t(int, int)> graph, std::function< int64_t(int)> heuristic, int64_t disconnected_distance, std::vector< int > *nodes)
-
Definition at line 57 of file astar.cc.
+
Definition at line 56 of file astar.cc.
|
@@ -162,7 +162,7 @@ Static Public Attributes
@@ -193,7 +193,7 @@ Static Public Attributes
@@ -218,7 +218,7 @@ Static Public Attributes
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_automaton_constraint.html b/docs/cpp/classoperations__research_1_1sat_1_1_automaton_constraint.html
index 5f10384129..93dd580f2c 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_automaton_constraint.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_automaton_constraint.html
@@ -97,7 +97,7 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_a
Specialized automaton constraint.
This constraint allows adding transitions to the automaton constraint incrementally.
-
Definition at line 696 of file cp_model.h.
+
Definition at line 691 of file cp_model.h.
|
@@ -163,7 +163,7 @@ Protected Attributes
Adds a transitions to the automaton.
-Definition at line 602 of file cp_model.cc.
+Definition at line 620 of file cp_model.cc.
@@ -192,7 +192,7 @@ Protected Attributes
Returns the mutable underlying protobuf object (useful for model edition).
-Definition at line 586 of file cp_model.h.
+Definition at line 581 of file cp_model.h.
@@ -221,7 +221,7 @@ Protected Attributes
Returns the name of the constraint (or the empty string if not set).
-Definition at line 548 of file cp_model.cc.
+Definition at line 566 of file cp_model.cc.
@@ -258,7 +258,7 @@ Protected Attributes
other: no support (but can be added on a per-demand basis).
-Definition at line 550 of file cp_model.cc.
+Definition at line 568 of file cp_model.cc.
@@ -288,7 +288,7 @@ Protected Attributes
See OnlyEnforceIf(absl::Span<const BoolVar> literals).
-Definition at line 557 of file cp_model.cc.
+Definition at line 575 of file cp_model.cc.
@@ -317,7 +317,7 @@ Protected Attributes
Returns the underlying protobuf object (useful for testing).
-Definition at line 583 of file cp_model.h.
+Definition at line 578 of file cp_model.h.
@@ -347,7 +347,7 @@ Protected Attributes
Sets the name of the constraint.
-Definition at line 543 of file cp_model.cc.
+Definition at line 561 of file cp_model.cc.
@@ -372,7 +372,7 @@ Protected Attributes
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_bool_var.html b/docs/cpp/classoperations__research_1_1sat_1_1_bool_var.html
index 3b08e11c8f..645498e622 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_bool_var.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_bool_var.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_b
A Boolean variable.
-
This class wraps an IntegerVariableProto with domain [0, 1]. It supports the logical negation (Not).
+
This class refer to an IntegerVariableProto with domain [0, 1] or to its logical negation (Not). This is called a Boolean Literal in other context.
This can only be constructed via CpModelBuilder.NewBoolVar().
Definition at line 70 of file cp_model.h.
@@ -102,6 +102,7 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_b
|
| | BoolVar () |
+
| | A default constructed BoolVar can be used to mean not defined yet. More...
|
| |
| BoolVar | WithName (const std::string &name) |
| | Sets the name of the variable. More...
|
@@ -113,13 +114,10 @@ Public Member Functions
| | Returns the logical negation of the current Boolean variable. More...
|
| |
| bool | operator== (const BoolVar &other) const |
-
| | Equality test with another boolvar. More...
|
| |
| bool | operator!= (const BoolVar &other) const |
-
| | Dis-Equality test. More...
|
| |
| std::string | DebugString () const |
-
| | Debug string. More...
|
| |
| int | index () const |
| | Returns the index of the variable in the model. More...
|
@@ -141,6 +139,9 @@ Public Member Functions
+
A default constructed BoolVar can be used to mean not defined yet.
+
However, it shouldn't be passed to any of the functions in this file. Doing so will crash in debug mode and will result in an invalid model in opt mode.
+
Definition at line 30 of file cp_model.cc.
@@ -161,9 +162,7 @@ Public Member Functions
@@ -193,7 +192,7 @@ Public Member Functions
Returns the index of the variable in the model.
Warning: If the variable is the negation of another variable v, its index is -v.index() - 1. So this can be negative.
-Definition at line 103 of file cp_model.h.
+Definition at line 104 of file cp_model.h.
@@ -214,7 +213,7 @@ Public Member Functions
Returns the name of the variable.
-Definition at line 42 of file cp_model.cc.
+Definition at line 44 of file cp_model.cc.
@@ -243,7 +242,7 @@ Public Member Functions
Returns the logical negation of the current Boolean variable.
-Definition at line 82 of file cp_model.h.
+Definition at line 86 of file cp_model.h.
@@ -271,9 +270,7 @@ Public Member Functions
@@ -301,9 +298,7 @@ Public Member Functions
-
Equality test with another boolvar.
-
-
Definition at line 85 of file cp_model.h.
+
Definition at line 88 of file cp_model.h.
Specialized circuit constraint.
This constraint allows adding arcs to the circuit constraint incrementally.
-
Definition at line 601 of file cp_model.h.
+
Definition at line 596 of file cp_model.h.
|
@@ -171,7 +171,7 @@ Protected Attributes
-Definition at line 562 of file cp_model.cc.
+Definition at line 580 of file cp_model.cc.
@@ -200,7 +200,7 @@ Protected Attributes
Returns the mutable underlying protobuf object (useful for model edition).
-Definition at line 586 of file cp_model.h.
+Definition at line 581 of file cp_model.h.
@@ -229,7 +229,7 @@ Protected Attributes
Returns the name of the constraint (or the empty string if not set).
-Definition at line 548 of file cp_model.cc.
+Definition at line 566 of file cp_model.cc.
@@ -266,7 +266,7 @@ Protected Attributes
other: no support (but can be added on a per-demand basis).
-Definition at line 550 of file cp_model.cc.
+Definition at line 568 of file cp_model.cc.
@@ -296,7 +296,7 @@ Protected Attributes
See OnlyEnforceIf(absl::Span<const BoolVar> literals).
-Definition at line 557 of file cp_model.cc.
+Definition at line 575 of file cp_model.cc.
@@ -325,7 +325,7 @@ Protected Attributes
Returns the underlying protobuf object (useful for testing).
-Definition at line 583 of file cp_model.h.
+Definition at line 578 of file cp_model.h.
@@ -355,7 +355,7 @@ Protected Attributes
Sets the name of the constraint.
-Definition at line 543 of file cp_model.cc.
+Definition at line 561 of file cp_model.cc.
@@ -380,7 +380,7 @@ Protected Attributes
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_constraint.html b/docs/cpp/classoperations__research_1_1sat_1_1_constraint.html
index 232648e037..e9cff5fe59 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_constraint.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_constraint.html
@@ -99,7 +99,7 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_c
This class enables you to modify the constraint that was previously added to the model.
The constraint must be built using the different CpModelBuilder::AddXXX methods.
-Definition at line 552 of file cp_model.h.
+Definition at line 547 of file cp_model.h.
|
@@ -157,7 +157,7 @@ Protected Attributes
@@ -187,7 +187,7 @@ Protected Attributes
Returns the mutable underlying protobuf object (useful for model edition).
-Definition at line 586 of file cp_model.h.
+Definition at line 581 of file cp_model.h.
@@ -208,7 +208,7 @@ Protected Attributes
Returns the name of the constraint (or the empty string if not set).
-Definition at line 548 of file cp_model.cc.
+Definition at line 566 of file cp_model.cc.
@@ -237,7 +237,7 @@ Protected Attributes
other: no support (but can be added on a per-demand basis).
-Definition at line 550 of file cp_model.cc.
+Definition at line 568 of file cp_model.cc.
@@ -259,7 +259,7 @@ Protected Attributes
See OnlyEnforceIf(absl::Span<const BoolVar> literals).
-Definition at line 557 of file cp_model.cc.
+Definition at line 575 of file cp_model.cc.
@@ -288,7 +288,7 @@ Protected Attributes
Returns the underlying protobuf object (useful for testing).
-Definition at line 583 of file cp_model.h.
+Definition at line 578 of file cp_model.h.
@@ -310,7 +310,7 @@ Protected Attributes
Sets the name of the constraint.
-Definition at line 543 of file cp_model.cc.
+Definition at line 561 of file cp_model.cc.
@@ -335,7 +335,7 @@ Protected Attributes
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_cp_model_builder-members.html b/docs/cpp/classoperations__research_1_1sat_1_1_cp_model_builder-members.html
index 547a225da9..498127ff7f 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_cp_model_builder-members.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_cp_model_builder-members.html
@@ -114,56 +114,57 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_c
| AddGreaterOrEqual(const LinearExpr &left, const LinearExpr &right) | CpModelBuilder | |
| AddGreaterThan(const LinearExpr &left, const LinearExpr &right) | CpModelBuilder | |
| AddHint(IntVar var, int64_t value) | CpModelBuilder | |
- | AddImplication(BoolVar a, BoolVar b) | CpModelBuilder | inline |
- | AddInverseConstraint(absl::Span< const IntVar > variables, absl::Span< const IntVar > inverse_variables) | CpModelBuilder | |
- | AddLessOrEqual(const LinearExpr &left, const LinearExpr &right) | CpModelBuilder | |
- | AddLessThan(const LinearExpr &left, const LinearExpr &right) | CpModelBuilder | |
- | AddLinearConstraint(const LinearExpr &expr, const Domain &domain) | CpModelBuilder | |
- | AddLinMaxEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs) | CpModelBuilder | inline |
- | AddLinMinEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs) | CpModelBuilder | inline |
- | AddMaxEquality(const LinearExpr &target, absl::Span< const IntVar > vars) | CpModelBuilder | |
- | AddMaxEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs) | CpModelBuilder | |
- | AddMaxEquality(const LinearExpr &target, std::initializer_list< LinearExpr > exprs) | CpModelBuilder | |
- | AddMinEquality(const LinearExpr &target, absl::Span< const IntVar > vars) | CpModelBuilder | |
- | AddMinEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs) | CpModelBuilder | |
- | AddMinEquality(const LinearExpr &target, std::initializer_list< LinearExpr > exprs) | CpModelBuilder | |
- | AddModuloEquality(const LinearExpr &target, const LinearExpr &var, const LinearExpr &mod) | CpModelBuilder | |
- | AddMultipleCircuitConstraint() | CpModelBuilder | |
- | AddMultiplicationEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs) | CpModelBuilder | |
- | AddMultiplicationEquality(const LinearExpr &target, absl::Span< const IntVar > vars) | CpModelBuilder | |
- | AddMultiplicationEquality(const LinearExpr &target, std::initializer_list< LinearExpr > exprs) | CpModelBuilder | |
- | AddNoOverlap(absl::Span< const IntervalVar > vars) | CpModelBuilder | |
- | AddNoOverlap2D() | CpModelBuilder | |
- | AddNotEqual(const LinearExpr &left, const LinearExpr &right) | CpModelBuilder | |
- | AddReservoirConstraint(int64_t min_level, int64_t max_level) | CpModelBuilder | |
- | AddVariableElement(IntVar index, absl::Span< const IntVar > variables, IntVar target) | CpModelBuilder | |
- | Build() const | CpModelBuilder | inline |
- | ClearAssumptions() | CpModelBuilder | |
- | ClearHints() | CpModelBuilder | |
- | CopyFrom(const CpModelProto &model_proto) | CpModelBuilder | |
- | CumulativeConstraint | CpModelBuilder | friend |
- | FalseVar() | CpModelBuilder | |
- | GetBoolVarFromProtoIndex(int index) | CpModelBuilder | |
- | GetIntervalVarFromProtoIndex(int index) | CpModelBuilder | |
- | GetIntVarFromProtoIndex(int index) | CpModelBuilder | |
- | IntervalVar | CpModelBuilder | friend |
- | IntVar | CpModelBuilder | friend |
- | Maximize(const LinearExpr &expr) | CpModelBuilder | |
- | Maximize(const DoubleLinearExpr &expr) | CpModelBuilder | |
- | Minimize(const LinearExpr &expr) | CpModelBuilder | |
- | Minimize(const DoubleLinearExpr &expr) | CpModelBuilder | |
- | MutableProto() | CpModelBuilder | inline |
- | NewBoolVar() | CpModelBuilder | |
- | NewConstant(int64_t value) | CpModelBuilder | |
- | NewFixedSizeIntervalVar(const LinearExpr &start, int64_t size) | CpModelBuilder | |
- | NewIntervalVar(const LinearExpr &start, const LinearExpr &size, const LinearExpr &end) | CpModelBuilder | |
- | NewIntVar(const Domain &domain) | CpModelBuilder | |
- | NewOptionalFixedSizeIntervalVar(const LinearExpr &start, int64_t size, BoolVar presence) | CpModelBuilder | |
- | NewOptionalIntervalVar(const LinearExpr &start, const LinearExpr &size, const LinearExpr &end, BoolVar presence) | CpModelBuilder | |
- | Proto() const | CpModelBuilder | inline |
- | ReservoirConstraint | CpModelBuilder | friend |
- | SetName(const std::string &name) | CpModelBuilder | |
- | TrueVar() | CpModelBuilder | |
+ | AddHint(BoolVar var, bool value) | CpModelBuilder | |
+ | AddImplication(BoolVar a, BoolVar b) | CpModelBuilder | inline |
+ | AddInverseConstraint(absl::Span< const IntVar > variables, absl::Span< const IntVar > inverse_variables) | CpModelBuilder | |
+ | AddLessOrEqual(const LinearExpr &left, const LinearExpr &right) | CpModelBuilder | |
+ | AddLessThan(const LinearExpr &left, const LinearExpr &right) | CpModelBuilder | |
+ | AddLinearConstraint(const LinearExpr &expr, const Domain &domain) | CpModelBuilder | |
+ | AddLinMaxEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs) | CpModelBuilder | inline |
+ | AddLinMinEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs) | CpModelBuilder | inline |
+ | AddMaxEquality(const LinearExpr &target, absl::Span< const IntVar > vars) | CpModelBuilder | |
+ | AddMaxEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs) | CpModelBuilder | |
+ | AddMaxEquality(const LinearExpr &target, std::initializer_list< LinearExpr > exprs) | CpModelBuilder | |
+ | AddMinEquality(const LinearExpr &target, absl::Span< const IntVar > vars) | CpModelBuilder | |
+ | AddMinEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs) | CpModelBuilder | |
+ | AddMinEquality(const LinearExpr &target, std::initializer_list< LinearExpr > exprs) | CpModelBuilder | |
+ | AddModuloEquality(const LinearExpr &target, const LinearExpr &var, const LinearExpr &mod) | CpModelBuilder | |
+ | AddMultipleCircuitConstraint() | CpModelBuilder | |
+ | AddMultiplicationEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs) | CpModelBuilder | |
+ | AddMultiplicationEquality(const LinearExpr &target, absl::Span< const IntVar > vars) | CpModelBuilder | |
+ | AddMultiplicationEquality(const LinearExpr &target, std::initializer_list< LinearExpr > exprs) | CpModelBuilder | |
+ | AddNoOverlap(absl::Span< const IntervalVar > vars) | CpModelBuilder | |
+ | AddNoOverlap2D() | CpModelBuilder | |
+ | AddNotEqual(const LinearExpr &left, const LinearExpr &right) | CpModelBuilder | |
+ | AddReservoirConstraint(int64_t min_level, int64_t max_level) | CpModelBuilder | |
+ | AddVariableElement(IntVar index, absl::Span< const IntVar > variables, IntVar target) | CpModelBuilder | |
+ | Build() const | CpModelBuilder | inline |
+ | ClearAssumptions() | CpModelBuilder | |
+ | ClearHints() | CpModelBuilder | |
+ | CopyFrom(const CpModelProto &model_proto) | CpModelBuilder | |
+ | CumulativeConstraint | CpModelBuilder | friend |
+ | FalseVar() | CpModelBuilder | |
+ | GetBoolVarFromProtoIndex(int index) | CpModelBuilder | |
+ | GetIntervalVarFromProtoIndex(int index) | CpModelBuilder | |
+ | GetIntVarFromProtoIndex(int index) | CpModelBuilder | |
+ | IntervalVar | CpModelBuilder | friend |
+ | IntVar | CpModelBuilder | friend |
+ | Maximize(const LinearExpr &expr) | CpModelBuilder | |
+ | Maximize(const DoubleLinearExpr &expr) | CpModelBuilder | |
+ | Minimize(const LinearExpr &expr) | CpModelBuilder | |
+ | Minimize(const DoubleLinearExpr &expr) | CpModelBuilder | |
+ | MutableProto() | CpModelBuilder | inline |
+ | NewBoolVar() | CpModelBuilder | |
+ | NewConstant(int64_t value) | CpModelBuilder | |
+ | NewFixedSizeIntervalVar(const LinearExpr &start, int64_t size) | CpModelBuilder | |
+ | NewIntervalVar(const LinearExpr &start, const LinearExpr &size, const LinearExpr &end) | CpModelBuilder | |
+ | NewIntVar(const Domain &domain) | CpModelBuilder | |
+ | NewOptionalFixedSizeIntervalVar(const LinearExpr &start, int64_t size, BoolVar presence) | CpModelBuilder | |
+ | NewOptionalIntervalVar(const LinearExpr &start, const LinearExpr &size, const LinearExpr &end, BoolVar presence) | CpModelBuilder | |
+ | Proto() const | CpModelBuilder | inline |
+ | ReservoirConstraint | CpModelBuilder | friend |
+ | SetName(const std::string &name) | CpModelBuilder | |
+ | TrueVar() | CpModelBuilder | |
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_cp_model_builder.html b/docs/cpp/classoperations__research_1_1sat_1_1_cp_model_builder.html
index a236b940fd..7bf85fc05c 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_cp_model_builder.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_cp_model_builder.html
@@ -99,7 +99,7 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_c
AddXXX to create new constraints and add them to the model.
-Definition at line 753 of file cp_model.h.
+Definition at line 748 of file cp_model.h.
|
@@ -272,6 +272,9 @@ Public Member Functions
| void | AddHint (IntVar var, int64_t value) |
| | Adds hinting to a variable. More...
|
| |
+| void | AddHint (BoolVar var, bool value) |
+| | Adds hinting to a Boolean variable. More...
|
+| |
| void | ClearHints () |
| | Removes all hints. More...
|
| |
@@ -332,7 +335,7 @@ Public Member Functions
Adds target == abs(expr).
-Definition at line 1117 of file cp_model.cc.
+Definition at line 1141 of file cp_model.cc.
@@ -354,7 +357,7 @@ Public Member Functions
This constraint forces all variables to have different values.
-Definition at line 915 of file cp_model.cc.
+Definition at line 939 of file cp_model.cc.
@@ -376,7 +379,7 @@ Public Member Functions
This constraint forces all expressions to have different values.
-Definition at line 925 of file cp_model.cc.
+Definition at line 949 of file cp_model.cc.
@@ -398,7 +401,7 @@ Public Member Functions
This constraint forces all expressions to have different values.
-Definition at line 933 of file cp_model.cc.
+Definition at line 957 of file cp_model.cc.
@@ -422,7 +425,7 @@ Public Member Functions
An AllowedAssignments constraint is a constraint on an array of variables that forces, when all variables are fixed to a single value, that the corresponding list of values is equal to one of the tuples added to the constraint.
It returns a table constraint that allows adding tuples incrementally after construction.
-Definition at line 973 of file cp_model.cc.
+Definition at line 997 of file cp_model.cc.
@@ -444,7 +447,7 @@ Public Member Functions
Adds a literal to the model as assumptions.
-Definition at line 1268 of file cp_model.cc.
+Definition at line 1302 of file cp_model.cc.
@@ -466,7 +469,7 @@ Public Member Functions
Adds multiple literals to the model as assumptions.
-Definition at line 1272 of file cp_model.cc.
+Definition at line 1306 of file cp_model.cc.
@@ -508,7 +511,7 @@ Public Member Functions
Between two consecutive phases i and i + 1, the automaton creates a set of arcs. For each transition (tail, head, label), it will add an arc from the state 'tail' of phase i and the state 'head' of phase i + 1. This arc labeled by the value 'label' of the variables 'variables[i]'. That is, this arc can only be selected if 'variables[i]' is assigned the value 'label'. A feasible solution of this constraint is an assignment of variables such that, starting from the initial state in phase 0, there is a path labeled by the values of the variables that ends in one of the final states in the final phase.
It returns an AutomatonConstraint that allows adding transition incrementally after construction.
-Definition at line 1013 of file cp_model.cc.
+Definition at line 1037 of file cp_model.cc.
@@ -530,7 +533,7 @@ Public Member Functions
Adds the constraint that all literals must be true.
-Definition at line 803 of file cp_model.cc.
+Definition at line 827 of file cp_model.cc.
@@ -552,7 +555,7 @@ Public Member Functions
Adds the constraint that at least one of the literals must be true.
-Definition at line 795 of file cp_model.cc.
+Definition at line 819 of file cp_model.cc.
@@ -574,7 +577,7 @@ Public Member Functions
Adds the constraint that an odd number of literals is true.
-Definition at line 811 of file cp_model.cc.
+Definition at line 835 of file cp_model.cc.
@@ -598,7 +601,7 @@ Public Member Functions
For now, we ignore node indices with no incident arc. All the other nodes must have exactly one incoming and one outgoing selected arc (i.e. literal at true). All the selected arcs that are not self-loops must form a single circuit.
It returns a circuit constraint that allows adding arcs incrementally after construction.
-Definition at line 965 of file cp_model.cc.
+Definition at line 989 of file cp_model.cc.
@@ -621,7 +624,7 @@ Public Member Functions
The cumulative constraint.
It ensures that for any integer point, the sum of the demands of the intervals containing that point does not exceed the capacity.
-Definition at line 1179 of file cp_model.cc.
+Definition at line 1203 of file cp_model.cc.
@@ -659,7 +662,7 @@ Public Member Functions
Adds a decision strategy on a list of boolean variables.
-Definition at line 1247 of file cp_model.cc.
+Definition at line 1271 of file cp_model.cc.
@@ -697,7 +700,7 @@ Public Member Functions
Adds a decision strategy on a list of integer variables.
-Definition at line 1235 of file cp_model.cc.
+Definition at line 1259 of file cp_model.cc.
@@ -735,7 +738,7 @@ Public Member Functions
Adds target = num / denom (integer division rounded towards 0).
-Definition at line 1107 of file cp_model.cc.
+Definition at line 1131 of file cp_model.cc.
@@ -773,7 +776,7 @@ Public Member Functions
Adds the element constraint: values[index] == target.
-Definition at line 953 of file cp_model.cc.
+Definition at line 977 of file cp_model.cc.
@@ -805,7 +808,7 @@ Public Member Functions
Adds left == right.
-Definition at line 836 of file cp_model.cc.
+Definition at line 860 of file cp_model.cc.
@@ -829,7 +832,7 @@ Public Member Functions
A ForbiddenAssignments constraint is a constraint on an array of variables where the list of impossible combinations is provided in the tuples added to the constraint.
It returns a table constraint that allows adding tuples incrementally after construction.
-Definition at line 982 of file cp_model.cc.
+Definition at line 1006 of file cp_model.cc.
@@ -861,7 +864,7 @@ Public Member Functions
Adds left >= right.
-Definition at line 846 of file cp_model.cc.
+Definition at line 870 of file cp_model.cc.
@@ -893,12 +896,44 @@ Public Member Functions
Adds left > right.
-Definition at line 866 of file cp_model.cc.
+Definition at line 890 of file cp_model.cc.
+
+
+
+
+◆ AddHint() [1/2]
+
+
+
+
+
+ | void AddHint |
+ ( |
+ BoolVar |
+ var, |
+
+
+ |
+ |
+ bool |
+ value |
+
+
+ |
+ ) |
+ | |
+
+
+
+
+
Adds hinting to a Boolean variable.
+
+
Definition at line 1288 of file cp_model.cc.
◆ AddHint()
+◆ AddHint() [2/2]
@@ -925,7 +960,7 @@ Public Member Functions
Adds hinting to a variable.
-
Definition at line 1259 of file cp_model.cc.
+
Definition at line 1283 of file cp_model.cc.
@@ -965,7 +1000,7 @@ Public Member Functions
Adds a => b.
-Definition at line 806 of file cp_model.h.
+Definition at line 801 of file cp_model.h.
@@ -998,7 +1033,7 @@ Public Member Functions
An inverse constraint.
It enforces that if 'variables[i]' is assigned a value 'j', then inverse_variables[j] is assigned a value 'i'. And vice versa.
-Definition at line 992 of file cp_model.cc.
+Definition at line 1016 of file cp_model.cc.
@@ -1030,7 +1065,7 @@ Public Member Functions
Adds left <= right.
-Definition at line 856 of file cp_model.cc.
+Definition at line 880 of file cp_model.cc.
@@ -1062,7 +1097,7 @@ Public Member Functions
Adds left < right.
-Definition at line 876 of file cp_model.cc.
+Definition at line 900 of file cp_model.cc.
@@ -1094,7 +1129,7 @@ Public Member Functions
Adds expr in domain.
-Definition at line 886 of file cp_model.cc.
+Definition at line 910 of file cp_model.cc.
@@ -1132,7 +1167,7 @@ Public Member Functions
@@ -1170,7 +1205,7 @@ Public Member Functions
@@ -1202,7 +1237,7 @@ Public Member Functions
Adds target == max(vars).
-Definition at line 1077 of file cp_model.cc.
+Definition at line 1101 of file cp_model.cc.
@@ -1234,7 +1269,7 @@ Public Member Functions
Adds target == max(exprs).
-Definition at line 1087 of file cp_model.cc.
+Definition at line 1111 of file cp_model.cc.
@@ -1266,7 +1301,7 @@ Public Member Functions
Adds target == max(exprs).
-Definition at line 1097 of file cp_model.cc.
+Definition at line 1121 of file cp_model.cc.
@@ -1298,7 +1333,7 @@ Public Member Functions
Adds target == min(vars).
-Definition at line 1041 of file cp_model.cc.
+Definition at line 1065 of file cp_model.cc.
@@ -1330,7 +1365,7 @@ Public Member Functions
Adds target == min(exprs).
-Definition at line 1053 of file cp_model.cc.
+Definition at line 1077 of file cp_model.cc.
@@ -1362,7 +1397,7 @@ Public Member Functions
Adds target == min(exprs).
-Definition at line 1065 of file cp_model.cc.
+Definition at line 1089 of file cp_model.cc.
@@ -1400,7 +1435,7 @@ Public Member Functions
Adds target = var % mod.
-Definition at line 1127 of file cp_model.cc.
+Definition at line 1151 of file cp_model.cc.
@@ -1429,7 +1464,7 @@ Public Member Functions
There is no cycle in this graph, except through node 0.
-Definition at line 969 of file cp_model.cc.
+Definition at line 993 of file cp_model.cc.
@@ -1461,7 +1496,7 @@ Public Member Functions
Adds target == prod(vars).
-Definition at line 1137 of file cp_model.cc.
+Definition at line 1161 of file cp_model.cc.
@@ -1493,7 +1528,7 @@ Public Member Functions
Adds target == prod(exprs).
-Definition at line 1147 of file cp_model.cc.
+Definition at line 1171 of file cp_model.cc.
@@ -1525,7 +1560,7 @@ Public Member Functions
Adds target == prod(vars).
-Definition at line 1157 of file cp_model.cc.
+Definition at line 1181 of file cp_model.cc.
@@ -1547,7 +1582,7 @@ Public Member Functions
Adds a no-overlap constraint that ensures that all present intervals do not overlap in time.
-Definition at line 1167 of file cp_model.cc.
+Definition at line 1191 of file cp_model.cc.
@@ -1568,7 +1603,7 @@ Public Member Functions
The no_overlap_2d constraint prevents a set of boxes from overlapping.
-Definition at line 1175 of file cp_model.cc.
+Definition at line 1199 of file cp_model.cc.
@@ -1600,7 +1635,7 @@ Public Member Functions
Adds left != right.
-Definition at line 903 of file cp_model.cc.
+Definition at line 927 of file cp_model.cc.
@@ -1635,7 +1670,7 @@ Public Member Functions
Note that level_min can be > 0, or level_max can be < 0. It just forces some level_changes to be executed at time 0 to make sure that we are within those bounds with the executed level_changes. Therefore, at any time t >= 0: sum(level_changes[i] * actives[i] if times[i] <= t) in [min_level, max_level]
It returns a ReservoirConstraint that allows adding optional and non optional events incrementally after construction.
-Definition at line 1005 of file cp_model.cc.
+Definition at line 1029 of file cp_model.cc.
@@ -1673,7 +1708,7 @@ Public Member Functions
Adds the element constraint: variables[index] == target.
-Definition at line 942 of file cp_model.cc.
+Definition at line 966 of file cp_model.cc.
@@ -1700,7 +1735,7 @@ Public Member Functions
@@ -1721,7 +1756,7 @@ Public Member Functions
Remove all assumptions from the model.
-Definition at line 1278 of file cp_model.cc.
+Definition at line 1312 of file cp_model.cc.
@@ -1742,7 +1777,7 @@ Public Member Functions
Removes all hints.
-Definition at line 1264 of file cp_model.cc.
+Definition at line 1298 of file cp_model.cc.
@@ -1764,7 +1799,7 @@ Public Member Functions
Replaces the current model with the one from the given proto.
-Definition at line 1282 of file cp_model.cc.
+Definition at line 1316 of file cp_model.cc.
@@ -1786,7 +1821,7 @@ Public Member Functions
Creates an always false Boolean variable.
If this is called multiple times, the same variable will always be returned.
-Definition at line 750 of file cp_model.cc.
+Definition at line 774 of file cp_model.cc.
@@ -1808,7 +1843,7 @@ Public Member Functions
Returns the Boolean variable from its index in the proto.
-Definition at line 1296 of file cp_model.cc.
+Definition at line 1330 of file cp_model.cc.
@@ -1830,7 +1865,7 @@ Public Member Functions
Returns the interval variable from its index in the proto.
-Definition at line 1318 of file cp_model.cc.
+Definition at line 1352 of file cp_model.cc.
@@ -1852,7 +1887,7 @@ Public Member Functions
Returns the integer variable from its index in the proto.
-Definition at line 1312 of file cp_model.cc.
+Definition at line 1346 of file cp_model.cc.
@@ -1874,7 +1909,7 @@ Public Member Functions
Adds a linear maximization objective after rescaling of the double coefficients.
-Definition at line 1223 of file cp_model.cc.
+Definition at line 1247 of file cp_model.cc.
@@ -1896,7 +1931,7 @@ Public Member Functions
Adds a linear maximization objective.
-Definition at line 1198 of file cp_model.cc.
+Definition at line 1222 of file cp_model.cc.
@@ -1918,7 +1953,7 @@ Public Member Functions
Adds a linear minimization objective after rescaling of the double coefficients.
-Definition at line 1211 of file cp_model.cc.
+Definition at line 1235 of file cp_model.cc.
@@ -1940,7 +1975,7 @@ Public Member Functions
Adds a linear minimization objective.
-Definition at line 1186 of file cp_model.cc.
+Definition at line 1210 of file cp_model.cc.
@@ -1967,7 +2002,7 @@ Public Member Functions
@@ -1988,7 +2023,7 @@ Public Member Functions
Creates a Boolean variable.
-Definition at line 734 of file cp_model.cc.
+Definition at line 758 of file cp_model.cc.
@@ -2011,7 +2046,7 @@ Public Member Functions
Creates a constant variable.
This is a shortcut for NewVariable(Domain(value)).but it will return the same variable if used twice with the same constant.
-Definition at line 742 of file cp_model.cc.
+Definition at line 766 of file cp_model.cc.
@@ -2043,7 +2078,7 @@ Public Member Functions
Creates an interval variable with a fixed size.
-Definition at line 760 of file cp_model.cc.
+Definition at line 784 of file cp_model.cc.
@@ -2081,7 +2116,7 @@ Public Member Functions
Creates an interval variable from 3 affine expressions.
-Definition at line 754 of file cp_model.cc.
+Definition at line 778 of file cp_model.cc.
@@ -2103,7 +2138,7 @@ Public Member Functions
Creates an integer variable with the given domain.
-Definition at line 724 of file cp_model.cc.
+Definition at line 748 of file cp_model.cc.
@@ -2141,7 +2176,7 @@ Public Member Functions
Creates an optional interval variable with a fixed size.
-Definition at line 782 of file cp_model.cc.
+Definition at line 806 of file cp_model.cc.
@@ -2185,7 +2220,7 @@ Public Member Functions
Creates an optional interval variable from 3 affine expressions and a Boolean variable.
-Definition at line 765 of file cp_model.cc.
+Definition at line 789 of file cp_model.cc.
@@ -2212,7 +2247,7 @@ Public Member Functions
@@ -2234,7 +2269,7 @@ Public Member Functions
Sets the name of the model.
-Definition at line 688 of file cp_model.cc.
+Definition at line 712 of file cp_model.cc.
@@ -2256,7 +2291,7 @@ Public Member Functions
Creates an always true Boolean variable.
If this is called multiple times, the same variable will always be returned.
-Definition at line 746 of file cp_model.cc.
+Definition at line 770 of file cp_model.cc.
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_cumulative_constraint.html b/docs/cpp/classoperations__research_1_1sat_1_1_cumulative_constraint.html
index ec74da2072..300dc1a361 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_cumulative_constraint.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_cumulative_constraint.html
@@ -98,7 +98,7 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_c
This constraint allows adding fixed or variables demands to the cumulative constraint incrementally.
One cannot mix the AddDemand() and AddDemandWithEnergy() APIs in the same cumulative API. Either always supply energy info, or never.
-Definition at line 733 of file cp_model.h.
+Definition at line 728 of file cp_model.h.
|
@@ -158,7 +158,7 @@ Protected Attributes
Adds a pair (interval, demand) to the constraint.
-Definition at line 619 of file cp_model.cc.
+Definition at line 637 of file cp_model.cc.
@@ -187,7 +187,7 @@ Protected Attributes
Returns the mutable underlying protobuf object (useful for model edition).
-Definition at line 586 of file cp_model.h.
+Definition at line 581 of file cp_model.h.
@@ -216,7 +216,7 @@ Protected Attributes
Returns the name of the constraint (or the empty string if not set).
-Definition at line 548 of file cp_model.cc.
+Definition at line 566 of file cp_model.cc.
@@ -253,7 +253,7 @@ Protected Attributes
other: no support (but can be added on a per-demand basis).
-Definition at line 550 of file cp_model.cc.
+Definition at line 568 of file cp_model.cc.
@@ -283,7 +283,7 @@ Protected Attributes
See OnlyEnforceIf(absl::Span<const BoolVar> literals).
-Definition at line 557 of file cp_model.cc.
+Definition at line 575 of file cp_model.cc.
@@ -312,7 +312,7 @@ Protected Attributes
Returns the underlying protobuf object (useful for testing).
-Definition at line 583 of file cp_model.h.
+Definition at line 578 of file cp_model.h.
@@ -342,7 +342,7 @@ Protected Attributes
Sets the name of the constraint.
-Definition at line 543 of file cp_model.cc.
+Definition at line 561 of file cp_model.cc.
@@ -367,7 +367,7 @@ Protected Attributes
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_double_linear_expr-members.html b/docs/cpp/classoperations__research_1_1sat_1_1_double_linear_expr-members.html
index c092644541..7be18f8652 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_double_linear_expr-members.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_double_linear_expr-members.html
@@ -102,21 +102,22 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_d
| DoubleLinearExpr(BoolVar var) | DoubleLinearExpr | explicit |
| DoubleLinearExpr(IntVar var) | DoubleLinearExpr | explicit |
| DoubleLinearExpr(double constant) | DoubleLinearExpr | explicit |
- | operator*=(double coeff) | DoubleLinearExpr | |
- | operator+=(double value) | DoubleLinearExpr | |
- | operator+=(IntVar var) | DoubleLinearExpr | |
- | operator+=(BoolVar var) | DoubleLinearExpr | |
- | operator+=(const DoubleLinearExpr &expr) | DoubleLinearExpr | |
- | operator-=(double value) | DoubleLinearExpr | |
- | operator-=(IntVar var) | DoubleLinearExpr | |
- | operator-=(const DoubleLinearExpr &expr) | DoubleLinearExpr | |
- | ScalProd(absl::Span< const IntVar > vars, absl::Span< const double > coeffs) | DoubleLinearExpr | static |
- | ScalProd(absl::Span< const BoolVar > vars, absl::Span< const double > coeffs) | DoubleLinearExpr | static |
- | ScalProd(std::initializer_list< IntVar > vars, absl::Span< const double > coeffs) | DoubleLinearExpr | static |
- | Sum(absl::Span< const IntVar > vars) | DoubleLinearExpr | static |
- | Sum(absl::Span< const BoolVar > vars) | DoubleLinearExpr | static |
- | Sum(std::initializer_list< IntVar > vars) | DoubleLinearExpr | static |
- | variables() const | DoubleLinearExpr | inline |
+ | IsConstant() const | DoubleLinearExpr | inline |
+ | operator*=(double coeff) | DoubleLinearExpr | |
+ | operator+=(double value) | DoubleLinearExpr | |
+ | operator+=(IntVar var) | DoubleLinearExpr | |
+ | operator+=(BoolVar var) | DoubleLinearExpr | |
+ | operator+=(const DoubleLinearExpr &expr) | DoubleLinearExpr | |
+ | operator-=(double value) | DoubleLinearExpr | |
+ | operator-=(IntVar var) | DoubleLinearExpr | |
+ | operator-=(const DoubleLinearExpr &expr) | DoubleLinearExpr | |
+ | ScalProd(absl::Span< const IntVar > vars, absl::Span< const double > coeffs) | DoubleLinearExpr | static |
+ | ScalProd(absl::Span< const BoolVar > vars, absl::Span< const double > coeffs) | DoubleLinearExpr | static |
+ | ScalProd(std::initializer_list< IntVar > vars, absl::Span< const double > coeffs) | DoubleLinearExpr | static |
+ | Sum(absl::Span< const IntVar > vars) | DoubleLinearExpr | static |
+ | Sum(absl::Span< const BoolVar > vars) | DoubleLinearExpr | static |
+ | Sum(std::initializer_list< IntVar > vars) | DoubleLinearExpr | static |
+ | variables() const | DoubleLinearExpr | inline |
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_double_linear_expr.html b/docs/cpp/classoperations__research_1_1sat_1_1_double_linear_expr.html
index 4ad8d7f92a..42801d8943 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_double_linear_expr.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_double_linear_expr.html
@@ -114,17 +114,17 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_d
-static DoubleLinearExpr ScalProd(absl::Span< const IntVar > vars, absl::Span< const double > coeffs)
Constructs the scalar product of variables and coefficients.
DoubleLinearExpr & AddConstant(double constant)
Deprecated. Use +=.
static DoubleLinearExpr Sum(absl::Span< const IntVar > vars)
Constructs the sum of a list of variables.
static DoubleLinearExpr ScalProd(absl::Span< const IntVar > vars, absl::Span< const double > coeffs)
Constructs the scalar product of variables and coefficients.
DoubleLinearExpr & AddConstant(double constant)
Deprecated. Use +=.
static DoubleLinearExpr Sum(absl::Span< const IntVar > vars)
Constructs the sum of a list of variables.
BoolVar Not(BoolVar x)
A convenient wrapper so we can write Not(x) instead of x.Not() which is sometimes clearer.
BoolVar Not(BoolVar x)
A convenient wrapper so we can write Not(x) instead of x.Not() which is sometimes clearer.
This can be used in the objective definition.
cp_model.Minimize(DoubleLinearExpr::Term(y, 3.4).
AddConstant(5.2));
-Definition at line 370 of file cp_model.h.
+Definition at line 368 of file cp_model.h.
|
@@ -176,6 +176,8 @@ Public Member Functions
| const std::vector< double > & | coefficients () const |
| | Returns the vector of coefficients. More...
|
| |
+| const bool | IsConstant () const |
+| |
| double | constant () const |
| | Returns the constant term. More...
|
| |
@@ -220,7 +222,7 @@ Static Public Member Functions
@@ -251,7 +253,7 @@ Static Public Member Functions
Constructs a linear expression from a Boolean variable.
It deals with logical negation correctly.
-Definition at line 361 of file cp_model.cc.
+Definition at line 379 of file cp_model.cc.
@@ -281,7 +283,7 @@ Static Public Member Functions
Constructs a linear expression from an integer variable.
-Definition at line 363 of file cp_model.cc.
+Definition at line 381 of file cp_model.cc.
@@ -311,7 +313,7 @@ Static Public Member Functions
Constructs a constant linear expression.
-Definition at line 365 of file cp_model.cc.
+Definition at line 383 of file cp_model.cc.
@@ -334,7 +336,7 @@ Static Public Member Functions
Deprecated. Use +=.
-Definition at line 427 of file cp_model.cc.
+Definition at line 445 of file cp_model.cc.
@@ -364,7 +366,7 @@ Static Public Member Functions
@@ -396,7 +398,7 @@ Static Public Member Functions
Adds a term (var * coeff) to the linear expression.
-Definition at line 451 of file cp_model.cc.
+Definition at line 469 of file cp_model.cc.
@@ -425,7 +427,7 @@ Static Public Member Functions
Returns the vector of coefficients.
-Definition at line 441 of file cp_model.h.
+Definition at line 436 of file cp_model.h.
@@ -454,7 +456,7 @@ Static Public Member Functions
Returns the constant term.
-Definition at line 444 of file cp_model.h.
+Definition at line 442 of file cp_model.h.
@@ -476,7 +478,34 @@ Static Public Member Functions
Debug string. See the documentation for LinearExpr::DebugString().
-Definition at line 498 of file cp_model.cc.
+Definition at line 516 of file cp_model.cc.
+
+
+
+
+◆ IsConstant()
+
+
+
+
+
+
+
+
+ | const bool IsConstant |
+ ( |
+ | ) |
+ const |
+
+
+ |
+
+inline |
+
+
+
Multiply the linear expression by a constant.
-Definition at line 490 of file cp_model.cc.
+Definition at line 508 of file cp_model.cc.
@@ -518,7 +547,7 @@ Static Public Member Functions
@@ -540,7 +569,7 @@ Static Public Member Functions
Adds another linear expression to the linear expression.
-Definition at line 442 of file cp_model.cc.
+Definition at line 460 of file cp_model.cc.
@@ -562,7 +591,7 @@ Static Public Member Functions
Adds a constant value to the linear expression.
-Definition at line 422 of file cp_model.cc.
+Definition at line 440 of file cp_model.cc.
@@ -584,7 +613,7 @@ Static Public Member Functions
Adds a single integer variable to the linear expression.
-Definition at line 432 of file cp_model.cc.
+Definition at line 450 of file cp_model.cc.
@@ -606,7 +635,7 @@ Static Public Member Functions
Adds another linear expression to the linear expression.
-Definition at line 480 of file cp_model.cc.
+Definition at line 498 of file cp_model.cc.
@@ -628,7 +657,7 @@ Static Public Member Functions
Adds a constant value to the linear expression.
-Definition at line 470 of file cp_model.cc.
+Definition at line 488 of file cp_model.cc.
@@ -650,7 +679,7 @@ Static Public Member Functions
Adds a single integer variable to the linear expression.
-Definition at line 475 of file cp_model.cc.
+Definition at line 493 of file cp_model.cc.
@@ -690,7 +719,7 @@ Static Public Member Functions
Constructs the scalar product of Boolean variables and coefficients.
-Definition at line 401 of file cp_model.cc.
+Definition at line 419 of file cp_model.cc.
@@ -730,7 +759,7 @@ Static Public Member Functions
Constructs the scalar product of variables and coefficients.
-Definition at line 391 of file cp_model.cc.
+Definition at line 409 of file cp_model.cc.
@@ -770,7 +799,7 @@ Static Public Member Functions
Constructs the scalar product of variables and coefficients.
-Definition at line 411 of file cp_model.cc.
+Definition at line 429 of file cp_model.cc.
@@ -800,7 +829,7 @@ Static Public Member Functions
Constructs the sum of a list of Boolean variables.
-Definition at line 375 of file cp_model.cc.
+Definition at line 393 of file cp_model.cc.
@@ -830,7 +859,7 @@ Static Public Member Functions
Constructs the sum of a list of variables.
-Definition at line 367 of file cp_model.cc.
+Definition at line 385 of file cp_model.cc.
@@ -860,7 +889,7 @@ Static Public Member Functions
Constructs the sum of a list of variables.
-Definition at line 383 of file cp_model.cc.
+Definition at line 401 of file cp_model.cc.
@@ -889,7 +918,7 @@ Static Public Member Functions
Returns the vector of variable indices.
-Definition at line 438 of file cp_model.h.
+Definition at line 433 of file cp_model.h.
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_int_var-members.html b/docs/cpp/classoperations__research_1_1sat_1_1_int_var-members.html
index 99a0ca5473..f62a64c685 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_int_var-members.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_int_var-members.html
@@ -97,21 +97,20 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_i
| CpModelBuilder | IntVar | friend |
| CumulativeConstraint | IntVar | friend |
| DebugString() const | IntVar | |
- | DoubleLinearExpr | IntVar | friend |
- | index() const | IntVar | inline |
- | IntervalVar | IntVar | friend |
- | IntVar() | IntVar | |
- | IntVar(const BoolVar &var) | IntVar | |
- | LinearExpr | IntVar | friend |
- | MutableProto() const | IntVar | |
- | Name() const | IntVar | inline |
+ | Domain() const | IntVar | |
+ | DoubleLinearExpr | IntVar | friend |
+ | index() const | IntVar | inline |
+ | IntervalVar | IntVar | friend |
+ | IntVar() | IntVar | |
+ | IntVar(const BoolVar &var) | IntVar | |
+ | LinearExpr | IntVar | friend |
+ | Name() const | IntVar | |
| operator!=(const IntVar &other) const | IntVar | inline |
| operator==(const IntVar &other) const | IntVar | inline |
- | Proto() const | IntVar | |
- | ReservoirConstraint | IntVar | friend |
- | SolutionIntegerValue | IntVar | friend |
- | ToBoolVar() const | IntVar | |
- | WithName(const std::string &name) | IntVar | |
+ | ReservoirConstraint | IntVar | friend |
+ | SolutionIntegerValue | IntVar | friend |
+ | ToBoolVar() const | IntVar | |
+ | WithName(const std::string &name) | IntVar | |
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_int_var.html b/docs/cpp/classoperations__research_1_1sat_1_1_int_var.html
index 08ed713e96..1c8e06f237 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_int_var.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_int_var.html
@@ -94,17 +94,17 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_i
An integer variable.
-
This class wraps an IntegerVariableProto. This can only be constructed via CpModelBuilder.NewIntVar().
-
Note that a BoolVar can be used in any place that accept an IntVar via an implicit cast. It will simply take the value 0 (when false) or 1 (when true).
+
This class wraps an IntegerVariableProto. This can only be constructed via CpModelBuilder.NewIntVar().
-
Definition at line 141 of file cp_model.h.
+
Definition at line 138 of file cp_model.h.
@@ -153,7 +146,10 @@ Public Member Functions
-
Definition at line 86 of file cp_model.cc.
+
A default constructed IntVar can be used to mean not defined yet.
+
However, it shouldn't be passed to any of the functions in this file. Doing so will crash in debug mode and will result in an invalid model in opt mode.
+
+
Definition at line 90 of file cp_model.cc.
-
Implicit cast BoolVar -> IntVar.
-
Warning: If you construct an IntVar from a negated BoolVar, this might create a new variable in the model.
+
Cast BoolVar -> IntVar.
+
The IntVar will take the value 1 (when the bool is true) and 0 otherwise.
+
Warning: If you construct an IntVar from a negated BoolVar, this might create a new variable in the model. Otherwise this just point to the same underlying variable.
-
Definition at line 93 of file cp_model.cc.
+
Definition at line 97 of file cp_model.cc.
-
Adds a constant value to an integer variable and returns a linear expression.
+
Deprecated. Just do var + cte where needed.
-
Definition at line 111 of file cp_model.cc.
+
Definition at line 129 of file cp_model.cc.
◆ Domain()
+
+
@@ -249,18 +263,18 @@ Public Member Functions
Returns the index of the variable in the model. This will be non-negative.
-Definition at line 187 of file cp_model.h.
+Definition at line 181 of file cp_model.h.
-
-◆ MutableProto()
+
+◆ Name()
- | IntegerVariableProto * MutableProto |
+ std::string Name |
( |
| ) |
const |
@@ -268,38 +282,9 @@ Public Member Functions
-
Returns the mutable underlying protobuf object (useful for model edition).
-
-
Definition at line 153 of file cp_model.cc.
-
-
-
-
-◆ Name()
-
-
-
-
-
-
-
-
- | const std::string & Name |
- ( |
- | ) |
- const |
-
-
- |
-
-inline |
-
-
-
-
Returns the name of the variable (or the empty string if not set).
-
Definition at line 161 of file cp_model.h.
+
Definition at line 124 of file cp_model.cc.
◆ Proto()
-
-
-
-
-
Returns the underlying protobuf object (useful for testing).
-
-
Definition at line 149 of file cp_model.cc.
+
Definition at line 167 of file cp_model.h.
Cast IntVar -> BoolVar.
-
Warning: This checks that the domain of the var is within {0,1} and crash if it is not the case. Use at your own risk.
+
Warning: The domain of the var must be within {0,1}. If not, we crash in debug mode, and in opt mode you will get an invalid model if you use this BoolVar anywhere since it will not have a valid domain.
-
Definition at line 99 of file cp_model.cc.
+
Definition at line 107 of file cp_model.cc.
@@ -424,7 +384,7 @@ Public Member Functions
Sets the name of the variable.
-Definition at line 106 of file cp_model.cc.
+Definition at line 117 of file cp_model.cc.
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_interval_var-members.html b/docs/cpp/classoperations__research_1_1sat_1_1_interval_var-members.html
index 5555826126..280cbd43c5 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_interval_var-members.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_interval_var-members.html
@@ -98,14 +98,12 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_i
| EndExpr() const | IntervalVar | |
| index() const | IntervalVar | inline |
| IntervalVar() | IntervalVar | |
- | MutableProto() const | IntervalVar | |
- | Name() const | IntervalVar | |
- | NoOverlap2DConstraint | IntervalVar | friend |
- | operator!=(const IntervalVar &other) const | IntervalVar | inline |
- | operator<< | IntervalVar | friend |
- | operator==(const IntervalVar &other) const | IntervalVar | inline |
- | PresenceBoolVar() const | IntervalVar | |
- | Proto() const | IntervalVar | |
+ | Name() const | IntervalVar | |
+ | NoOverlap2DConstraint | IntervalVar | friend |
+ | operator!=(const IntervalVar &other) const | IntervalVar | inline |
+ | operator<< | IntervalVar | friend |
+ | operator==(const IntervalVar &other) const | IntervalVar | inline |
+ | PresenceBoolVar() const | IntervalVar | |
| SizeExpr() const | IntervalVar | |
| StartExpr() const | IntervalVar | |
| WithName(const std::string &name) | IntervalVar | |
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_interval_var.html b/docs/cpp/classoperations__research_1_1sat_1_1_interval_var.html
index 01f19c95ca..8a0b1cedfe 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_interval_var.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_interval_var.html
@@ -100,19 +100,19 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_i
Optionally, a presence literal can be added to this constraint. This presence literal is understood by the same constraints. These constraints ignore interval variables with precence literals assigned to false. Conversely, these constraints will also set these presence literals to false if they cannot fit these intervals into the schedule.
It can only be constructed via CpModelBuilder.NewIntervalVar().
-Definition at line 477 of file cp_model.h.
+Definition at line 475 of file cp_model.h.
-
Default ctor.
+
A default constructed IntervalVar can be used to mean not defined yet.
+
However, it shouldn't be passed to any of the functions in this file. Doing so will crash in debug mode and will result in an invalid model in opt mode.
-
Definition at line 625 of file cp_model.cc.
+
Definition at line 643 of file cp_model.cc.
Returns a debug string.
-Definition at line 656 of file cp_model.cc.
+Definition at line 688 of file cp_model.cc.
@@ -206,7 +201,7 @@ Public Member Functions
Returns the end linear expression.
Note that this rebuilds the expression each time this method is called.
-Definition at line 643 of file cp_model.cc.
+Definition at line 669 of file cp_model.cc.
@@ -235,39 +230,18 @@ Public Member Functions
Returns the index of the interval constraint in the model.
-Definition at line 527 of file cp_model.h.
+Definition at line 522 of file cp_model.h.
-
-◆ MutableProto()
+
+◆ Name()
-
-
Returns the mutable underlying protobuf object (useful for model edition).
-
-
Definition at line 677 of file cp_model.cc.
-
-
-
-
-◆ Name()
-
-
-
-
-
- | const std::string & Name |
+ std::string Name |
( |
| ) |
const |
@@ -277,7 +251,7 @@ Public Member Functions
Returns the name of the interval (or the empty string if not set).
-Definition at line 652 of file cp_model.cc.
+Definition at line 683 of file cp_model.cc.
@@ -307,7 +281,7 @@ Public Member Functions
Difference test with another interval variable.
-Definition at line 513 of file cp_model.h.
+Definition at line 514 of file cp_model.h.
@@ -337,7 +311,7 @@ Public Member Functions
Equality test with another interval variable.
-Definition at line 508 of file cp_model.h.
+Definition at line 509 of file cp_model.h.
@@ -359,28 +333,7 @@ Public Member Functions
Returns a BoolVar indicating the presence of this interval.
It returns CpModelBuilder.TrueVar() if the interval is not optional.
-Definition at line 647 of file cp_model.cc.
-
-
-
-
-◆ Proto()
-
-
-
-
-
Returns the underlying protobuf object (useful for testing).
-
-
Definition at line 673 of file cp_model.cc.
+
Definition at line 676 of file cp_model.cc.
Returns the size linear expression.
Note that this rebuilds the expression each time this method is called.
-Definition at line 639 of file cp_model.cc.
+Definition at line 662 of file cp_model.cc.
@@ -424,7 +377,7 @@ Public Member Functions
Returns the start linear expression.
Note that this rebuilds the expression each time this method is called.
-Definition at line 635 of file cp_model.cc.
+Definition at line 655 of file cp_model.cc.
@@ -446,7 +399,7 @@ Public Member Functions
Sets the name of the variable.
-Definition at line 630 of file cp_model.cc.
+Definition at line 648 of file cp_model.cc.
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_linear_expr-members.html b/docs/cpp/classoperations__research_1_1sat_1_1_linear_expr-members.html
index 1df42925b6..ecf504b36d 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_linear_expr-members.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_linear_expr-members.html
@@ -104,22 +104,23 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_l
| constant() const | LinearExpr | inline |
| DebugString(const CpModelProto *proto=nullptr) const | LinearExpr | |
| FromProto(const LinearExpressionProto &proto) | LinearExpr | static |
- | LinearExpr()=default | LinearExpr | |
- | LinearExpr(BoolVar var) | LinearExpr | |
- | LinearExpr(IntVar var) | LinearExpr | |
- | LinearExpr(int64_t constant) | LinearExpr | |
- | operator*=(int64_t factor) | LinearExpr | |
- | operator+=(const LinearExpr &other) | LinearExpr | |
- | operator-=(const LinearExpr &other) | LinearExpr | |
- | ScalProd(absl::Span< const IntVar > vars, absl::Span< const int64_t > coeffs) | LinearExpr | static |
- | ScalProd(absl::Span< const BoolVar > vars, absl::Span< const int64_t > coeffs) | LinearExpr | static |
- | ScalProd(std::initializer_list< IntVar > vars, absl::Span< const int64_t > coeffs) | LinearExpr | static |
- | Sum(absl::Span< const IntVar > vars) | LinearExpr | static |
- | Sum(absl::Span< const BoolVar > vars) | LinearExpr | static |
- | Sum(std::initializer_list< IntVar > vars) | LinearExpr | static |
- | Term(IntVar var, int64_t coefficient) | LinearExpr | static |
- | Term(BoolVar var, int64_t coefficient) | LinearExpr | static |
- | variables() const | LinearExpr | inline |
+ | IsConstant() const | LinearExpr | inline |
+ | LinearExpr()=default | LinearExpr | |
+ | LinearExpr(BoolVar var) | LinearExpr | |
+ | LinearExpr(IntVar var) | LinearExpr | |
+ | LinearExpr(int64_t constant) | LinearExpr | |
+ | operator*=(int64_t factor) | LinearExpr | |
+ | operator+=(const LinearExpr &other) | LinearExpr | |
+ | operator-=(const LinearExpr &other) | LinearExpr | |
+ | ScalProd(absl::Span< const IntVar > vars, absl::Span< const int64_t > coeffs) | LinearExpr | static |
+ | ScalProd(absl::Span< const BoolVar > vars, absl::Span< const int64_t > coeffs) | LinearExpr | static |
+ | ScalProd(std::initializer_list< IntVar > vars, absl::Span< const int64_t > coeffs) | LinearExpr | static |
+ | Sum(absl::Span< const IntVar > vars) | LinearExpr | static |
+ | Sum(absl::Span< const BoolVar > vars) | LinearExpr | static |
+ | Sum(std::initializer_list< IntVar > vars) | LinearExpr | static |
+ | Term(IntVar var, int64_t coefficient) | LinearExpr | static |
+ | Term(BoolVar var, int64_t coefficient) | LinearExpr | static |
+ | variables() const | LinearExpr | inline |
A dedicated container for linear expressions.
With the use of implicit constructors, it can accept integer values, Boolean and Integer variables. Note that Not(x) will be silently transformed into 1 - x when added to the linear expression. It also support operator overloads to construct the linear expression naturally.
-
Furthermore, static methods allows sums and scalar products, with or without an additional constant.
+
Furthermore, static methods allow to construct a linear expression from sums or scalar products.
Usage:
CpModelBuilder cp_model;
IntVar x =
model.NewIntVar({0, 10}).WithName(
"x");
IntVar y =
model.NewIntVar({0, 10}).WithName(
"y");
@@ -110,19 +110,20 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_l
std::vector<BoolVar> bools = {
b,
Not(c)};
-
static LinearExpr Sum(absl::Span< const IntVar > vars)
Constructs the sum of a list of variables.
-
+
static LinearExpr Sum(absl::Span< const IntVar > vars)
Constructs the sum of a list of variables.
+
LinearExpr()=default
Creates an empty linear expression with value zero.
-
BoolVar Not(BoolVar x)
A convenient wrapper so we can write Not(x) instead of x.Not() which is sometimes clearer.
+
BoolVar Not(BoolVar x)
A convenient wrapper so we can write Not(x) instead of x.Not() which is sometimes clearer.
This can be used implicitly in some of the CpModelBuilder methods.
cp_model.AddGreaterThan(x, 5);
cp_model.AddEquality(x, y + 5);
-
Definition at line 241 of file cp_model.h.
+
Definition at line 238 of file cp_model.h.
|
| | LinearExpr ()=default |
+| | Creates an empty linear expression with value zero. More...
|
| |
| | LinearExpr (BoolVar var) |
| | Constructs a linear expression from a Boolean variable. More...
|
@@ -157,6 +158,9 @@ Public Member Functions
| const std::vector< int64_t > & | coefficients () const |
| | Returns the vector of coefficients. More...
|
| |
+| const bool | IsConstant () const |
+| | Returns true if the expression has no variables. More...
|
+| |
| int64_t | constant () const |
| | Returns the constant term. More...
|
| |
@@ -173,7 +177,7 @@ Static Public Member Functions
| | Constructs the sum of a list of Boolean variables. More...
|
| |
| static LinearExpr | Sum (std::initializer_list< IntVar > vars) |
-| | Constructs the sum of a list of Boolean variables. More...
|
+| | Constructs the sum of a list of variables. More...
|
| |
| static LinearExpr | ScalProd (absl::Span< const IntVar > vars, absl::Span< const int64_t > coeffs) |
| | Constructs the scalar product of variables and coefficients. More...
|
@@ -224,6 +228,8 @@ Static Public Member Functions
+
Creates an empty linear expression with value zero.
+
Constructs a linear expression from a Boolean variable.
It deals with logical negation correctly.
-Definition at line 162 of file cp_model.cc.
+Definition at line 178 of file cp_model.cc.
@@ -267,7 +273,7 @@ Static Public Member Functions
Constructs a linear expression from an integer variable.
-Definition at line 164 of file cp_model.cc.
+Definition at line 180 of file cp_model.cc.
@@ -289,7 +295,7 @@ Static Public Member Functions
Constructs a constant linear expression.
-Definition at line 166 of file cp_model.cc.
+Definition at line 182 of file cp_model.cc.
@@ -310,7 +316,7 @@ Static Public Member Functions
@@ -338,7 +344,7 @@ Static Public Member Functions
@@ -368,7 +374,7 @@ Static Public Member Functions
@@ -398,7 +404,7 @@ Static Public Member Functions
@@ -418,7 +424,7 @@ Static Public Member Functions
@@ -438,7 +444,7 @@ Static Public Member Functions
@@ -478,7 +484,7 @@ Static Public Member Functions
Deprecated. Use ScalProd() instead.
-Definition at line 252 of file cp_model.cc.
+Definition at line 268 of file cp_model.cc.
@@ -508,7 +514,7 @@ Static Public Member Functions
Deprecated. Use Sum() instead.
-Definition at line 244 of file cp_model.cc.
+Definition at line 260 of file cp_model.cc.
@@ -537,7 +543,7 @@ Static Public Member Functions
Returns the vector of coefficients.
-Definition at line 314 of file cp_model.h.
+Definition at line 309 of file cp_model.h.
@@ -566,7 +572,7 @@ Static Public Member Functions
Returns the constant term.
-Definition at line 317 of file cp_model.h.
+Definition at line 315 of file cp_model.h.
@@ -589,7 +595,7 @@ Static Public Member Functions
Debug string.
If the CpModelBuilder is passed, the string will include variable names and domains. Otherwise, you will get a shorter string with only variable indices.
-Definition at line 316 of file cp_model.cc.
+Definition at line 334 of file cp_model.cc.
@@ -619,7 +625,36 @@ Static Public Member Functions
Constructs a linear expr from its proto representation.
-Definition at line 168 of file cp_model.cc.
+Definition at line 184 of file cp_model.cc.
+
+
+
+
+◆ IsConstant()
+
+
+
+
+
+
+
+
+ | const bool IsConstant |
+ ( |
+ | ) |
+ const |
+
+
+ |
+
+inline |
+
+
+
+
+
Returns true if the expression has no variables.
+
+
Definition at line 312 of file cp_model.h.
Constructs the scalar product of Boolean variables and coefficients.
-Definition at line 211 of file cp_model.cc.
+Definition at line 227 of file cp_model.cc.
@@ -759,7 +794,7 @@ Static Public Member Functions
Constructs the scalar product of variables and coefficients.
-Definition at line 201 of file cp_model.cc.
+Definition at line 217 of file cp_model.cc.
@@ -799,7 +834,7 @@ Static Public Member Functions
Constructs the scalar product of variables and coefficients.
-Definition at line 221 of file cp_model.cc.
+Definition at line 237 of file cp_model.cc.
@@ -829,7 +864,7 @@ Static Public Member Functions
Constructs the sum of a list of Boolean variables.
-Definition at line 185 of file cp_model.cc.
+Definition at line 201 of file cp_model.cc.
@@ -859,7 +894,7 @@ Static Public Member Functions
Constructs the sum of a list of variables.
-Definition at line 177 of file cp_model.cc.
+Definition at line 193 of file cp_model.cc.
@@ -887,9 +922,9 @@ Static Public Member Functions
-
Constructs the sum of a list of Boolean variables.
+
Constructs the sum of a list of variables.
-
Definition at line 193 of file cp_model.cc.
+
Definition at line 209 of file cp_model.cc.
Constructs bool * coefficient.
-Definition at line 238 of file cp_model.cc.
+Definition at line 254 of file cp_model.cc.
@@ -969,7 +1004,7 @@ Static Public Member Functions
Constructs var * coefficient.
-Definition at line 232 of file cp_model.cc.
+Definition at line 248 of file cp_model.cc.
@@ -998,7 +1033,7 @@ Static Public Member Functions
Returns the vector of variable indices.
-Definition at line 311 of file cp_model.h.
+Definition at line 306 of file cp_model.h.
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_multiple_circuit_constraint.html b/docs/cpp/classoperations__research_1_1sat_1_1_multiple_circuit_constraint.html
index 2c98cb1a4e..ca07e40950 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_multiple_circuit_constraint.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_multiple_circuit_constraint.html
@@ -97,7 +97,7 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_m
Specialized circuit constraint.
This constraint allows adding arcs to the multiple circuit constraint incrementally.
-
Definition at line 624 of file cp_model.h.
+
Definition at line 619 of file cp_model.h.
|
@@ -171,7 +171,7 @@ Protected Attributes
-Definition at line 568 of file cp_model.cc.
+Definition at line 586 of file cp_model.cc.
@@ -200,7 +200,7 @@ Protected Attributes
Returns the mutable underlying protobuf object (useful for model edition).
-Definition at line 586 of file cp_model.h.
+Definition at line 581 of file cp_model.h.
@@ -229,7 +229,7 @@ Protected Attributes
Returns the name of the constraint (or the empty string if not set).
-Definition at line 548 of file cp_model.cc.
+Definition at line 566 of file cp_model.cc.
@@ -266,7 +266,7 @@ Protected Attributes
other: no support (but can be added on a per-demand basis).
-Definition at line 550 of file cp_model.cc.
+Definition at line 568 of file cp_model.cc.
@@ -296,7 +296,7 @@ Protected Attributes
See OnlyEnforceIf(absl::Span<const BoolVar> literals).
-Definition at line 557 of file cp_model.cc.
+Definition at line 575 of file cp_model.cc.
@@ -325,7 +325,7 @@ Protected Attributes
Returns the underlying protobuf object (useful for testing).
-Definition at line 583 of file cp_model.h.
+Definition at line 578 of file cp_model.h.
@@ -355,7 +355,7 @@ Protected Attributes
Sets the name of the constraint.
-Definition at line 543 of file cp_model.cc.
+Definition at line 561 of file cp_model.cc.
@@ -380,7 +380,7 @@ Protected Attributes
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_no_overlap2_d_constraint.html b/docs/cpp/classoperations__research_1_1sat_1_1_no_overlap2_d_constraint.html
index 171f9dd93f..5c6c7ba31f 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_no_overlap2_d_constraint.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_no_overlap2_d_constraint.html
@@ -97,7 +97,7 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_n
Specialized no_overlap2D constraint.
This constraint allows adding rectangles to the no_overlap2D constraint incrementally.
-
Definition at line 713 of file cp_model.h.
+
Definition at line 708 of file cp_model.h.
|
@@ -157,7 +157,7 @@ Protected Attributes
Adds a rectangle (parallel to the axis) to the constraint.
-Definition at line 609 of file cp_model.cc.
+Definition at line 627 of file cp_model.cc.
@@ -186,7 +186,7 @@ Protected Attributes
Returns the mutable underlying protobuf object (useful for model edition).
-Definition at line 586 of file cp_model.h.
+Definition at line 581 of file cp_model.h.
@@ -215,7 +215,7 @@ Protected Attributes
Returns the name of the constraint (or the empty string if not set).
-Definition at line 548 of file cp_model.cc.
+Definition at line 566 of file cp_model.cc.
@@ -252,7 +252,7 @@ Protected Attributes
other: no support (but can be added on a per-demand basis).
-Definition at line 550 of file cp_model.cc.
+Definition at line 568 of file cp_model.cc.
@@ -282,7 +282,7 @@ Protected Attributes
See OnlyEnforceIf(absl::Span<const BoolVar> literals).
-Definition at line 557 of file cp_model.cc.
+Definition at line 575 of file cp_model.cc.
@@ -311,7 +311,7 @@ Protected Attributes
Returns the underlying protobuf object (useful for testing).
-Definition at line 583 of file cp_model.h.
+Definition at line 578 of file cp_model.h.
@@ -341,7 +341,7 @@ Protected Attributes
Sets the name of the constraint.
-Definition at line 543 of file cp_model.cc.
+Definition at line 561 of file cp_model.cc.
@@ -366,7 +366,7 @@ Protected Attributes
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_reservoir_constraint.html b/docs/cpp/classoperations__research_1_1sat_1_1_reservoir_constraint.html
index 4ab9caaaae..1eb649dced 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_reservoir_constraint.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_reservoir_constraint.html
@@ -97,7 +97,7 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_r
Specialized reservoir constraint.
This constraint allows adding emptying/refilling events to the reservoir constraint incrementally.
-
Definition at line 664 of file cp_model.h.
+
Definition at line 659 of file cp_model.h.
|
@@ -161,7 +161,7 @@ Protected Attributes
Adds a mandatory event.
It will increase the used capacity by level_change at time time.
-Definition at line 585 of file cp_model.cc.
+Definition at line 603 of file cp_model.cc.
@@ -200,7 +200,7 @@ Protected Attributes
Adds a optional event.
If c is_active is true, It will increase the used capacity by level_changeat timec time.
-Definition at line 593 of file cp_model.cc.
+Definition at line 611 of file cp_model.cc.
@@ -229,7 +229,7 @@ Protected Attributes
Returns the mutable underlying protobuf object (useful for model edition).
-Definition at line 586 of file cp_model.h.
+Definition at line 581 of file cp_model.h.
@@ -258,7 +258,7 @@ Protected Attributes
Returns the name of the constraint (or the empty string if not set).
-Definition at line 548 of file cp_model.cc.
+Definition at line 566 of file cp_model.cc.
@@ -295,7 +295,7 @@ Protected Attributes
other: no support (but can be added on a per-demand basis).
-Definition at line 550 of file cp_model.cc.
+Definition at line 568 of file cp_model.cc.
@@ -325,7 +325,7 @@ Protected Attributes
See OnlyEnforceIf(absl::Span<const BoolVar> literals).
-Definition at line 557 of file cp_model.cc.
+Definition at line 575 of file cp_model.cc.
@@ -354,7 +354,7 @@ Protected Attributes
Returns the underlying protobuf object (useful for testing).
-Definition at line 583 of file cp_model.h.
+Definition at line 578 of file cp_model.h.
@@ -384,7 +384,7 @@ Protected Attributes
Sets the name of the constraint.
-Definition at line 543 of file cp_model.cc.
+Definition at line 561 of file cp_model.cc.
@@ -409,7 +409,7 @@ Protected Attributes
diff --git a/docs/cpp/classoperations__research_1_1sat_1_1_table_constraint.html b/docs/cpp/classoperations__research_1_1sat_1_1_table_constraint.html
index ad56f4fbb0..a2f56c5987 100644
--- a/docs/cpp/classoperations__research_1_1sat_1_1_table_constraint.html
+++ b/docs/cpp/classoperations__research_1_1sat_1_1_table_constraint.html
@@ -97,7 +97,7 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1sat_1_1_t
Specialized assignment constraint.
This constraint allows adding tuples to the allowed/forbidden assignment constraint incrementally.
-
Definition at line 647 of file cp_model.h.
+
Definition at line 642 of file cp_model.h.
|
@@ -147,7 +147,7 @@ Protected Attributes
Adds a tuple of possible values to the constraint.
-Definition at line 574 of file cp_model.cc.
+Definition at line 592 of file cp_model.cc.
@@ -176,7 +176,7 @@ Protected Attributes
Returns the mutable underlying protobuf object (useful for model edition).
-Definition at line 586 of file cp_model.h.
+Definition at line 581 of file cp_model.h.
@@ -205,7 +205,7 @@ Protected Attributes
Returns the name of the constraint (or the empty string if not set).
-Definition at line 548 of file cp_model.cc.
+Definition at line 566 of file cp_model.cc.
@@ -242,7 +242,7 @@ Protected Attributes
other: no support (but can be added on a per-demand basis).
-Definition at line 550 of file cp_model.cc.
+Definition at line 568 of file cp_model.cc.
@@ -272,7 +272,7 @@ Protected Attributes
See OnlyEnforceIf(absl::Span<const BoolVar> literals).
-Definition at line 557 of file cp_model.cc.
+Definition at line 575 of file cp_model.cc.
@@ -301,7 +301,7 @@ Protected Attributes
Returns the underlying protobuf object (useful for testing).
-Definition at line 583 of file cp_model.h.
+Definition at line 578 of file cp_model.h.
@@ -331,7 +331,7 @@ Protected Attributes
Sets the name of the constraint.
-Definition at line 543 of file cp_model.cc.
+Definition at line 561 of file cp_model.cc.
@@ -356,7 +356,7 @@ Protected Attributes
diff --git a/docs/cpp/cp__model_8cc_source.html b/docs/cpp/cp__model_8cc_source.html
index 7304bf8673..ed1ee9541c 100644
--- a/docs/cpp/cp__model_8cc_source.html
+++ b/docs/cpp/cp__model_8cc_source.html
@@ -124,164 +124,164 @@ $(document).ready(function(){initNavTree('cp__model_8cc_source.html',''); initRe
33 : builder_(builder), index_(
index) {}
-
-
-
-
-
-
-
- 43 const std::string&
name =
-
-
-
-
- 48 return absl::StrCat(
"Not(",
name,
")");
-
-
-
-
-
-
-
-
-
-
-
-
- 61 output.append(var_proto.
domain(0) == 0 ?
"false" :
"true");
-
- 63 if (var_proto.
name().empty()) {
- 64 absl::StrAppendFormat(&output,
"BoolVar%i(", index_);
-
- 66 absl::StrAppendFormat(&output,
"%s(", var_proto.
name());
-
-
- 69 output.append(var_proto.
domain(0) == 0 ?
"false)" :
"true)");
-
- 71 absl::StrAppend(&output, var_proto.
domain(0),
", ", var_proto.
domain(1),
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 89 : builder_(builder), index_(
index) {
-
-
-
-
- 94 builder_ =
var.builder_;
- 95 index_ = builder_->GetOrCreateIntegerIndex(
var.index_);
-
-
-
-
-
-
-
- 103 return BoolVar(index_, builder_);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+ 36 DCHECK(builder_ !=
nullptr);
+ 37 if (builder_ ==
nullptr)
return *
this;
+
+
+
+
+
+
+
+ 45 if (builder_ ==
nullptr)
return "null";
+ 46 const std::string&
name =
+
+
+
+
+ 51 return absl::StrCat(
"Not(",
name,
")");
+
+
+
+
+ 56 if (builder_ ==
nullptr)
return "null";
+
+
+
+
+
+
+
+
+ 65 output.append(var_proto.
domain(0) == 0 ?
"false" :
"true");
+
+ 67 if (var_proto.
name().empty()) {
+ 68 absl::StrAppendFormat(&output,
"BoolVar%i(", index_);
+
+ 70 absl::StrAppendFormat(&output,
"%s(", var_proto.
name());
+
+
+ 73 output.append(var_proto.
domain(0) == 0 ?
"false)" :
"true)");
+
+ 75 absl::StrAppend(&output, var_proto.
domain(0),
", ", var_proto.
domain(1),
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 93 : builder_(builder), index_(
index) {
+
+
+
+
+ 98 if (
var.builder_ ==
nullptr) {
+
+
+
+ 102 builder_ =
var.builder_;
+ 103 index_ = builder_->GetOrCreateIntegerIndex(
var.index_);
+
+
+
+
+ 108 if (builder_ !=
nullptr) {
+
+
+
+
+
+ 114 return BoolVar(index_, builder_);
+
+
+
+ 118 DCHECK(builder_ !=
nullptr);
+ 119 if (builder_ ==
nullptr)
return *
this;
+
+
+
-
-
-
-
- 128 absl::StrAppend(&output, var_proto.
domain(0));
-
- 130 if (var_proto.
name().empty()) {
- 131 absl::StrAppend(&output,
"V",
index,
"(");
-
- 133 absl::StrAppend(&output, var_proto.
name(),
"(");
-
-
-
-
-
- 139 absl::StrAppend(&output, var_proto.
domain(0),
")");
-
- 141 absl::StrAppend(&output, var_proto.
domain(0),
", ", var_proto.
domain(1),
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 170 for (
int i = 0; i < expr_proto.
vars_size(); ++i) {
- 171 result.variables_.push_back(expr_proto.
vars(i));
- 172 result.coefficients_.push_back(expr_proto.
coeffs(i));
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+ 125 if (builder_ ==
nullptr)
return "null";
+
+
+
+
+
+
+
+
+ 134 if (builder_ ==
nullptr)
return Domain();
+
+
+
+
+ 139 if (builder_ ==
nullptr)
return "null";
+
+
+
+
+
+
+
+
+
+
+
+
+ 152 absl::StrAppend(&output, var_proto.
domain(0));
+
+ 154 if (var_proto.
name().empty()) {
+ 155 absl::StrAppend(&output,
"V",
index,
"(");
+
+ 157 absl::StrAppend(&output, var_proto.
name(),
"(");
+
+
+
+
+
+ 163 absl::StrAppend(&output, var_proto.
domain(0),
")");
+
+ 165 absl::StrAppend(&output, var_proto.
domain(0),
", ", var_proto.
domain(1),
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 186 for (
int i = 0; i < expr_proto.
vars_size(); ++i) {
+ 187 result.variables_.push_back(expr_proto.
vars(i));
+ 188 result.coefficients_.push_back(expr_proto.
coeffs(i));
-
+
@@ -289,1187 +289,1223 @@ $(document).ready(function(){initNavTree('cp__model_8cc_source.html',''); initRe
-
- 202 absl::Span<const int64_t> coeffs) {
- 203 CHECK_EQ(vars.size(), coeffs.size());
-
- 205 for (
int i = 0; i < vars.size(); ++i) {
- 206 result.
AddTerm(vars[i], coeffs[i]);
-
-
-
-
-
- 212 absl::Span<const int64_t> coeffs) {
- 213 CHECK_EQ(vars.size(), coeffs.size());
-
- 215 for (
int i = 0; i < vars.size(); ++i) {
- 216 result.
AddTerm(vars[i], coeffs[i]);
-
-
-
-
-
- 222 absl::Span<const int64_t> coeffs) {
- 223 CHECK_EQ(vars.size(), coeffs.size());
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 253 absl::Span<const int64_t> coeffs) {
- 254 CHECK_EQ(vars.size(), coeffs.size());
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 218 absl::Span<const int64_t> coeffs) {
+ 219 CHECK_EQ(vars.size(), coeffs.size());
+
+ 221 for (
int i = 0; i < vars.size(); ++i) {
+ 222 result.
AddTerm(vars[i], coeffs[i]);
+
+
+
+
+
+ 228 absl::Span<const int64_t> coeffs) {
+ 229 CHECK_EQ(vars.size(), coeffs.size());
+
+ 231 for (
int i = 0; i < vars.size(); ++i) {
+ 232 result.
AddTerm(vars[i], coeffs[i]);
+
+
+
+
+
+ 238 absl::Span<const int64_t> coeffs) {
+ 239 CHECK_EQ(vars.size(), coeffs.size());
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
- 256 for (
int i = 0; i < vars.size(); ++i) {
- 257 result.
AddTerm(vars[i], coeffs[i]);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 272 variables_.push_back(
var.index_);
- 273 coefficients_.push_back(coeff);
-
-
-
-
-
-
- 280 variables_.push_back(
index);
- 281 coefficients_.push_back(coeff);
-
-
-
- 285 coefficients_.push_back(-coeff);
-
-
-
-
-
-
- 292 constant_ += other.constant_;
- 293 variables_.insert(variables_.end(), other.variables_.begin(),
- 294 other.variables_.end());
- 295 coefficients_.insert(coefficients_.end(), other.coefficients_.begin(),
- 296 other.coefficients_.end());
-
-
-
-
- 301 constant_ -= other.constant_;
- 302 variables_.insert(variables_.end(), other.variables_.begin(),
- 303 other.variables_.end());
- 304 for (
const int64_t coeff : other.coefficients_) {
- 305 coefficients_.push_back(-coeff);
-
-
-
-
-
-
- 312 for (int64_t& coeff : coefficients_) coeff *= factor;
-
-
-
-
-
- 318 for (
int i = 0; i < variables_.size(); ++i) {
- 319 const int64_t coeff = coefficients_[i];
- 320 const std::string var_string =
proto ==
nullptr
- 321 ? absl::StrCat(
"V", variables_[i])
-
-
-
- 325 absl::StrAppend(&result, var_string);
- 326 }
else if (coeff == -1) {
- 327 absl::StrAppend(&result,
"-", var_string);
- 328 }
else if (coeff != 0) {
- 329 absl::StrAppend(&result, coeff,
" * ", var_string);
-
- 331 }
else if (coeff == 1) {
- 332 absl::StrAppend(&result,
" + ", var_string);
- 333 }
else if (coeff > 0) {
- 334 absl::StrAppend(&result,
" + ", coeff,
" * ", var_string);
- 335 }
else if (coeff == -1) {
- 336 absl::StrAppend(&result,
" - ", var_string);
- 337 }
else if (coeff < 0) {
- 338 absl::StrAppend(&result,
" - ", -coeff,
" * ", var_string);
-
-
-
- 342 if (constant_ != 0) {
- 343 if (variables_.empty()) {
- 344 return absl::StrCat(constant_);
- 345 }
else if (constant_ > 0) {
- 346 absl::StrAppend(&result,
" + ", constant_);
-
- 348 absl::StrAppend(&result,
" - ", -constant_);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 269 absl::Span<const int64_t> coeffs) {
+ 270 CHECK_EQ(vars.size(), coeffs.size());
+
+ 272 for (
int i = 0; i < vars.size(); ++i) {
+ 273 result.
AddTerm(vars[i], coeffs[i]);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 289 variables_.push_back(
var.index_);
+ 290 coefficients_.push_back(coeff);
+
+
+
+
+
+
+
+ 298 variables_.push_back(
index);
+ 299 coefficients_.push_back(coeff);
+
+
+
+ 303 coefficients_.push_back(-coeff);
+
+
+
+
+
+
+ 310 constant_ += other.constant_;
+ 311 variables_.insert(variables_.end(), other.variables_.begin(),
+ 312 other.variables_.end());
+ 313 coefficients_.insert(coefficients_.end(), other.coefficients_.begin(),
+ 314 other.coefficients_.end());
+
+
+
+
+ 319 constant_ -= other.constant_;
+ 320 variables_.insert(variables_.end(), other.variables_.begin(),
+ 321 other.variables_.end());
+ 322 for (
const int64_t coeff : other.coefficients_) {
+ 323 coefficients_.push_back(-coeff);
+
+
+
+
+
+
+ 330 for (int64_t& coeff : coefficients_) coeff *= factor;
+
+
+
+
+
+ 336 for (
int i = 0; i < variables_.size(); ++i) {
+ 337 const int64_t coeff = coefficients_[i];
+ 338 const std::string var_string =
proto ==
nullptr
+ 339 ? absl::StrCat(
"V", variables_[i])
+
+
+
+ 343 absl::StrAppend(&result, var_string);
+ 344 }
else if (coeff == -1) {
+ 345 absl::StrAppend(&result,
"-", var_string);
+ 346 }
else if (coeff != 0) {
+ 347 absl::StrAppend(&result, coeff,
" * ", var_string);
+
+ 349 }
else if (coeff == 1) {
+ 350 absl::StrAppend(&result,
" + ", var_string);
+ 351 }
else if (coeff > 0) {
+ 352 absl::StrAppend(&result,
" + ", coeff,
" * ", var_string);
+ 353 }
else if (coeff == -1) {
+ 354 absl::StrAppend(&result,
" - ", var_string);
+ 355 }
else if (coeff < 0) {
+ 356 absl::StrAppend(&result,
" - ", -coeff,
" * ", var_string);
+
+
+
+ 360 if (constant_ != 0) {
+ 361 if (variables_.empty()) {
+ 362 return absl::StrCat(constant_);
+ 363 }
else if (constant_ > 0) {
+ 364 absl::StrAppend(&result,
" + ", constant_);
+
+ 366 absl::StrAppend(&result,
" - ", -constant_);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
- 392 absl::Span<const double> coeffs) {
- 393 CHECK_EQ(vars.size(), coeffs.size());
+
+
+
+
+
+
+
+
+
+
+
- 395 for (
int i = 0; i < vars.size(); ++i) {
- 396 result.
AddTerm(vars[i], coeffs[i]);
+
+
-
- 402 absl::Span<const double> coeffs) {
- 403 CHECK_EQ(vars.size(), coeffs.size());
-
- 405 for (
int i = 0; i < vars.size(); ++i) {
- 406 result.
AddTerm(vars[i], coeffs[i]);
-
-
-
-
-
- 412 absl::Span<const double> coeffs) {
- 413 CHECK_EQ(vars.size(), coeffs.size());
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 443 constant_ += expr.constant_;
- 444 variables_.insert(variables_.end(), expr.variables_.begin(),
- 445 expr.variables_.end());
- 446 coefficients_.insert(coefficients_.end(), expr.coefficients_.begin(),
- 447 expr.coefficients_.end());
-
-
-
-
- 452 variables_.push_back(
var.index_);
- 453 coefficients_.push_back(coeff);
-
-
-
-
-
-
- 460 variables_.push_back(
index);
- 461 coefficients_.push_back(coeff);
-
-
- 464 coefficients_.push_back(-coeff);
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+ 410 absl::Span<const double> coeffs) {
+ 411 CHECK_EQ(vars.size(), coeffs.size());
+
+ 413 for (
int i = 0; i < vars.size(); ++i) {
+ 414 result.
AddTerm(vars[i], coeffs[i]);
+
+
+
+
+
+ 420 absl::Span<const double> coeffs) {
+ 421 CHECK_EQ(vars.size(), coeffs.size());
+
+ 423 for (
int i = 0; i < vars.size(); ++i) {
+ 424 result.
AddTerm(vars[i], coeffs[i]);
+
+
+
+
+
+ 430 absl::Span<const double> coeffs) {
+ 431 CHECK_EQ(vars.size(), coeffs.size());
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 461 constant_ += expr.constant_;
+ 462 variables_.insert(variables_.end(), expr.variables_.begin(),
+ 463 expr.variables_.end());
+ 464 coefficients_.insert(coefficients_.end(), expr.coefficients_.begin(),
+ 465 expr.coefficients_.end());
+
+
+
+
+ 470 variables_.push_back(
var.index_);
+ 471 coefficients_.push_back(coeff);
-
-
-
-
-
-
- 481 constant_ -= expr.constant_;
- 482 variables_.insert(variables_.end(), expr.variables_.begin(),
- 483 expr.variables_.end());
-
- 485 coefficients_.push_back(-coeff);
-
-
-
-
-
-
- 492 for (
double& c : coefficients_) {
-
-
+
+
+
+ 478 variables_.push_back(
index);
+ 479 coefficients_.push_back(coeff);
+
+
+ 482 coefficients_.push_back(-coeff);
+
+
+
+
+
+
+
+
+
+
+
+
-
-
- 500 for (
int i = 0; i < variables_.size(); ++i) {
- 501 const double coeff = coefficients_[i];
- 502 const std::string var_string =
proto ==
nullptr
- 503 ? absl::StrCat(
"V", variables_[i])
-
-
-
- 507 absl::StrAppend(&result, var_string);
- 508 }
else if (coeff == -1.0) {
- 509 absl::StrAppend(&result,
"-", var_string);
- 510 }
else if (coeff != 0.0) {
- 511 absl::StrAppend(&result, coeff,
" * ", var_string);
-
- 513 }
else if (coeff == 1.0) {
- 514 absl::StrAppend(&result,
" + ", var_string);
- 515 }
else if (coeff > 0.0) {
- 516 absl::StrAppend(&result,
" + ", coeff,
" * ", var_string);
- 517 }
else if (coeff == -1.0) {
- 518 absl::StrAppend(&result,
" - ", var_string);
- 519 }
else if (coeff < 0.0) {
- 520 absl::StrAppend(&result,
" - ", -coeff,
" * ", var_string);
-
-
-
- 524 if (constant_ != 0.0) {
- 525 if (variables_.empty()) {
- 526 return absl::StrCat(constant_);
- 527 }
else if (constant_ > 0.0) {
- 528 absl::StrAppend(&result,
" + ", constant_);
-
- 530 absl::StrAppend(&result,
" - ", -constant_);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+ 499 constant_ -= expr.constant_;
+ 500 variables_.insert(variables_.end(), expr.variables_.begin(),
+ 501 expr.variables_.end());
+
+ 503 coefficients_.push_back(-coeff);
+
+
+
+
+
+
+ 510 for (
double& c : coefficients_) {
+
+
+
+
+
+
+
+ 518 for (
int i = 0; i < variables_.size(); ++i) {
+ 519 const double coeff = coefficients_[i];
+ 520 const std::string var_string =
proto ==
nullptr
+ 521 ? absl::StrCat(
"V", variables_[i])
+
+
+
+ 525 absl::StrAppend(&result, var_string);
+ 526 }
else if (coeff == -1.0) {
+ 527 absl::StrAppend(&result,
"-", var_string);
+ 528 }
else if (coeff != 0.0) {
+ 529 absl::StrAppend(&result, coeff,
" * ", var_string);
+
+ 531 }
else if (coeff == 1.0) {
+ 532 absl::StrAppend(&result,
" + ", var_string);
+ 533 }
else if (coeff > 0.0) {
+ 534 absl::StrAppend(&result,
" + ", coeff,
" * ", var_string);
+ 535 }
else if (coeff == -1.0) {
+ 536 absl::StrAppend(&result,
" - ", var_string);
+ 537 }
else if (coeff < 0.0) {
+ 538 absl::StrAppend(&result,
" - ", -coeff,
" * ", var_string);
+
+
+
+ 542 if (constant_ != 0.0) {
+ 543 if (variables_.empty()) {
+ 544 return absl::StrCat(constant_);
+ 545 }
else if (constant_ > 0.0) {
+ 546 absl::StrAppend(&result,
" + ", constant_);
+
+ 548 absl::StrAppend(&result,
" - ", -constant_);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
-
-
-
-
-
-
-
-
- 576 for (
const int64_t t : tuple) {
-
-
-
-
-
-
-
-
-
-
- 587 builder_->LinearExprToProto(
time);
-
-
- 590 builder_->IndexFromConstant(1));
-
-
-
- 594 int64_t level_change,
-
-
- 597 builder_->LinearExprToProto(
time);
-
-
-
-
-
- 603 int64_t transition_label) {
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 622 builder_->LinearExprToProto(
demand);
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 594 for (
const int64_t t : tuple) {
+
+
+
+
+
+
+
+
+
+
+ 605 builder_->LinearExprToProto(
time);
+
+
+ 608 builder_->IndexFromConstant(1));
+
+
+
+ 612 int64_t level_change,
+
+
+ 615 builder_->LinearExprToProto(
time);
+
+
+
+
+
+ 621 int64_t transition_label) {
+
+
+
+
-
- 628 : builder_(builder), index_(
index) {}
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 640 builder_->LinearExprToProto(
demand);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 661 if (ct_proto.
name().empty()) {
- 662 absl::StrAppend(&output,
"IntervalVar", index_,
"(");
-
- 664 absl::StrAppend(&output, ct_proto.
name(),
"(");
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+ 646 : builder_(builder), index_(
index) {}
+
+
+ 649 DCHECK(builder_ !=
nullptr);
+ 650 if (builder_ ==
nullptr)
return *
this;
+
+
+
+
+
+ 656 DCHECK(builder_ !=
nullptr);
+
+
+
+
+
+
+ 663 DCHECK(builder_ !=
nullptr);
+
+
+
+
+
+
+ 670 DCHECK(builder_ !=
nullptr);
+
+
+
+
+
+
+ 677 DCHECK(builder_ !=
nullptr);
+ 678 if (builder_ ==
nullptr)
return BoolVar();
+
+
-
-
-
+
+ 684 if (builder_ ==
nullptr)
return "null";
+
-
-
-
-
- 692int CpModelBuilder::IndexFromConstant(int64_t
value) {
- 693 if (!constant_to_index_map_.contains(
value)) {
-
-
-
-
-
+
+ 689 if (builder_ ==
nullptr)
return "null";
+
+
+
+
+
+ 695 if (ct_proto.
name().empty()) {
+ 696 absl::StrAppend(&output,
"IntervalVar", index_,
"(");
+
+ 698 absl::StrAppend(&output, ct_proto.
name(),
"(");
- 700 return constant_to_index_map_[
value];
-
-
- 703int CpModelBuilder::GetOrCreateIntegerIndex(
int index) {
-
-
-
- 707 if (!bool_to_integer_index_map_.contains(
index)) {
-
- 709 const IntegerVariableProto& old_var = cp_model_.
variables(
var);
-
- 711 IntegerVariableProto*
const new_var = cp_model_.
add_variables();
-
- 713 new_var->add_domain(1);
- 714 if (!old_var.name().empty()) {
- 715 new_var->set_name(absl::StrCat(
"Not(", old_var.name(),
")"));
-
-
- 718 bool_to_integer_index_map_[
index] = new_index;
-
-
- 721 return bool_to_integer_index_map_[
index];
-
-
-
-
-
- 727 for (
const auto&
interval : domain) {
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 716int CpModelBuilder::IndexFromConstant(int64_t
value) {
+ 717 if (!constant_to_index_map_.contains(
value)) {
+
+
+
+
+
+
+ 724 return constant_to_index_map_[
value];
+
+
+ 727int CpModelBuilder::GetOrCreateIntegerIndex(
int index) {
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 747 return BoolVar(IndexFromConstant(1),
this);
-
-
-
- 751 return BoolVar(IndexFromConstant(0),
this);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 774 ct->add_enforcement_literal(presence.index_);
-
- 776 *
interval->mutable_start() = LinearExprToProto(start);
- 777 *
interval->mutable_size() = LinearExprToProto(size);
- 778 *
interval->mutable_end() = LinearExprToProto(end);
-
-
-
-
-
-
-
- 786 ct->add_enforcement_literal(presence.index_);
-
- 788 *
interval->mutable_start() = LinearExprToProto(start);
- 789 interval->mutable_size()->set_offset(size);
- 790 *
interval->mutable_end() = LinearExprToProto(start);
-
-
-
-
-
-
- 797 for (
const BoolVar& lit : literals) {
- 798 proto->mutable_bool_or()->add_literals(lit.index_);
-
-
-
-
-
-
- 805 for (
const BoolVar& lit : literals) {
- 806 proto->mutable_bool_and()->add_literals(lit.index_);
-
-
-
-
-
-
- 813 for (
const BoolVar& lit : literals) {
- 814 proto->mutable_bool_xor()->add_literals(lit.index_);
-
-
+ 731 if (!bool_to_integer_index_map_.contains(
index)) {
+
+ 733 const IntegerVariableProto& old_var = cp_model_.
variables(
var);
+
+ 735 IntegerVariableProto*
const new_var = cp_model_.
add_variables();
+
+ 737 new_var->add_domain(1);
+ 738 if (!old_var.name().empty()) {
+ 739 new_var->set_name(absl::StrCat(
"Not(", old_var.name(),
")"));
+
+
+ 742 bool_to_integer_index_map_[
index] = new_index;
+
+
+ 745 return bool_to_integer_index_map_[
index];
+
+
+
+
+
+ 751 for (
const auto&
interval : domain) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 771 return BoolVar(IndexFromConstant(1),
this);
+
+
+
+ 775 return BoolVar(IndexFromConstant(0),
this);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 798 ct->add_enforcement_literal(presence.index_);
+
+ 800 *
interval->mutable_start() = LinearExprToProto(start);
+ 801 *
interval->mutable_size() = LinearExprToProto(size);
+ 802 *
interval->mutable_end() = LinearExprToProto(end);
+
+
+
+
+
+
+
+ 810 ct->add_enforcement_literal(presence.index_);
+
+ 812 *
interval->mutable_start() = LinearExprToProto(start);
+ 813 interval->mutable_size()->set_offset(size);
+ 814 *
interval->mutable_end() = LinearExprToProto(start);
+
+
- 819void CpModelBuilder::FillLinearTerms(
const LinearExpr& left,
-
-
-
-
-
-
- 826 proto->add_coeffs(coeff);
-
-
-
-
-
- 832 proto->add_coeffs(-coeff);
-
-
-
-
-
-
- 839 FillLinearTerms(left, right,
proto->mutable_linear());
-
- 841 proto->mutable_linear()->add_domain(rhs);
- 842 proto->mutable_linear()->add_domain(rhs);
-
-
-
-
-
-
- 849 FillLinearTerms(left, right,
proto->mutable_linear());
-
- 851 proto->mutable_linear()->add_domain(rhs);
-
-
-
-
-
-
-
- 859 FillLinearTerms(left, right,
proto->mutable_linear());
-
-
- 862 proto->mutable_linear()->add_domain(rhs);
-
-
-
-
-
-
- 869 FillLinearTerms(left, right,
proto->mutable_linear());
-
- 871 proto->mutable_linear()->add_domain(rhs + 1);
-
-
-
-
-
-
-
- 879 FillLinearTerms(left, right,
proto->mutable_linear());
-
-
- 882 proto->mutable_linear()->add_domain(rhs - 1);
-
-
-
-
-
-
-
- 890 proto->mutable_linear()->add_vars(x);
-
-
- 893 proto->mutable_linear()->add_coeffs(coeff);
-
- 895 const int64_t cst = expr.
constant();
- 896 for (
const auto& i : domain) {
- 897 proto->mutable_linear()->add_domain(i.start - cst);
- 898 proto->mutable_linear()->add_domain(i.end - cst);
-
-
-
-
-
-
-
- 906 FillLinearTerms(left, right,
proto->mutable_linear());
-
-
- 909 proto->mutable_linear()->add_domain(rhs - 1);
- 910 proto->mutable_linear()->add_domain(rhs + 1);
-
-
-
-
-
-
-
- 918 auto* expr =
proto->mutable_all_diff()->add_exprs();
- 919 expr->add_vars(
var.index_);
-
-
-
-
-
-
-
-
- 928 *
proto->mutable_all_diff()->add_exprs() = LinearExprToProto(expr);
-
-
-
-
-
- 934 std::initializer_list<LinearExpr> exprs) {
-
-
- 937 *
proto->mutable_all_diff()->add_exprs() = LinearExprToProto(expr);
-
-
-
-
-
-
-
- 945 proto->mutable_element()->set_index(
index.index_);
- 946 proto->mutable_element()->set_target(target.index_);
-
- 948 proto->mutable_element()->add_vars(
var.index_);
-
-
-
-
-
- 954 absl::Span<const int64_t> values,
-
-
- 957 proto->mutable_element()->set_index(
index.index_);
- 958 proto->mutable_element()->set_target(target.index_);
- 959 for (int64_t
value : values) {
- 960 proto->mutable_element()->add_vars(IndexFromConstant(
value));
-
-
-
-
-
-
-
-
-
-
-
-
-
- 974 absl::Span<const IntVar> vars) {
-
-
- 977 proto->mutable_table()->add_vars(
var.index_);
-
-
-
-
-
- 983 absl::Span<const IntVar> vars) {
-
-
- 986 proto->mutable_table()->add_vars(
var.index_);
-
- 988 proto->mutable_table()->set_negated(
true);
-
-
-
-
- 993 absl::Span<const IntVar> variables,
- 994 absl::Span<const IntVar> inverse_variables) {
-
-
- 997 proto->mutable_inverse()->add_f_direct(
var.index_);
-
- 999 for (
const IntVar&
var : inverse_variables) {
- 1000 proto->mutable_inverse()->add_f_inverse(
var.index_);
-
-
-
-
-
- 1006 int64_t max_level) {
-
- 1008 proto->mutable_reservoir()->set_min_level(min_level);
- 1009 proto->mutable_reservoir()->set_max_level(max_level);
-
-
-
-
- 1014 absl::Span<const IntVar> transition_variables,
int starting_state,
- 1015 absl::Span<const int> final_states) {
-
- 1017 for (
const IntVar&
var : transition_variables) {
- 1018 proto->mutable_automaton()->add_vars(
var.index_);
-
- 1020 proto->mutable_automaton()->set_starting_state(starting_state);
- 1021 for (
const int final_state : final_states) {
- 1022 proto->mutable_automaton()->add_final_states(final_state);
-
-
-
-
-
-
-
-
-
-
- 1033 const int64_t mult = negate ? -1 : 1;
-
-
-
-
-
-
-
-
- 1042 absl::Span<const IntVar> vars) {
-
- 1044 *
ct->mutable_lin_max()->mutable_target() =
- 1045 LinearExprToProto(target,
true);
-
- 1047 *
ct->mutable_lin_max()->add_exprs() =
- 1048 LinearExprToProto(
var,
true);
-
-
-
-
-
- 1054 absl::Span<const LinearExpr> exprs) {
-
- 1056 *
ct->mutable_lin_max()->mutable_target() =
- 1057 LinearExprToProto(target,
true);
-
- 1059 *
ct->mutable_lin_max()->add_exprs() =
- 1060 LinearExprToProto(expr,
true);
-
-
+
+
+ 821 for (
const BoolVar& lit : literals) {
+ 822 proto->mutable_bool_or()->add_literals(lit.index_);
+
+
+
+
+
+
+ 829 for (
const BoolVar& lit : literals) {
+ 830 proto->mutable_bool_and()->add_literals(lit.index_);
+
+
+
+
+
+
+ 837 for (
const BoolVar& lit : literals) {
+ 838 proto->mutable_bool_xor()->add_literals(lit.index_);
+
+
+
+
+ 843void CpModelBuilder::FillLinearTerms(
const LinearExpr& left,
+
+
+
+
+
+
+ 850 proto->add_coeffs(coeff);
+
+
+
+
+
+ 856 proto->add_coeffs(-coeff);
+
+
+
+
+
+
+ 863 FillLinearTerms(left, right,
proto->mutable_linear());
+
+ 865 proto->mutable_linear()->add_domain(rhs);
+ 866 proto->mutable_linear()->add_domain(rhs);
+
+
+
+
+
+
+ 873 FillLinearTerms(left, right,
proto->mutable_linear());
+
+ 875 proto->mutable_linear()->add_domain(rhs);
+
+
+
+
+
+
+
+ 883 FillLinearTerms(left, right,
proto->mutable_linear());
+
+
+ 886 proto->mutable_linear()->add_domain(rhs);
+
+
+
+
+
+
+ 893 FillLinearTerms(left, right,
proto->mutable_linear());
+
+ 895 proto->mutable_linear()->add_domain(rhs + 1);
+
+
+
+
+
+
+
+ 903 FillLinearTerms(left, right,
proto->mutable_linear());
+
+
+ 906 proto->mutable_linear()->add_domain(rhs - 1);
+
+
+
+
+
+
+
+ 914 proto->mutable_linear()->add_vars(x);
+
+
+ 917 proto->mutable_linear()->add_coeffs(coeff);
+
+ 919 const int64_t cst = expr.
constant();
+ 920 for (
const auto& i : domain) {
+ 921 proto->mutable_linear()->add_domain(i.start - cst);
+ 922 proto->mutable_linear()->add_domain(i.end - cst);
+
+
+
+
+
+
+
+ 930 FillLinearTerms(left, right,
proto->mutable_linear());
+
+
+ 933 proto->mutable_linear()->add_domain(rhs - 1);
+ 934 proto->mutable_linear()->add_domain(rhs + 1);
+
+
+
+
+
+
+
+ 942 auto* expr =
proto->mutable_all_diff()->add_exprs();
+ 943 expr->add_vars(
var.index_);
+
+
+
+
+
+
+
+
+ 952 *
proto->mutable_all_diff()->add_exprs() = LinearExprToProto(expr);
+
+
+
+
+
+ 958 std::initializer_list<LinearExpr> exprs) {
+
+
+ 961 *
proto->mutable_all_diff()->add_exprs() = LinearExprToProto(expr);
+
+
+
+
+
+
+
+ 969 proto->mutable_element()->set_index(
index.index_);
+ 970 proto->mutable_element()->set_target(target.index_);
+
+ 972 proto->mutable_element()->add_vars(
var.index_);
+
+
+
+
+
+ 978 absl::Span<const int64_t> values,
+
+
+ 981 proto->mutable_element()->set_index(
index.index_);
+ 982 proto->mutable_element()->set_target(target.index_);
+ 983 for (int64_t
value : values) {
+ 984 proto->mutable_element()->add_vars(IndexFromConstant(
value));
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 998 absl::Span<const IntVar> vars) {
+
+
+ 1001 proto->mutable_table()->add_vars(
var.index_);
+
+
+
+
+
+ 1007 absl::Span<const IntVar> vars) {
+
+
+ 1010 proto->mutable_table()->add_vars(
var.index_);
+
+ 1012 proto->mutable_table()->set_negated(
true);
+
+
+
+
+ 1017 absl::Span<const IntVar> variables,
+ 1018 absl::Span<const IntVar> inverse_variables) {
+
+
+ 1021 proto->mutable_inverse()->add_f_direct(
var.index_);
+
+ 1023 for (
const IntVar&
var : inverse_variables) {
+ 1024 proto->mutable_inverse()->add_f_inverse(
var.index_);
+
+
+
+
+
+ 1030 int64_t max_level) {
+
+ 1032 proto->mutable_reservoir()->set_min_level(min_level);
+ 1033 proto->mutable_reservoir()->set_max_level(max_level);
+
+
+
+
+ 1038 absl::Span<const IntVar> transition_variables,
int starting_state,
+ 1039 absl::Span<const int> final_states) {
+
+ 1041 for (
const IntVar&
var : transition_variables) {
+ 1042 proto->mutable_automaton()->add_vars(
var.index_);
+
+ 1044 proto->mutable_automaton()->set_starting_state(starting_state);
+ 1045 for (
const int final_state : final_states) {
+ 1046 proto->mutable_automaton()->add_final_states(final_state);
+
+
+
+
+
+
+
+
+
+
+ 1057 const int64_t mult = negate ? -1 : 1;
+
+
+
+
+
-
- 1066 const LinearExpr& target, std::initializer_list<LinearExpr> exprs) {
+
+ 1066 absl::Span<const IntVar> vars) {
1068 *
ct->mutable_lin_max()->mutable_target() =
1069 LinearExprToProto(target,
true);
-
+
1071 *
ct->mutable_lin_max()->add_exprs() =
- 1072 LinearExprToProto(expr,
true);
+ 1072 LinearExprToProto(
var,
true);
-
- 1078 absl::Span<const IntVar> vars) {
+
+ 1078 absl::Span<const LinearExpr> exprs) {
- 1080 *
ct->mutable_lin_max()->mutable_target() = LinearExprToProto(target);
-
- 1082 *
ct->mutable_lin_max()->add_exprs() = LinearExprToProto(
var);
-
-
-
-
-
- 1088 absl::Span<const LinearExpr> exprs) {
-
- 1090 *
ct->mutable_lin_max()->mutable_target() = LinearExprToProto(target);
-
- 1092 *
ct->mutable_lin_max()->add_exprs() = LinearExprToProto(expr);
-
-
-
-
-
- 1098 const LinearExpr& target, std::initializer_list<LinearExpr> exprs) {
-
- 1100 *
ct->mutable_lin_max()->mutable_target() = LinearExprToProto(target);
-
- 1102 *
ct->mutable_lin_max()->add_exprs() = LinearExprToProto(expr);
-
-
-
-
-
-
-
-
- 1111 *
proto->mutable_int_div()->mutable_target() = LinearExprToProto(target);
- 1112 *
proto->mutable_int_div()->add_exprs() = LinearExprToProto(numerator);
- 1113 *
proto->mutable_int_div()->add_exprs() = LinearExprToProto(denominator);
-
-
-
-
-
-
- 1120 *
proto->mutable_lin_max()->mutable_target() = LinearExprToProto(target);
- 1121 *
proto->mutable_lin_max()->add_exprs() = LinearExprToProto(expr);
- 1122 *
proto->mutable_lin_max()->add_exprs() =
- 1123 LinearExprToProto(expr,
true);
-
-
-
-
-
-
-
- 1131 *
proto->mutable_int_mod()->mutable_target() = LinearExprToProto(target);
- 1132 *
proto->mutable_int_mod()->add_exprs() = LinearExprToProto(
var);
- 1133 *
proto->mutable_int_mod()->add_exprs() = LinearExprToProto(mod);
-
-
-
-
- 1138 const LinearExpr& target, absl::Span<const IntVar> vars) {
-
- 1140 *
proto->mutable_int_prod()->mutable_target() = LinearExprToProto(target);
-
- 1142 *
proto->mutable_int_prod()->add_exprs() = LinearExprToProto(
var);
-
-
-
-
-
- 1148 const LinearExpr& target, absl::Span<const LinearExpr> exprs) {
-
- 1150 *
proto->mutable_int_prod()->mutable_target() = LinearExprToProto(target);
-
- 1152 *
proto->mutable_int_prod()->add_exprs() = LinearExprToProto(expr);
-
-
-
-
-
- 1158 const LinearExpr& target, std::initializer_list<LinearExpr> exprs) {
-
- 1160 *
proto->mutable_int_prod()->mutable_target() = LinearExprToProto(target);
-
- 1162 *
proto->mutable_int_prod()->add_exprs() = LinearExprToProto(expr);
-
-
-
-
-
-
-
- 1170 proto->mutable_no_overlap()->add_intervals(
var.index_);
-
-
-
-
-
-
-
-
-
-
- 1181 *
proto->mutable_cumulative()->mutable_capacity() =
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1214 for (
int i = 0; i < expr.
variables().size(); ++i) {
-
-
-
+ 1080 *
ct->mutable_lin_max()->mutable_target() =
+ 1081 LinearExprToProto(target,
true);
+
+ 1083 *
ct->mutable_lin_max()->add_exprs() =
+ 1084 LinearExprToProto(expr,
true);
+
+
+
+
+
+ 1090 const LinearExpr& target, std::initializer_list<LinearExpr> exprs) {
+
+ 1092 *
ct->mutable_lin_max()->mutable_target() =
+ 1093 LinearExprToProto(target,
true);
+
+ 1095 *
ct->mutable_lin_max()->add_exprs() =
+ 1096 LinearExprToProto(expr,
true);
+
+
+
+
+
+ 1102 absl::Span<const IntVar> vars) {
+
+ 1104 *
ct->mutable_lin_max()->mutable_target() = LinearExprToProto(target);
+
+ 1106 *
ct->mutable_lin_max()->add_exprs() = LinearExprToProto(
var);
+
+
+
+
+
+ 1112 absl::Span<const LinearExpr> exprs) {
+
+ 1114 *
ct->mutable_lin_max()->mutable_target() = LinearExprToProto(target);
+
+ 1116 *
ct->mutable_lin_max()->add_exprs() = LinearExprToProto(expr);
+
+
+
+
+
+ 1122 const LinearExpr& target, std::initializer_list<LinearExpr> exprs) {
+
+ 1124 *
ct->mutable_lin_max()->mutable_target() = LinearExprToProto(target);
+
+ 1126 *
ct->mutable_lin_max()->add_exprs() = LinearExprToProto(expr);
+
+
+
+
+
+
+
+
+ 1135 *
proto->mutable_int_div()->mutable_target() = LinearExprToProto(target);
+ 1136 *
proto->mutable_int_div()->add_exprs() = LinearExprToProto(numerator);
+ 1137 *
proto->mutable_int_div()->add_exprs() = LinearExprToProto(denominator);
+
+
+
+
+
+
+ 1144 *
proto->mutable_lin_max()->mutable_target() = LinearExprToProto(target);
+ 1145 *
proto->mutable_lin_max()->add_exprs() = LinearExprToProto(expr);
+ 1146 *
proto->mutable_lin_max()->add_exprs() =
+ 1147 LinearExprToProto(expr,
true);
+
+
+
+
+
+
+
+ 1155 *
proto->mutable_int_mod()->mutable_target() = LinearExprToProto(target);
+ 1156 *
proto->mutable_int_mod()->add_exprs() = LinearExprToProto(
var);
+ 1157 *
proto->mutable_int_mod()->add_exprs() = LinearExprToProto(mod);
+
+
+
+
+ 1162 const LinearExpr& target, absl::Span<const IntVar> vars) {
+
+ 1164 *
proto->mutable_int_prod()->mutable_target() = LinearExprToProto(target);
+
+ 1166 *
proto->mutable_int_prod()->add_exprs() = LinearExprToProto(
var);
+
+
+
+
+
+ 1172 const LinearExpr& target, absl::Span<const LinearExpr> exprs) {
+
+ 1174 *
proto->mutable_int_prod()->mutable_target() = LinearExprToProto(target);
+
+ 1176 *
proto->mutable_int_prod()->add_exprs() = LinearExprToProto(expr);
+
+
+
+
+
+ 1182 const LinearExpr& target, std::initializer_list<LinearExpr> exprs) {
+
+ 1184 *
proto->mutable_int_prod()->mutable_target() = LinearExprToProto(target);
+
+ 1186 *
proto->mutable_int_prod()->add_exprs() = LinearExprToProto(expr);
+
+
+
+
+
+
+
+ 1194 proto->mutable_no_overlap()->add_intervals(
var.index_);
+
+
+
+
+
+
+
+
+
+
+ 1205 *
proto->mutable_cumulative()->mutable_capacity() =
+
+
+
+
+
+
+
+
+
+
+
+
-
-
-
-
-
-
-
- 1226 for (
int i = 0; i < expr.
variables().size(); ++i) {
-
-
-
+
+
+
+
+
+
+
+
+
+
+
-
-
+
+
-
- 1236 absl::Span<const IntVar> variables,
-
-
-
-
-
+
+
+
+ 1238 for (
int i = 0; i < expr.
variables().size(); ++i) {
+
+
+
- 1243 proto->set_variable_selection_strategy(var_strategy);
- 1244 proto->set_domain_reduction_strategy(domain_strategy);
+
+
-
- 1248 absl::Span<const BoolVar> variables,
-
-
-
-
-
+
+
+
+ 1250 for (
int i = 0; i < expr.
variables().size(); ++i) {
+
+
+
- 1255 proto->set_variable_selection_strategy(var_strategy);
- 1256 proto->set_domain_reduction_strategy(domain_strategy);
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1273 for (
const BoolVar& lit : literals) {
-
-
-
-
-
-
-
-
-
-
-
- 1285 constant_to_index_map_.clear();
-
-
- 1288 if (
var.domain_size() == 2 &&
var.domain(0) ==
var.domain(1)) {
- 1289 constant_to_index_map_[
var.domain(0)] = i;
-
-
-
- 1293 bool_to_integer_index_map_.clear();
-
-
-
-
-
-
-
- 1301 <<
"CpModelBuilder::GetBoolVarFromProtoIndex: The domain of the variable "
-
-
- 1304 <<
"CpModelBuilder::GetBoolVarFromProtoIndex: The domain of the variable "
-
-
- 1307 <<
"CpModelBuilder::GetBoolVarFromProtoIndex: The domain of the variable "
-
-
+
+ 1260 absl::Span<const IntVar> variables,
+
+
+
+
+
+
+ 1267 proto->set_variable_selection_strategy(var_strategy);
+ 1268 proto->set_domain_reduction_strategy(domain_strategy);
+
+
+
+ 1272 absl::Span<const BoolVar> variables,
+
+
+
+
+
+
+ 1279 proto->set_variable_selection_strategy(var_strategy);
+ 1280 proto->set_domain_reduction_strategy(domain_strategy);
+
+
+
+
+
+
+
+
+ 1289 if (
var.index_ >= 0) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1307 for (
const BoolVar& lit : literals) {
+
+
-
-
-
-
-
-
-
-
-
-
-
- 1323 <<
"CpModelBuilder::GetIntervalVarFromProtoIndex: the referenced "
- 1324 "object is not an interval variable";
-
-
-
-
-
-
- 1331 const std::vector<int>& variables = expr.
variables();
-
- 1333 for (
int i = 0; i < variables.size(); ++i) {
-
-
-
-
-
-
- 1340 const int ref = x.index_;
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+ 1319 constant_to_index_map_.clear();
+
+
+ 1322 if (
var.domain_size() == 2 &&
var.domain(0) ==
var.domain(1)) {
+ 1323 constant_to_index_map_[
var.domain(0)] = i;
+
+
+
+ 1327 bool_to_integer_index_map_.clear();
+
+
+
+
+
+
+
+ 1335 <<
"CpModelBuilder::GetBoolVarFromProtoIndex: The domain of the variable "
+
+
+ 1338 <<
"CpModelBuilder::GetBoolVarFromProtoIndex: The domain of the variable "
+
+
+ 1341 <<
"CpModelBuilder::GetBoolVarFromProtoIndex: The domain of the variable "
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1357 <<
"CpModelBuilder::GetIntervalVarFromProtoIndex: the referenced "
+ 1358 "object is not an interval variable";
+
+
+
+
+
+
+ 1365 const std::vector<int>& variables = expr.
variables();
+
+ 1367 for (
int i = 0; i < variables.size(); ++i) {
+
+
+
+
+
+
+ 1374 const int ref = x.index_;
+
+
+
+
+
+
+
+
+
+#define DCHECK_LE(val1, val2)
#define CHECK_LT(val1, val2)
#define CHECK_EQ(val1, val2)
#define CHECK_GE(val1, val2)
#define DCHECK_GE(val1, val2)
#define DCHECK(condition)
#define CHECK_LE(val1, val2)
#define DCHECK_EQ(val1, val2)
We call domain any subset of Int64 = [kint64min, kint64max].
Specialized automaton constraint.
void AddTransition(int tail, int head, int64_t transition_label)
Adds a transitions to the automaton.
Specialized automaton constraint.
void AddTransition(int tail, int head, int64_t transition_label)
Adds a transitions to the automaton.
void add_transition_tail(int64_t value)
void add_transition_head(int64_t value)
void add_transition_label(int64_t value)
std::string Name() const
Returns the name of the variable.
std::string Name() const
Returns the name of the variable.
BoolVar WithName(const std::string &name)
Sets the name of the variable.
std::string DebugString() const
Debug string.
BoolVar Not() const
Returns the logical negation of the current Boolean variable.
Specialized circuit constraint.
void AddArc(int tail, int head, BoolVar literal)
Add an arc to the circuit.
std::string DebugString() const
BoolVar()
A default constructed BoolVar can be used to mean not defined yet.
BoolVar Not() const
Returns the logical negation of the current Boolean variable.
Specialized circuit constraint.
void AddArc(int tail, int head, BoolVar literal)
Add an arc to the circuit.
void add_literals(int32_t value)
void add_heads(int32_t value)
void add_tails(int32_t value)
Constraint OnlyEnforceIf(absl::Span< const BoolVar > literals)
The constraint will be enforced iff all literals listed here are true.
Constraint WithName(const std::string &name)
Sets the name of the constraint.
const std::string & Name() const
Returns the name of the constraint (or the empty string if not set).
Constraint(ConstraintProto *proto)
Constraint OnlyEnforceIf(absl::Span< const BoolVar > literals)
The constraint will be enforced iff all literals listed here are true.
Constraint WithName(const std::string &name)
Sets the name of the constraint.
const std::string & Name() const
Returns the name of the constraint (or the empty string if not set).
Constraint(ConstraintProto *proto)
::operations_research::sat::IntervalConstraintProto * mutable_interval()
::operations_research::sat::NoOverlap2DConstraintProto * mutable_no_overlap_2d()
::operations_research::sat::TableConstraintProto * mutable_table()
const std::string & name() const
::operations_research::sat::CumulativeConstraintProto * mutable_cumulative()
::operations_research::sat::CircuitConstraintProto * mutable_circuit()
::operations_research::sat::ReservoirConstraintProto * mutable_reservoir()
Wrapper class around the cp_model proto.
void AddHint(IntVar var, int64_t value)
Adds hinting to a variable.
TableConstraint AddForbiddenAssignments(absl::Span< const IntVar > vars)
Adds an forbidden assignments constraint.
Constraint AddMinEquality(const LinearExpr &target, absl::Span< const IntVar > vars)
Adds target == min(vars).
Constraint AddLinearConstraint(const LinearExpr &expr, const Domain &domain)
Adds expr in domain.
void ClearAssumptions()
Remove all assumptions from the model.
Constraint AddAbsEquality(const LinearExpr &target, const LinearExpr &expr)
Adds target == abs(expr).
void AddAssumptions(absl::Span< const BoolVar > literals)
Adds multiple literals to the model as assumptions.
IntervalVar NewFixedSizeIntervalVar(const LinearExpr &start, int64_t size)
Creates an interval variable with a fixed size.
MultipleCircuitConstraint AddMultipleCircuitConstraint()
Adds a multiple circuit constraint, aka the "VRP" (Vehicle Routing Problem) constraint.
BoolVar TrueVar()
Creates an always true Boolean variable.
IntVar NewIntVar(const Domain &domain)
Creates an integer variable with the given domain.
void ClearHints()
Removes all hints.
void Maximize(const LinearExpr &expr)
Adds a linear maximization objective.
BoolVar NewBoolVar()
Creates a Boolean variable.
Constraint AddMaxEquality(const LinearExpr &target, absl::Span< const IntVar > vars)
Adds target == max(vars).
Constraint AddMultiplicationEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs)
Adds target == prod(exprs).
void AddDecisionStrategy(absl::Span< const IntVar > variables, DecisionStrategyProto::VariableSelectionStrategy var_strategy, DecisionStrategyProto::DomainReductionStrategy domain_strategy)
Adds a decision strategy on a list of integer variables.
IntervalVar NewOptionalIntervalVar(const LinearExpr &start, const LinearExpr &size, const LinearExpr &end, BoolVar presence)
Creates an optional interval variable from 3 affine expressions and a Boolean variable.
CircuitConstraint AddCircuitConstraint()
Adds a circuit constraint.
Constraint AddVariableElement(IntVar index, absl::Span< const IntVar > variables, IntVar target)
Adds the element constraint: variables[index] == target.
Constraint AddGreaterThan(const LinearExpr &left, const LinearExpr &right)
Adds left > right.
void CopyFrom(const CpModelProto &model_proto)
Replaces the current model with the one from the given proto.
Constraint AddLessThan(const LinearExpr &left, const LinearExpr &right)
Adds left < right.
Constraint AddBoolXor(absl::Span< const BoolVar > literals)
Adds the constraint that an odd number of literals is true.
void SetName(const std::string &name)
Sets the name of the model.
Constraint AddElement(IntVar index, absl::Span< const int64_t > values, IntVar target)
Adds the element constraint: values[index] == target.
void AddAssumption(BoolVar lit)
Adds a literal to the model as assumptions.
void Minimize(const LinearExpr &expr)
Adds a linear minimization objective.
CpModelProto * MutableProto()
BoolVar FalseVar()
Creates an always false Boolean variable.
friend class CumulativeConstraint
Constraint AddBoolAnd(absl::Span< const BoolVar > literals)
Adds the constraint that all literals must be true.
IntervalVar GetIntervalVarFromProtoIndex(int index)
Returns the interval variable from its index in the proto.
CumulativeConstraint AddCumulative(LinearExpr capacity)
The cumulative constraint.
Constraint AddLessOrEqual(const LinearExpr &left, const LinearExpr &right)
Adds left <= right.
ReservoirConstraint AddReservoirConstraint(int64_t min_level, int64_t max_level)
Adds a reservoir constraint with optional refill/emptying events.
Constraint AddEquality(const LinearExpr &left, const LinearExpr &right)
Adds left == right.
NoOverlap2DConstraint AddNoOverlap2D()
The no_overlap_2d constraint prevents a set of boxes from overlapping.
Constraint AddGreaterOrEqual(const LinearExpr &left, const LinearExpr &right)
Adds left >= right.
Constraint AddBoolOr(absl::Span< const BoolVar > literals)
Adds the constraint that at least one of the literals must be true.
IntVar GetIntVarFromProtoIndex(int index)
Returns the integer variable from its index in the proto.
AutomatonConstraint AddAutomaton(absl::Span< const IntVar > transition_variables, int starting_state, absl::Span< const int > final_states)
An automaton constraint.
IntervalVar NewOptionalFixedSizeIntervalVar(const LinearExpr &start, int64_t size, BoolVar presence)
Creates an optional interval variable with a fixed size.
Constraint AddDivisionEquality(const LinearExpr &target, const LinearExpr &numerator, const LinearExpr &denominator)
Adds target = num / denom (integer division rounded towards 0).
friend class ReservoirConstraint
BoolVar GetBoolVarFromProtoIndex(int index)
Returns the Boolean variable from its index in the proto.
Constraint AddNotEqual(const LinearExpr &left, const LinearExpr &right)
Adds left != right.
Constraint AddModuloEquality(const LinearExpr &target, const LinearExpr &var, const LinearExpr &mod)
Adds target = var % mod.
Constraint AddAllDifferent(absl::Span< const IntVar > vars)
This constraint forces all variables to have different values.
TableConstraint AddAllowedAssignments(absl::Span< const IntVar > vars)
Adds an allowed assignments constraint.
IntVar NewConstant(int64_t value)
Creates a constant variable.
IntervalVar NewIntervalVar(const LinearExpr &start, const LinearExpr &size, const LinearExpr &end)
Creates an interval variable from 3 affine expressions.
Constraint AddInverseConstraint(absl::Span< const IntVar > variables, absl::Span< const IntVar > inverse_variables)
An inverse constraint.
Constraint AddNoOverlap(absl::Span< const IntervalVar > vars)
Adds a no-overlap constraint that ensures that all present intervals do not overlap in time.
const CpModelProto & Proto() const
Wrapper class around the cp_model proto.
void AddHint(IntVar var, int64_t value)
Adds hinting to a variable.
TableConstraint AddForbiddenAssignments(absl::Span< const IntVar > vars)
Adds an forbidden assignments constraint.
Constraint AddMinEquality(const LinearExpr &target, absl::Span< const IntVar > vars)
Adds target == min(vars).
Constraint AddLinearConstraint(const LinearExpr &expr, const Domain &domain)
Adds expr in domain.
void ClearAssumptions()
Remove all assumptions from the model.
Constraint AddAbsEquality(const LinearExpr &target, const LinearExpr &expr)
Adds target == abs(expr).
void AddAssumptions(absl::Span< const BoolVar > literals)
Adds multiple literals to the model as assumptions.
IntervalVar NewFixedSizeIntervalVar(const LinearExpr &start, int64_t size)
Creates an interval variable with a fixed size.
MultipleCircuitConstraint AddMultipleCircuitConstraint()
Adds a multiple circuit constraint, aka the "VRP" (Vehicle Routing Problem) constraint.
BoolVar TrueVar()
Creates an always true Boolean variable.
IntVar NewIntVar(const Domain &domain)
Creates an integer variable with the given domain.
void ClearHints()
Removes all hints.
void Maximize(const LinearExpr &expr)
Adds a linear maximization objective.
BoolVar NewBoolVar()
Creates a Boolean variable.
Constraint AddMaxEquality(const LinearExpr &target, absl::Span< const IntVar > vars)
Adds target == max(vars).
Constraint AddMultiplicationEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs)
Adds target == prod(exprs).
void AddDecisionStrategy(absl::Span< const IntVar > variables, DecisionStrategyProto::VariableSelectionStrategy var_strategy, DecisionStrategyProto::DomainReductionStrategy domain_strategy)
Adds a decision strategy on a list of integer variables.
IntervalVar NewOptionalIntervalVar(const LinearExpr &start, const LinearExpr &size, const LinearExpr &end, BoolVar presence)
Creates an optional interval variable from 3 affine expressions and a Boolean variable.
CircuitConstraint AddCircuitConstraint()
Adds a circuit constraint.
Constraint AddVariableElement(IntVar index, absl::Span< const IntVar > variables, IntVar target)
Adds the element constraint: variables[index] == target.
Constraint AddGreaterThan(const LinearExpr &left, const LinearExpr &right)
Adds left > right.
void CopyFrom(const CpModelProto &model_proto)
Replaces the current model with the one from the given proto.
Constraint AddLessThan(const LinearExpr &left, const LinearExpr &right)
Adds left < right.
Constraint AddBoolXor(absl::Span< const BoolVar > literals)
Adds the constraint that an odd number of literals is true.
void SetName(const std::string &name)
Sets the name of the model.
Constraint AddElement(IntVar index, absl::Span< const int64_t > values, IntVar target)
Adds the element constraint: values[index] == target.
void AddAssumption(BoolVar lit)
Adds a literal to the model as assumptions.
void Minimize(const LinearExpr &expr)
Adds a linear minimization objective.
CpModelProto * MutableProto()
BoolVar FalseVar()
Creates an always false Boolean variable.
friend class CumulativeConstraint
Constraint AddBoolAnd(absl::Span< const BoolVar > literals)
Adds the constraint that all literals must be true.
IntervalVar GetIntervalVarFromProtoIndex(int index)
Returns the interval variable from its index in the proto.
CumulativeConstraint AddCumulative(LinearExpr capacity)
The cumulative constraint.
Constraint AddLessOrEqual(const LinearExpr &left, const LinearExpr &right)
Adds left <= right.
ReservoirConstraint AddReservoirConstraint(int64_t min_level, int64_t max_level)
Adds a reservoir constraint with optional refill/emptying events.
Constraint AddEquality(const LinearExpr &left, const LinearExpr &right)
Adds left == right.
NoOverlap2DConstraint AddNoOverlap2D()
The no_overlap_2d constraint prevents a set of boxes from overlapping.
Constraint AddGreaterOrEqual(const LinearExpr &left, const LinearExpr &right)
Adds left >= right.
Constraint AddBoolOr(absl::Span< const BoolVar > literals)
Adds the constraint that at least one of the literals must be true.
IntVar GetIntVarFromProtoIndex(int index)
Returns the integer variable from its index in the proto.
AutomatonConstraint AddAutomaton(absl::Span< const IntVar > transition_variables, int starting_state, absl::Span< const int > final_states)
An automaton constraint.
IntervalVar NewOptionalFixedSizeIntervalVar(const LinearExpr &start, int64_t size, BoolVar presence)
Creates an optional interval variable with a fixed size.
Constraint AddDivisionEquality(const LinearExpr &target, const LinearExpr &numerator, const LinearExpr &denominator)
Adds target = num / denom (integer division rounded towards 0).
friend class ReservoirConstraint
BoolVar GetBoolVarFromProtoIndex(int index)
Returns the Boolean variable from its index in the proto.
Constraint AddNotEqual(const LinearExpr &left, const LinearExpr &right)
Adds left != right.
Constraint AddModuloEquality(const LinearExpr &target, const LinearExpr &var, const LinearExpr &mod)
Adds target = var % mod.
Constraint AddAllDifferent(absl::Span< const IntVar > vars)
This constraint forces all variables to have different values.
TableConstraint AddAllowedAssignments(absl::Span< const IntVar > vars)
Adds an allowed assignments constraint.
IntVar NewConstant(int64_t value)
Creates a constant variable.
IntervalVar NewIntervalVar(const LinearExpr &start, const LinearExpr &size, const LinearExpr &end)
Creates an interval variable from 3 affine expressions.
Constraint AddInverseConstraint(absl::Span< const IntVar > variables, absl::Span< const IntVar > inverse_variables)
An inverse constraint.
Constraint AddNoOverlap(absl::Span< const IntervalVar > vars)
Adds a no-overlap constraint that ensures that all present intervals do not overlap in time.
const CpModelProto & Proto() const
::PROTOBUF_NAMESPACE_ID::RepeatedField< int32_t > * mutable_assumptions()
::operations_research::sat::DecisionStrategyProto * add_search_strategy()
void set_scaling_factor(double value)
int64_t solution(int index) const
Specialized cumulative constraint.
void AddDemand(IntervalVar interval, LinearExpr demand)
Adds a pair (interval, demand) to the constraint.
Specialized cumulative constraint.
void AddDemand(IntervalVar interval, LinearExpr demand)
Adds a pair (interval, demand) to the constraint.
void add_intervals(int32_t value)
::operations_research::sat::LinearExpressionProto * add_demands()
A dedicated container for linear expressions with double coefficients.
static DoubleLinearExpr ScalProd(absl::Span< const IntVar > vars, absl::Span< const double > coeffs)
Constructs the scalar product of variables and coefficients.
double constant() const
Returns the constant term.
DoubleLinearExpr & operator+=(double value)
Adds a constant value to the linear expression.
std::string DebugString(const CpModelProto *proto=nullptr) const
Debug string. See the documentation for LinearExpr::DebugString().
const std::vector< double > & coefficients() const
Returns the vector of coefficients.
const std::vector< int > & variables() const
Returns the vector of variable indices.
DoubleLinearExpr & operator-=(double value)
Adds a constant value to the linear expression.
DoubleLinearExpr & AddTerm(IntVar var, double coeff)
Adds a term (var * coeff) to the linear expression.
DoubleLinearExpr & operator*=(double coeff)
Multiply the linear expression by a constant.
DoubleLinearExpr & AddConstant(double constant)
Deprecated. Use +=.
static DoubleLinearExpr Sum(absl::Span< const IntVar > vars)
Constructs the sum of a list of variables.
A dedicated container for linear expressions with double coefficients.
static DoubleLinearExpr ScalProd(absl::Span< const IntVar > vars, absl::Span< const double > coeffs)
Constructs the scalar product of variables and coefficients.
double constant() const
Returns the constant term.
DoubleLinearExpr & operator+=(double value)
Adds a constant value to the linear expression.
std::string DebugString(const CpModelProto *proto=nullptr) const
Debug string. See the documentation for LinearExpr::DebugString().
const std::vector< double > & coefficients() const
Returns the vector of coefficients.
const std::vector< int > & variables() const
Returns the vector of variable indices.
DoubleLinearExpr & operator-=(double value)
Adds a constant value to the linear expression.
DoubleLinearExpr & AddTerm(IntVar var, double coeff)
Adds a term (var * coeff) to the linear expression.
DoubleLinearExpr & operator*=(double coeff)
Multiply the linear expression by a constant.
DoubleLinearExpr & AddConstant(double constant)
Deprecated. Use +=.
static DoubleLinearExpr Sum(absl::Span< const IntVar > vars)
Constructs the sum of a list of variables.
void add_vars(int32_t value)
void add_coeffs(double value)
void set_offset(double value)
void set_maximize(bool value)
BoolVar ToBoolVar() const
Cast IntVar -> BoolVar.
IntegerVariableProto * MutableProto() const
Returns the mutable underlying protobuf object (useful for model edition).
std::string DebugString() const
Returns a debug string.
IntVar WithName(const std::string &name)
Sets the name of the variable.
LinearExpr AddConstant(int64_t value) const
Adds a constant value to an integer variable and returns a linear expression.
const IntegerVariableProto & Proto() const
Returns the underlying protobuf object (useful for testing).
BoolVar ToBoolVar() const
Cast IntVar -> BoolVar.
std::string Name() const
Returns the name of the variable (or the empty string if not set).
IntVar()
A default constructed IntVar can be used to mean not defined yet.
std::string DebugString() const
IntVar WithName(const std::string &name)
Sets the name of the variable.
::operations_research::Domain Domain() const
LinearExpr AddConstant(int64_t value) const
Deprecated. Just do var + cte where needed.
const std::string & name() const
int64_t domain(int index) const
void add_domain(int64_t value)
Represents a Interval variable.
LinearExpr SizeExpr() const
Returns the size linear expression.
LinearExpr StartExpr() const
Returns the start linear expression.
BoolVar PresenceBoolVar() const
Returns a BoolVar indicating the presence of this interval.
const IntervalConstraintProto & Proto() const
Returns the underlying protobuf object (useful for testing).
std::string DebugString() const
Returns a debug string.
const std::string & Name() const
Returns the name of the interval (or the empty string if not set).
IntervalVar WithName(const std::string &name)
Sets the name of the variable.
IntervalConstraintProto * MutableProto() const
Returns the mutable underlying protobuf object (useful for model edition).
LinearExpr EndExpr() const
Returns the end linear expression.
IntervalVar()
Default ctor.
const ::operations_research::sat::LinearExpressionProto & end() const
const ::operations_research::sat::LinearExpressionProto & start() const
const ::operations_research::sat::LinearExpressionProto & size() const
Represents a Interval variable.
LinearExpr SizeExpr() const
Returns the size linear expression.
LinearExpr StartExpr() const
Returns the start linear expression.
BoolVar PresenceBoolVar() const
Returns a BoolVar indicating the presence of this interval.
std::string Name() const
Returns the name of the interval (or the empty string if not set).
std::string DebugString() const
Returns a debug string.
IntervalVar WithName(const std::string &name)
Sets the name of the variable.
LinearExpr EndExpr() const
Returns the end linear expression.
IntervalVar()
A default constructed IntervalVar can be used to mean not defined yet.
A dedicated container for linear expressions.
LinearExpr & operator+=(const LinearExpr &other)
LinearExpr & AddVar(IntVar var)
LinearExpr & operator-=(const LinearExpr &other)
LinearExpr & operator*=(int64_t factor)
static LinearExpr Sum(absl::Span< const IntVar > vars)
Constructs the sum of a list of variables.
std::string DebugString(const CpModelProto *proto=nullptr) const
Debug string.
const std::vector< int64_t > & coefficients() const
Returns the vector of coefficients.
static LinearExpr BooleanSum(absl::Span< const BoolVar > vars)
Deprecated. Use Sum() instead.
const std::vector< int > & variables() const
Returns the vector of variable indices.
int64_t constant() const
Returns the constant term.
static LinearExpr BooleanScalProd(absl::Span< const BoolVar > vars, absl::Span< const int64_t > coeffs)
Deprecated. Use ScalProd() instead.
static LinearExpr FromProto(const LinearExpressionProto &proto)
Constructs a linear expr from its proto representation.
static LinearExpr ScalProd(absl::Span< const IntVar > vars, absl::Span< const int64_t > coeffs)
Constructs the scalar product of variables and coefficients.
LinearExpr & AddTerm(BoolVar var, int64_t coeff)
LinearExpr & AddConstant(int64_t value)
static LinearExpr Term(IntVar var, int64_t coefficient)
Constructs var * coefficient.
A dedicated container for linear expressions.
LinearExpr & operator+=(const LinearExpr &other)
LinearExpr & AddVar(IntVar var)
LinearExpr & operator-=(const LinearExpr &other)
LinearExpr & operator*=(int64_t factor)
static LinearExpr Sum(absl::Span< const IntVar > vars)
Constructs the sum of a list of variables.
std::string DebugString(const CpModelProto *proto=nullptr) const
Debug string.
const std::vector< int64_t > & coefficients() const
Returns the vector of coefficients.
static LinearExpr BooleanSum(absl::Span< const BoolVar > vars)
Deprecated. Use Sum() instead.
const std::vector< int > & variables() const
Returns the vector of variable indices.
int64_t constant() const
Returns the constant term.
LinearExpr()=default
Creates an empty linear expression with value zero.
static LinearExpr BooleanScalProd(absl::Span< const BoolVar > vars, absl::Span< const int64_t > coeffs)
Deprecated. Use ScalProd() instead.
static LinearExpr FromProto(const LinearExpressionProto &proto)
Constructs a linear expr from its proto representation.
static LinearExpr ScalProd(absl::Span< const IntVar > vars, absl::Span< const int64_t > coeffs)
Constructs the scalar product of variables and coefficients.
LinearExpr & AddTerm(BoolVar var, int64_t coeff)
LinearExpr & AddConstant(int64_t value)
static LinearExpr Term(IntVar var, int64_t coefficient)
Constructs var * coefficient.
void set_offset(int64_t value)
void add_coeffs(int64_t value)
int32_t vars(int index) const
int64_t coeffs(int index) const
Specialized circuit constraint.
void AddArc(int tail, int head, BoolVar literal)
Add an arc to the circuit.
Specialized no_overlap2D constraint.
void AddRectangle(IntervalVar x_coordinate, IntervalVar y_coordinate)
Adds a rectangle (parallel to the axis) to the constraint.
Specialized circuit constraint.
void AddArc(int tail, int head, BoolVar literal)
Add an arc to the circuit.
Specialized no_overlap2D constraint.
void AddRectangle(IntervalVar x_coordinate, IntervalVar y_coordinate)
Adds a rectangle (parallel to the axis) to the constraint.
void add_y_intervals(int32_t value)
void add_x_intervals(int32_t value)
void add_vars(int32_t value)
void add_values(int64_t value)
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final
Specialized reservoir constraint.
void AddOptionalEvent(LinearExpr time, int64_t level_change, BoolVar is_active)
Adds a optional event.
void AddEvent(LinearExpr time, int64_t level_change)
Adds a mandatory event.
Specialized reservoir constraint.
void AddOptionalEvent(LinearExpr time, int64_t level_change, BoolVar is_active)
Adds a optional event.
void AddEvent(LinearExpr time, int64_t level_change)
Adds a mandatory event.
void add_active_literals(int32_t value)
void add_level_changes(int64_t value)
::operations_research::sat::LinearExpressionProto * add_time_exprs()
void add_literals(int32_t value)
void add_heads(int32_t value)
void add_tails(int32_t value)
Specialized assignment constraint.
void AddTuple(absl::Span< const int64_t > tuple)
Adds a tuple of possible values to the constraint.
Specialized assignment constraint.
void AddTuple(absl::Span< const int64_t > tuple)
Adds a tuple of possible values to the constraint.
void add_values(int64_t value)
This file implements a wrapper around the CP-SAT model proto.
absl::Span< const double > coefficients
DecisionStrategyProto_DomainReductionStrategy
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
bool RefIsPositive(int ref)
std::string VarDebugString(const CpModelProto &proto, int index)
BoolVar Not(BoolVar x)
A convenient wrapper so we can write Not(x) instead of x.Not() which is sometimes clearer.
bool SolutionBooleanValue(const CpSolverResponse &r, BoolVar x)
Evaluates the value of a Boolean literal in a solver response.
std::string VarDebugString(const CpModelProto &proto, int index)
BoolVar Not(BoolVar x)
A convenient wrapper so we can write Not(x) instead of x.Not() which is sometimes clearer.
bool SolutionBooleanValue(const CpSolverResponse &r, BoolVar x)
Evaluates the value of a Boolean literal in a solver response.
DecisionStrategyProto_VariableSelectionStrategy
int64_t SolutionIntegerValue(const CpSolverResponse &r, const LinearExpr &expr)
Evaluates the value of an linear expression in a solver response.
Domain ReadDomainFromProto(const ProtoWithDomain &proto)
int64_t SolutionIntegerValue(const CpSolverResponse &r, const LinearExpr &expr)
Evaluates the value of an linear expression in a solver response.
Collection of objects used to extend the Constraint Solver library.
LinearExpression Sum(const Iterable &items)
int64_t SolutionIntegerValue(const CpSolverResponse &r, const LinearExpr &expr)
Evaluates the value of an linear expression in a solver response.
int64_t SolutionIntegerValue(const CpSolverResponse &r, const LinearExpr &expr)
Evaluates the value of an linear expression in a solver response.
CpSolverResponse Solve(const CpModelProto &model_proto)
Solves the given CpModelProto and returns an instance of CpSolverResponse.
Definition in file cp_model.h.
@@ -229,14 +229,10 @@ Functions
| |
| DoubleLinearExpr | operator+ (DoubleLinearExpr &&lhs, DoubleLinearExpr &&rhs) |
| |
-| DoubleLinearExpr | operator+ (const DoubleLinearExpr &lhs, double rhs) |
-| |
-| DoubleLinearExpr | operator+ (DoubleLinearExpr &&lhs, double rhs) |
-| |
-| DoubleLinearExpr | operator+ (double lhs, DoubleLinearExpr &&rhs) |
-| |
-| DoubleLinearExpr | operator+ (double lhs, const DoubleLinearExpr &rhs) |
-| |
+| DoubleLinearExpr | operator+ (DoubleLinearExpr expr, double rhs) |
+| |
+| DoubleLinearExpr | operator+ (double lhs, DoubleLinearExpr expr) |
+| |
| DoubleLinearExpr | operator- (const DoubleLinearExpr &lhs, const DoubleLinearExpr &rhs) |
| |
| DoubleLinearExpr | operator- (DoubleLinearExpr &&lhs, const DoubleLinearExpr &rhs) |
@@ -245,14 +241,10 @@ Functions
| |
| DoubleLinearExpr | operator- (DoubleLinearExpr &&lhs, DoubleLinearExpr &&rhs) |
| |
-| DoubleLinearExpr | operator- (const DoubleLinearExpr &lhs, double rhs) |
-| |
-| DoubleLinearExpr | operator- (DoubleLinearExpr &&lhs, double rhs) |
-| |
-| DoubleLinearExpr | operator- (double lhs, DoubleLinearExpr &&rhs) |
-| |
-| DoubleLinearExpr | operator- (double lhs, const DoubleLinearExpr &rhs) |
-| |
+| DoubleLinearExpr | operator- (DoubleLinearExpr epxr, double rhs) |
+| |
+| DoubleLinearExpr | operator- (double lhs, DoubleLinearExpr expr) |
+| |
| DoubleLinearExpr | operator* (DoubleLinearExpr expr, double factor) |
| |
| DoubleLinearExpr | operator* (double factor, DoubleLinearExpr expr) |
diff --git a/docs/cpp/cp__model_8h_source.html b/docs/cpp/cp__model_8h_source.html
index 941e9f89da..5deb5c5f8d 100644
--- a/docs/cpp/cp__model_8h_source.html
+++ b/docs/cpp/cp__model_8h_source.html
@@ -128,923 +128,904 @@ $(document).ready(function(){initNavTree('cp__model_8h_source.html',''); initRes
-
-
-
+
- 79 std::string
Name()
const;
-
-
-
-
- 86 return other.builder_ == builder_ && other.index_ == index_;
-
-
-
- 91 return other.builder_ != builder_ || other.index_ != index_;
-
-
-
-
- 103 int index()
const {
return index_; }
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+ 83 std::string
Name()
const;
+
+
+
+
+ 89 return other.builder_ == builder_ && other.index_ == index_;
+
+
+
+ 93 return other.builder_ != builder_ || other.index_ != index_;
+
+
+
+
+ 104 int index()
const {
return index_; }
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 165 std::string
Name()
const;
-
- 169 return other.builder_ == builder_ && other.index_ == index_;
-
-
-
- 174 return other.builder_ != builder_ || other.index_ != index_;
-
-
+
+ 168 return other.builder_ == builder_ && other.index_ == index_;
+
+
+
+ 172 return other.builder_ != builder_ || other.index_ != index_;
+
+
+
+
+
-
+ 181 int index()
const {
return index_; }
-
+
- 187 int index()
const {
return index_; }
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 270 absl::Span<const int64_t> coeffs);
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 265 absl::Span<const int64_t> coeffs);
+
+
+ 269 absl::Span<const int64_t> coeffs);
+
+
+
274 absl::Span<const int64_t> coeffs);
-
-
- 279 absl::Span<const int64_t> coeffs);
-
-
-
-
-
-
-
-
- 292 absl::Span<const int64_t> coeffs);
-
-
+
+
+
+
+
+
+
+ 287 absl::Span<const int64_t> coeffs);
+
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
- 311 const std::vector<int>&
variables()
const {
return variables_; }
-
- 314 const std::vector<int64_t>&
coefficients()
const {
return coefficients_; }
-
-
-
-
-
-
- 327 std::vector<int> variables_;
- 328 std::vector<int64_t> coefficients_;
- 329 int64_t constant_ = 0;
-
+
+
+
+
+
+
+
+
+ 306 const std::vector<int>&
variables()
const {
return variables_; }
+
+ 309 const std::vector<int64_t>&
coefficients()
const {
return coefficients_; }
+
+
+
+
+
+
+
+
+ 325 std::vector<int> variables_;
+ 326 std::vector<int64_t> coefficients_;
+ 327 int64_t constant_ = 0;
+
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 427 absl::Span<const double> coeffs);
-
-
- 431 absl::Span<const double> coeffs);
-
-
- 435 absl::Span<const double> coeffs);
-
- 438 const std::vector<int>&
variables()
const {
return variables_; }
-
- 441 const std::vector<double>&
coefficients()
const {
return coefficients_; }
-
-
-
-
-
-
- 450 std::vector<int> variables_;
- 451 std::vector<double> coefficients_;
- 452 double constant_ = 0;
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 422 absl::Span<const double> coeffs);
+
+
+ 426 absl::Span<const double> coeffs);
+
+
+ 430 absl::Span<const double> coeffs);
+
+ 433 const std::vector<int>&
variables()
const {
return variables_; }
+
+ 436 const std::vector<double>&
coefficients()
const {
return coefficients_; }
+
+
+
+
+
+
+
+
+
+ 448 std::vector<int> variables_;
+ 449 std::vector<double> coefficients_;
+ 450 double constant_ = 0;
+
+
+ 453std::ostream&
operator<<(std::ostream& os,
const DoubleLinearExpr& e);
- 455std::ostream&
operator<<(std::ostream& os,
const DoubleLinearExpr& e);
-
-
-
-
-
-
-
- 486 const std::string&
Name()
const;
-
-
-
-
-
-
-
-
-
-
- 509 return other.builder_ == builder_ && other.index_ == index_;
-
-
-
- 514 return other.builder_ != builder_ || other.index_ != index_;
-
-
-
-
-
-
-
-
- 527 int index()
const {
return index_; }
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 580 const std::string&
Name()
const;
-
-
-
-
+
+
+
+
+
+
+ 487 std::string
Name()
const;
+
+
+
+
+
+
+
+
+
+
+ 510 return other.builder_ == builder_ && other.index_ == index_;
+
+
+
+ 515 return other.builder_ != builder_ || other.index_ != index_;
+
+
+
+
+ 522 int index()
const {
return index_; }
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 575 const std::string&
Name()
const;
+
+
+
+
+
+
+
+
+
-
-
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 650 void AddTuple(absl::Span<const int64_t> tuple);
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 645 void AddTuple(absl::Span<const int64_t> tuple);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
-
-
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
-
-
+
+
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
-
+
-
+
-
-
-
-
-
-
-
-
-
-
-
-
- 794 int64_t size,
BoolVar presence);
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+ 789 int64_t size,
BoolVar presence);
+
+
+
+
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 837 absl::Span<const IntVar> variables,
+
-
- 842 absl::Span<const IntVar> variables,
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 913 absl::Span<const IntVar> inverse_variables);
-
-
-
-
-
- 964 absl::Span<const IntVar> transition_variables,
int starting_state,
- 965 absl::Span<const int> final_states);
-
-
- 969 absl::Span<const IntVar> vars);
-
-
- 973 absl::Span<const LinearExpr> exprs);
-
-
- 977 std::initializer_list<LinearExpr> exprs);
-
-
-
- 981 absl::Span<const LinearExpr> exprs) {
-
-
-
-
- 987 absl::Span<const IntVar> vars);
-
-
- 991 absl::Span<const LinearExpr> exprs);
-
-
- 995 std::initializer_list<LinearExpr> exprs);
-
-
-
- 999 absl::Span<const LinearExpr> exprs) {
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+ 908 absl::Span<const IntVar> inverse_variables);
+
+
+
+
+
+ 959 absl::Span<const IntVar> transition_variables,
int starting_state,
+ 960 absl::Span<const int> final_states);
+
+
+ 964 absl::Span<const IntVar> vars);
+
+
+ 968 absl::Span<const LinearExpr> exprs);
+
+
+ 972 std::initializer_list<LinearExpr> exprs);
+
+
+
+ 976 absl::Span<const LinearExpr> exprs) {
+
+
+
+
+ 982 absl::Span<const IntVar> vars);
+
+
+ 986 absl::Span<const LinearExpr> exprs);
+
+
+ 990 std::initializer_list<LinearExpr> exprs);
+
+
+
+ 994 absl::Span<const LinearExpr> exprs) {
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
-
- 1017 absl::Span<const LinearExpr> exprs);
-
-
- 1021 absl::Span<const IntVar> vars);
-
-
- 1025 std::initializer_list<LinearExpr> exprs);
-
-
+
+
+
+
+
+
+ 1012 absl::Span<const LinearExpr> exprs);
+
+
+ 1016 absl::Span<const IntVar> vars);
+
+
+ 1020 std::initializer_list<LinearExpr> exprs);
+
+
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1062 absl::Span<const IntVar> variables,
-
-
-
-
- 1068 absl::Span<const BoolVar> variables,
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+ 1057 absl::Span<const IntVar> variables,
+
+
+
+
+ 1063 absl::Span<const BoolVar> variables,
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1112 bool negate =
false);
-
-
- 1115 int IndexFromConstant(int64_t
value);
-
-
-
-
-
-
- 1122 int GetOrCreateIntegerIndex(
int index);
-
-
-
-
-
- 1128 absl::flat_hash_map<int64_t, int> constant_to_index_map_;
- 1129 absl::flat_hash_map<int, int> bool_to_integer_index_map_;
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1110 bool negate =
false);
+
+
+ 1113 int IndexFromConstant(int64_t
value);
+
+
+
+
+
+
+ 1120 int GetOrCreateIntegerIndex(
int index);
+
+
+
+
+
+ 1126 absl::flat_hash_map<int64_t, int> constant_to_index_map_;
+ 1127 absl::flat_hash_map<int, int> bool_to_integer_index_map_;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
- 1162 return std::move(lhs);
-
-
-
- 1166 return std::move(rhs);
-
-
- 1169 if (lhs.variables().size() < rhs.variables().size()) {
- 1170 rhs += std::move(lhs);
- 1171 return std::move(rhs);
-
- 1173 lhs += std::move(rhs);
- 1174 return std::move(lhs);
-
-
-
-
-
-
-
-
-
-
- 1185 return std::move(lhs);
-
-
-
- 1189 return std::move(rhs);
-
-
- 1192 if (lhs.variables().size() < rhs.variables().size()) {
- 1193 rhs -= std::move(lhs);
- 1194 return std::move(rhs);
-
- 1196 lhs -= std::move(rhs);
- 1197 return std::move(lhs);
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+ 1160 return std::move(lhs);
+
+
+
+ 1164 return std::move(rhs);
+
+
+ 1167 if (lhs.variables().size() < rhs.variables().size()) {
+ 1168 rhs += std::move(lhs);
+ 1169 return std::move(rhs);
+
+ 1171 lhs += std::move(rhs);
+ 1172 return std::move(lhs);
+
+
+
+
+
+
+
+
+
+
+ 1183 return std::move(lhs);
+
+
+
+ 1187 return std::move(rhs);
+
+
+ 1190 if (lhs.variables().size() < rhs.variables().size()) {
+ 1191 rhs -= std::move(lhs);
+ 1192 return std::move(rhs);
+
+ 1194 lhs -= std::move(rhs);
+ 1195 return std::move(lhs);
+
+
+
+
+
+
+
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1223 return std::move(lhs);
-
-
-
-
- 1228 return std::move(rhs);
-
-
-
- 1232 if (lhs.variables().size() < rhs.variables().size()) {
- 1233 rhs += std::move(lhs);
- 1234 return std::move(rhs);
-
- 1236 lhs += std::move(rhs);
- 1237 return std::move(lhs);
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1224 return std::move(lhs);
+
+
+
+
+ 1229 return std::move(rhs);
+
+
+
+ 1233 if (lhs.variables().size() < rhs.variables().size()) {
+ 1234 rhs += std::move(lhs);
+ 1235 return std::move(rhs);
+
+ 1237 lhs += std::move(rhs);
+ 1238 return std::move(lhs);
+
+
+
+
+
+
-
-
- 1248 return std::move(lhs);
+
+
+
-
-
- 1252 return std::move(rhs);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1269 return std::move(lhs);
-
-
-
-
- 1274 return std::move(rhs);
-
-
-
- 1278 if (lhs.variables().size() < rhs.variables().size()) {
- 1279 rhs -= std::move(lhs);
- 1280 return std::move(rhs);
-
- 1282 lhs -= std::move(rhs);
- 1283 return std::move(lhs);
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+ 1260 return std::move(lhs);
+
+
+
+
+ 1265 return std::move(rhs);
+
+
+
+ 1269 if (lhs.variables().size() < rhs.variables().size()) {
+ 1270 rhs -= std::move(lhs);
+ 1271 return std::move(rhs);
+
+ 1273 lhs -= std::move(rhs);
+ 1274 return std::move(lhs);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
-
-
- 1294 return std::move(lhs);
-
-
-
-
- 1299 return std::move(rhs);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
We call domain any subset of Int64 = [kint64min, kint64max].
LinearExpr models a quantity that is linear in the decision variables (MPVariable) of an optimization...
Specialized automaton constraint.
void AddTransition(int tail, int head, int64_t transition_label)
Adds a transitions to the automaton.
Specialized automaton constraint.
void AddTransition(int tail, int head, int64_t transition_label)
Adds a transitions to the automaton.
std::string Name() const
Returns the name of the variable.
std::string Name() const
Returns the name of the variable.
BoolVar WithName(const std::string &name)
Sets the name of the variable.
std::string DebugString() const
Debug string.
friend bool SolutionBooleanValue(const CpSolverResponse &r, BoolVar x)
Evaluates the value of a Boolean literal in a solver response.
bool operator!=(const BoolVar &other) const
Dis-Equality test.
bool operator==(const BoolVar &other) const
Equality test with another boolvar.
int index() const
Returns the index of the variable in the model.
BoolVar Not() const
Returns the logical negation of the current Boolean variable.
Specialized circuit constraint.
void AddArc(int tail, int head, BoolVar literal)
Add an arc to the circuit.
Constraint OnlyEnforceIf(absl::Span< const BoolVar > literals)
The constraint will be enforced iff all literals listed here are true.
Constraint WithName(const std::string &name)
Sets the name of the constraint.
ConstraintProto * MutableProto() const
Returns the mutable underlying protobuf object (useful for model edition).
const std::string & Name() const
Returns the name of the constraint (or the empty string if not set).
Constraint(ConstraintProto *proto)
const ConstraintProto & Proto() const
Returns the underlying protobuf object (useful for testing).
std::string DebugString() const
friend bool SolutionBooleanValue(const CpSolverResponse &r, BoolVar x)
Evaluates the value of a Boolean literal in a solver response.
BoolVar()
A default constructed BoolVar can be used to mean not defined yet.
bool operator!=(const BoolVar &other) const
bool operator==(const BoolVar &other) const
int index() const
Returns the index of the variable in the model.
BoolVar Not() const
Returns the logical negation of the current Boolean variable.
Specialized circuit constraint.
void AddArc(int tail, int head, BoolVar literal)
Add an arc to the circuit.
Constraint OnlyEnforceIf(absl::Span< const BoolVar > literals)
The constraint will be enforced iff all literals listed here are true.
Constraint WithName(const std::string &name)
Sets the name of the constraint.
ConstraintProto * MutableProto() const
Returns the mutable underlying protobuf object (useful for model edition).
const std::string & Name() const
Returns the name of the constraint (or the empty string if not set).
Constraint(ConstraintProto *proto)
const ConstraintProto & Proto() const
Returns the underlying protobuf object (useful for testing).
Wrapper class around the cp_model proto.
void AddHint(IntVar var, int64_t value)
Adds hinting to a variable.
TableConstraint AddForbiddenAssignments(absl::Span< const IntVar > vars)
Adds an forbidden assignments constraint.
Constraint AddMinEquality(const LinearExpr &target, absl::Span< const IntVar > vars)
Adds target == min(vars).
Constraint AddLinearConstraint(const LinearExpr &expr, const Domain &domain)
Adds expr in domain.
void ClearAssumptions()
Remove all assumptions from the model.
Constraint AddAbsEquality(const LinearExpr &target, const LinearExpr &expr)
Adds target == abs(expr).
void AddAssumptions(absl::Span< const BoolVar > literals)
Adds multiple literals to the model as assumptions.
IntervalVar NewFixedSizeIntervalVar(const LinearExpr &start, int64_t size)
Creates an interval variable with a fixed size.
MultipleCircuitConstraint AddMultipleCircuitConstraint()
Adds a multiple circuit constraint, aka the "VRP" (Vehicle Routing Problem) constraint.
BoolVar TrueVar()
Creates an always true Boolean variable.
IntVar NewIntVar(const Domain &domain)
Creates an integer variable with the given domain.
void ClearHints()
Removes all hints.
void Maximize(const LinearExpr &expr)
Adds a linear maximization objective.
BoolVar NewBoolVar()
Creates a Boolean variable.
Constraint AddMaxEquality(const LinearExpr &target, absl::Span< const IntVar > vars)
Adds target == max(vars).
Constraint AddMultiplicationEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs)
Adds target == prod(exprs).
void AddDecisionStrategy(absl::Span< const IntVar > variables, DecisionStrategyProto::VariableSelectionStrategy var_strategy, DecisionStrategyProto::DomainReductionStrategy domain_strategy)
Adds a decision strategy on a list of integer variables.
IntervalVar NewOptionalIntervalVar(const LinearExpr &start, const LinearExpr &size, const LinearExpr &end, BoolVar presence)
Creates an optional interval variable from 3 affine expressions and a Boolean variable.
CircuitConstraint AddCircuitConstraint()
Adds a circuit constraint.
Constraint AddVariableElement(IntVar index, absl::Span< const IntVar > variables, IntVar target)
Adds the element constraint: variables[index] == target.
Constraint AddGreaterThan(const LinearExpr &left, const LinearExpr &right)
Adds left > right.
void CopyFrom(const CpModelProto &model_proto)
Replaces the current model with the one from the given proto.
Constraint AddLessThan(const LinearExpr &left, const LinearExpr &right)
Adds left < right.
Constraint AddBoolXor(absl::Span< const BoolVar > literals)
Adds the constraint that an odd number of literals is true.
void SetName(const std::string &name)
Sets the name of the model.
Constraint AddElement(IntVar index, absl::Span< const int64_t > values, IntVar target)
Adds the element constraint: values[index] == target.
void AddAssumption(BoolVar lit)
Adds a literal to the model as assumptions.
void Minimize(const LinearExpr &expr)
Adds a linear minimization objective.
CpModelProto * MutableProto()
BoolVar FalseVar()
Creates an always false Boolean variable.
Constraint AddImplication(BoolVar a, BoolVar b)
Adds a => b.
Constraint AddBoolAnd(absl::Span< const BoolVar > literals)
Adds the constraint that all literals must be true.
IntervalVar GetIntervalVarFromProtoIndex(int index)
Returns the interval variable from its index in the proto.
CumulativeConstraint AddCumulative(LinearExpr capacity)
The cumulative constraint.
Constraint AddLessOrEqual(const LinearExpr &left, const LinearExpr &right)
Adds left <= right.
ReservoirConstraint AddReservoirConstraint(int64_t min_level, int64_t max_level)
Adds a reservoir constraint with optional refill/emptying events.
Constraint AddEquality(const LinearExpr &left, const LinearExpr &right)
Adds left == right.
NoOverlap2DConstraint AddNoOverlap2D()
The no_overlap_2d constraint prevents a set of boxes from overlapping.
Constraint AddGreaterOrEqual(const LinearExpr &left, const LinearExpr &right)
Adds left >= right.
Constraint AddBoolOr(absl::Span< const BoolVar > literals)
Adds the constraint that at least one of the literals must be true.
IntVar GetIntVarFromProtoIndex(int index)
Returns the integer variable from its index in the proto.
AutomatonConstraint AddAutomaton(absl::Span< const IntVar > transition_variables, int starting_state, absl::Span< const int > final_states)
An automaton constraint.
Constraint AddLinMinEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs)
IntervalVar NewOptionalFixedSizeIntervalVar(const LinearExpr &start, int64_t size, BoolVar presence)
Creates an optional interval variable with a fixed size.
Constraint AddLinMaxEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs)
const CpModelProto & Build() const
Constraint AddDivisionEquality(const LinearExpr &target, const LinearExpr &numerator, const LinearExpr &denominator)
Adds target = num / denom (integer division rounded towards 0).
BoolVar GetBoolVarFromProtoIndex(int index)
Returns the Boolean variable from its index in the proto.
Constraint AddNotEqual(const LinearExpr &left, const LinearExpr &right)
Adds left != right.
Constraint AddModuloEquality(const LinearExpr &target, const LinearExpr &var, const LinearExpr &mod)
Adds target = var % mod.
Constraint AddAllDifferent(absl::Span< const IntVar > vars)
This constraint forces all variables to have different values.
TableConstraint AddAllowedAssignments(absl::Span< const IntVar > vars)
Adds an allowed assignments constraint.
IntVar NewConstant(int64_t value)
Creates a constant variable.
IntervalVar NewIntervalVar(const LinearExpr &start, const LinearExpr &size, const LinearExpr &end)
Creates an interval variable from 3 affine expressions.
Constraint AddInverseConstraint(absl::Span< const IntVar > variables, absl::Span< const IntVar > inverse_variables)
An inverse constraint.
Constraint AddNoOverlap(absl::Span< const IntervalVar > vars)
Adds a no-overlap constraint that ensures that all present intervals do not overlap in time.
const CpModelProto & Proto() const
Wrapper class around the cp_model proto.
void AddHint(IntVar var, int64_t value)
Adds hinting to a variable.
TableConstraint AddForbiddenAssignments(absl::Span< const IntVar > vars)
Adds an forbidden assignments constraint.
Constraint AddMinEquality(const LinearExpr &target, absl::Span< const IntVar > vars)
Adds target == min(vars).
Constraint AddLinearConstraint(const LinearExpr &expr, const Domain &domain)
Adds expr in domain.
void ClearAssumptions()
Remove all assumptions from the model.
Constraint AddAbsEquality(const LinearExpr &target, const LinearExpr &expr)
Adds target == abs(expr).
void AddAssumptions(absl::Span< const BoolVar > literals)
Adds multiple literals to the model as assumptions.
IntervalVar NewFixedSizeIntervalVar(const LinearExpr &start, int64_t size)
Creates an interval variable with a fixed size.
MultipleCircuitConstraint AddMultipleCircuitConstraint()
Adds a multiple circuit constraint, aka the "VRP" (Vehicle Routing Problem) constraint.
BoolVar TrueVar()
Creates an always true Boolean variable.
IntVar NewIntVar(const Domain &domain)
Creates an integer variable with the given domain.
void ClearHints()
Removes all hints.
void Maximize(const LinearExpr &expr)
Adds a linear maximization objective.
BoolVar NewBoolVar()
Creates a Boolean variable.
Constraint AddMaxEquality(const LinearExpr &target, absl::Span< const IntVar > vars)
Adds target == max(vars).
Constraint AddMultiplicationEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs)
Adds target == prod(exprs).
void AddDecisionStrategy(absl::Span< const IntVar > variables, DecisionStrategyProto::VariableSelectionStrategy var_strategy, DecisionStrategyProto::DomainReductionStrategy domain_strategy)
Adds a decision strategy on a list of integer variables.
IntervalVar NewOptionalIntervalVar(const LinearExpr &start, const LinearExpr &size, const LinearExpr &end, BoolVar presence)
Creates an optional interval variable from 3 affine expressions and a Boolean variable.
CircuitConstraint AddCircuitConstraint()
Adds a circuit constraint.
Constraint AddVariableElement(IntVar index, absl::Span< const IntVar > variables, IntVar target)
Adds the element constraint: variables[index] == target.
Constraint AddGreaterThan(const LinearExpr &left, const LinearExpr &right)
Adds left > right.
void CopyFrom(const CpModelProto &model_proto)
Replaces the current model with the one from the given proto.
Constraint AddLessThan(const LinearExpr &left, const LinearExpr &right)
Adds left < right.
Constraint AddBoolXor(absl::Span< const BoolVar > literals)
Adds the constraint that an odd number of literals is true.
void SetName(const std::string &name)
Sets the name of the model.
Constraint AddElement(IntVar index, absl::Span< const int64_t > values, IntVar target)
Adds the element constraint: values[index] == target.
void AddAssumption(BoolVar lit)
Adds a literal to the model as assumptions.
void Minimize(const LinearExpr &expr)
Adds a linear minimization objective.
CpModelProto * MutableProto()
BoolVar FalseVar()
Creates an always false Boolean variable.
Constraint AddImplication(BoolVar a, BoolVar b)
Adds a => b.
Constraint AddBoolAnd(absl::Span< const BoolVar > literals)
Adds the constraint that all literals must be true.
IntervalVar GetIntervalVarFromProtoIndex(int index)
Returns the interval variable from its index in the proto.
CumulativeConstraint AddCumulative(LinearExpr capacity)
The cumulative constraint.
Constraint AddLessOrEqual(const LinearExpr &left, const LinearExpr &right)
Adds left <= right.
ReservoirConstraint AddReservoirConstraint(int64_t min_level, int64_t max_level)
Adds a reservoir constraint with optional refill/emptying events.
Constraint AddEquality(const LinearExpr &left, const LinearExpr &right)
Adds left == right.
NoOverlap2DConstraint AddNoOverlap2D()
The no_overlap_2d constraint prevents a set of boxes from overlapping.
Constraint AddGreaterOrEqual(const LinearExpr &left, const LinearExpr &right)
Adds left >= right.
Constraint AddBoolOr(absl::Span< const BoolVar > literals)
Adds the constraint that at least one of the literals must be true.
IntVar GetIntVarFromProtoIndex(int index)
Returns the integer variable from its index in the proto.
AutomatonConstraint AddAutomaton(absl::Span< const IntVar > transition_variables, int starting_state, absl::Span< const int > final_states)
An automaton constraint.
Constraint AddLinMinEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs)
IntervalVar NewOptionalFixedSizeIntervalVar(const LinearExpr &start, int64_t size, BoolVar presence)
Creates an optional interval variable with a fixed size.
Constraint AddLinMaxEquality(const LinearExpr &target, absl::Span< const LinearExpr > exprs)
const CpModelProto & Build() const
Constraint AddDivisionEquality(const LinearExpr &target, const LinearExpr &numerator, const LinearExpr &denominator)
Adds target = num / denom (integer division rounded towards 0).
BoolVar GetBoolVarFromProtoIndex(int index)
Returns the Boolean variable from its index in the proto.
Constraint AddNotEqual(const LinearExpr &left, const LinearExpr &right)
Adds left != right.
Constraint AddModuloEquality(const LinearExpr &target, const LinearExpr &var, const LinearExpr &mod)
Adds target = var % mod.
Constraint AddAllDifferent(absl::Span< const IntVar > vars)
This constraint forces all variables to have different values.
TableConstraint AddAllowedAssignments(absl::Span< const IntVar > vars)
Adds an allowed assignments constraint.
IntVar NewConstant(int64_t value)
Creates a constant variable.
IntervalVar NewIntervalVar(const LinearExpr &start, const LinearExpr &size, const LinearExpr &end)
Creates an interval variable from 3 affine expressions.
Constraint AddInverseConstraint(absl::Span< const IntVar > variables, absl::Span< const IntVar > inverse_variables)
An inverse constraint.
Constraint AddNoOverlap(absl::Span< const IntervalVar > vars)
Adds a no-overlap constraint that ensures that all present intervals do not overlap in time.
const CpModelProto & Proto() const
Specialized cumulative constraint.
void AddDemand(IntervalVar interval, LinearExpr demand)
Adds a pair (interval, demand) to the constraint.
A dedicated container for linear expressions with double coefficients.
static DoubleLinearExpr ScalProd(absl::Span< const IntVar > vars, absl::Span< const double > coeffs)
Constructs the scalar product of variables and coefficients.
double constant() const
Returns the constant term.
DoubleLinearExpr & operator+=(double value)
Adds a constant value to the linear expression.
std::string DebugString(const CpModelProto *proto=nullptr) const
Debug string. See the documentation for LinearExpr::DebugString().
const std::vector< double > & coefficients() const
Returns the vector of coefficients.
const std::vector< int > & variables() const
Returns the vector of variable indices.
DoubleLinearExpr & operator-=(double value)
Adds a constant value to the linear expression.
DoubleLinearExpr & AddTerm(IntVar var, double coeff)
Adds a term (var * coeff) to the linear expression.
DoubleLinearExpr & operator*=(double coeff)
Multiply the linear expression by a constant.
DoubleLinearExpr & AddConstant(double constant)
Deprecated. Use +=.
static DoubleLinearExpr Sum(absl::Span< const IntVar > vars)
Constructs the sum of a list of variables.
BoolVar ToBoolVar() const
Cast IntVar -> BoolVar.
IntegerVariableProto * MutableProto() const
Returns the mutable underlying protobuf object (useful for model edition).
bool operator==(const IntVar &other) const
Equality test with another IntVar.
std::string DebugString() const
Returns a debug string.
bool operator!=(const IntVar &other) const
Difference test with another IntVar.
IntVar WithName(const std::string &name)
Sets the name of the variable.
const std::string & Name() const
Returns the name of the variable (or the empty string if not set).
friend int64_t SolutionIntegerValue(const CpSolverResponse &r, const LinearExpr &expr)
Evaluates the value of an linear expression in a solver response.
int index() const
Returns the index of the variable in the model. This will be non-negative.
LinearExpr AddConstant(int64_t value) const
Adds a constant value to an integer variable and returns a linear expression.
const IntegerVariableProto & Proto() const
Returns the underlying protobuf object (useful for testing).
const std::string & name() const
Represents a Interval variable.
LinearExpr SizeExpr() const
Returns the size linear expression.
LinearExpr StartExpr() const
Returns the start linear expression.
BoolVar PresenceBoolVar() const
Returns a BoolVar indicating the presence of this interval.
const IntervalConstraintProto & Proto() const
Returns the underlying protobuf object (useful for testing).
std::string DebugString() const
Returns a debug string.
bool operator!=(const IntervalVar &other) const
Difference test with another interval variable.
const std::string & Name() const
Returns the name of the interval (or the empty string if not set).
bool operator==(const IntervalVar &other) const
Equality test with another interval variable.
IntervalVar WithName(const std::string &name)
Sets the name of the variable.
IntervalConstraintProto * MutableProto() const
Returns the mutable underlying protobuf object (useful for model edition).
LinearExpr EndExpr() const
Returns the end linear expression.
IntervalVar()
Default ctor.
int index() const
Returns the index of the interval constraint in the model.
friend std::ostream & operator<<(std::ostream &os, const IntervalVar &var)
Specialized cumulative constraint.
void AddDemand(IntervalVar interval, LinearExpr demand)
Adds a pair (interval, demand) to the constraint.
A dedicated container for linear expressions with double coefficients.
static DoubleLinearExpr ScalProd(absl::Span< const IntVar > vars, absl::Span< const double > coeffs)
Constructs the scalar product of variables and coefficients.
const bool IsConstant() const
double constant() const
Returns the constant term.
DoubleLinearExpr & operator+=(double value)
Adds a constant value to the linear expression.
std::string DebugString(const CpModelProto *proto=nullptr) const
Debug string. See the documentation for LinearExpr::DebugString().
const std::vector< double > & coefficients() const
Returns the vector of coefficients.
const std::vector< int > & variables() const
Returns the vector of variable indices.
DoubleLinearExpr & operator-=(double value)
Adds a constant value to the linear expression.
DoubleLinearExpr & AddTerm(IntVar var, double coeff)
Adds a term (var * coeff) to the linear expression.
DoubleLinearExpr & operator*=(double coeff)
Multiply the linear expression by a constant.
DoubleLinearExpr & AddConstant(double constant)
Deprecated. Use +=.
static DoubleLinearExpr Sum(absl::Span< const IntVar > vars)
Constructs the sum of a list of variables.
BoolVar ToBoolVar() const
Cast IntVar -> BoolVar.
std::string Name() const
Returns the name of the variable (or the empty string if not set).
bool operator==(const IntVar &other) const
IntVar()
A default constructed IntVar can be used to mean not defined yet.
std::string DebugString() const
bool operator!=(const IntVar &other) const
IntVar WithName(const std::string &name)
Sets the name of the variable.
::operations_research::Domain Domain() const
friend int64_t SolutionIntegerValue(const CpSolverResponse &r, const LinearExpr &expr)
Evaluates the value of an linear expression in a solver response.
int index() const
Returns the index of the variable in the model. This will be non-negative.
LinearExpr AddConstant(int64_t value) const
Deprecated. Just do var + cte where needed.
Represents a Interval variable.
LinearExpr SizeExpr() const
Returns the size linear expression.
LinearExpr StartExpr() const
Returns the start linear expression.
BoolVar PresenceBoolVar() const
Returns a BoolVar indicating the presence of this interval.
std::string Name() const
Returns the name of the interval (or the empty string if not set).
std::string DebugString() const
Returns a debug string.
bool operator!=(const IntervalVar &other) const
Difference test with another interval variable.
bool operator==(const IntervalVar &other) const
Equality test with another interval variable.
IntervalVar WithName(const std::string &name)
Sets the name of the variable.
LinearExpr EndExpr() const
Returns the end linear expression.
IntervalVar()
A default constructed IntervalVar can be used to mean not defined yet.
int index() const
Returns the index of the interval constraint in the model.
friend std::ostream & operator<<(std::ostream &os, const IntervalVar &var)
A dedicated container for linear expressions.
LinearExpr & operator+=(const LinearExpr &other)
LinearExpr & AddVar(IntVar var)
LinearExpr & operator-=(const LinearExpr &other)
LinearExpr & AddExpression(const LinearExpr &expr)
LinearExpr & operator*=(int64_t factor)
static LinearExpr Sum(absl::Span< const IntVar > vars)
Constructs the sum of a list of variables.
std::string DebugString(const CpModelProto *proto=nullptr) const
Debug string.
const std::vector< int64_t > & coefficients() const
Returns the vector of coefficients.
static LinearExpr BooleanSum(absl::Span< const BoolVar > vars)
Deprecated. Use Sum() instead.
const std::vector< int > & variables() const
Returns the vector of variable indices.
int64_t constant() const
Returns the constant term.
static LinearExpr BooleanScalProd(absl::Span< const BoolVar > vars, absl::Span< const int64_t > coeffs)
Deprecated. Use ScalProd() instead.
static LinearExpr FromProto(const LinearExpressionProto &proto)
Constructs a linear expr from its proto representation.
static LinearExpr ScalProd(absl::Span< const IntVar > vars, absl::Span< const int64_t > coeffs)
Constructs the scalar product of variables and coefficients.
LinearExpr & AddTerm(BoolVar var, int64_t coeff)
LinearExpr & AddConstant(int64_t value)
static LinearExpr Term(IntVar var, int64_t coefficient)
Constructs var * coefficient.
A dedicated container for linear expressions.
LinearExpr & operator+=(const LinearExpr &other)
LinearExpr & AddVar(IntVar var)
LinearExpr & operator-=(const LinearExpr &other)
LinearExpr & AddExpression(const LinearExpr &expr)
LinearExpr & operator*=(int64_t factor)
const bool IsConstant() const
Returns true if the expression has no variables.
static LinearExpr Sum(absl::Span< const IntVar > vars)
Constructs the sum of a list of variables.
std::string DebugString(const CpModelProto *proto=nullptr) const
Debug string.
const std::vector< int64_t > & coefficients() const
Returns the vector of coefficients.
static LinearExpr BooleanSum(absl::Span< const BoolVar > vars)
Deprecated. Use Sum() instead.
const std::vector< int > & variables() const
Returns the vector of variable indices.
int64_t constant() const
Returns the constant term.
LinearExpr()=default
Creates an empty linear expression with value zero.
static LinearExpr BooleanScalProd(absl::Span< const BoolVar > vars, absl::Span< const int64_t > coeffs)
Deprecated. Use ScalProd() instead.
static LinearExpr FromProto(const LinearExpressionProto &proto)
Constructs a linear expr from its proto representation.
static LinearExpr ScalProd(absl::Span< const IntVar > vars, absl::Span< const int64_t > coeffs)
Constructs the scalar product of variables and coefficients.
LinearExpr & AddTerm(BoolVar var, int64_t coeff)
LinearExpr & AddConstant(int64_t value)
static LinearExpr Term(IntVar var, int64_t coefficient)
Constructs var * coefficient.
Specialized circuit constraint.
void AddArc(int tail, int head, BoolVar literal)
Add an arc to the circuit.
Specialized no_overlap2D constraint.
void AddRectangle(IntervalVar x_coordinate, IntervalVar y_coordinate)
Adds a rectangle (parallel to the axis) to the constraint.
Specialized reservoir constraint.
void AddOptionalEvent(LinearExpr time, int64_t level_change, BoolVar is_active)
Adds a optional event.
void AddEvent(LinearExpr time, int64_t level_change)
Adds a mandatory event.
Specialized assignment constraint.
void AddTuple(absl::Span< const int64_t > tuple)
Adds a tuple of possible values to the constraint.
Specialized circuit constraint.
void AddArc(int tail, int head, BoolVar literal)
Add an arc to the circuit.
Specialized no_overlap2D constraint.
void AddRectangle(IntervalVar x_coordinate, IntervalVar y_coordinate)
Adds a rectangle (parallel to the axis) to the constraint.
Specialized reservoir constraint.
void AddOptionalEvent(LinearExpr time, int64_t level_change, BoolVar is_active)
Adds a optional event.
void AddEvent(LinearExpr time, int64_t level_change)
Adds a mandatory event.
Specialized assignment constraint.
void AddTuple(absl::Span< const int64_t > tuple)
Adds a tuple of possible values to the constraint.
DecisionStrategyProto_DomainReductionStrategy
LinearExpr operator+(const LinearExpr &lhs, const LinearExpr &rhs)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::string VarDebugString(const CpModelProto &proto, int index)
LinearExpr operator-(LinearExpr expr)
BoolVar Not(BoolVar x)
A convenient wrapper so we can write Not(x) instead of x.Not() which is sometimes clearer.
bool SolutionBooleanValue(const CpSolverResponse &r, BoolVar x)
Evaluates the value of a Boolean literal in a solver response.
LinearExpr operator+(const LinearExpr &lhs, const LinearExpr &rhs)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::string VarDebugString(const CpModelProto &proto, int index)
LinearExpr operator-(LinearExpr expr)
BoolVar Not(BoolVar x)
A convenient wrapper so we can write Not(x) instead of x.Not() which is sometimes clearer.
bool SolutionBooleanValue(const CpSolverResponse &r, BoolVar x)
Evaluates the value of a Boolean literal in a solver response.
DecisionStrategyProto_VariableSelectionStrategy
int64_t SolutionIntegerValue(const CpSolverResponse &r, const LinearExpr &expr)
Evaluates the value of an linear expression in a solver response.
int64_t SolutionIntegerValue(const CpSolverResponse &r, const LinearExpr &expr)
Evaluates the value of an linear expression in a solver response.
LinearExpr operator*(LinearExpr expr, int64_t factor)
LinearExpr operator*(LinearExpr expr, int64_t factor)
Collection of objects used to extend the Constraint Solver library.
std::function< BooleanOrIntegerLiteral()> ConstructSearchStrategy(const CpModelProto &cp_model_proto, const std::vector< IntegerVariable > &variable_mapping, IntegerVariable objective_var, Model *model)
LinearRelaxation ComputeLinearRelaxation(const CpModelProto &model_proto, Model *m)
LinearRelaxation ComputeLinearRelaxation(const CpModelProto &model_proto, Model *m)
CpSolverResponse Solve(const CpModelProto &model_proto)
Solves the given CpModelProto and returns an instance of CpSolverResponse.
std::function< BooleanOrIntegerLiteral()> InstrumentSearchStrategy(const CpModelProto &cp_model_proto, const std::vector< IntegerVariable > &variable_mapping, const std::function< BooleanOrIntegerLiteral()> &instrumented_strategy, Model *model)
SatSolver::Status MinimizeIntegerVariableWithLinearScanAndLazyEncoding(IntegerVariable objective_var, const std::function< void()> &feasible_solution_observer, Model *model)
#define DCHECK_LT(val1, val2)
#define DCHECK(condition)
#define VLOG(verboselevel)
int index() const
Returns the index of the interval constraint in the model.
int index() const
Returns the index of the interval constraint in the model.
IntegerValue ShiftedStartMin(int t) const
void AddPresenceReason(int t)
void STLSortAndRemoveDuplicates(T *v, const LessFunc &less_func)
void swap(IdMap< K, V > &a, IdMap< K, V > &b)
constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
void GetOverlappingIntervalComponents(std::vector< IndexedInterval > *intervals, std::vector< std::vector< int > > *components)
IntegerValue CeilRatio(IntegerValue dividend, IntegerValue positive_divisor)
std::vector< int > GetIntervalArticulationPoints(std::vector< IndexedInterval > *intervals)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
void GetOverlappingIntervalComponents(std::vector< IndexedInterval > *intervals, std::vector< std::vector< int > > *components)
std::vector< int > GetIntervalArticulationPoints(std::vector< IndexedInterval > *intervals)
std::vector< absl::Span< int > > GetOverlappingRectangleComponents(const std::vector< Rectangle > &rectangles, absl::Span< int > active_rectangles)
- m -
-- Machine() : Machine
+- Machine() : Machine
- machine() : Task
- machine_size() : Task
- MachineDefaultTypeInternal() : MachineDefaultTypeInternal
-- machines() : JsspInputProblem
+- machines() : JsspInputProblem
- machines_size() : JsspInputProblem
- MainLpPreprocessor() : MainLpPreprocessor
- Maintain() : SearchLog
@@ -108,9 +108,9 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MakeAllDifferent() : Solver
- MakeAllDifferentExcept() : Solver
- MakeAllowedAssignments() : Solver
-- MakeAllSolutionCollector() : Solver
+- MakeAllSolutionCollector() : Solver
- MakeApplyBranchSelector() : Solver
-- MakeAssignment() : Solver
+- MakeAssignment() : Solver
- MakeAssignVariablesValues() : Solver
- MakeAssignVariablesValuesOrDoNothing() : Solver
- MakeAssignVariablesValuesOrFail() : Solver
@@ -122,7 +122,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MakeBestValueSolutionCollector() : Solver
- MakeBetweenCt() : Solver
- MakeBoolVar() : MPSolver, Solver
-- MakeBoolVarArray() : MPSolver, Solver
+- MakeBoolVarArray() : MPSolver, Solver
- MakeBoxedVariableRelevant() : VariablesInfo
- MakeBranchesLimit() : Solver
- MakeChainInactive() : PathOperator
@@ -136,7 +136,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MakeConstraintAdder() : Solver
- MakeConstraintInitialPropagateCallback() : Solver
- MakeConvexPiecewiseExpr() : Solver
-- MakeCount() : Solver
+- MakeCount() : Solver
- MakeCover() : Solver
- MakeCString() : JNIUtil
- MakeCumulative() : Solver
@@ -149,7 +149,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MakeDelayedConstraintInitialPropagateCallback() : Solver
- MakeDelayedPathCumul() : Solver
- MakeDeviation() : Solver
-- MakeDifference() : Solver
+- MakeDifference() : Solver
- MakeDisjunctionNodesUnperformed() : RoutingFilteredHeuristic
- MakeDisjunctiveConstraint() : Solver
- MakeDistribute() : Solver
@@ -168,14 +168,14 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MakeFirstSolutionCollector() : Solver
- MakeFixedDurationEndSyncedOnEndIntervalVar() : Solver
- MakeFixedDurationEndSyncedOnStartIntervalVar() : Solver
-- MakeFixedDurationIntervalVar() : Solver
+- MakeFixedDurationIntervalVar() : Solver
- MakeFixedDurationIntervalVarArray() : Solver
- MakeFixedDurationStartSyncedOnEndIntervalVar() : Solver
- MakeFixedDurationStartSyncedOnStartIntervalVar() : Solver
- MakeFixedInterval() : Solver
- MakeGenericTabuSearch() : Solver
- MakeGreater() : Solver
-- MakeGreaterOrEqual() : Solver
+- MakeGreaterOrEqual() : Solver
- MakeGreedyDescentLSOperator() : RoutingModel
- MakeGuidedLocalSearch() : Solver
- MakeGuidedSlackFinalizer() : RoutingModel
@@ -193,7 +193,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MakeIntervalRelaxedMin() : Solver
- MakeIntervalVar() : Solver
- MakeIntervalVarArray() : Solver
-- MakeIntervalVarRelation() : Solver
+- MakeIntervalVarRelation() : Solver
- MakeIntervalVarRelationWithDelay() : Solver
- MakeIntVar() : MPSolver, Solver
- MakeIntVarArray() : MPSolver, Solver
@@ -224,17 +224,17 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MakeIsLessOrEqualCt() : Solver
- MakeIsLessOrEqualVar() : Solver
- MakeIsLessVar() : Solver
-- MakeIsMemberCt() : Solver
-- MakeIsMemberVar() : Solver
+- MakeIsMemberCt() : Solver
+- MakeIsMemberVar() : Solver
- MakeJByteArray() : JNIUtil
- MakeJString() : JNIUtil
- MakeLastSolutionCollector() : Solver
- MakeLess() : Solver
-- MakeLessOrEqual() : Solver
+- MakeLessOrEqual() : Solver
- MakeLexicalLess() : Solver
- MakeLexicalLessOrEqual() : Solver
- MakeLimit() : Solver
-- MakeLocalSearchPhase() : Solver
+- MakeLocalSearchPhase() : Solver
- MakeLocalSearchPhaseParameters() : Solver
- MakeLubyRestart() : Solver
- MakeMapDomain() : Solver
@@ -242,29 +242,29 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MakeMaxEquality() : Solver
- MakeMaximize() : Solver
- MakeMemberCt() : Solver
-- MakeMin() : Solver
+- MakeMin() : Solver
- MakeMinEquality() : Solver
- MakeMinimize() : Solver
- MakeMirrorInterval() : Solver
- MakeModulo() : Solver
- MakeMonotonicElement() : Solver
- MakeMoveTowardTargetOperator() : Solver
-- MakeNBestValueSolutionCollector() : Solver
+- MakeNBestValueSolutionCollector() : Solver
- MakeNeighbor() : Cross, Exchange, ExchangeSubtrip, ExtendedSwapActiveOperator, IndexPairSwapActiveOperator, LightPairRelocateOperator, LinKernighan, MakeActiveAndRelocate, MakeActiveOperator, MakeChainInactiveOperator, MakeInactiveOperator, MakePairActiveOperator, MakePairInactiveOperator, MakeRelocateNeighborsOperator, PairExchangeOperator, PairExchangeRelocateOperator, PairNodeSwapActiveOperator< swap_first >, PairRelocateOperator, PathLns, PathOperator, Relocate, RelocateAndMakeActiveOperator, RelocateAndMakeInactiveOperator, RelocateExpensiveChain, RelocateSubtrip, SwapActiveOperator, TSPLns, TSPOpt, TwoOpt, SwigDirector_PathOperator
- MakeNeighborhoodLimit() : Solver
-- MakeNestedOptimize() : Solver
-- MakeNextNeighbor() : IndexPairSwapActiveOperator, IntVarLocalSearchOperator, LocalSearchOperator, NeighborhoodLimit, PairNodeSwapActiveOperator< swap_first >, SwapIndexPairOperator, SwigDirector_BaseLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_LocalSearchOperator, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator
+- MakeNestedOptimize() : Solver
+- MakeNextNeighbor() : IndexPairSwapActiveOperator, IntVarLocalSearchOperator, LocalSearchOperator, NeighborhoodLimit, PairNodeSwapActiveOperator< swap_first >, SwapIndexPairOperator, SwigDirector_BaseLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_LocalSearchOperator, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator
- MakeNoCycle() : Solver
- MakeNonEquality() : Solver
-- MakeNonOverlappingBoxesConstraint() : Solver
-- MakeNonOverlappingNonStrictBoxesConstraint() : Solver
+- MakeNonOverlappingBoxesConstraint() : Solver
+- MakeNonOverlappingNonStrictBoxesConstraint() : Solver
- MakeNotBetweenCt() : Solver
-- MakeNotMemberCt() : Solver
+- MakeNotMemberCt() : Solver
- MakeNullIntersect() : Solver
- MakeNullIntersectExcept() : Solver
- MakeNumVar() : MPSolver
- MakeNumVarArray() : MPSolver
-- MakeOneNeighbor() : BaseInactiveNodeToPathOperator, BaseLns, ChangeValue, IntVarLocalSearchOperator, MakePairActiveOperator, PathOperator, RelocateExpensiveChain, TSPLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_PathOperator
+- MakeOneNeighbor() : BaseInactiveNodeToPathOperator, BaseLns, ChangeValue, IntVarLocalSearchOperator, MakePairActiveOperator, PathOperator, RelocateExpensiveChain, TSPLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_PathOperator
- MakeOneNeighborSwigPublic() : SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_PathOperator
- MakeOperator() : Solver
- MakeOpposite() : Solver
@@ -274,15 +274,15 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MakePairInactiveOperator() : MakePairInactiveOperator
- MakePartiallyPerformedPairsUnperformed() : RoutingFilteredHeuristic
- MakePathConnected() : Solver
-- MakePathCumul() : Solver
+- MakePathCumul() : Solver
- MakePathPrecedenceConstraint() : Solver
- MakePathSpansAndTotalSlacks() : RoutingModel
- MakePathTransitPrecedenceConstraint() : Solver
-- MakePhase() : Solver
+- MakePhase() : Solver
- MakePiecewiseLinearExpr() : Solver
- MakePower() : Solver
- MakePrintModelVisitor() : Solver
-- MakeProd() : Solver
+- MakeProd() : Solver
- MakeProfiledDecisionBuilderWrapper() : Solver
- MakeRandomLnsOperator() : Solver
- MakeRankFirstInterval() : Solver
@@ -291,21 +291,21 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MakeRejectFilter() : Solver
- MakeRelocateNeighborsOperator() : MakeRelocateNeighborsOperator
- MakeRestoreAssignment() : Solver
-- MakeRowConstraint() : MPSolver
+- MakeRowConstraint() : MPSolver
- MakeScalProd() : Solver
- MakeScalProdEquality() : Solver
-- MakeScalProdGreaterOrEqual() : Solver
+- MakeScalProdGreaterOrEqual() : Solver
- MakeScalProdLessOrEqual() : Solver
- MakeScheduleOrExpedite() : Solver
- MakeScheduleOrPostpone() : Solver
-- MakeSearchLog() : Solver
+- MakeSearchLog() : Solver
- MakeSearchTrace() : Solver
- MakeSelfDependentDimensionFinalizer() : RoutingModel
- MakeSemiContinuousExpr() : Solver
- MakeSequenceVar() : DisjunctiveConstraint
- MakeSimulatedAnnealing() : Solver
- MakeSolutionsLimit() : Solver
-- MakeSolveOnce() : Solver
+- MakeSolveOnce() : Solver
- MakeSortingConstraint() : Solver
- makespan_cost() : JsspOutputSolution
- makespan_cost_per_time_unit() : JsspInputProblem
@@ -317,10 +317,10 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MakeStrictDisjunctiveConstraint() : Solver
- MakeSubCircuit() : Solver
- MakeSum() : Solver
-- MakeSumEquality() : Solver
+- MakeSumEquality() : Solver
- MakeSumGreaterOrEqual() : Solver
- MakeSumLessOrEqual() : Solver
-- MakeSumObjectiveFilter() : Solver
+- MakeSumObjectiveFilter() : Solver
- MakeSymmetryManager() : Solver
- MakeTabuSearch() : Solver
- MakeTemporalDisjunction() : Solver
@@ -406,9 +406,8 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MaxElements() : LogLegacy, LogLegacyUpTo100, LogMultiline, LogMultilineUpToN, LogShort, LogShortUpToN
- MaxFlow() : MaxFlow
- maximization() : MPObjective
-- Maximize() : Model
- maximize() : Model
-- Maximize() : HungarianOptimizer, Objective
+- Maximize() : Model, HungarianOptimizer, Objective
- maximize() : MPModelProto
- Maximize() : CpModelBuilder
- maximize() : FloatObjectiveProto
@@ -440,7 +439,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MergePartsOf() : MergingPartition
- MergeReasonInto() : IntegerTrail
- MergeWithGlobalTimeLimit() : TimeLimit
-- MergingPartition() : MergingPartition
+- MergingPartition() : MergingPartition
- message() : JavaExceptionMessage
- MessageCallbackData() : MessageCallbackData
- MessageHandler() : GScipSolverCallbackHandler
@@ -495,7 +494,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- mixed_integer_scheduling_solver() : RoutingSearchParameters
- Model() : Model
- model() : CallbackRegistration, CallbackResult::GeneratedLinearConstraint, CallbackResult, IdMap< K, V >, IdSet< K >, LinearConstraint, LinearExpression, MapFilter< KeyType >, ModelSolveParameters, Objective, Variable, MPModelRequest::_Internal, MPModelRequest, RoutingDimension, RoutingFilteredHeuristic
-- Model() : Model
+- Model() : Model
- model() : SatSolver, CpSolverRequest::_Internal, CpSolverRequest
- model_delta() : MPModelRequest::_Internal, MPModelRequest
- model_name() : Solver
@@ -521,9 +520,9 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- mp_callback() : ScipConstraintHandlerForMPCallback
- MPAbsConstraint() : MPAbsConstraint
- MPAbsConstraintDefaultTypeInternal() : MPAbsConstraintDefaultTypeInternal
-- MPArrayConstraint() : MPArrayConstraint
+- MPArrayConstraint() : MPArrayConstraint
- MPArrayConstraintDefaultTypeInternal() : MPArrayConstraintDefaultTypeInternal
-- MPArrayWithConstantConstraint() : MPArrayWithConstantConstraint
+- MPArrayWithConstantConstraint() : MPArrayWithConstantConstraint
- MPArrayWithConstantConstraintDefaultTypeInternal() : MPArrayWithConstantConstraintDefaultTypeInternal
- MPCallback() : MPCallback
- MPCallbackList() : MPCallbackList
@@ -532,40 +531,40 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MPConstraintProtoDefaultTypeInternal() : MPConstraintProtoDefaultTypeInternal
- MPGeneralConstraintProto() : MPGeneralConstraintProto
- MPGeneralConstraintProtoDefaultTypeInternal() : MPGeneralConstraintProtoDefaultTypeInternal
-- MPIndicatorConstraint() : MPIndicatorConstraint
+- MPIndicatorConstraint() : MPIndicatorConstraint
- MPIndicatorConstraintDefaultTypeInternal() : MPIndicatorConstraintDefaultTypeInternal
- mpm_time() : RcpspProblem
-- MPModelDeltaProto() : MPModelDeltaProto
+- MPModelDeltaProto() : MPModelDeltaProto
- MPModelDeltaProto_ConstraintOverridesEntry_DoNotUse() : MPModelDeltaProto_ConstraintOverridesEntry_DoNotUse
- MPModelDeltaProto_ConstraintOverridesEntry_DoNotUseDefaultTypeInternal() : MPModelDeltaProto_ConstraintOverridesEntry_DoNotUseDefaultTypeInternal
- MPModelDeltaProto_VariableOverridesEntry_DoNotUse() : MPModelDeltaProto_VariableOverridesEntry_DoNotUse
- MPModelDeltaProto_VariableOverridesEntry_DoNotUseDefaultTypeInternal() : MPModelDeltaProto_VariableOverridesEntry_DoNotUseDefaultTypeInternal
- MPModelDeltaProtoDefaultTypeInternal() : MPModelDeltaProtoDefaultTypeInternal
- MPModelExportOptions() : MPModelExportOptions
-- MPModelProto() : MPModelProto
+- MPModelProto() : MPModelProto
- MPModelProtoDefaultTypeInternal() : MPModelProtoDefaultTypeInternal
- MPModelRequest() : MPModelRequest
- MPModelRequestDefaultTypeInternal() : MPModelRequestDefaultTypeInternal
- MPQuadraticConstraint() : MPQuadraticConstraint
- MPQuadraticConstraintDefaultTypeInternal() : MPQuadraticConstraintDefaultTypeInternal
-- MPQuadraticObjective() : MPQuadraticObjective
+- MPQuadraticObjective() : MPQuadraticObjective
- MPQuadraticObjectiveDefaultTypeInternal() : MPQuadraticObjectiveDefaultTypeInternal
-- MPSolution() : MPSolution
+- MPSolution() : MPSolution
- MPSolutionDefaultTypeInternal() : MPSolutionDefaultTypeInternal
- MPSolutionResponse() : MPSolutionResponse
- MPSolutionResponseDefaultTypeInternal() : MPSolutionResponseDefaultTypeInternal
-- MPSolveInfo() : MPSolveInfo
+- MPSolveInfo() : MPSolveInfo
- MPSolveInfoDefaultTypeInternal() : MPSolveInfoDefaultTypeInternal
- MPSolver() : MPSolver
-- MPSolverCommonParameters() : MPSolverCommonParameters
+- MPSolverCommonParameters() : MPSolverCommonParameters
- MPSolverCommonParametersDefaultTypeInternal() : MPSolverCommonParametersDefaultTypeInternal
- MPSolverInterface() : MPSolverInterface
- MPSolverParameters() : MPSolverParameters
-- MPSosConstraint() : MPSosConstraint
+- MPSosConstraint() : MPSosConstraint
- MPSosConstraintDefaultTypeInternal() : MPSosConstraintDefaultTypeInternal
- MPSReaderImpl() : MPSReaderImpl
- MPVariable() : MPVariable
-- MPVariableProto() : MPVariableProto
+- MPVariableProto() : MPVariableProto
- MPVariableProtoDefaultTypeInternal() : MPVariableProtoDefaultTypeInternal
- multi_armed_bandit_compound_operator_exploration_coefficient() : RoutingSearchParameters
- multi_armed_bandit_compound_operator_memory_coefficient() : RoutingSearchParameters
@@ -589,7 +588,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- mutable_backward_sequence() : SequenceVarAssignment
- mutable_basedata() : RcpspProblem
- mutable_baseline_model_file_path() : MPModelDeltaProto
-- mutable_bins() : VectorBinPackingSolution
+- mutable_bins() : VectorBinPackingSolution
- mutable_bns() : WorkerInfo
- mutable_bool_and() : ConstraintProto
- mutable_bool_or() : ConstraintProto
@@ -603,13 +602,13 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- mutable_coefficients() : LinearBooleanConstraint, LinearObjective
- mutable_coeffs() : CpObjectiveProto, FloatObjectiveProto, LinearConstraintProto, LinearExpressionProto
- mutable_column() : SparseMatrix, SparseMatrixWithReusableColumnMemory
-- mutable_constraint() : MPIndicatorConstraint, MPModelProto
+- mutable_constraint() : MPIndicatorConstraint, MPModelProto
- mutable_constraint_id() : ConstraintRuns
- mutable_constraint_lower_bounds() : LinearProgram
- mutable_constraint_overrides() : MPModelDeltaProto
- mutable_constraint_solver_statistics() : SearchStatistics
- mutable_constraint_upper_bounds() : LinearProgram
-- mutable_constraints() : CpModelProto, LinearBooleanProblem
+- mutable_constraints() : CpModelProto, LinearBooleanProblem
- mutable_cost() : Task
- mutable_cumulative() : ConstraintProto
- mutable_cut() : CoverCutHelper
@@ -632,14 +631,14 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- mutable_enforcement_literal() : ConstraintProto
- mutable_entries() : DenseMatrixProto
- mutable_exactly_one() : ConstraintProto
-- mutable_exprs() : AllDifferentConstraintProto, LinearArgumentProto
+- mutable_exprs() : AllDifferentConstraintProto, LinearArgumentProto
- mutable_f_direct() : InverseConstraintProto
- mutable_f_inverse() : InverseConstraintProto
- mutable_final_states() : AutomatonConstraintProto
-- mutable_first_solution_statistics() : LocalSearchStatistics
+- mutable_first_solution_statistics() : LocalSearchStatistics
- mutable_floating_point_objective() : CpModelProto
- mutable_forward_sequence() : SequenceVarAssignment
-- mutable_general_constraint() : MPModelProto
+- mutable_general_constraint() : MPModelProto
- mutable_get() : StrongVector< IntType, T, Alloc >
- mutable_heads() : CircuitConstraintProto, RoutesConstraintProto
- mutable_improvement_limit_parameters() : RoutingSearchParameters
@@ -653,7 +652,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- mutable_int_var_assignment() : AssignmentProto
- mutable_integer_objective() : CpSolverResponse
- mutable_interval() : ConstraintProto
-- mutable_interval_var_assignment() : AssignmentProto
+- mutable_interval_var_assignment() : AssignmentProto
- mutable_intervals() : CumulativeConstraintProto, NoOverlapConstraintProto
- mutable_inverse() : ConstraintProto
- mutable_item() : VectorBinPackingProblem
@@ -676,9 +675,9 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- mutable_log_tag() : RoutingSearchParameters
- mutable_long_params() : GScipParameters
- mutable_machine() : Task
-- mutable_machines() : JsspInputProblem
+- mutable_machines() : JsspInputProblem
- mutable_max_constraint() : MPGeneralConstraintProto
-- mutable_methods() : BopSolverOptimizerSet
+- mutable_methods() : BopSolverOptimizerSet
- mutable_min_constraint() : MPGeneralConstraintProto
- mutable_min_delays() : PerRecipeDelays
- mutable_model() : MPModelRequest, CpSolverRequest
@@ -738,7 +737,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- mutable_status_str() : MPSolutionResponse
- mutable_strategy() : LocalSearchStatistics_FirstSolutionStatistics
- mutable_string_params() : GScipParameters
-- mutable_successor_delays() : Task
+- mutable_successor_delays() : Task
- mutable_successors() : Task
- mutable_sufficient_assumptions_for_infeasibility() : CpSolverResponse
- mutable_support() : SparsePermutationProto
@@ -750,7 +749,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- mutable_tightened_variables() : CpSolverResponse
- mutable_time_exprs() : ReservoirConstraintProto
- mutable_time_limit() : RoutingSearchParameters
-- mutable_transformations() : DecisionStrategyProto
+- mutable_transformations() : DecisionStrategyProto
- mutable_transition_head() : AutomatonConstraintProto
- mutable_transition_label() : AutomatonConstraintProto
- mutable_transition_tail() : AutomatonConstraintProto
@@ -774,7 +773,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- mutable_y_intervals() : NoOverlap2DConstraintProto
- MutableCoefficient() : SparseVector< IndexType, IteratorType >
- MutableConflict() : Trail
-- MutableElement() : AssignmentContainer< V, E >
+- MutableElement() : AssignmentContainer< V, E >
- MutableElementOrNull() : AssignmentContainer< V, E >
- MutableIndex() : SparseVector< IndexType, IteratorType >
- MutableIntegerReason() : SchedulingConstraintHelper
@@ -784,7 +783,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
- MutableLiteralReason() : SchedulingConstraintHelper
- MutableObjective() : MPSolver
- MutablePreAssignment() : RoutingModel
-- MutableProto() : Constraint, CpModelBuilder, IntervalVar, IntVar
+- MutableProto() : Constraint, CpModelBuilder
- MutableRef() : RevVector< IndexType, T >
- MutableResponse() : SharedResponseManager
- MutableSequenceVarContainer() : Assignment
diff --git a/docs/cpp/functions_func_n.html b/docs/cpp/functions_func_n.html
index d7df1b1db0..6e2b17e208 100644
--- a/docs/cpp/functions_func_n.html
+++ b/docs/cpp/functions_func_n.html
@@ -96,7 +96,7 @@ $(document).ready(function(){initNavTree('functions_func_n.html',''); initResiza
- name() : MPVariable, MPVariableProto, Item, VectorBinPackingProblem, PiecewiseLinearExpr, ProfiledDecisionBuilder, PropagationBaseObject, RoutingDimension
- Name() : BoolVar, Constraint
- name() : ConstraintProto, CpModelProto, IntegerVariableProto
-- Name() : IntervalVar, IntVar
+- Name() : IntervalVar, IntVar
- name() : LinearBooleanConstraint, LinearBooleanProblem
- Name() : Model
- name() : NeighborhoodGenerator, SatParameters, SubSolver, Job, JsspInputProblem, Machine, RcpspProblem
@@ -168,7 +168,7 @@ $(document).ready(function(){initNavTree('functions_func_n.html',''); initResiza
- NodeIterator() : StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::NodeIterator
- NodeRange() : PathState::NodeRange
- NodeReservation() : Graphs< Graph >, Graphs< operations_research::StarGraph >
-- nodes() : BopInterface, CBCInterface, CLPInterface, FlowModelProto, GLOPInterface, GurobiInterface, MPSolver, MPSolverInterface
+- nodes() : BopInterface, CBCInterface, CLPInterface, FlowModelProto, GLOPInterface, GurobiInterface, MPSolver, MPSolverInterface
- Nodes() : PathState
- nodes() : RoutingModel, SatInterface, SCIPInterface
- nodes_size() : FlowModelProto
diff --git a/docs/cpp/functions_func_p.html b/docs/cpp/functions_func_p.html
index d19f02eb22..b6661ff00f 100644
--- a/docs/cpp/functions_func_p.html
+++ b/docs/cpp/functions_func_p.html
@@ -261,7 +261,7 @@ $(document).ready(function(){initNavTree('functions_func_p.html',''); initResiza
- Priority() : Stat, TimeDistribution
- priority() : SwigDirector_Demon
- PriorityQueueWithRestrictedPush() : PriorityQueueWithRestrictedPush< Element, IntegerPriority >
-- ProbeBooleanVariables() : Prober
+- ProbeBooleanVariables() : Prober
- ProbeOneVariable() : Prober
- Prober() : Prober
- probing_period_at_root() : SatParameters
@@ -296,8 +296,8 @@ $(document).ready(function(){initNavTree('functions_func_p.html',''); initResiza
- ProfiledDecisionBuilder() : ProfiledDecisionBuilder
- profit_lower_bound() : KnapsackPropagator, KnapsackPropagatorForCuts
- profit_upper_bound() : KnapsackPropagator, KnapsackPropagatorForCuts, KnapsackSearchNode, KnapsackSearchNodeForCuts
-- ProgressPercent() : RegularLimit, Search, SearchMonitor, SwigDirector_OptimizeVar, SwigDirector_RegularLimit, SwigDirector_SearchLimit, SwigDirector_SearchMonitor, SwigDirector_SolutionCollector
-- Propagate() : Dimension, DisjunctivePropagator, Pack, AllDifferentBoundsPropagator, AllDifferentConstraint, BinaryImplicationGraph, BooleanXorPropagator, CircuitCoveringPropagator, CircuitPropagator, CombinedDisjunctive< time_direction >, CumulativeEnergyConstraint, CumulativeIsAfterSubsetConstraint, DisjunctiveDetectablePrecedences, DisjunctiveEdgeFinding, DisjunctiveNotLast, DisjunctiveOverloadChecker, DisjunctivePrecedences, DisjunctiveWithTwoItems, DivisionPropagator, FixedDivisionPropagator, FixedModuloPropagator, GenericLiteralWatcher, GreaterThanAtLeastOneOfPropagator, IntegerSumLE, IntegerTrail, LevelZeroEquality, LinearProgrammingConstraint, LinMinPropagator, LiteralWatchers, MinPropagator, NonOverlappingRectanglesDisjunctivePropagator, NonOverlappingRectanglesEnergyPropagator, PbConstraints, PrecedencesPropagator, ProductPropagator, PropagatorInterface, ReservoirTimeTabling, SatPropagator, SatSolver, SchedulingConstraintHelper, SelectedMinPropagator, SquarePropagator, SymmetryPropagator, TimeTableEdgeFinding, TimeTablingPerTask, UpperBoundedLinearConstraint
+- ProgressPercent() : RegularLimit, Search, SearchMonitor, SwigDirector_OptimizeVar, SwigDirector_RegularLimit, SwigDirector_SearchLimit, SwigDirector_SearchMonitor, SwigDirector_SolutionCollector
+- Propagate() : Dimension, DisjunctivePropagator, Pack, AllDifferentBoundsPropagator, AllDifferentConstraint, BinaryImplicationGraph, BooleanXorPropagator, CircuitCoveringPropagator, CircuitPropagator, CombinedDisjunctive< time_direction >, CumulativeEnergyConstraint, CumulativeIsAfterSubsetConstraint, DisjunctiveDetectablePrecedences, DisjunctiveEdgeFinding, DisjunctiveNotLast, DisjunctiveOverloadChecker, DisjunctivePrecedences, DisjunctiveWithTwoItems, DivisionPropagator, FixedDivisionPropagator, FixedModuloPropagator, GenericLiteralWatcher, GreaterThanAtLeastOneOfPropagator, IntegerSumLE, IntegerTrail, LevelZeroEquality, LinearProgrammingConstraint, LinMinPropagator, LiteralWatchers, MinPropagator, NonOverlappingRectanglesDisjunctivePropagator, NonOverlappingRectanglesEnergyPropagator, PbConstraints, PrecedencesPropagator, ProductPropagator, PropagatorInterface, ReservoirTimeTabling, SatPropagator, SatSolver, SchedulingConstraintHelper, SelectedMinPropagator, SquarePropagator, SymmetryPropagator, TimeTableEdgeFinding, TimeTablingPerTask, UpperBoundedLinearConstraint
- PropagateAffineRelation() : PresolveContext
- PropagateAtLevelZero() : IntegerSumLE
- PropagateCumulBounds() : CumulBoundsPropagator
@@ -313,9 +313,9 @@ $(document).ready(function(){initNavTree('functions_func_p.html',''); initResiza
- PropagationReason() : SatClause
- PropagatorId() : SatPropagator
- PropagatorInterface() : PropagatorInterface
-- ProportionalColumnPreprocessor() : ProportionalColumnPreprocessor
-- ProportionalRowPreprocessor() : ProportionalRowPreprocessor
-- Proto() : CallbackRegistration, CallbackResult, MapFilter< KeyType >, ModelSolveParameters, Constraint, CpModelBuilder, IntervalVar, IntVar
+- ProportionalColumnPreprocessor() : ProportionalColumnPreprocessor
+- ProportionalRowPreprocessor() : ProportionalRowPreprocessor
+- Proto() : CallbackRegistration, CallbackResult, MapFilter< KeyType >, ModelSolveParameters, Constraint, CpModelBuilder
- PROTOBUF_SECTION_VARIABLE() : TableStruct_ortools_2fbop_2fbop_5fparameters_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fassignment_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fdemon_5fprofiler_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fenums_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fsearch_5flimit_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fsearch_5fstats_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fsolver_5fparameters_2eproto, TableStruct_ortools_2fglop_2fparameters_2eproto, TableStruct_ortools_2fgraph_2fflow_5fproblem_2eproto, TableStruct_ortools_2fgscip_2fgscip_2eproto, TableStruct_ortools_2flinear_5fsolver_2flinear_5fsolver_2eproto, TableStruct_ortools_2fpacking_2fvector_5fbin_5fpacking_2eproto, TableStruct_ortools_2fsat_2fboolean_5fproblem_2eproto, TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto, TableStruct_ortools_2fsat_2fcp_5fmodel_5fservice_2eproto, TableStruct_ortools_2fsat_2fsat_5fparameters_2eproto, TableStruct_ortools_2fscheduling_2fjobshop_5fscheduling_2eproto, TableStruct_ortools_2fscheduling_2frcpsp_2eproto, TableStruct_ortools_2futil_2foptional_5fboolean_2eproto
- provide_strong_optimal_guarantee() : GlopParameters
- prune_search_tree() : BopParameters
diff --git a/docs/cpp/functions_func_r.html b/docs/cpp/functions_func_r.html
index 0fd7348dbd..718377698e 100644
--- a/docs/cpp/functions_func_r.html
+++ b/docs/cpp/functions_func_r.html
@@ -413,11 +413,11 @@ $(document).ready(function(){initNavTree('functions_func_r.html',''); initResiza
- ResetToMinimizeIndex() : LiteralWatchers
- ResetVehicleIndices() : RoutingFilteredHeuristic
- ResetWithGivenAssumptions() : SatSolver
-- resize() : StrongVector< IntType, T, Alloc >
+- resize() : StrongVector< IntType, T, Alloc >
- Resize() : AssignmentContainer< V, E >, Bitmap, Bitset64< IndexType >
- resize() : Permutation< IndexType >
- Resize() : RandomAccessSparseColumn
-- resize() : StrictITIVector< IntType, T >
+- resize() : StrictITIVector< IntType, T >
- Resize() : BinaryImplicationGraph, LiteralWatchers, PbConstraints, Trail, VariablesAssignment, VariableWithSameReasonIdentifier, SparseBitset< IntegerType >
- resize() : SVector< T >
- resize_down() : StrictITIVector< IntType, T >
@@ -425,16 +425,16 @@ $(document).ready(function(){initNavTree('functions_func_r.html',''); initResiza
- ResizeOnNewRows() : DualEdgeNorms
- ResolvePBConflict() : UpperBoundedLinearConstraint
- Resource() : Resource
-- resource_capacity() : VectorBinPackingProblem
+- resource_capacity() : VectorBinPackingProblem
- resource_capacity_size() : VectorBinPackingProblem
-- resource_name() : VectorBinPackingProblem
+- resource_name() : VectorBinPackingProblem
- resource_name_size() : VectorBinPackingProblem
- resource_usage() : Item
- resource_usage_size() : Item
- ResourceAssignmentOptimizer() : ResourceAssignmentOptimizer
- ResourceDefaultTypeInternal() : ResourceDefaultTypeInternal
- ResourceGroup() : RoutingModel::ResourceGroup
-- resources() : RcpspProblem, Recipe
+- resources() : RcpspProblem, Recipe
- resources_size() : RcpspProblem, Recipe
- ResourceVar() : RoutingModel
- ResourceVars() : RoutingModel
diff --git a/docs/cpp/functions_func_s.html b/docs/cpp/functions_func_s.html
index a243313752..68e2051b72 100644
--- a/docs/cpp/functions_func_s.html
+++ b/docs/cpp/functions_func_s.html
@@ -1349,18 +1349,18 @@ $(document).ready(function(){initNavTree('functions_func_s.html',''); initResiza
- SetLpAlgorithm() : BopInterface, GLOPInterface, MPSolverInterface, SatInterface
- SetMainObjectiveVariable() : LinearProgrammingConstraint
- SetMatchingAlgorithm() : ChristofidesPathSolver< CostType, ArcIndex, NodeIndex, CostFunction >
-- SetMax() : Assignment, BooleanVar, DemonProfiler, IntExpr, IntVarElement, LocalSearchVariable, PiecewiseLinearExpr, PropagationMonitor, Trace
+- SetMax() : Assignment, BooleanVar, DemonProfiler, IntExpr, IntVarElement, LocalSearchVariable, PiecewiseLinearExpr, PropagationMonitor, Trace
- SetMaxFPIterations() : FeasibilityPump
- SetMaximization() : MPObjective
- SetMaximizationProblem() : LinearProgram
- SetMaximize() : GScip
- SetMaximumNumberOfActiveVehicles() : RoutingModel
-- SetMin() : Assignment, BooleanVar, DemonProfiler, IntExpr, IntVarElement, LocalSearchVariable, PiecewiseLinearExpr, PropagationMonitor, Trace
+- SetMin() : Assignment, BooleanVar, DemonProfiler, IntExpr, IntVarElement, LocalSearchVariable, PiecewiseLinearExpr, PropagationMonitor, Trace
- SetMinimization() : MPObjective
- SetMIPParameters() : MPSolverInterface
- SetName() : DataWrapper< LinearProgram >, DataWrapper< MPModelProto >, LinearProgram, CpModelBuilder
- SetNext() : PathOperator
-- SetNextBaseToIncrement() : PathOperator, SwigDirector_PathOperator
+- SetNextBaseToIncrement() : PathOperator, SwigDirector_PathOperator
- SetNextBaseToIncrementSwigPublic() : SwigDirector_PathOperator
- SetNodeSupply() : GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >, SimpleMinCostFlow
- SetNonBasicVariableCostToZero() : ReducedCosts
@@ -1503,7 +1503,7 @@ $(document).ready(function(){initNavTree('functions_func_s.html',''); initResiza
- SimpleRevFIFO() : SimpleRevFIFO< T >
- SimplifyUsingImpliedDomain() : Domain
- Singleton() : Set< Integer >
-- SingletonColumnSignPreprocessor() : SingletonColumnSignPreprocessor
+- SingletonColumnSignPreprocessor() : SingletonColumnSignPreprocessor
- SingletonPreprocessor() : SingletonPreprocessor
- SingletonRank() : Set< Integer >
- SingletonUndo() : SingletonUndo
@@ -1543,7 +1543,7 @@ $(document).ready(function(){initNavTree('functions_func_s.html',''); initResiza
- Sizes() : SchedulingConstraintHelper
- SizeVar() : IntervalsRepository
- skip_locally_optimal_paths() : ConstraintSolverParameters
-- SkipUnchanged() : PathOperator, VarLocalSearchOperator< V, Val, Handler >, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator
+- SkipUnchanged() : PathOperator, VarLocalSearchOperator< V, Val, Handler >, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator
- Slack() : BlossomGraph
- slacks() : RoutingDimension
- SlackVar() : RoutingDimension
@@ -1585,7 +1585,7 @@ $(document).ready(function(){initNavTree('functions_func_s.html',''); initResiza
- solve_time_in_seconds() : VectorBinPackingSolution
- solve_user_time_seconds() : MPSolveInfo
- solve_wall_time_seconds() : MPSolveInfo
-- SolveAndCommit() : Solver
+- SolveAndCommit() : Solver
- SolveDepth() : Solver
- SolveFromAssignmentsWithParameters() : RoutingModel
- SolveFromAssignmentWithParameters() : RoutingModel
@@ -1593,7 +1593,7 @@ $(document).ready(function(){initNavTree('functions_func_s.html',''); initResiza
- solver() : Dimension
- Solver() : Solver
- solver() : ModelCache, PropagationBaseObject, RoutingModel, SearchMonitor
-- Solver() : Solver
+- Solver() : Solver
- solver_info() : VectorBinPackingSolution
- solver_optimizer_sets() : BopParameters
- solver_optimizer_sets_size() : BopParameters
diff --git a/docs/cpp/functions_func_v.html b/docs/cpp/functions_func_v.html
index a2ab47626c..00e832168f 100644
--- a/docs/cpp/functions_func_v.html
+++ b/docs/cpp/functions_func_v.html
@@ -126,7 +126,7 @@ $(document).ready(function(){initNavTree('functions_func_v.html',''); initResiza
- VarAt() : Argument
- VarDomination() : VarDomination
- Variable() : Variable
-- variable() : MPModelProto, MPSolver
+- variable() : MPModelProto, MPSolver
- Variable() : Literal
- variable_activity_decay() : SatParameters
- variable_bounds_dual_ray() : LPSolver
diff --git a/docs/cpp/functions_h.html b/docs/cpp/functions_h.html
index 0043e5405d..48add556df 100644
--- a/docs/cpp/functions_h.html
+++ b/docs/cpp/functions_h.html
@@ -469,8 +469,8 @@ $(document).ready(function(){initNavTree('functions_h.html',''); initResizable()
- HasCumulVarSoftLowerBound() : RoutingDimension
- HasCumulVarSoftUpperBound() : RoutingDimension
- HasDimension() : RoutingModel
-- HasFragments() : BaseLns, LocalSearchOperator, PathLns, SwigDirector_BaseLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_LocalSearchOperator, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator
-- Hash() : NonOrderedSetHasher< IntType >
+- HasFragments() : BaseLns, LocalSearchOperator, PathLns, SwigDirector_BaseLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_LocalSearchOperator, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator
+- Hash() : NonOrderedSetHasher< IntType >
- hash : LinearConstraintManager::ConstraintInfo, UpperBoundedLinearConstraint
- hash_function() : linked_hash_map< Key, Value, KeyHash, KeyEq, Alloc >
- HasHardTypeIncompatibilities() : RoutingModel
@@ -505,7 +505,7 @@ $(document).ready(function(){initNavTree('functions_h.html',''); initResizable()
- head : BlossomGraph::Edge, FlowArcProto
- Head() : GenericMaxFlow< Graph >, LinearSumAssignment< GraphType >, SimpleMaxFlow, SimpleMinCostFlow, StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >, CompleteBipartiteGraph< NodeIndexType, ArcIndexType >, CompleteGraph< NodeIndexType, ArcIndexType >, ListGraph< NodeIndexType, ArcIndexType >, ReverseArcListGraph< NodeIndexType, ArcIndexType >, ReverseArcMixedGraph< NodeIndexType, ArcIndexType >, ReverseArcStaticGraph< NodeIndexType, ArcIndexType >, StaticGraph< NodeIndexType, ArcIndexType >
- head_ : EbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >, StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >
-- heads() : CircuitConstraintProto, RoutesConstraintProto
+- heads() : CircuitConstraintProto, RoutesConstraintProto
- heads_size() : CircuitConstraintProto, RoutesConstraintProto
- HeldWolfeCrowder : TravelingSalesmanLowerBoundParameters
- HeldWolfeCrowderEvaluator() : HeldWolfeCrowderEvaluator< CostType, CostFunction >
diff --git a/docs/cpp/functions_i.html b/docs/cpp/functions_i.html
index 64f3020d77..24af814539 100644
--- a/docs/cpp/functions_i.html
+++ b/docs/cpp/functions_i.html
@@ -205,7 +205,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- initial_best_objective_bound : NeighborhoodGenerator::SolveData
- initial_condition_number_threshold() : GlopParameters
- initial_polarity() : SatParameters
-- initial_propagation_end_time() : ConstraintRuns
+- initial_propagation_end_time() : ConstraintRuns
- initial_propagation_end_time_size() : ConstraintRuns
- initial_propagation_start_time() : ConstraintRuns
- initial_propagation_start_time_size() : ConstraintRuns
@@ -284,7 +284,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- InsertVarValueEncoding() : PresolveContext
- InsertVoidConstraint() : ModelCache
- InStablePhase() : SatDecisionPolicy
-- Install() : DemonProfiler, LocalSearchMonitor, LocalSearchMonitorMaster, LocalSearchProfiler, PropagationMonitor, SearchMonitor, Trace, SwigDirector_OptimizeVar, SwigDirector_RegularLimit, SwigDirector_SearchLimit, SwigDirector_SearchMonitor, SwigDirector_SolutionCollector
+- Install() : DemonProfiler, LocalSearchMonitor, LocalSearchMonitorMaster, LocalSearchProfiler, PropagationMonitor, SearchMonitor, Trace, SwigDirector_OptimizeVar, SwigDirector_RegularLimit, SwigDirector_SearchLimit, SwigDirector_SearchMonitor, SwigDirector_SolutionCollector
- Instance() : AllSolversRegistry
- instantiate_all_variables() : SatParameters
- InstrumentsDemons() : Solver
@@ -322,7 +322,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- integer_value : LexerInfo
- integer_variables() : LinearProgrammingConstraint
- IntegerCastInfo() : Solver::IntegerCastInfo
-- IntegerDistribution() : IntegerDistribution
+- IntegerDistribution() : IntegerDistribution
- IntegerDomains() : IntegerDomains
- IntegerEncoder() : IntegerEncoder
- IntegerList() : Argument, Domain
@@ -343,7 +343,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- IntegerTrail() : IntegerTrail
- IntegerType : Set< Integer >, SetRangeIterator< SetRange >
- IntegerValue() : Annotation, Argument, Domain
-- IntegerVariableProto() : IntegerVariableProto
+- IntegerVariableProto() : IntegerVariableProto
- IntegerVariableProtoDefaultTypeInternal() : IntegerVariableProtoDefaultTypeInternal
- IntegerVariablesList() : LinearProgram
- IntegerVariableToRef() : VarDomination
@@ -364,9 +364,8 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- IntersectWithInterval() : Domain
- IntersectWithListOfIntegers() : Domain
- IntersectWithSingleton() : Domain
-- Interval() : Annotation
- INTERVAL : Annotation
-- Interval() : Argument, Domain
+- Interval() : Annotation, Argument, Domain
- interval() : ConstraintProto::_Internal, ConstraintProto
- Interval() : CpModelMapping, SequenceVar
- INTERVAL_DEFAULT : Solver
@@ -375,9 +374,9 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- INTERVAL_SET_TIMES_BACKWARD : Solver
- INTERVAL_SET_TIMES_FORWARD : Solver
- INTERVAL_SIMPLE : Solver
-- interval_var_assignment() : AssignmentProto
+- interval_var_assignment() : AssignmentProto
- interval_var_assignment_size() : AssignmentProto
-- IntervalConstraintProto() : IntervalConstraintProto
+- IntervalConstraintProto() : IntervalConstraintProto
- IntervalConstraintProtoDefaultTypeInternal() : IntervalConstraintProtoDefaultTypeInternal
- IntervalContainer : Assignment
- IntervalDebugString() : PresolveContext
@@ -392,7 +391,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- IntervalStrategy : Solver
- IntervalUsage() : PresolveContext
- IntervalVar() : IntervalVar, BoolVar, CpModelBuilder, IntervalVar, IntVar
-- IntervalVarAssignment() : IntervalVarAssignment
+- IntervalVarAssignment() : IntervalVarAssignment
- IntervalVarAssignmentDefaultTypeInternal() : IntervalVarAssignmentDefaultTypeInternal
- IntervalVarContainer() : Assignment
- IntervalVarElement() : IntervalVarElement
@@ -400,8 +399,8 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- IntTupleSet() : IntTupleSet
- IntType() : IntType< IntTypeName, _ValueType >
- IntValueStrategy : Solver
-- IntVar() : IntVar, BoolVar, CpModelBuilder, IntVar, Solver
-- IntVarAssignment() : IntVarAssignment
+- IntVar() : IntVar, BoolVar, CpModelBuilder, IntVar, Solver
+- IntVarAssignment() : IntVarAssignment
- IntVarAssignmentDefaultTypeInternal() : IntVarAssignmentDefaultTypeInternal
- IntVarContainer() : Assignment
- IntVarElement() : IntVarElement
@@ -417,7 +416,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- InvalidateSolutionSynchronization() : MPSolverInterface
- inverse() : ConstraintProto::_Internal, ConstraintProto
- inverse_col_perm() : LuFactorization
-- InverseConstraintProto() : InverseConstraintProto
+- InverseConstraintProto() : InverseConstraintProto
- InverseConstraintProtoDefaultTypeInternal() : InverseConstraintProtoDefaultTypeInternal
- InverseMultiplicationBy() : Domain
- InverseValue() : IntVarLocalSearchOperator
@@ -479,6 +478,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- IsColumnDeleted() : MatrixNonZeroPattern
- IsColumnMarked() : ColumnDeletionHelper
- IsComputed() : UpdateRow
+- IsConstant() : DoubleLinearExpr, LinearExpr
- IsConstraintLinear() : GScip
- IsContinuous() : BopInterface, CBCInterface, CLPInterface, GLOPInterface, GurobiInterface, MPSolverInterface, SatInterface, SCIPInterface
- IsConvex() : PiecewiseLinearFunction
@@ -497,7 +497,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- IsEqualTo() : SparseVector< IndexType, IteratorType >
- IsFalseLiteral() : IntegerLiteral
- IsFeasible() : AssignmentAndConstraintFeasibilityMaintainer, BopSolution
-- IsFixed() : Domain, CpModelView, IntegerTrail, PresolveContext
+- IsFixed() : Domain, CpModelView, IntegerTrail, PresolveContext
- IsFixedAtLevelZero() : IntegerTrail
- IsFree() : BlossomGraph::Node
- IsFullyEncoded() : PresolveContext
@@ -511,7 +511,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- IsIncludedIn() : Domain
- IsIncoming() : EbertGraph< NodeIndexType, ArcIndexType >, ForwardEbertGraph< NodeIndexType, ArcIndexType >, ForwardStaticGraph< NodeIndexType, ArcIndexType >
- IsInconsistent() : Model
-- IsIncremental() : LocalSearchFilter, TwoOpt, VarLocalSearchOperator< V, Val, Handler >, SwigDirector_BaseLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchFilter, SwigDirector_IntVarLocalSearchOperator, SwigDirector_LocalSearchFilter, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator
+- IsIncremental() : LocalSearchFilter, TwoOpt, VarLocalSearchOperator< V, Val, Handler >, SwigDirector_BaseLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchFilter, SwigDirector_IntVarLocalSearchOperator, SwigDirector_LocalSearchFilter, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator
- IsInEquationForm() : LinearProgram
- IsInfeasible() : ProblemState
- IsInitialized() : AssignmentProto, BopOptimizerMethod, BopParameters, BopSolverOptimizerSet, NonOrderedSetHasher< IntType >, ConstraintRuns, ConstraintSolverParameters, ConstraintSolverStatistics, DemonRuns, FlowArcProto, FlowModelProto, FlowNodeProto, GlopParameters, GScipOutput, GScipParameters, GScipSolvingStats, IntervalVarAssignment, IntVarAssignment, LocalSearchStatistics, LocalSearchStatistics_FirstSolutionStatistics, LocalSearchStatistics_LocalSearchFilterStatistics, LocalSearchStatistics_LocalSearchOperatorStatistics, MPAbsConstraint, MPArrayConstraint, MPArrayWithConstantConstraint, MPConstraintProto, MPGeneralConstraintProto, MPIndicatorConstraint, MPModelDeltaProto, MPModelProto, MPModelRequest, MPQuadraticConstraint, MPQuadraticObjective, MPSolution, MPSolutionResponse, MPSolveInfo, MPSolverCommonParameters, MPSosConstraint, MPVariableProto, OptionalDouble, Item, VectorBinPackingOneBinInSolution, VectorBinPackingProblem, VectorBinPackingSolution, PartialVariableAssignment, RegularLimitParameters, RoutingModelParameters, RoutingSearchParameters, RoutingSearchParameters_ImprovementSearchLimitParameters, RoutingSearchParameters_LocalSearchNeighborhoodOperators, AllDifferentConstraintProto, AutomatonConstraintProto, BoolArgumentProto, BooleanAssignment, CircuitConstraintProto, ConstraintProto, CpModelProto, CpObjectiveProto, CpSolverResponse, CpSolverSolution, CumulativeConstraintProto, DecisionStrategyProto, DecisionStrategyProto_AffineTransformation, DenseMatrixProto, ElementConstraintProto, FloatObjectiveProto, IntegerVariableProto, IntervalConstraintProto, InverseConstraintProto, LinearArgumentProto, LinearBooleanConstraint, LinearBooleanProblem, LinearConstraintProto, LinearExpressionProto, LinearObjective, ListOfVariablesProto, NoOverlap2DConstraintProto, NoOverlapConstraintProto, PartialVariableAssignment, ReservoirConstraintProto, RoutesConstraintProto, SatParameters, SparsePermutationProto, SymmetryProto, TableConstraintProto, CpSolverRequest, AssignedJob, AssignedTask, Job, JobPrecedence, JsspInputProblem, JsspOutputSolution, Machine, Task, TransitionTimeMatrix, PerRecipeDelays, PerSuccessorDelays, RcpspProblem, Recipe, Resource, Task, SearchStatistics, SequenceVarAssignment, WorkerInfo
@@ -586,7 +586,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- item_copies_size() : VectorBinPackingOneBinInSolution
- item_id : KnapsackAssignment, KnapsackAssignmentForCuts
- item_index : ArcFlowGraph::Arc
-- item_indices() : VectorBinPackingOneBinInSolution
+- item_indices() : VectorBinPackingOneBinInSolution
- item_indices_size() : VectorBinPackingOneBinInSolution
- item_size() : VectorBinPackingProblem
- ItemDefaultTypeInternal() : ItemDefaultTypeInternal
diff --git a/docs/cpp/functions_l.html b/docs/cpp/functions_l.html
index 061cbe39bc..e4dc613572 100644
--- a/docs/cpp/functions_l.html
+++ b/docs/cpp/functions_l.html
@@ -219,9 +219,9 @@ $(document).ready(function(){initNavTree('functions_l.html',''); initResizable()
- LiteralIsFalse() : PresolveContext, VariablesAssignment
- LiteralIsTrue() : PresolveContext, VariablesAssignment
- LiteralOrNegationHasView() : IntegerEncoder
-- literals() : BoolArgumentProto, BooleanAssignment, CircuitConstraintProto
+- literals() : BoolArgumentProto, BooleanAssignment, CircuitConstraintProto
- Literals() : CpModelMapping
-- literals : IndexReferences, LinearBooleanConstraint, LinearObjective, RoutesConstraintProto
+- literals : IndexReferences, LinearBooleanConstraint, LinearObjective, RoutesConstraintProto
- literals_size() : BoolArgumentProto, BooleanAssignment, CircuitConstraintProto, LinearBooleanConstraint, LinearObjective, RoutesConstraintProto
- LiteralTrail() : SatSolver
- LiteralWatchers() : LiteralWatchers, SatClause
diff --git a/docs/cpp/functions_m.html b/docs/cpp/functions_m.html
index 3694c7e746..a73186ff39 100644
--- a/docs/cpp/functions_m.html
+++ b/docs/cpp/functions_m.html
@@ -89,13 +89,13 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
Here is a list of all class members with links to the classes they belong to:
- m -
-- Machine() : Machine
+- Machine() : Machine
- machine() : Task
- MACHINE_COUNT_READ : JsspParser
- MACHINE_READ : JsspParser
- machine_size() : Task
- MachineDefaultTypeInternal() : MachineDefaultTypeInternal
-- machines() : JsspInputProblem
+- machines() : JsspInputProblem
- machines_size() : JsspInputProblem
- MainLpPreprocessor() : MainLpPreprocessor
- Maintain() : SearchLog
@@ -110,7 +110,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MAKEACTIVE : Solver
- MakeActiveAndRelocate() : MakeActiveAndRelocate
- MakeActiveOperator() : MakeActiveOperator
-- MakeAllDifferent() : Solver
+- MakeAllDifferent() : Solver
- MakeAllDifferentExcept() : Solver
- MakeAllowedAssignments() : Solver
- MakeAllSolutionCollector() : Solver
@@ -127,7 +127,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MakeBestValueSolutionCollector() : Solver
- MakeBetweenCt() : Solver
- MakeBoolVar() : MPSolver, Solver
-- MakeBoolVarArray() : MPSolver, Solver
+- MakeBoolVarArray() : MPSolver, Solver
- MakeBoxedVariableRelevant() : VariablesInfo
- MakeBranchesLimit() : Solver
- MakeChainInactive() : PathOperator
@@ -145,7 +145,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MakeCount() : Solver
- MakeCover() : Solver
- MakeCString() : JNIUtil
-- MakeCumulative() : Solver
+- MakeCumulative() : Solver
- MakeCustomLimit() : Solver
- MakeDecision() : Solver
- MakeDecisionBuilderFromAssignment() : Solver
@@ -155,7 +155,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MakeDelayedConstraintInitialPropagateCallback() : Solver
- MakeDelayedPathCumul() : Solver
- MakeDeviation() : Solver
-- MakeDifference() : Solver
+- MakeDifference() : Solver
- MakeDisjunctionNodesUnperformed() : RoutingFilteredHeuristic
- MakeDisjunctiveConstraint() : Solver
- MakeDistribute() : Solver
@@ -175,12 +175,12 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MakeFixedDurationEndSyncedOnEndIntervalVar() : Solver
- MakeFixedDurationEndSyncedOnStartIntervalVar() : Solver
- MakeFixedDurationIntervalVar() : Solver
-- MakeFixedDurationIntervalVarArray() : Solver
+- MakeFixedDurationIntervalVarArray() : Solver
- MakeFixedDurationStartSyncedOnEndIntervalVar() : Solver
- MakeFixedDurationStartSyncedOnStartIntervalVar() : Solver
- MakeFixedInterval() : Solver
- MakeGenericTabuSearch() : Solver
-- MakeGreater() : Solver
+- MakeGreater() : Solver
- MakeGreaterOrEqual() : Solver
- MakeGreedyDescentLSOperator() : RoutingModel
- MakeGuidedLocalSearch() : Solver
@@ -202,7 +202,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MakeIntervalVarArray() : Solver
- MakeIntervalVarRelation() : Solver
- MakeIntervalVarRelationWithDelay() : Solver
-- MakeIntVar() : MPSolver, Solver
+- MakeIntVar() : MPSolver, Solver
- MakeIntVarArray() : MPSolver, Solver
- MakeInversePermutationConstraint() : Solver
- MakeIsBetweenCt() : Solver
@@ -232,20 +232,20 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MakeIsLessOrEqualVar() : Solver
- MakeIsLessVar() : Solver
- MakeIsMemberCt() : Solver
-- MakeIsMemberVar() : Solver
+- MakeIsMemberVar() : Solver
- MakeJByteArray() : JNIUtil
- MakeJString() : JNIUtil
- MakeLastSolutionCollector() : Solver
- MakeLess() : Solver
-- MakeLessOrEqual() : Solver
+- MakeLessOrEqual() : Solver
- MakeLexicalLess() : Solver
- MakeLexicalLessOrEqual() : Solver
- MakeLimit() : Solver
- MakeLocalSearchPhase() : Solver
-- MakeLocalSearchPhaseParameters() : Solver
+- MakeLocalSearchPhaseParameters() : Solver
- MakeLubyRestart() : Solver
- MakeMapDomain() : Solver
-- MakeMax() : Solver
+- MakeMax() : Solver
- MakeMaxEquality() : Solver
- MakeMaximize() : Solver
- MakeMemberCt() : Solver
@@ -253,25 +253,25 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MakeMinEquality() : Solver
- MakeMinimize() : Solver
- MakeMirrorInterval() : Solver
-- MakeModulo() : Solver
+- MakeModulo() : Solver
- MakeMonotonicElement() : Solver
- MakeMoveTowardTargetOperator() : Solver
- MakeNBestValueSolutionCollector() : Solver
- MakeNeighbor() : Cross, Exchange, ExchangeSubtrip, ExtendedSwapActiveOperator, IndexPairSwapActiveOperator, LightPairRelocateOperator, LinKernighan, MakeActiveAndRelocate, MakeActiveOperator, MakeChainInactiveOperator, MakeInactiveOperator, MakePairActiveOperator, MakePairInactiveOperator, MakeRelocateNeighborsOperator, PairExchangeOperator, PairExchangeRelocateOperator, PairNodeSwapActiveOperator< swap_first >, PairRelocateOperator, PathLns, PathOperator, Relocate, RelocateAndMakeActiveOperator, RelocateAndMakeInactiveOperator, RelocateExpensiveChain, RelocateSubtrip, SwapActiveOperator, TSPLns, TSPOpt, TwoOpt, SwigDirector_PathOperator
- MakeNeighborhoodLimit() : Solver
-- MakeNestedOptimize() : Solver
-- MakeNextNeighbor() : IndexPairSwapActiveOperator, IntVarLocalSearchOperator, LocalSearchOperator, NeighborhoodLimit, PairNodeSwapActiveOperator< swap_first >, SwapIndexPairOperator, SwigDirector_BaseLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_LocalSearchOperator, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator
+- MakeNestedOptimize() : Solver
+- MakeNextNeighbor() : IndexPairSwapActiveOperator, IntVarLocalSearchOperator, LocalSearchOperator, NeighborhoodLimit, PairNodeSwapActiveOperator< swap_first >, SwapIndexPairOperator, SwigDirector_BaseLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_LocalSearchOperator, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator
- MakeNoCycle() : Solver
- MakeNonEquality() : Solver
- MakeNonOverlappingBoxesConstraint() : Solver
-- MakeNonOverlappingNonStrictBoxesConstraint() : Solver
+- MakeNonOverlappingNonStrictBoxesConstraint() : Solver
- MakeNotBetweenCt() : Solver
-- MakeNotMemberCt() : Solver
+- MakeNotMemberCt() : Solver
- MakeNullIntersect() : Solver
- MakeNullIntersectExcept() : Solver
- MakeNumVar() : MPSolver
- MakeNumVarArray() : MPSolver
-- MakeOneNeighbor() : BaseInactiveNodeToPathOperator, BaseLns, ChangeValue, IntVarLocalSearchOperator, MakePairActiveOperator, PathOperator, RelocateExpensiveChain, TSPLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_PathOperator
+- MakeOneNeighbor() : BaseInactiveNodeToPathOperator, BaseLns, ChangeValue, IntVarLocalSearchOperator, MakePairActiveOperator, PathOperator, RelocateExpensiveChain, TSPLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_PathOperator
- MakeOneNeighborSwigPublic() : SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_PathOperator
- MakeOperator() : Solver
- MakeOpposite() : Solver
@@ -282,37 +282,37 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MakePartiallyPerformedPairsUnperformed() : RoutingFilteredHeuristic
- MakePathConnected() : Solver
- MakePathCumul() : Solver
-- MakePathPrecedenceConstraint() : Solver
+- MakePathPrecedenceConstraint() : Solver
- MakePathSpansAndTotalSlacks() : RoutingModel
- MakePathTransitPrecedenceConstraint() : Solver
-- MakePhase() : Solver
+- MakePhase() : Solver
- MakePiecewiseLinearExpr() : Solver
- MakePower() : Solver
- MakePrintModelVisitor() : Solver
- MakeProd() : Solver
- MakeProfiledDecisionBuilderWrapper() : Solver
-- MakeRandomLnsOperator() : Solver
+- MakeRandomLnsOperator() : Solver
- MakeRankFirstInterval() : Solver
- MakeRankLastInterval() : Solver
- MakeReducedCostsPrecise() : ReducedCosts
- MakeRejectFilter() : Solver
- MakeRelocateNeighborsOperator() : MakeRelocateNeighborsOperator
- MakeRestoreAssignment() : Solver
-- MakeRowConstraint() : MPSolver
+- MakeRowConstraint() : MPSolver
- MakeScalProd() : Solver
- MakeScalProdEquality() : Solver
- MakeScalProdGreaterOrEqual() : Solver
- MakeScalProdLessOrEqual() : Solver
- MakeScheduleOrExpedite() : Solver
- MakeScheduleOrPostpone() : Solver
-- MakeSearchLog() : Solver
+- MakeSearchLog() : Solver
- MakeSearchTrace() : Solver
- MakeSelfDependentDimensionFinalizer() : RoutingModel
- MakeSemiContinuousExpr() : Solver
- MakeSequenceVar() : DisjunctiveConstraint
- MakeSimulatedAnnealing() : Solver
- MakeSolutionsLimit() : Solver
-- MakeSolveOnce() : Solver
+- MakeSolveOnce() : Solver
- MakeSortingConstraint() : Solver
- makespan_cost() : JsspOutputSolution
- makespan_cost_per_time_unit() : JsspInputProblem
@@ -323,14 +323,14 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MakeStoreAssignment() : Solver
- MakeStrictDisjunctiveConstraint() : Solver
- MakeSubCircuit() : Solver
-- MakeSum() : Solver
+- MakeSum() : Solver
- MakeSumEquality() : Solver
- MakeSumGreaterOrEqual() : Solver
- MakeSumLessOrEqual() : Solver
- MakeSumObjectiveFilter() : Solver
-- MakeSymmetryManager() : Solver
+- MakeSymmetryManager() : Solver
- MakeTabuSearch() : Solver
-- MakeTemporalDisjunction() : Solver
+- MakeTemporalDisjunction() : Solver
- MakeTimeLimit() : Solver
- MakeTransitionConstraint() : Solver
- MakeTrueConstraint() : Solver
@@ -343,7 +343,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MakeVariableLessOrEqualValue() : Solver
- MakeWeightedMaximize() : Solver
- MakeWeightedMinimize() : Solver
-- MakeWeightedOptimize() : Solver
+- MakeWeightedOptimize() : Solver
- Map : ConnectedComponentsTypeHelper< T, CompareOrHashT, Eq >, ConnectedComponentsTypeHelper< T, CompareOrHashT, Eq >::SelectContainer< U, V, E >, ConnectedComponentsTypeHelper< T, CompareOrHashT, Eq >::SelectContainer< U, V, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value &&!std::is_same_v< V, void > > >, ConnectedComponentsTypeHelper< T, CompareOrHashT, Eq >::SelectContainer< U, V, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value &&std::is_same_v< V, void > > >
- mapped_type : linked_hash_map< Key, Value, KeyHash, KeyEq, Alloc >, IdMap< K, V >, RevMap< Map >
- mapping_model : PresolveContext
@@ -374,7 +374,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MatrixNonZeroPattern() : MatrixNonZeroPattern
- MatrixOrFunction() : MatrixOrFunction< ScalarType, Evaluator, square >, MatrixOrFunction< ScalarType, std::vector< std::vector< ScalarType > >, square >
- MatrixRow() : ZeroHalfCutHelper
-- MatrixView() : MatrixView
+- MatrixView() : MatrixView
- Max() : Assignment, BooleanVar, DistributionStat, Domain, IntExpr
- max() : IntVarAssignment
- Max() : IntVarElement, LocalSearchVariable, PiecewiseLinearExpr, CpModelView
@@ -434,9 +434,8 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MaxFlow() : MaxFlow
- maximization() : MPObjective
- MAXIMIZATION : Solver
-- Maximize() : Model
- maximize() : Model
-- Maximize() : HungarianOptimizer, Objective
+- Maximize() : Model, HungarianOptimizer, Objective
- maximize() : MPModelProto
- Maximize() : CpModelBuilder
- maximize() : FloatObjectiveProto
@@ -485,7 +484,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- message : CrashReason, JavaExceptionMessage
- message_ : LogMessage::LogMessageData
- message_text_ : LogMessage::LogMessageData
-- MessageCallbackData() : MessageCallbackData
+- MessageCallbackData() : MessageCallbackData
- MessageHandler() : GScipSolverCallbackHandler
- messages : CallbackData
- MetaParamValue : GScipParameters
@@ -523,7 +522,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- minimization() : MPObjective
- MINIMIZATION : Solver
- minimization_algorithm() : SatParameters
-- Minimize() : Model, HungarianOptimizer, Objective, CpModelBuilder
+- Minimize() : Model, HungarianOptimizer, Objective, CpModelBuilder
- minimize_core() : SatParameters
- minimize_reduction_during_pb_resolution() : SatParameters
- minimize_with_propagation_num_decisions() : SatParameters
@@ -575,7 +574,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- modifiable : GScipConstraintOptions, ScipCallbackConstraintOptions
- modified_domains : PresolveContext
- ModifyDecision() : Search
-- ModifyValue() : ChangeValue, SwigDirector_ChangeValue
+- ModifyValue() : ChangeValue, SwigDirector_ChangeValue
- module_pattern : VModuleInfo
- MonoidOperationTree() : MonoidOperationTree< T >
- MoreFixedVariableToClean() : Inprocessing
@@ -590,50 +589,50 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MPAbsConstraintDefaultTypeInternal() : MPAbsConstraintDefaultTypeInternal
- MPArrayConstraint() : MPArrayConstraint
- MPArrayConstraintDefaultTypeInternal() : MPArrayConstraintDefaultTypeInternal
-- MPArrayWithConstantConstraint() : MPArrayWithConstantConstraint
+- MPArrayWithConstantConstraint() : MPArrayWithConstantConstraint
- MPArrayWithConstantConstraintDefaultTypeInternal() : MPArrayWithConstantConstraintDefaultTypeInternal
- MPCallback() : MPCallback
- MPCallbackList() : MPCallbackList
- MPConstraint() : MPConstraint, MPSolverInterface
-- MPConstraintProto() : MPConstraintProto
+- MPConstraintProto() : MPConstraintProto
- MPConstraintProtoDefaultTypeInternal() : MPConstraintProtoDefaultTypeInternal
-- MPGeneralConstraintProto() : MPGeneralConstraintProto
+- MPGeneralConstraintProto() : MPGeneralConstraintProto
- MPGeneralConstraintProtoDefaultTypeInternal() : MPGeneralConstraintProtoDefaultTypeInternal
- MPIndicatorConstraint() : MPIndicatorConstraint
- MPIndicatorConstraintDefaultTypeInternal() : MPIndicatorConstraintDefaultTypeInternal
- mpm_time() : RcpspProblem
-- MPModelDeltaProto() : MPModelDeltaProto
+- MPModelDeltaProto() : MPModelDeltaProto
- MPModelDeltaProto_ConstraintOverridesEntry_DoNotUse() : MPModelDeltaProto_ConstraintOverridesEntry_DoNotUse
- MPModelDeltaProto_ConstraintOverridesEntry_DoNotUseDefaultTypeInternal() : MPModelDeltaProto_ConstraintOverridesEntry_DoNotUseDefaultTypeInternal
-- MPModelDeltaProto_VariableOverridesEntry_DoNotUse() : MPModelDeltaProto_VariableOverridesEntry_DoNotUse
+- MPModelDeltaProto_VariableOverridesEntry_DoNotUse() : MPModelDeltaProto_VariableOverridesEntry_DoNotUse
- MPModelDeltaProto_VariableOverridesEntry_DoNotUseDefaultTypeInternal() : MPModelDeltaProto_VariableOverridesEntry_DoNotUseDefaultTypeInternal
- MPModelDeltaProtoDefaultTypeInternal() : MPModelDeltaProtoDefaultTypeInternal
- MPModelExportOptions() : MPModelExportOptions
-- MPModelProto() : MPModelProto
+- MPModelProto() : MPModelProto
- MPModelProtoDefaultTypeInternal() : MPModelProtoDefaultTypeInternal
- MPModelRequest() : MPModelRequest
- MPModelRequestDefaultTypeInternal() : MPModelRequestDefaultTypeInternal
- MPObjective : MPSolverInterface
- MPQuadraticConstraint() : MPQuadraticConstraint
- MPQuadraticConstraintDefaultTypeInternal() : MPQuadraticConstraintDefaultTypeInternal
-- MPQuadraticObjective() : MPQuadraticObjective
+- MPQuadraticObjective() : MPQuadraticObjective
- MPQuadraticObjectiveDefaultTypeInternal() : MPQuadraticObjectiveDefaultTypeInternal
-- MPSolution() : MPSolution
+- MPSolution() : MPSolution
- MPSolutionDefaultTypeInternal() : MPSolutionDefaultTypeInternal
- MPSolutionResponse() : MPSolutionResponse
- MPSolutionResponseDefaultTypeInternal() : MPSolutionResponseDefaultTypeInternal
- MPSolveInfo() : MPSolveInfo
- MPSolveInfoDefaultTypeInternal() : MPSolveInfoDefaultTypeInternal
- MPSolver : MPConstraint, MPObjective, MPSolver, MPSolverInterface, MPVariable
-- MPSolverCommonParameters() : MPSolverCommonParameters
+- MPSolverCommonParameters() : MPSolverCommonParameters
- MPSolverCommonParametersDefaultTypeInternal() : MPSolverCommonParametersDefaultTypeInternal
- MPSolverInterface : MPConstraint, MPObjective, MPSolver, MPSolverInterface, MPVariable
- MPSolverParameters() : MPSolverParameters
-- MPSosConstraint() : MPSosConstraint
+- MPSosConstraint() : MPSosConstraint
- MPSosConstraintDefaultTypeInternal() : MPSosConstraintDefaultTypeInternal
- MPSReaderImpl() : MPSReaderImpl
- MPVariable() : MPVariable
-- MPVariableProto() : MPVariableProto
+- MPVariableProto() : MPVariableProto
- MPVariableProtoDefaultTypeInternal() : MPVariableProtoDefaultTypeInternal
- MPVariableSolutionValueTest : MPVariable
- multi_armed_bandit_compound_operator_exploration_coefficient() : RoutingSearchParameters
@@ -651,7 +650,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- Mutable() : Model
- mutable_abs_constraint() : MPGeneralConstraintProto
- mutable_active_literals() : ReservoirConstraintProto
-- mutable_additional_solutions() : MPSolutionResponse, CpSolverResponse
+- mutable_additional_solutions() : MPSolutionResponse, CpSolverResponse
- mutable_all_diff() : ConstraintProto
- mutable_and_constraint() : MPGeneralConstraintProto
- mutable_arcs() : FlowModelProto
@@ -662,7 +661,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- mutable_backward_sequence() : SequenceVarAssignment
- mutable_basedata() : RcpspProblem
- mutable_baseline_model_file_path() : MPModelDeltaProto
-- mutable_bins() : VectorBinPackingSolution
+- mutable_bins() : VectorBinPackingSolution
- mutable_bns() : WorkerInfo
- mutable_bool_and() : ConstraintProto
- mutable_bool_or() : ConstraintProto
@@ -676,13 +675,13 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- mutable_coefficients() : LinearBooleanConstraint, LinearObjective
- mutable_coeffs() : CpObjectiveProto, FloatObjectiveProto, LinearConstraintProto, LinearExpressionProto
- mutable_column() : SparseMatrix, SparseMatrixWithReusableColumnMemory
-- mutable_constraint() : MPIndicatorConstraint, MPModelProto
+- mutable_constraint() : MPIndicatorConstraint, MPModelProto
- mutable_constraint_id() : ConstraintRuns
- mutable_constraint_lower_bounds() : LinearProgram
- mutable_constraint_overrides() : MPModelDeltaProto
- mutable_constraint_solver_statistics() : SearchStatistics
- mutable_constraint_upper_bounds() : LinearProgram
-- mutable_constraints() : CpModelProto, LinearBooleanProblem
+- mutable_constraints() : CpModelProto, LinearBooleanProblem
- mutable_cost() : Task
- mutable_cumulative() : ConstraintProto
- mutable_cut() : CoverCutHelper
@@ -705,14 +704,14 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- mutable_enforcement_literal() : ConstraintProto
- mutable_entries() : DenseMatrixProto
- mutable_exactly_one() : ConstraintProto
-- mutable_exprs() : AllDifferentConstraintProto, LinearArgumentProto
+- mutable_exprs() : AllDifferentConstraintProto, LinearArgumentProto
- mutable_f_direct() : InverseConstraintProto
- mutable_f_inverse() : InverseConstraintProto
- mutable_final_states() : AutomatonConstraintProto
- mutable_first_solution_statistics() : LocalSearchStatistics
- mutable_floating_point_objective() : CpModelProto
- mutable_forward_sequence() : SequenceVarAssignment
-- mutable_general_constraint() : MPModelProto
+- mutable_general_constraint() : MPModelProto
- mutable_get() : StrongVector< IntType, T, Alloc >
- mutable_heads() : CircuitConstraintProto, RoutesConstraintProto
- mutable_improvement_limit_parameters() : RoutingSearchParameters
@@ -729,7 +728,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- mutable_interval_var_assignment() : AssignmentProto
- mutable_intervals() : CumulativeConstraintProto, NoOverlapConstraintProto
- mutable_inverse() : ConstraintProto
-- mutable_item() : VectorBinPackingProblem
+- mutable_item() : VectorBinPackingProblem
- mutable_item_copies() : VectorBinPackingOneBinInSolution
- mutable_item_indices() : VectorBinPackingOneBinInSolution
- mutable_jobs() : JsspInputProblem, JsspOutputSolution
@@ -742,14 +741,14 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- mutable_local_search_filter() : LocalSearchStatistics_LocalSearchFilterStatistics
- mutable_local_search_filter_statistics() : LocalSearchStatistics
- mutable_local_search_operator() : LocalSearchStatistics_LocalSearchOperatorStatistics
-- mutable_local_search_operator_statistics() : LocalSearchStatistics
+- mutable_local_search_operator_statistics() : LocalSearchStatistics
- mutable_local_search_operators() : RoutingSearchParameters
- mutable_local_search_statistics() : SearchStatistics
- mutable_log_prefix() : SatParameters
- mutable_log_tag() : RoutingSearchParameters
- mutable_long_params() : GScipParameters
- mutable_machine() : Task
-- mutable_machines() : JsspInputProblem
+- mutable_machines() : JsspInputProblem
- mutable_max_constraint() : MPGeneralConstraintProto
- mutable_methods() : BopSolverOptimizerSet
- mutable_min_constraint() : MPGeneralConstraintProto
@@ -762,7 +761,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- mutable_nodes() : FlowModelProto
- mutable_objective() : AssignmentProto, CpModelProto, LinearBooleanProblem
- mutable_or_constraint() : MPGeneralConstraintProto
-- mutable_orbitopes() : SymmetryProto
+- mutable_orbitopes() : SymmetryProto
- mutable_output() : Model
- mutable_parameters_as_string() : CpSolverRequest
- mutable_permutations() : SymmetryProto
@@ -847,7 +846,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- mutable_y_intervals() : NoOverlap2DConstraintProto
- MutableCoefficient() : SparseVector< IndexType, IteratorType >
- MutableConflict() : Trail
-- MutableElement() : AssignmentContainer< V, E >
+- MutableElement() : AssignmentContainer< V, E >
- MutableElementOrNull() : AssignmentContainer< V, E >
- MutableIndex() : SparseVector< IndexType, IteratorType >
- MutableIntegerReason() : SchedulingConstraintHelper
@@ -857,7 +856,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- MutableLiteralReason() : SchedulingConstraintHelper
- MutableObjective() : MPSolver
- MutablePreAssignment() : RoutingModel
-- MutableProto() : Constraint, CpModelBuilder, IntervalVar, IntVar
+- MutableProto() : Constraint, CpModelBuilder
- MutableRef() : RevVector< IndexType, T >
- MutableResponse() : SharedResponseManager
- MutableSequenceVarContainer() : Assignment
diff --git a/docs/cpp/functions_n.html b/docs/cpp/functions_n.html
index ba7fd13792..2454e6edb2 100644
--- a/docs/cpp/functions_n.html
+++ b/docs/cpp/functions_n.html
@@ -96,12 +96,12 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
- name() : MPVariable, MPVariableProto, Item, VectorBinPackingProblem, PiecewiseLinearExpr, ProfiledDecisionBuilder, PropagationBaseObject, RoutingDimension
- Name() : BoolVar, Constraint
- name() : ConstraintProto, CpModelProto, IntegerVariableProto
-- Name() : IntervalVar, IntVar
+- Name() : IntervalVar, IntVar
- name() : LinearBooleanConstraint, LinearBooleanProblem
- Name() : Model
- name() : NeighborhoodGenerator, SatParameters, SubSolver, Job, JsspInputProblem, Machine, RcpspProblem, ScipConstraintHandlerDescription
- Name() : Stat
-- name : swig_const_info, swig_globalvar, swig_type_info, SwigDirector_Constraint, SwigDirector_PropagationBaseObject
+- name : swig_const_info, swig_globalvar, swig_type_info, SwigDirector_Constraint, SwigDirector_PropagationBaseObject
- name_ : BopOptimizerBase, NeighborhoodGenerator, SatPropagator, SubSolver
- name_all_variables() : ConstraintSolverParameters
- name_cast_variables() : ConstraintSolverParameters
@@ -148,14 +148,14 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
- NewOptionalIntervalVar() : CpModelBuilder
- newraw : SwigPyClientData
- NewRelaxationSolution() : SharedRelaxationSolutionRepository
-- NewSearch() : Solver
+- NewSearch() : Solver
- NewSolution() : SharedResponseManager
- NewString() : CheckOpMessageBuilder
- NewUpdateTracker() : IndexedModel
- next : VModuleInfo
- Next() : Bitset64< IndexType >::Iterator, DecisionBuilder, DenseDoublyLinkedList, EbertGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator, EbertGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator, FindOneNeighbor, HeldWolfeCrowderEvaluator< CostType, CostFunction >, IntVarFilteredDecisionBuilder, IntVarIterator, LinearSumAssignment< GraphType >::BipartiteLeftNodeIterator, PathOperator, ProfiledDecisionBuilder, RoutingModel, SequenceVar, StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::ArcIterator, StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::NodeIterator, StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::OutgoingArcIterator, VolgenantJonkerEvaluator< CostType >
- next : swig_cast_info, swig_globalvar, swig_module_info
-- Next() : SwigDirector_DecisionBuilder
+- Next() : SwigDirector_DecisionBuilder
- next : SwigPyObject
- Next() : CompleteBipartiteGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator, ListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator, ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator, ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator, ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator, ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator, ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator, ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator, ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator, ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator, ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator, ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator, ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator, StaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
- next_adjacent_arc_ : EbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >
@@ -169,7 +169,7 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
- NextAssignment() : LocalSearchAssignmentIterator
- NextBranch() : SatDecisionPolicy
- NextClauseToMinimize() : LiteralWatchers
-- NextFragment() : BaseLns, SwigDirector_BaseLns
+- NextFragment() : BaseLns, SwigDirector_BaseLns
- NextNode() : StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >
- NextOutgoingArc() : EbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >, ForwardStaticGraph< NodeIndexType, ArcIndexType >
- NextRepairingTerm() : OneFlipConstraintRepairer
@@ -208,7 +208,7 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
- NodeIterator() : StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::NodeIterator
- NodeRange : PathState::NodeRange::Iterator, PathState::NodeRange
- NodeReservation() : Graphs< Graph >, Graphs< operations_research::StarGraph >
-- nodes() : BopInterface, CBCInterface, CLPInterface, FlowModelProto, GLOPInterface, GurobiInterface, MPSolver, MPSolverInterface, ArcFlowGraph
+- nodes() : BopInterface, CBCInterface, CLPInterface, FlowModelProto, GLOPInterface, GurobiInterface, MPSolver, MPSolverInterface, ArcFlowGraph
- Nodes() : PathState
- nodes() : RoutingModel, SatInterface, SCIPInterface
- nodes_size() : FlowModelProto
diff --git a/docs/cpp/functions_o.html b/docs/cpp/functions_o.html
index 61ccd91bdc..18a1147711 100644
--- a/docs/cpp/functions_o.html
+++ b/docs/cpp/functions_o.html
@@ -130,8 +130,8 @@ $(document).ready(function(){initNavTree('functions_o.html',''); initResizable()
- OffsetDelta() : LatticeMemoryManager< Set, CostType >
- offsets() : ShiftVariableBoundsPreprocessor, TableStruct_ortools_2fbop_2fbop_5fparameters_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fassignment_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fdemon_5fprofiler_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fenums_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fsearch_5flimit_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fsearch_5fstats_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fsolver_5fparameters_2eproto, TableStruct_ortools_2fglop_2fparameters_2eproto, TableStruct_ortools_2fgraph_2fflow_5fproblem_2eproto, TableStruct_ortools_2fgscip_2fgscip_2eproto, TableStruct_ortools_2flinear_5fsolver_2flinear_5fsolver_2eproto, TableStruct_ortools_2fpacking_2fvector_5fbin_5fpacking_2eproto, TableStruct_ortools_2fsat_2fboolean_5fproblem_2eproto, TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto, TableStruct_ortools_2fsat_2fcp_5fmodel_5fservice_2eproto, TableStruct_ortools_2fsat_2fsat_5fparameters_2eproto, TableStruct_ortools_2fscheduling_2fjobshop_5fscheduling_2eproto, TableStruct_ortools_2fscheduling_2frcpsp_2eproto, TableStruct_ortools_2futil_2foptional_5fboolean_2eproto
- Ok() : Bitset64< IndexType >::Iterator, EbertGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator, EbertGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator
-- ok() : Status
- OK() : Status
+- ok() : Status
- Ok() : IntVarIterator, LinearSumAssignment< GraphType >::BipartiteLeftNodeIterator
- ok() : SimpleRevFIFO< T >::Iterator
- Ok() : StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::ArcIterator, StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::NodeIterator, StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::OutgoingArcIterator, CompleteBipartiteGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator, ListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator, ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator, ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator, ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator, ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator, ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator, ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator, ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator, ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator, ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator, ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator, ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator, StaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
diff --git a/docs/cpp/functions_p.html b/docs/cpp/functions_p.html
index 32468dad57..738cf9543a 100644
--- a/docs/cpp/functions_p.html
+++ b/docs/cpp/functions_p.html
@@ -117,7 +117,7 @@ $(document).ready(function(){initNavTree('functions_p.html',''); initResizable()
- PARSING_ERROR : JsspParser
- PartialDomainEncoding() : IntegerEncoder
- PartialGreaterThanEncoding() : IntegerEncoder
-- PartialVariableAssignment() : PartialVariableAssignment
+- PartialVariableAssignment() : PartialVariableAssignment
- PartialVariableAssignmentDefaultTypeInternal() : PartialVariableAssignmentDefaultTypeInternal
- PartOf() : DynamicPartition
- PatchNumber() : OrToolsVersion
@@ -263,7 +263,7 @@ $(document).ready(function(){initNavTree('functions_p.html',''); initResizable()
- preserved_errno_ : LogMessage::LogMessageData
- presolve() : GScipParameters, MPSolverCommonParameters
- PRESOLVE : MPSolverParameters
-- Presolve() : CpModelPresolver, SatPresolver
+- Presolve() : CpModelPresolver, SatPresolver
- presolve_blocked_clause() : SatParameters
- presolve_bva_threshold() : SatParameters
- presolve_bve_clause_weight() : SatParameters
@@ -368,7 +368,7 @@ $(document).ready(function(){initNavTree('functions_p.html',''); initResizable()
- ProgressPercent() : RegularLimit, Search, SearchMonitor, SwigDirector_OptimizeVar, SwigDirector_RegularLimit, SwigDirector_SearchLimit, SwigDirector_SearchMonitor, SwigDirector_SolutionCollector
- Propagate() : Dimension, DisjunctivePropagator
- propagate : GScipConstraintOptions
-- Propagate() : Pack, AllDifferentBoundsPropagator, AllDifferentConstraint, BinaryImplicationGraph, BooleanXorPropagator, CircuitCoveringPropagator, CircuitPropagator, CombinedDisjunctive< time_direction >, CumulativeEnergyConstraint, CumulativeIsAfterSubsetConstraint, DisjunctiveDetectablePrecedences, DisjunctiveEdgeFinding, DisjunctiveNotLast, DisjunctiveOverloadChecker, DisjunctivePrecedences, DisjunctiveWithTwoItems, DivisionPropagator, FixedDivisionPropagator, FixedModuloPropagator, GenericLiteralWatcher, GreaterThanAtLeastOneOfPropagator, IntegerSumLE, IntegerTrail, LevelZeroEquality, LinearProgrammingConstraint, LinMinPropagator, LiteralWatchers, MinPropagator, NonOverlappingRectanglesDisjunctivePropagator, NonOverlappingRectanglesEnergyPropagator, PbConstraints, PrecedencesPropagator, ProductPropagator, PropagatorInterface, ReservoirTimeTabling, SatPropagator, SatSolver, SchedulingConstraintHelper, SelectedMinPropagator, SquarePropagator, SymmetryPropagator, TimeTableEdgeFinding, TimeTablingPerTask, UpperBoundedLinearConstraint
+- Propagate() : Pack, AllDifferentBoundsPropagator, AllDifferentConstraint, BinaryImplicationGraph, BooleanXorPropagator, CircuitCoveringPropagator, CircuitPropagator, CombinedDisjunctive< time_direction >, CumulativeEnergyConstraint, CumulativeIsAfterSubsetConstraint, DisjunctiveDetectablePrecedences, DisjunctiveEdgeFinding, DisjunctiveNotLast, DisjunctiveOverloadChecker, DisjunctivePrecedences, DisjunctiveWithTwoItems, DivisionPropagator, FixedDivisionPropagator, FixedModuloPropagator, GenericLiteralWatcher, GreaterThanAtLeastOneOfPropagator, IntegerSumLE, IntegerTrail, LevelZeroEquality, LinearProgrammingConstraint, LinMinPropagator, LiteralWatchers, MinPropagator, NonOverlappingRectanglesDisjunctivePropagator, NonOverlappingRectanglesEnergyPropagator, PbConstraints, PrecedencesPropagator, ProductPropagator, PropagatorInterface, ReservoirTimeTabling, SatPropagator, SatSolver, SchedulingConstraintHelper, SelectedMinPropagator, SquarePropagator, SymmetryPropagator, TimeTableEdgeFinding, TimeTablingPerTask, UpperBoundedLinearConstraint
- propagate : ScipCallbackConstraintOptions
- PropagateAffineRelation() : PresolveContext
- PropagateAtLevelZero() : IntegerSumLE
@@ -395,9 +395,9 @@ $(document).ready(function(){initNavTree('functions_p.html',''); initResizable()
- PROTECTION_ALWAYS : SatParameters
- PROTECTION_LBD : SatParameters
- PROTECTION_NONE : SatParameters
-- Proto() : CallbackRegistration, CallbackResult, MapFilter< KeyType >, ModelSolveParameters, Constraint, CpModelBuilder, IntervalVar, IntVar
+- Proto() : CallbackRegistration, CallbackResult, MapFilter< KeyType >, ModelSolveParameters, Constraint, CpModelBuilder
- proto_ : Constraint
-- PROTOBUF_SECTION_VARIABLE() : TableStruct_ortools_2fbop_2fbop_5fparameters_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fassignment_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fdemon_5fprofiler_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fenums_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fsearch_5flimit_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fsearch_5fstats_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fsolver_5fparameters_2eproto, TableStruct_ortools_2fglop_2fparameters_2eproto, TableStruct_ortools_2fgraph_2fflow_5fproblem_2eproto, TableStruct_ortools_2fgscip_2fgscip_2eproto, TableStruct_ortools_2flinear_5fsolver_2flinear_5fsolver_2eproto, TableStruct_ortools_2fpacking_2fvector_5fbin_5fpacking_2eproto, TableStruct_ortools_2fsat_2fboolean_5fproblem_2eproto, TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto, TableStruct_ortools_2fsat_2fcp_5fmodel_5fservice_2eproto, TableStruct_ortools_2fsat_2fsat_5fparameters_2eproto, TableStruct_ortools_2fscheduling_2fjobshop_5fscheduling_2eproto, TableStruct_ortools_2fscheduling_2frcpsp_2eproto, TableStruct_ortools_2futil_2foptional_5fboolean_2eproto
+- PROTOBUF_SECTION_VARIABLE() : TableStruct_ortools_2fbop_2fbop_5fparameters_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fassignment_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fdemon_5fprofiler_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fenums_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fsearch_5flimit_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fsearch_5fstats_2eproto, TableStruct_ortools_2fconstraint_5fsolver_2fsolver_5fparameters_2eproto, TableStruct_ortools_2fglop_2fparameters_2eproto, TableStruct_ortools_2fgraph_2fflow_5fproblem_2eproto, TableStruct_ortools_2fgscip_2fgscip_2eproto, TableStruct_ortools_2flinear_5fsolver_2flinear_5fsolver_2eproto, TableStruct_ortools_2fpacking_2fvector_5fbin_5fpacking_2eproto, TableStruct_ortools_2fsat_2fboolean_5fproblem_2eproto, TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto, TableStruct_ortools_2fsat_2fcp_5fmodel_5fservice_2eproto, TableStruct_ortools_2fsat_2fsat_5fparameters_2eproto, TableStruct_ortools_2fscheduling_2fjobshop_5fscheduling_2eproto, TableStruct_ortools_2fscheduling_2frcpsp_2eproto, TableStruct_ortools_2futil_2foptional_5fboolean_2eproto
- prototype_ : SolutionCollector
- provide_strong_optimal_guarantee() : GlopParameters
- prune_search_tree() : BopParameters
diff --git a/docs/cpp/functions_r.html b/docs/cpp/functions_r.html
index 50856bf9e9..4dc1f1f5e3 100644
--- a/docs/cpp/functions_r.html
+++ b/docs/cpp/functions_r.html
@@ -418,7 +418,7 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
- ReservoirConstraintProto() : ReservoirConstraintProto
- ReservoirConstraintProtoDefaultTypeInternal() : ReservoirConstraintProtoDefaultTypeInternal
- ReservoirTimeTabling() : ReservoirTimeTabling
-- Reset() : AdaptiveParameterValue, LubyAdaptiveParameterValue, BopInterface, CBCInterface, CLPInterface, DistributionStat, DynamicPermutation, ColumnPriorityQueue, CompactSparseMatrix, MatrixNonZeroPattern, SparseMatrixWithReusableColumnMemory, TriangularMatrix, GLOPInterface, GurobiInterface, IntervalVarElement, IntVarElement, LocalSearchFilter, LocalSearchOperator, MatrixOrFunction< ScalarType, Evaluator, square >, MatrixOrFunction< ScalarType, std::vector< std::vector< ScalarType > >, square >, MergingPartition, MinCostPerfectMatching, MonoidOperationTree< T >, MPSolver, MPSolverInterface, MPSolverParameters, PathOperator, RunningAverage, DualBoundStrengthening, IncrementalAverage, RestartPolicy, ThetaLambdaTree< IntegerType >, VarDomination, ZeroHalfCutHelper, SatInterface, SCIPInterface, SequenceVarElement, Stat, StatsGroup, VectorOrFunction< ScalarType, Evaluator >, VectorOrFunction< ScalarType, std::vector< ScalarType > >, VehicleTypeCurator, SwigDirector_BaseLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchFilter, SwigDirector_IntVarLocalSearchOperator, SwigDirector_LocalSearchFilter, SwigDirector_LocalSearchOperator, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator, WallTimer
+- Reset() : AdaptiveParameterValue, LubyAdaptiveParameterValue, BopInterface, CBCInterface, CLPInterface, DistributionStat, DynamicPermutation, ColumnPriorityQueue, CompactSparseMatrix, MatrixNonZeroPattern, SparseMatrixWithReusableColumnMemory, TriangularMatrix, GLOPInterface, GurobiInterface, IntervalVarElement, IntVarElement, LocalSearchFilter, LocalSearchOperator, MatrixOrFunction< ScalarType, Evaluator, square >, MatrixOrFunction< ScalarType, std::vector< std::vector< ScalarType > >, square >, MergingPartition, MinCostPerfectMatching, MonoidOperationTree< T >, MPSolver, MPSolverInterface, MPSolverParameters, PathOperator, RunningAverage, DualBoundStrengthening, IncrementalAverage, RestartPolicy, ThetaLambdaTree< IntegerType >, VarDomination, ZeroHalfCutHelper, SatInterface, SCIPInterface, SequenceVarElement, Stat, StatsGroup, VectorOrFunction< ScalarType, Evaluator >, VectorOrFunction< ScalarType, std::vector< ScalarType > >, VehicleTypeCurator, SwigDirector_BaseLns, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchFilter, SwigDirector_IntVarLocalSearchOperator, SwigDirector_LocalSearchFilter, SwigDirector_LocalSearchOperator, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator, WallTimer
- reset_action_on_fail() : PropagationBaseObject, Queue
- ResetAllNonBasicVariableValues() : VariableValues
- ResetAndSolveWithGivenAssumptions() : SatSolver
@@ -440,21 +440,21 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
- ResetVehicleIndices() : RoutingFilteredHeuristic
- ResetWithGivenAssumptions() : SatSolver
- residual_arc_capacity_ : GenericMaxFlow< Graph >
-- resize() : StrongVector< IntType, T, Alloc >
+- resize() : StrongVector< IntType, T, Alloc >
- Resize() : AssignmentContainer< V, E >, Bitmap, Bitset64< IndexType >
- resize() : Permutation< IndexType >
- Resize() : RandomAccessSparseColumn
-- resize() : StrictITIVector< IntType, T >
+- resize() : StrictITIVector< IntType, T >
- Resize() : BinaryImplicationGraph, LiteralWatchers, PbConstraints, Trail, VariablesAssignment, VariableWithSameReasonIdentifier, SparseBitset< IntegerType >
- resize() : SVector< T >
- resize_down() : StrictITIVector< IntType, T >
- ResizeDown() : SparseVector< IndexType, IteratorType >
- ResizeOnNewRows() : DualEdgeNorms
- ResolvePBConflict() : UpperBoundedLinearConstraint
-- Resource() : Resource
+- Resource() : Resource
- resource_capacity() : VectorBinPackingProblem
- resource_capacity_size() : VectorBinPackingProblem
-- resource_name() : VectorBinPackingProblem
+- resource_name() : VectorBinPackingProblem
- resource_name_size() : VectorBinPackingProblem
- resource_usage() : Item
- resource_usage_size() : Item
@@ -462,7 +462,7 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
- ResourceDefaultTypeInternal() : ResourceDefaultTypeInternal
- ResourceGroup : RoutingModel::ResourceGroup::Resource, RoutingModel::ResourceGroup
- ResourceGroup::Resource : RoutingModel
-- resources() : RcpspProblem, Recipe
+- resources() : RcpspProblem, Recipe
- resources_size() : RcpspProblem, Recipe
- ResourceVar() : RoutingModel
- ResourceVars() : RoutingModel
diff --git a/docs/cpp/functions_s.html b/docs/cpp/functions_s.html
index 2d066738c9..741cfc80b8 100644
--- a/docs/cpp/functions_s.html
+++ b/docs/cpp/functions_s.html
@@ -1406,13 +1406,13 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
- SetLpAlgorithm() : BopInterface, GLOPInterface, MPSolverInterface, SatInterface
- SetMainObjectiveVariable() : LinearProgrammingConstraint
- SetMatchingAlgorithm() : ChristofidesPathSolver< CostType, ArcIndex, NodeIndex, CostFunction >
-- SetMax() : Assignment, BooleanVar, DemonProfiler, IntExpr, IntVarElement, LocalSearchVariable, PiecewiseLinearExpr, PropagationMonitor, Trace
+- SetMax() : Assignment, BooleanVar, DemonProfiler, IntExpr, IntVarElement, LocalSearchVariable, PiecewiseLinearExpr, PropagationMonitor, Trace
- SetMaxFPIterations() : FeasibilityPump
- SetMaximization() : MPObjective
- SetMaximizationProblem() : LinearProgram
- SetMaximize() : GScip
- SetMaximumNumberOfActiveVehicles() : RoutingModel
-- SetMin() : Assignment, BooleanVar, DemonProfiler, IntExpr, IntVarElement, LocalSearchVariable, PiecewiseLinearExpr, PropagationMonitor, Trace
+- SetMin() : Assignment, BooleanVar, DemonProfiler, IntExpr, IntVarElement, LocalSearchVariable, PiecewiseLinearExpr, PropagationMonitor, Trace
- SetMinimization() : MPObjective
- SetMIPParameters() : MPSolverInterface
- SetName() : DataWrapper< LinearProgram >, DataWrapper< MPModelProto >, LinearProgram, CpModelBuilder
@@ -1464,7 +1464,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
- SetPropagatorPriority() : GenericLiteralWatcher
- SetQuadraticCostSoftSpanUpperBoundForVehicle() : RoutingDimension
- SetQueueCapacity() : ThreadPool
-- SetRange() : Assignment, BooleanVar, DemonProfiler, IntExpr, IntVarElement, PiecewiseLinearExpr, PropagationMonitor, Trace
+- SetRange() : Assignment, BooleanVar, DemonProfiler, IntExpr, IntVarElement, PiecewiseLinearExpr, PropagationMonitor, Trace
- SetRangeIterator() : SetRangeIterator< SetRange >
- SetRangeWithCardinality() : SetRangeWithCardinality< Set >
- SetReferenceSolution() : AssignmentAndConstraintFeasibilityMaintainer
@@ -1570,8 +1570,8 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
- Singleton() : Set< Integer >
- SINGLETON_COLUMN_IN_EQUALITY : SingletonUndo
- SINGLETON_ROW : SingletonUndo
-- SingletonColumnSignPreprocessor() : SingletonColumnSignPreprocessor
-- SingletonPreprocessor() : SingletonPreprocessor
+- SingletonColumnSignPreprocessor() : SingletonColumnSignPreprocessor
+- SingletonPreprocessor() : SingletonPreprocessor
- SingletonRank() : Set< Integer >
- SingletonUndo() : SingletonUndo
- SingleVariable() : SolutionOutputSpecs
@@ -1614,7 +1614,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
- SizeVar() : IntervalsRepository
- skip_locally_optimal_paths() : ConstraintSolverParameters, PathOperator::IterationParameters
- skip_zero_values : MapFilter< KeyType >
-- SkipUnchanged() : PathOperator, VarLocalSearchOperator< V, Val, Handler >, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator
+- SkipUnchanged() : PathOperator, VarLocalSearchOperator< V, Val, Handler >, SwigDirector_ChangeValue, SwigDirector_IntVarLocalSearchOperator, SwigDirector_PathOperator, SwigDirector_SequenceVarLocalSearchOperator
- slack : BlossomGraph::Edge
- Slack() : BlossomGraph
- slack : ZeroHalfCutHelper::CombinationOfRows
@@ -1658,7 +1658,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
- solutions : GScipResult, RegularLimit, RegularLimitParameters, Solver
- SolutionsRepository() : SharedResponseManager
- SolutionValue() : LinearExpr
-- Solve() : BaseKnapsackSolver, BopSolver, IntegralSolver, BopInterface, CBCInterface, ChristofidesPathSolver< CostType, ArcIndex, NodeIndex, CostFunction >, CLPInterface, GenericMaxFlow< Graph >, GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >, LPSolver, RevisedSimplex, GLOPInterface, GScip, GurobiInterface, Knapsack64ItemsSolver, KnapsackBruteForceSolver, KnapsackDivideAndConquerSolver, KnapsackDynamicProgrammingSolver, KnapsackGenericSolver, KnapsackMIPSolver, KnapsackSolver, KnapsackSolverForCuts, CpSatSolver, GlopSolver, GScipSolver, GurobiSolver, MathOpt, Solver, SolverInterface, MinCostPerfectMatching, MPSolver, MPSolverInterface, RoutingCPSatWrapper, RoutingGlopWrapper, RoutingLinearSolverWrapper, RoutingModel, FeasibilityPump, SatSolver, SatInterface, SCIPInterface, SimpleLinearSumAssignment, SimpleMaxFlow, SimpleMinCostFlow, Solver
+- Solve() : BaseKnapsackSolver, BopSolver, IntegralSolver, BopInterface, CBCInterface, ChristofidesPathSolver< CostType, ArcIndex, NodeIndex, CostFunction >, CLPInterface, GenericMaxFlow< Graph >, GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >, LPSolver, RevisedSimplex, GLOPInterface, GScip, GurobiInterface, Knapsack64ItemsSolver, KnapsackBruteForceSolver, KnapsackDivideAndConquerSolver, KnapsackDynamicProgrammingSolver, KnapsackGenericSolver, KnapsackMIPSolver, KnapsackSolver, KnapsackSolverForCuts, CpSatSolver, GlopSolver, GScipSolver, GurobiSolver, MathOpt, Solver, SolverInterface, MinCostPerfectMatching, MPSolver, MPSolverInterface, RoutingCPSatWrapper, RoutingGlopWrapper, RoutingLinearSolverWrapper, RoutingModel, FeasibilityPump, SatSolver, SatInterface, SCIPInterface, SimpleLinearSumAssignment, SimpleMaxFlow, SimpleMinCostFlow, Solver
- solve_dual_problem() : GlopParameters
- solve_info() : MPSolutionResponse::_Internal, MPSolutionResponse
- solve_log() : CpSolverResponse
@@ -1667,7 +1667,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
- solve_time_in_seconds() : VectorBinPackingSolution
- solve_user_time_seconds() : MPSolveInfo
- solve_wall_time_seconds() : MPSolveInfo
-- SolveAndCommit() : Solver
+- SolveAndCommit() : Solver
- SolveDepth() : Solver
- SolveFromAssignmentsWithParameters() : RoutingModel
- SolveFromAssignmentWithParameters() : RoutingModel
@@ -1677,7 +1677,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
- solver() : ModelCache, PropagationBaseObject, RoutingModel
- Solver : Search
- solver() : SearchMonitor
-- Solver() : Solver, StateMarker
+- Solver() : Solver, StateMarker
- solver : SCIP_LPi
- solver_ : MPSolverInterface
- solver_info() : VectorBinPackingSolution
@@ -1709,7 +1709,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
- SolverVersion() : BopInterface, CBCInterface, CLPInterface, GLOPInterface, GurobiInterface, MPSolver, MPSolverInterface, SatInterface, SCIPInterface
- SolveWithParameters() : RoutingModel
- SolveWithProto() : MPSolver
-- SolveWithTimeLimit() : BopSolver, IntegralSolver, LPSolver, SatSolver
+- SolveWithTimeLimit() : BopSolver, IntegralSolver, LPSolver, SatSolver
- Sort() : TaskSet, SavingsFilteredHeuristic::SavingsContainer< Saving >
- SORT_BY_NAME : StatsGroup
- SORT_BY_PART : DynamicPartition
@@ -1742,7 +1742,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
- SparseColumn() : SparseColumn
- SparseColumnEntry() : SparseColumnEntry
- SparseLeftSolve() : EtaFactorization, EtaMatrix
-- SparseMatrix() : SparseMatrix
+- SparseMatrix() : SparseMatrix
- SparseMatrixScaler() : SparseMatrixScaler
- SparseMatrixWithReusableColumnMemory() : SparseMatrixWithReusableColumnMemory
- SparsePermutation() : SparsePermutation
@@ -1816,7 +1816,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
- Stat() : Stat
- state() : KnapsackPropagator, KnapsackPropagatorForCuts, Solver
- StateDependentTransitCallback() : RoutingModel
-- StateInfo() : StateInfo
+- StateInfo() : StateInfo
- StateIsValid() : LocalSearchState
- StateMarker() : StateMarker
- StaticGraph() : StaticGraph< NodeIndexType, ArcIndexType >
@@ -1887,9 +1887,8 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
- String() : Annotation
- string_params() : GScipParameters
- string_params_size() : GScipParameters
-- string_value : Annotation
- STRING_VALUE : Annotation
-- string_value : LexerInfo
+- string_value : Annotation, LexerInfo
- strong_propagation : Constraint
- StrongVector() : StrongVector< IntType, T, Alloc >
- sub_decision_builder() : LocalSearchPhaseParameters
diff --git a/docs/cpp/functions_v.html b/docs/cpp/functions_v.html
index 65c07aa5d3..b5a6aa5177 100644
--- a/docs/cpp/functions_v.html
+++ b/docs/cpp/functions_v.html
@@ -100,10 +100,8 @@ $(document).ready(function(){initNavTree('functions_v.html',''); initResizable()
- value() : AdaptiveParameterValue
- Value() : BopSolution
- value : CheapestInsertionFilteredHeuristic::NodeInsertion
-- Value : FirstSolutionStrategy, Argument, Domain
-- value : VarRefOrValue
-- Value() : VarRefOrValue
-- value : DoubletonEqualityRowPreprocessor::RestoreInfo::ColChoiceAndStatus
+- Value : FirstSolutionStrategy, Argument, Domain, VarRefOrValue
+- value : VarRefOrValue, DoubletonEqualityRowPreprocessor::RestoreInfo::ColChoiceAndStatus
- Value() : IntTupleSet, IntVar, IntVarElement, IntVarFilteredHeuristic, IntVarIterator, IntVarLocalSearchFilter, LatticeMemoryManager< Set, CostType >, LocalSearchMetaheuristic, MPObjective
- value() : OptionalDouble
- Value() : PiecewiseLinearFunction, PiecewiseSegment, Rev< T >, RevArray< T >
@@ -124,12 +122,12 @@ $(document).ready(function(){initNavTree('functions_v.html',''); initResizable()
- ValueAtOffset() : LatticeMemoryManager< Set, CostType >
- ValueDeleter() : ValueDeleter
- ValueFromAssignment() : IntVarLocalSearchHandler, SequenceVarLocalSearchHandler
-- Values() : Domain
+- Values() : Domain
- values : Argument, Domain, ScatteredVector< Index, Iterator >
-- Values() : IdMap< K, V >
+- Values() : IdMap< K, V >
- values() : SparseVectorView< T >
- Values() : RevGrowingMultiMap< Key, Value >
-- values() : CpSolverSolution, PartialVariableAssignment, TableConstraintProto
+- values() : CpSolverSolution, PartialVariableAssignment, TableConstraintProto
- values_ : VarLocalSearchOperator< V, Val, Handler >
- values_size() : SparseVectorView< T >, CpSolverSolution, PartialVariableAssignment, TableConstraintProto
- ValueSelection : DefaultPhaseParameters
@@ -161,7 +159,7 @@ $(document).ready(function(){initNavTree('functions_v.html',''); initResizable()
- VAR_CONSTANT_NON_EQUALITY : ModelCache
- var_handler_ : VarLocalSearchOperator< V, Val, Handler >
- var_id : BopConstraintTerm, IntervalVarAssignment, IntVarAssignment, SequenceVarAssignment
-- var_index() : MPAbsConstraint, MPArrayConstraint, MPArrayWithConstantConstraint, MPConstraintProto, MPIndicatorConstraint, MPQuadraticConstraint, MPSosConstraint, PartialVariableAssignment
+- var_index() : MPAbsConstraint, MPArrayConstraint, MPArrayWithConstantConstraint, MPConstraintProto, MPIndicatorConstraint, MPQuadraticConstraint, MPSosConstraint, PartialVariableAssignment
- var_index_size() : MPArrayConstraint, MPArrayWithConstantConstraint, MPConstraintProto, MPQuadraticConstraint, MPSosConstraint, PartialVariableAssignment
- var_names() : LinearBooleanProblem
- var_names_size() : LinearBooleanProblem
@@ -186,7 +184,7 @@ $(document).ready(function(){initNavTree('functions_v.html',''); initResizable()
- VarDomination() : VarDomination
- variable : SolutionOutputSpecs, VarRefOrValue, LinearTerm
- Variable() : Variable
-- variable() : MPModelProto, MPSolver
+- variable() : MPModelProto, MPSolver
- Variable() : Literal
- variable : Solver::IntegerCastInfo, Solver::SearchLogParameters
- variable_activity_decay() : SatParameters
diff --git a/docs/cpp/graph__python__wrap_8cc_source.html b/docs/cpp/graph__python__wrap_8cc_source.html
index 93c6469d88..4e00f1d4a8 100644
--- a/docs/cpp/graph__python__wrap_8cc_source.html
+++ b/docs/cpp/graph__python__wrap_8cc_source.html
@@ -5966,7 +5966,7 @@ $(document).ready(function(){initNavTree('graph__python__wrap_8cc_source.html','
bool DijkstraShortestPath(int node_count, int start_node, int end_node, std::function< int64_t(int, int)> graph, int64_t disconnected_distance, std::vector< int > *nodes)
bool AStarShortestPath(int node_count, int start_node, int end_node, std::function< int64_t(int, int)> graph, std::function< int64_t(int)> heuristic, int64_t disconnected_distance, std::vector< int > *nodes)
bool AStarShortestPath(int node_count, int start_node, int end_node, std::function< int64_t(int, int)> graph, std::function< int64_t(int)> heuristic, int64_t disconnected_distance, std::vector< int > *nodes)
bool BellmanFordShortestPath(int node_count, int start_node, int end_node, std::function< int64_t(int, int)> graph, int64_t disconnected_distance, std::vector< int > *nodes)
absl::InlinedVector< IntegerLiteral, 2 > InlinedIntegerLiteralVector
constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
const LiteralIndex kNoLiteralIndex(-1)
constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)
std::function< void(Model *)> ClauseConstraint(absl::Span< const Literal > literals)
bool AddProductTo(IntegerValue a, IntegerValue b, IntegerValue *result)
constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)
std::function< void(Model *)> Equality(IntegerVariable v, int64_t value)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
IntType IntTypeAbs(IntType t)
IntegerValue CeilRatio(IntegerValue dividend, IntegerValue positive_divisor)
const LiteralIndex kNoLiteralIndex(-1)
799 integer_trail->LevelZeroLowerBound(y_sizes[i]);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 815 NegationOf(mapping->GetExprFromProto(
ct.lin_max().target()));
- 816 for (
int i = 0; i <
ct.lin_max().exprs_size(); ++i) {
-
- 818 mapping->GetExprFromProto(
ct.lin_max().exprs(i));
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 833 std::vector<std::pair<IntegerValue, IntegerValue>> affines;
-
- 835 CollectAffineExpressionWithSingleVariable(
ct, mapping, &
var, &affines);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 851 std::vector<std::pair<IntegerValue, IntegerValue>> affines;
-
- 853 CollectAffineExpressionWithSingleVariable(
ct, mapping, &
var, &affines);
-
-
-
-
-
-
- 860 if (
ct.lin_max().target().vars().empty())
return;
-
-
-
-
- 865 target_expr,
var, affines,
"AffineMax",
model));
-
-
-
-
-
-
-
- 873 IntegerVariable target,
const std::vector<Literal>& alternative_literals,
- 874 const std::vector<LinearExpression>& exprs,
Model*
model,
-
- 876 const int num_exprs = exprs.size();
-
-
-
- 880 for (
int i = 0; i < num_exprs; ++i) {
-
-
- 883 local_expr.
vars.push_back(target);
- 884 local_expr.
coeffs = exprs[i].coeffs;
- 885 local_expr.
coeffs.push_back(IntegerValue(1));
-
-
-
-
-
-
-
-
-
-
-
-
- 898 std::vector<IntegerVariable> x_vars;
- 899 for (
int i = 0; i < num_exprs; ++i) {
- 900 x_vars.insert(x_vars.end(), exprs[i].vars.begin(), exprs[i].vars.end());
-
-
-
-
- 905 DCHECK(std::all_of(x_vars.begin(), x_vars.end(), [](IntegerVariable
var) {
- 906 return VariableIsPositive(var);
-
-
- 909 std::vector<std::vector<IntegerValue>> sum_of_max_corner_diff(
- 910 num_exprs, std::vector<IntegerValue>(num_exprs, IntegerValue(0)));
-
-
- 913 for (
int i = 0; i < num_exprs; ++i) {
- 914 for (
int j = 0; j < num_exprs; ++j) {
- 915 if (i == j)
continue;
- 916 for (
const IntegerVariable x_var : x_vars) {
-
-
- 919 const IntegerValue diff =
-
- 921 sum_of_max_corner_diff[i][j] +=
std::max(diff * lb, diff * ub);
-
-
-
- 925 for (
int i = 0; i < num_exprs; ++i) {
-
- 927 lc.
AddTerm(target, IntegerValue(1));
- 928 for (
int j = 0; j < exprs[i].vars.size(); ++j) {
- 929 lc.
AddTerm(exprs[i].vars[j], -exprs[i].coeffs[j]);
-
- 931 for (
int j = 0; j < num_exprs; ++j) {
-
- 933 -exprs[j].offset - sum_of_max_corner_diff[i][j]));
-
-
-
-
-
-
- 940 bool linearize_enforced_constraints,
-
-
-
-
-
-
-
-
-
-
-
- 952 const IntegerValue rhs_domain_min = IntegerValue(
ct.linear().domain(0));
- 953 const IntegerValue rhs_domain_max =
- 954 IntegerValue(
ct.linear().domain(
ct.linear().domain_size() - 1));
-
-
-
-
-
-
- 961 for (
int i = 0; i <
ct.linear().vars_size(); i++) {
- 962 const int ref =
ct.linear().vars(i);
- 963 const int64_t coeff =
ct.linear().coeffs(i);
- 964 lc.
AddTerm(mapping->Integer(ref), IntegerValue(coeff));
-
-
-
-
-
-
- 971 if (!linearize_enforced_constraints)
return;
-
-
-
- 975 if (!mapping->IsHalfEncodingConstraint(&
ct) &&
ct.linear().vars_size() <= 1) {
-
-
-
- 979 std::vector<Literal> enforcing_literals;
- 980 enforcing_literals.reserve(
ct.enforcement_literal_size());
- 981 for (
const int enforcement_ref :
ct.enforcement_literal()) {
- 982 enforcing_literals.push_back(mapping->Literal(enforcement_ref));
-
-
- 985 expr.
vars.reserve(
ct.linear().vars_size());
- 986 expr.
coeffs.reserve(
ct.linear().vars_size());
- 987 for (
int i = 0; i <
ct.linear().vars_size(); i++) {
- 988 int ref =
ct.linear().vars(i);
- 989 IntegerValue coeff(
ct.linear().coeffs(i));
-
-
-
-
- 994 const IntegerVariable int_var = mapping->Integer(ref);
- 995 expr.
vars.push_back(int_var);
- 996 expr.
coeffs.push_back(coeff);
-
- 998 AppendEnforcedLinearExpression(enforcing_literals, expr, rhs_domain_min,
- 999 rhs_domain_max, *
model, relaxation);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1020 switch (
ct.constraint_case()) {
- 1021 case ConstraintProto::ConstraintCase::kBoolOr: {
- 1022 if (linearization_level > 1) {
-
-
-
-
- 1027 case ConstraintProto::ConstraintCase::kBoolAnd: {
- 1028 if (linearization_level > 1) {
-
-
-
-
- 1033 case ConstraintProto::ConstraintCase::kAtMostOne: {
-
-
-
- 1037 case ConstraintProto::ConstraintCase::kExactlyOne: {
-
-
-
- 1041 case ConstraintProto::ConstraintCase::kIntProd: {
-
-
-
-
- 1046 case ConstraintProto::ConstraintCase::kLinMax: {
-
- 1048 const bool is_affine_max = LinMaxContainsOnlyOneVarInExpressions(
ct);
- 1049 if (is_affine_max) {
-
-
-
-
- 1054 if (linearization_level > 1) {
- 1055 if (is_affine_max) {
-
-
-
-
-
-
-
- 1063 case ConstraintProto::ConstraintCase::kAllDiff: {
- 1064 if (linearization_level > 1) {
-
-
-
-
- 1069 case ConstraintProto::ConstraintCase::kLinear: {
-
- 1071 ct, linearization_level > 1,
model,
-
-
-
- 1075 case ConstraintProto::ConstraintCase::kCircuit: {
-
- 1077 if (linearization_level > 1) {
-
-
-
-
- 1082 case ConstraintProto::ConstraintCase::kRoutes: {
-
- 1084 if (linearization_level > 1) {
-
-
-
-
- 1089 case ConstraintProto::ConstraintCase::kNoOverlap: {
- 1090 if (linearization_level > 1) {
-
-
-
-
-
- 1096 case ConstraintProto::ConstraintCase::kCumulative: {
- 1097 if (linearization_level > 1) {
-
-
-
-
-
- 1103 case ConstraintProto::ConstraintCase::kNoOverlap2D: {
-
-
- 1106 if (linearization_level > 1) {
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1121 std::vector<int> tails(
ct.circuit().tails().begin(),
- 1122 ct.circuit().tails().end());
- 1123 std::vector<int> heads(
ct.circuit().heads().begin(),
- 1124 ct.circuit().heads().end());
-
- 1126 std::vector<Literal> literals = mapping->
Literals(
ct.circuit().literals());
- 1127 const int num_nodes =
ReindexArcs(&tails, &heads);
-
-
- 1130 num_nodes, tails, heads, literals, m));
-
-
-
-
- 1135 std::vector<int> tails(
ct.routes().tails().begin(),
- 1136 ct.routes().tails().end());
- 1137 std::vector<int> heads(
ct.routes().heads().begin(),
- 1138 ct.routes().heads().end());
-
- 1140 std::vector<Literal> literals = mapping->
Literals(
ct.routes().literals());
-
-
- 1143 for (
int i = 0; i <
ct.routes().tails_size(); ++i) {
- 1144 num_nodes =
std::max(num_nodes, 1 +
ct.routes().tails(i));
- 1145 num_nodes =
std::max(num_nodes, 1 +
ct.routes().heads(i));
-
- 1147 if (
ct.routes().demands().empty() ||
ct.routes().capacity() == 0) {
-
-
-
-
- 1152 const std::vector<int64_t> demands(
ct.routes().demands().begin(),
- 1153 ct.routes().demands().end());
-
- 1155 num_nodes, tails, heads, literals, demands,
ct.routes().capacity(), m));
-
-
-
-
-
-
- 1162 if (
ct.int_prod().exprs_size() != 2)
return;
-
-
-
-
-
-
-
-
-
- 1172 IntegerValue x_lb = integer_trail->
LowerBound(x);
- 1173 IntegerValue x_ub = integer_trail->
UpperBound(x);
- 1174 IntegerValue y_lb = integer_trail->
LowerBound(y);
- 1175 IntegerValue y_ub = integer_trail->
UpperBound(y);
-
-
-
- 1179 if (x_lb < 0 && x_ub > 0)
return;
-
-
-
-
-
-
-
-
-
-
- 1190 if (x_lb < 0 && x_ub > 0)
return;
- 1191 if (y_lb < 0 && y_ub > 0)
return;
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1214 const int num_exprs =
ct.all_diff().exprs_size();
-
- 1216 if (num_exprs <= m->GetOrCreate<SatParameters>()->max_all_diff_cut_size()) {
- 1217 std::vector<AffineExpression> exprs(num_exprs);
-
- 1219 exprs.push_back(mapping->Affine(expr));
-
-
-
-
-
-
-
-
-
-
-
- 1231 const std::vector<IntervalVariable> intervals =
-
-
-
-
-
-
-
- 1239 std::vector<LinearExpression> energies;
- 1240 std::vector<AffineExpression> demands;
- 1241 std::vector<AffineExpression> sizes;
- 1242 for (
int i = 0; i < intervals.size(); ++i) {
- 1243 demands.push_back(mapping->Affine(
ct.cumulative().demands(i)));
- 1244 sizes.push_back(intervals_repository->
Size(intervals[i]));
-
-
-
-
-
-
- 1251 intervals,
capacity, demands, energies, m));
-
-
-
-
-
-
-
-
-
-
-
-
- 1264 std::vector<IntervalVariable> intervals =
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1279 std::vector<IntervalVariable> x_intervals =
- 1280 mapping->
Intervals(
ct.no_overlap_2d().x_intervals());
- 1281 std::vector<IntervalVariable> y_intervals =
- 1282 mapping->Intervals(
ct.no_overlap_2d().y_intervals());
-
-
-
-
-
-
- 1289 bool has_variable_part =
false;
- 1290 for (
int i = 0; i < x_intervals.size(); ++i) {
-
- 1292 if (intervals_repository->
IsAbsent(x_intervals[i]) ||
- 1293 intervals_repository->
IsAbsent(y_intervals[i])) {
-
-
-
-
- 1298 if ((intervals_repository->
IsOptional(x_intervals[i]) &&
- 1299 !intervals_repository->
IsPresent(x_intervals[i])) ||
- 1300 (intervals_repository->
IsOptional(y_intervals[i]) &&
- 1301 !intervals_repository->
IsPresent(y_intervals[i]))) {
- 1302 has_variable_part =
true;
-
-
-
-
- 1307 if (intervals_repository->
MinSize(x_intervals[i]) !=
- 1308 intervals_repository->
MaxSize(x_intervals[i]) ||
- 1309 intervals_repository->
MinSize(y_intervals[i]) !=
- 1310 intervals_repository->
MaxSize(y_intervals[i])) {
- 1311 has_variable_part =
true;
-
-
-
- 1315 if (has_variable_part) {
-
-
-
-
-
-
-
-
-
-
-
-
- 1328 if (
ct.lin_max().target().vars_size() != 1)
return;
- 1329 if (
ct.lin_max().target().coeffs(0) != 1)
return;
- 1330 if (
ct.lin_max().target().offset() != 0)
return;
-
- 1332 const IntegerVariable target =
- 1333 mapping->
Integer(
ct.lin_max().target().vars(0));
- 1334 std::vector<LinearExpression> exprs;
- 1335 exprs.reserve(
ct.lin_max().exprs_size());
- 1336 for (
int i = 0; i <
ct.lin_max().exprs_size(); ++i) {
-
-
-
-
-
-
- 1343 const std::vector<Literal> alternative_literals =
-
-
-
-
-
-
-
-
-
- 1353 std::vector<IntegerVariable> z_vars;
-
- 1355 for (
const Literal lit : alternative_literals) {
- 1356 z_vars.push_back(encoder->GetLiteralView(lit));
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1375 int num_exactly_one_elements = 0;
-
- 1377 for (
const IntegerVariable
var :
- 1378 implied_bounds->GetElementEncodedVariables()) {
- 1379 for (
const auto& [
index, literal_value_list] :
- 1380 implied_bounds->GetElementEncodings(
var)) {
-
-
-
-
-
- 1386 absl::flat_hash_set<IntegerValue> values;
- 1387 for (
const auto& literal_value : literal_value_list) {
- 1388 min_value =
std::min(min_value, literal_value.value);
- 1389 values.insert(literal_value.value);
-
- 1391 if (values.size() == literal_value_list.size())
continue;
-
-
-
- 1395 linear_encoding.
AddTerm(
var, IntegerValue(-1));
- 1396 for (
const auto& [
value,
literal] : literal_value_list) {
- 1397 const IntegerValue delta_min =
value - min_value;
- 1398 if (delta_min != 0) {
-
-
-
-
-
-
- 1405 ++num_exactly_one_elements;
-
-
-
-
- 1410 if (num_exactly_one_elements != 0) {
-
-
- 1413 "[ElementLinearRelaxation]"
- 1414 " #from_exactly_one:",
- 1415 num_exactly_one_elements);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1431 int num_loose_equality_encoding_relaxations = 0;
- 1432 int num_tight_equality_encoding_relaxations = 0;
- 1433 int num_inequality_encoding_relaxations = 0;
-
-
- 1436 if (mapping->IsBoolean(i))
continue;
-
- 1438 const IntegerVariable
var = mapping->Integer(i);
-
-
-
-
- 1443 var, *m, &relaxation, &num_tight_equality_encoding_relaxations,
- 1444 &num_loose_equality_encoding_relaxations);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1459 ++num_inequality_encoding_relaxations;
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1477 if (num_tight_equality_encoding_relaxations != 0 ||
- 1478 num_loose_equality_encoding_relaxations != 0 ||
- 1479 num_inequality_encoding_relaxations != 0) {
-
- 1481 "[EncodingLinearRelaxation]"
- 1482 " #tight_equality:",
- 1483 num_tight_equality_encoding_relaxations,
- 1484 " #loose_equality:", num_loose_equality_encoding_relaxations,
- 1485 " #inequality:", num_inequality_encoding_relaxations);
-
-
-
-
- 1490 "[LinearRelaxationBeforeCliqueExpansion]"
-
-
-
-
-
-
-
-
-
- 1500 for (
const std::vector<Literal>& at_most_one : relaxation.
at_most_ones) {
- 1501 if (at_most_one.empty())
continue;
-
-
-
-
-
- 1507 const bool unused ABSL_ATTRIBUTE_UNUSED =
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1533 if (!mapping->IsBoolean(i))
continue;
-
-
-
- 1537 const bool unused ABSL_ATTRIBUTE_UNUSED =
-
-
-
-
-
- 1543 if (!expr.
vars.empty()) {
-
-
-
-
-
-
-
-
- 1552 "[FinalLinearRelaxation]"
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 816 NegationOf(mapping->GetExprFromProto(
ct.lin_max().target()));
+ 817 for (
int i = 0; i <
ct.lin_max().exprs_size(); ++i) {
+
+ 819 mapping->GetExprFromProto(
ct.lin_max().exprs(i));
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 834 std::vector<std::pair<IntegerValue, IntegerValue>> affines;
+
+ 836 CollectAffineExpressionWithSingleVariable(
ct, mapping, &
var, &affines);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 852 std::vector<std::pair<IntegerValue, IntegerValue>> affines;
+
+ 854 CollectAffineExpressionWithSingleVariable(
ct, mapping, &
var, &affines);
+
+
+
+
+
+
+ 861 if (
ct.lin_max().target().vars().empty())
return;
+
+
+
+
+ 866 target_expr,
var, affines,
"AffineMax",
model));
+
+
+
+
+
+
+
+ 874 IntegerVariable target,
const std::vector<Literal>& alternative_literals,
+ 875 const std::vector<LinearExpression>& exprs,
Model*
model,
+
+ 877 const int num_exprs = exprs.size();
+
+
+
+ 881 for (
int i = 0; i < num_exprs; ++i) {
+
+
+ 884 local_expr.
vars.push_back(target);
+ 885 local_expr.
coeffs = exprs[i].coeffs;
+ 886 local_expr.
coeffs.push_back(IntegerValue(1));
+
+
+
+
+
+
+
+
+
+
+
+
+ 899 std::vector<IntegerVariable> x_vars;
+ 900 for (
int i = 0; i < num_exprs; ++i) {
+ 901 x_vars.insert(x_vars.end(), exprs[i].vars.begin(), exprs[i].vars.end());
+
+
+
+
+ 906 DCHECK(std::all_of(x_vars.begin(), x_vars.end(), [](IntegerVariable
var) {
+ 907 return VariableIsPositive(var);
+
+
+ 910 std::vector<std::vector<IntegerValue>> sum_of_max_corner_diff(
+ 911 num_exprs, std::vector<IntegerValue>(num_exprs, IntegerValue(0)));
+
+
+ 914 for (
int i = 0; i < num_exprs; ++i) {
+ 915 for (
int j = 0; j < num_exprs; ++j) {
+ 916 if (i == j)
continue;
+ 917 for (
const IntegerVariable x_var : x_vars) {
+
+
+ 920 const IntegerValue diff =
+
+ 922 sum_of_max_corner_diff[i][j] +=
std::max(diff * lb, diff * ub);
+
+
+
+ 926 for (
int i = 0; i < num_exprs; ++i) {
+
+ 928 lc.
AddTerm(target, IntegerValue(1));
+ 929 for (
int j = 0; j < exprs[i].vars.size(); ++j) {
+ 930 lc.
AddTerm(exprs[i].vars[j], -exprs[i].coeffs[j]);
+
+ 932 for (
int j = 0; j < num_exprs; ++j) {
+
+ 934 -exprs[j].offset - sum_of_max_corner_diff[i][j]));
+
+
+
+
+
+
+ 941 bool linearize_enforced_constraints,
+
+
+
+
+
+
+
+
+
+
+
+ 953 const IntegerValue rhs_domain_min = IntegerValue(
ct.linear().domain(0));
+ 954 const IntegerValue rhs_domain_max =
+ 955 IntegerValue(
ct.linear().domain(
ct.linear().domain_size() - 1));
+
+
+
+
+
+
+ 962 for (
int i = 0; i <
ct.linear().vars_size(); i++) {
+ 963 const int ref =
ct.linear().vars(i);
+ 964 const int64_t coeff =
ct.linear().coeffs(i);
+ 965 lc.
AddTerm(mapping->Integer(ref), IntegerValue(coeff));
+
+
+
+
+
+
+ 972 if (!linearize_enforced_constraints)
return;
+
+
+
+ 976 if (!mapping->IsHalfEncodingConstraint(&
ct) &&
ct.linear().vars_size() <= 1) {
+
+
+
+ 980 std::vector<Literal> enforcing_literals;
+ 981 enforcing_literals.reserve(
ct.enforcement_literal_size());
+ 982 for (
const int enforcement_ref :
ct.enforcement_literal()) {
+ 983 enforcing_literals.push_back(mapping->Literal(enforcement_ref));
+
+
+ 986 expr.
vars.reserve(
ct.linear().vars_size());
+ 987 expr.
coeffs.reserve(
ct.linear().vars_size());
+ 988 for (
int i = 0; i <
ct.linear().vars_size(); i++) {
+ 989 int ref =
ct.linear().vars(i);
+ 990 IntegerValue coeff(
ct.linear().coeffs(i));
+
+
+
+
+ 995 const IntegerVariable int_var = mapping->Integer(ref);
+ 996 expr.
vars.push_back(int_var);
+ 997 expr.
coeffs.push_back(coeff);
+
+ 999 AppendEnforcedLinearExpression(enforcing_literals, expr, rhs_domain_min,
+ 1000 rhs_domain_max, *
model, relaxation);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1021 switch (
ct.constraint_case()) {
+ 1022 case ConstraintProto::ConstraintCase::kBoolOr: {
+ 1023 if (linearization_level > 1) {
+
+
+
+
+ 1028 case ConstraintProto::ConstraintCase::kBoolAnd: {
+ 1029 if (linearization_level > 1) {
+
+
+
+
+ 1034 case ConstraintProto::ConstraintCase::kAtMostOne: {
+
+
+
+ 1038 case ConstraintProto::ConstraintCase::kExactlyOne: {
+
+
+
+ 1042 case ConstraintProto::ConstraintCase::kIntProd: {
+
+
+
+
+ 1047 case ConstraintProto::ConstraintCase::kLinMax: {
+
+ 1049 const bool is_affine_max = LinMaxContainsOnlyOneVarInExpressions(
ct);
+ 1050 if (is_affine_max) {
+
+
+
+
+ 1055 if (linearization_level > 1) {
+ 1056 if (is_affine_max) {
+
+
+
+
+
+
+
+ 1064 case ConstraintProto::ConstraintCase::kAllDiff: {
+ 1065 if (linearization_level > 1) {
+
+
+
+
+ 1070 case ConstraintProto::ConstraintCase::kLinear: {
+
+ 1072 ct, linearization_level > 1,
model,
+
+
+
+ 1076 case ConstraintProto::ConstraintCase::kCircuit: {
+
+ 1078 if (linearization_level > 1) {
+
+
+
+
+ 1083 case ConstraintProto::ConstraintCase::kRoutes: {
+
+ 1085 if (linearization_level > 1) {
+
+
+
+
+ 1090 case ConstraintProto::ConstraintCase::kNoOverlap: {
+ 1091 if (linearization_level > 1) {
+
+
+
+
+
+ 1097 case ConstraintProto::ConstraintCase::kCumulative: {
+ 1098 if (linearization_level > 1) {
+
+
+
+
+
+ 1104 case ConstraintProto::ConstraintCase::kNoOverlap2D: {
+
+
+ 1107 if (linearization_level > 1) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1122 std::vector<int> tails(
ct.circuit().tails().begin(),
+ 1123 ct.circuit().tails().end());
+ 1124 std::vector<int> heads(
ct.circuit().heads().begin(),
+ 1125 ct.circuit().heads().end());
+
+ 1127 std::vector<Literal> literals = mapping->
Literals(
ct.circuit().literals());
+ 1128 const int num_nodes =
ReindexArcs(&tails, &heads);
+
+
+ 1131 num_nodes, tails, heads, literals, m));
+
+
+
+
+ 1136 std::vector<int> tails(
ct.routes().tails().begin(),
+ 1137 ct.routes().tails().end());
+ 1138 std::vector<int> heads(
ct.routes().heads().begin(),
+ 1139 ct.routes().heads().end());
+
+ 1141 std::vector<Literal> literals = mapping->
Literals(
ct.routes().literals());
+
+
+ 1144 for (
int i = 0; i <
ct.routes().tails_size(); ++i) {
+ 1145 num_nodes =
std::max(num_nodes, 1 +
ct.routes().tails(i));
+ 1146 num_nodes =
std::max(num_nodes, 1 +
ct.routes().heads(i));
+
+ 1148 if (
ct.routes().demands().empty() ||
ct.routes().capacity() == 0) {
+
+
+
+
+ 1153 const std::vector<int64_t> demands(
ct.routes().demands().begin(),
+ 1154 ct.routes().demands().end());
+
+ 1156 num_nodes, tails, heads, literals, demands,
ct.routes().capacity(), m));
+
+
+
+
+
+
+ 1163 if (
ct.int_prod().exprs_size() != 2)
return;
+
+
+
+
+
+
+
+
+
+ 1173 IntegerValue x_lb = integer_trail->
LowerBound(x);
+ 1174 IntegerValue x_ub = integer_trail->
UpperBound(x);
+ 1175 IntegerValue y_lb = integer_trail->
LowerBound(y);
+ 1176 IntegerValue y_ub = integer_trail->
UpperBound(y);
+
+
+
+ 1180 if (x_lb < 0 && x_ub > 0)
return;
+
+
+
+
+
+
+
+
+
+
+ 1191 if (x_lb < 0 && x_ub > 0)
return;
+ 1192 if (y_lb < 0 && y_ub > 0)
return;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1215 const int num_exprs =
ct.all_diff().exprs_size();
+
+ 1217 if (num_exprs <= m->GetOrCreate<SatParameters>()->max_all_diff_cut_size()) {
+ 1218 std::vector<AffineExpression> exprs(num_exprs);
+
+ 1220 exprs.push_back(mapping->Affine(expr));
+
+
+
+
+
+
+
+
+
+
+
+ 1232 const std::vector<IntervalVariable> intervals =
+
+
+
+
+
+
+
+ 1240 std::vector<LinearExpression> energies;
+ 1241 std::vector<AffineExpression> demands;
+ 1242 std::vector<AffineExpression> sizes;
+ 1243 for (
int i = 0; i < intervals.size(); ++i) {
+ 1244 demands.push_back(mapping->Affine(
ct.cumulative().demands(i)));
+ 1245 sizes.push_back(intervals_repository->
Size(intervals[i]));
+
+
+
+
+
+
+ 1252 intervals,
capacity, demands, energies, m));
+
+
+
+
+
+
+
+
+
+
+
+
+ 1265 std::vector<IntervalVariable> intervals =
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1280 std::vector<IntervalVariable> x_intervals =
+ 1281 mapping->
Intervals(
ct.no_overlap_2d().x_intervals());
+ 1282 std::vector<IntervalVariable> y_intervals =
+ 1283 mapping->Intervals(
ct.no_overlap_2d().y_intervals());
+
+
+
+
+
+
+ 1290 bool has_variable_part =
false;
+ 1291 for (
int i = 0; i < x_intervals.size(); ++i) {
+
+ 1293 if (intervals_repository->
IsAbsent(x_intervals[i]) ||
+ 1294 intervals_repository->
IsAbsent(y_intervals[i])) {
+
+
+
+
+ 1299 if (!intervals_repository->
IsPresent(x_intervals[i]) ||
+ 1300 !intervals_repository->
IsPresent(y_intervals[i])) {
+ 1301 has_variable_part =
true;
+
+
+
+
+ 1306 if (intervals_repository->
MinSize(x_intervals[i]) !=
+ 1307 intervals_repository->
MaxSize(x_intervals[i]) ||
+ 1308 intervals_repository->
MinSize(y_intervals[i]) !=
+ 1309 intervals_repository->
MaxSize(y_intervals[i])) {
+ 1310 has_variable_part =
true;
+
+
+
+ 1314 if (has_variable_part) {
+
+
+
+
+
+
+
+
+
+
+
+
+ 1327 if (
ct.lin_max().target().vars_size() != 1)
return;
+ 1328 if (
ct.lin_max().target().coeffs(0) != 1)
return;
+ 1329 if (
ct.lin_max().target().offset() != 0)
return;
+
+ 1331 const IntegerVariable target =
+ 1332 mapping->
Integer(
ct.lin_max().target().vars(0));
+ 1333 std::vector<LinearExpression> exprs;
+ 1334 exprs.reserve(
ct.lin_max().exprs_size());
+ 1335 for (
int i = 0; i <
ct.lin_max().exprs_size(); ++i) {
+
+
+
+
+
+
+ 1342 const std::vector<Literal> alternative_literals =
+
+
+
+
+
+
+
+
+
+ 1352 std::vector<IntegerVariable> z_vars;
+
+ 1354 for (
const Literal lit : alternative_literals) {
+ 1355 z_vars.push_back(encoder->GetLiteralView(lit));
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1374 int num_exactly_one_elements = 0;
+
+ 1376 for (
const IntegerVariable
var :
+ 1377 implied_bounds->GetElementEncodedVariables()) {
+ 1378 for (
const auto& [
index, literal_value_list] :
+ 1379 implied_bounds->GetElementEncodings(
var)) {
+
+
+
+
+
+ 1385 absl::flat_hash_set<IntegerValue> values;
+ 1386 for (
const auto& literal_value : literal_value_list) {
+ 1387 min_value =
std::min(min_value, literal_value.value);
+ 1388 values.insert(literal_value.value);
+
+ 1390 if (values.size() == literal_value_list.size())
continue;
+
+
+
+ 1394 linear_encoding.
AddTerm(
var, IntegerValue(-1));
+ 1395 for (
const auto& [
value,
literal] : literal_value_list) {
+ 1396 const IntegerValue delta_min =
value - min_value;
+ 1397 if (delta_min != 0) {
+
+
+
+
+
+
+ 1404 ++num_exactly_one_elements;
+
+
+
+
+ 1409 if (num_exactly_one_elements != 0) {
+
+
+ 1412 "[ElementLinearRelaxation]"
+ 1413 " #from_exactly_one:",
+ 1414 num_exactly_one_elements);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1430 int num_loose_equality_encoding_relaxations = 0;
+ 1431 int num_tight_equality_encoding_relaxations = 0;
+ 1432 int num_inequality_encoding_relaxations = 0;
+
+
+ 1435 if (mapping->IsBoolean(i))
continue;
+
+ 1437 const IntegerVariable
var = mapping->Integer(i);
+
+
+
+
+ 1442 var, *m, &relaxation, &num_tight_equality_encoding_relaxations,
+ 1443 &num_loose_equality_encoding_relaxations);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1458 ++num_inequality_encoding_relaxations;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1476 if (num_tight_equality_encoding_relaxations != 0 ||
+ 1477 num_loose_equality_encoding_relaxations != 0 ||
+ 1478 num_inequality_encoding_relaxations != 0) {
+
+ 1480 "[EncodingLinearRelaxation]"
+ 1481 " #tight_equality:",
+ 1482 num_tight_equality_encoding_relaxations,
+ 1483 " #loose_equality:", num_loose_equality_encoding_relaxations,
+ 1484 " #inequality:", num_inequality_encoding_relaxations);
+
+
+
+
+ 1489 "[LinearRelaxationBeforeCliqueExpansion]"
+
+
+
+
+
+
+
+
+
+ 1499 for (
const std::vector<Literal>& at_most_one : relaxation.
at_most_ones) {
+ 1500 if (at_most_one.empty())
continue;
+
+
+
+
+
+ 1506 const bool unused ABSL_ATTRIBUTE_UNUSED =
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1532 if (!mapping->IsBoolean(i))
continue;
+
+
+
+ 1536 const bool unused ABSL_ATTRIBUTE_UNUSED =
+
+
+
+
+
+ 1542 if (!expr.
vars.empty()) {
+
+
+
+
+
+
+
+
+ 1551 "[FinalLinearRelaxation]"
+
+
+
+
+
+
+
+
+
+
@@ -1690,7 +1689,6 @@ $(document).ready(function(){initNavTree('linear__relaxation_8cc_source.html',''
bool IsPresent(IntervalVariable i) const
AffineExpression Size(IntervalVariable i) const
bool IsAbsent(IntervalVariable i) const
bool IsOptional(IntervalVariable i) const
ABSL_MUST_USE_RESULT bool AddLiteralTerm(Literal lit, IntegerValue coeff)
void AddLinearExpression(const LinearExpression &expr)
void STLSortAndRemoveDuplicates(T *v, const LessFunc &less_func)
void AddCumulativeCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddCumulativeCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
CutGenerator CreateCumulativeEnergyCutGenerator(const std::vector< IntervalVariable > &intervals, const AffineExpression &capacity, const std::vector< AffineExpression > &demands, const std::vector< LinearExpression > &energies, Model *model)
std::function< IntegerVariable(Model *)> NewIntegerVariableFromLiteral(Literal lit)
CutGenerator CreateCVRPCutGenerator(int num_nodes, const std::vector< int > &tails, const std::vector< int > &heads, const std::vector< Literal > &literals, const std::vector< int64_t > &demands, int64_t capacity, Model *model)
CutGenerator CreateNoOverlap2dEnergyCutGenerator(const std::vector< IntervalVariable > &x_intervals, const std::vector< IntervalVariable > &y_intervals, Model *model)
constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)
void AppendLinMaxRelaxationPart1(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AppendLinMaxRelaxationPart1(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AppendBoolOrRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
IntegerValue LinExprLowerBound(const LinearExpression &expr, const IntegerTrail &integer_trail)
CutGenerator CreateNoOverlapCompletionTimeCutGenerator(const std::vector< IntervalVariable > &intervals, Model *model)
void TryToLinearizeConstraint(const CpModelProto &model_proto, const ConstraintProto &ct, int linearization_level, Model *model, LinearRelaxation *relaxation)
void TryToLinearizeConstraint(const CpModelProto &model_proto, const ConstraintProto &ct, int linearization_level, Model *model, LinearRelaxation *relaxation)
bool AppendFullEncodingRelaxation(IntegerVariable var, const Model &model, LinearRelaxation *relaxation)
bool RefIsPositive(int ref)
CutGenerator CreateNoOverlapPrecedenceCutGenerator(const std::vector< IntervalVariable > &intervals, Model *model)
CutGenerator CreateAllDifferentCutGenerator(const std::vector< AffineExpression > &exprs, Model *model)
void AppendNoOverlapRelaxation(const CpModelProto &model_proto, const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
const LiteralIndex kNoLiteralIndex(-1)
void AddMaxAffineCutGenerator(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AddMaxAffineCutGenerator(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AppendAtMostOneRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AppendCumulativeRelaxation(const CpModelProto &model_proto, const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)
std::function< int64_t(const Model &)> LowerBound(IntegerVariable v)
void AddNoOverlapCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddNoOverlapCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
std::function< BooleanVariable(Model *)> NewBooleanVariable()
bool HasEnforcementLiteral(const ConstraintProto &ct)
void LinearizeInnerProduct(const std::vector< AffineExpression > &left, const std::vector< AffineExpression > &right, Model *model, std::vector< LinearExpression > *energies)
std::function< IntervalVariable(Model *)> NewInterval(int64_t min_start, int64_t max_end, int64_t size)
void AppendBoolAndRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
const IntegerVariable kNoIntegerVariable(-1)
void AppendLinearConstraintRelaxation(const ConstraintProto &ct, bool linearize_enforced_constraints, Model *model, LinearRelaxation *relaxation)
void AppendLinearConstraintRelaxation(const ConstraintProto &ct, bool linearize_enforced_constraints, Model *model, LinearRelaxation *relaxation)
LinearExpression CanonicalizeExpr(const LinearExpression &expr)
void AddNoOverlap2dCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddNoOverlap2dCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
CutGenerator CreateCumulativeTimeTableCutGenerator(const std::vector< IntervalVariable > &intervals, const AffineExpression &capacity, const std::vector< AffineExpression > &demands, Model *model)
void AddIntProdCutGenerator(const ConstraintProto &ct, int linearization_level, Model *m, LinearRelaxation *relaxation)
void AddCircuitCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddIntProdCutGenerator(const ConstraintProto &ct, int linearization_level, Model *m, LinearRelaxation *relaxation)
void AddCircuitCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
CutGenerator CreateNoOverlap2dCompletionTimeCutGenerator(const std::vector< IntervalVariable > &x_intervals, const std::vector< IntervalVariable > &y_intervals, Model *model)
std::function< IntervalVariable(Model *)> NewOptionalInterval(int64_t min_start, int64_t max_end, int64_t size, Literal is_present)
IntegerVariable PositiveVariable(IntegerVariable i)
CutGenerator CreateLinMaxCutGenerator(const IntegerVariable target, const std::vector< LinearExpression > &exprs, const std::vector< IntegerVariable > &z_vars, Model *model)
CutGenerator CreatePositiveMultiplicationCutGenerator(AffineExpression z, AffineExpression x, AffineExpression y, int linearization_level, Model *model)
void AppendMaxAffineRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AppendMaxAffineRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
LinearConstraint BuildMaxAffineUpConstraint(const LinearExpression &target, IntegerVariable var, const std::vector< std::pair< IntegerValue, IntegerValue > > &affines, Model *model)
void AppendExactlyOneRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
IntegerValue GetCoefficient(const IntegerVariable var, const LinearExpression &expr)
CutGenerator CreateSquareCutGenerator(AffineExpression y, AffineExpression x, int linearization_level, Model *model)
std::vector< Literal > CreateAlternativeLiteralsWithView(int num_literals, Model *model, LinearRelaxation *relaxation)
std::function< int64_t(const Model &)> UpperBound(IntegerVariable v)
void AppendElementEncodingRelaxation(const CpModelProto &model_proto, Model *m, LinearRelaxation *relaxation)
void AppendElementEncodingRelaxation(const CpModelProto &model_proto, Model *m, LinearRelaxation *relaxation)
void AppendCircuitRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
CutGenerator CreateCumulativeCompletionTimeCutGenerator(const std::vector< IntervalVariable > &intervals, const AffineExpression &capacity, const std::vector< AffineExpression > &demands, const std::vector< LinearExpression > &energies, Model *model)
std::vector< IntegerVariable > NegationOf(const std::vector< IntegerVariable > &vars)
std::function< IntegerVariable(Model *)> NewIntegerVariable(int64_t lb, int64_t ub)
void AddAllDiffCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddAllDiffCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
CutGenerator CreateNoOverlapEnergyCutGenerator(const std::vector< IntervalVariable > &intervals, Model *model)
CutGenerator CreateMaxAffineCutGenerator(LinearExpression target, IntegerVariable var, std::vector< std::pair< IntegerValue, IntegerValue > > affines, const std::string cut_name, Model *model)
std::function< void(Model *)> SpanOfIntervals(IntervalVariable span, const std::vector< IntervalVariable > &intervals)
void AddLinMaxCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddLinMaxCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AppendRoutesRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
CutGenerator CreateCumulativePrecedenceCutGenerator(const std::vector< IntervalVariable > &intervals, const AffineExpression &capacity, const std::vector< AffineExpression > &demands, Model *model)
std::function< void(Model *)> ExactlyOneConstraint(const std::vector< Literal > &literals)
CutGenerator CreateCliqueCutGenerator(const std::vector< IntegerVariable > &base_variables, Model *model)
bool VariableIsPositive(IntegerVariable i)
void AddRoutesCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddRoutesCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
CutGenerator CreateStronglyConnectedGraphCutGenerator(int num_nodes, const std::vector< int > &tails, const std::vector< int > &heads, const std::vector< Literal > &literals, Model *model)
LinearRelaxation ComputeLinearRelaxation(const CpModelProto &model_proto, Model *m)
void AppendLinMaxRelaxationPart2(IntegerVariable target, const std::vector< Literal > &alternative_literals, const std::vector< LinearExpression > &exprs, Model *model, LinearRelaxation *relaxation)
LinearRelaxation ComputeLinearRelaxation(const CpModelProto &model_proto, Model *m)
void AppendLinMaxRelaxationPart2(IntegerVariable target, const std::vector< Literal > &alternative_literals, const std::vector< LinearExpression > &exprs, Model *model, LinearRelaxation *relaxation)
void AppendPartialGreaterThanEncodingRelaxation(IntegerVariable var, const Model &model, LinearRelaxation *relaxation)
Collection of objects used to extend the Constraint Solver library.
int64_t CapSub(int64_t x, int64_t y)
void AddCumulativeCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AppendLinMaxRelaxationPart1(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AddCumulativeCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AppendLinMaxRelaxationPart1(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AppendBoolOrRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void TryToLinearizeConstraint(const CpModelProto &model_proto, const ConstraintProto &ct, int linearization_level, Model *model, LinearRelaxation *relaxation)
void TryToLinearizeConstraint(const CpModelProto &model_proto, const ConstraintProto &ct, int linearization_level, Model *model, LinearRelaxation *relaxation)
void AppendNoOverlapRelaxation(const CpModelProto &model_proto, const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AppendAtMostOneRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AppendCumulativeRelaxation(const CpModelProto &model_proto, const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AddNoOverlapCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddNoOverlapCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AppendBoolAndRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AppendLinearConstraintRelaxation(const ConstraintProto &ct, bool linearize_enforced_constraints, Model *model, LinearRelaxation *relaxation)
void AddNoOverlap2dCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddIntProdCutGenerator(const ConstraintProto &ct, int linearization_level, Model *m, LinearRelaxation *relaxation)
void AddCircuitCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AppendMaxAffineRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AppendLinearConstraintRelaxation(const ConstraintProto &ct, bool linearize_enforced_constraints, Model *model, LinearRelaxation *relaxation)
void AddNoOverlap2dCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddIntProdCutGenerator(const ConstraintProto &ct, int linearization_level, Model *m, LinearRelaxation *relaxation)
void AddCircuitCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AppendMaxAffineRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AppendExactlyOneRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
std::vector< Literal > CreateAlternativeLiteralsWithView(int num_literals, Model *model, LinearRelaxation *relaxation)
void AppendCircuitRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AddAllDiffCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddLinMaxCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddAllDiffCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AddLinMaxCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
void AppendRoutesRelaxation(const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation)
void AppendRelaxationForEqualityEncoding(IntegerVariable var, const Model &model, LinearRelaxation *relaxation, int *num_tight, int *num_loose)
void AddRoutesCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
LinearRelaxation ComputeLinearRelaxation(const CpModelProto &model_proto, Model *m)
void AppendLinMaxRelaxationPart2(IntegerVariable target, const std::vector< Literal > &alternative_literals, const std::vector< LinearExpression > &exprs, Model *model, LinearRelaxation *relaxation)
void AddRoutesCutGenerator(const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation)
LinearRelaxation ComputeLinearRelaxation(const CpModelProto &model_proto, Model *m)
void AppendLinMaxRelaxationPart2(IntegerVariable target, const std::vector< Literal > &alternative_literals, const std::vector< LinearExpression > &exprs, Model *model, LinearRelaxation *relaxation)
void AppendPartialGreaterThanEncodingRelaxation(IntegerVariable var, const Model &model, LinearRelaxation *relaxation)
Collection of objects used to extend the Constraint Solver library.
- OpenOrDie() : file
- operator!=() : operations_research::math_opt
- operator*() : operations_research::math_opt, operations_research, operations_research::sat
-- operator+() : operations_research::math_opt, operations_research, operations_research::sat
-- operator-() : operations_research::math_opt, operations_research, operations_research::sat
+- operator+() : operations_research::math_opt, operations_research, operations_research::sat
+- operator-() : operations_research::math_opt, operations_research, operations_research::sat
- operator/() : operations_research::math_opt, operations_research
-- operator<<() : google, gtl, operations_research::bop, operations_research::glop, operations_research::math_opt, operations_research, operations_research::sat, strings
+- operator<<() : google, gtl, operations_research::bop, operations_research::glop, operations_research::math_opt, operations_research, operations_research::sat, strings
- operator<=() : operations_research::math_opt, operations_research
- operator==() : operations_research::math_opt, operations_research
- operator>=() : operations_research::math_opt, operations_research
diff --git a/docs/cpp/namespacemembers_o.html b/docs/cpp/namespacemembers_o.html
index 84351fc2d6..2e686333db 100644
--- a/docs/cpp/namespacemembers_o.html
+++ b/docs/cpp/namespacemembers_o.html
@@ -97,13 +97,13 @@ $(document).ready(function(){initNavTree('namespacemembers_o.html',''); initResi
- Open() : file
- OpenOrDie() : file
- operator!=() : operations_research::math_opt
-- operator*() : operations_research::math_opt, operations_research, operations_research::sat
-- operator+() : operations_research::math_opt, operations_research, operations_research::sat
-- operator-() : operations_research::math_opt, operations_research, operations_research::sat
-- operator/() : operations_research::math_opt, operations_research
-- operator<<() : google, gtl, operations_research::bop, operations_research::glop, operations_research::math_opt, operations_research, operations_research::sat, strings
-- operator<=() : operations_research::math_opt, operations_research
-- operator==() : operations_research::math_opt, operations_research
+- operator*() : operations_research::math_opt, operations_research, operations_research::sat
+- operator+() : operations_research::math_opt, operations_research, operations_research::sat
+- operator-() : operations_research::math_opt, operations_research, operations_research::sat
+- operator/() : operations_research::math_opt, operations_research
+- operator<<() : google, gtl, operations_research::bop, operations_research::glop, operations_research::math_opt, operations_research, operations_research::sat, strings
+- operator<=() : operations_research::math_opt, operations_research
+- operator==() : operations_research::math_opt, operations_research
- operator>=() : operations_research::math_opt, operations_research
- OPP_VAR : operations_research
- OPTIMAL : operations_research::packing::vbp, operations_research::sat
diff --git a/docs/cpp/namespaceoperations__research.html b/docs/cpp/namespaceoperations__research.html
index ed9be4b81c..eff76b491e 100644
--- a/docs/cpp/namespaceoperations__research.html
+++ b/docs/cpp/namespaceoperations__research.html
@@ -5323,7 +5323,7 @@ Variables
diff --git a/docs/cpp/namespaceoperations__research_1_1sat.html b/docs/cpp/namespaceoperations__research_1_1sat.html
index 3636dbf25e..f4505328d8 100644
--- a/docs/cpp/namespaceoperations__research_1_1sat.html
+++ b/docs/cpp/namespaceoperations__research_1_1sat.html
@@ -1005,14 +1005,10 @@ Functions
| |
| DoubleLinearExpr | operator+ (DoubleLinearExpr &&lhs, DoubleLinearExpr &&rhs) |
| |
-| DoubleLinearExpr | operator+ (const DoubleLinearExpr &lhs, double rhs) |
-| |
-| DoubleLinearExpr | operator+ (DoubleLinearExpr &&lhs, double rhs) |
-| |
-| DoubleLinearExpr | operator+ (double lhs, DoubleLinearExpr &&rhs) |
-| |
-| DoubleLinearExpr | operator+ (double lhs, const DoubleLinearExpr &rhs) |
-| |
+| DoubleLinearExpr | operator+ (DoubleLinearExpr expr, double rhs) |
+| |
+| DoubleLinearExpr | operator+ (double lhs, DoubleLinearExpr expr) |
+| |
| DoubleLinearExpr | operator- (const DoubleLinearExpr &lhs, const DoubleLinearExpr &rhs) |
| |
| DoubleLinearExpr | operator- (DoubleLinearExpr &&lhs, const DoubleLinearExpr &rhs) |
@@ -1021,14 +1017,10 @@ Functions
| |
| DoubleLinearExpr | operator- (DoubleLinearExpr &&lhs, DoubleLinearExpr &&rhs) |
| |
-| DoubleLinearExpr | operator- (const DoubleLinearExpr &lhs, double rhs) |
-| |
-| DoubleLinearExpr | operator- (DoubleLinearExpr &&lhs, double rhs) |
-| |
-| DoubleLinearExpr | operator- (double lhs, DoubleLinearExpr &&rhs) |
-| |
-| DoubleLinearExpr | operator- (double lhs, const DoubleLinearExpr &rhs) |
-| |
+| DoubleLinearExpr | operator- (DoubleLinearExpr epxr, double rhs) |
+| |
+| DoubleLinearExpr | operator- (double lhs, DoubleLinearExpr expr) |
+| |
| DoubleLinearExpr | operator* (DoubleLinearExpr expr, double factor) |
| |
| DoubleLinearExpr | operator* (double factor, DoubleLinearExpr expr) |
@@ -2490,7 +2482,7 @@ Variables
@@ -2526,7 +2518,7 @@ Variables
@@ -2562,7 +2554,7 @@ Variables
@@ -2844,7 +2836,7 @@ Variables
@@ -2916,7 +2908,7 @@ Variables
@@ -2952,7 +2944,7 @@ Variables
@@ -2988,7 +2980,7 @@ Variables
@@ -3024,7 +3016,7 @@ Variables
@@ -3316,7 +3308,7 @@ Variables
@@ -3698,7 +3690,7 @@ Variables
@@ -3812,7 +3804,7 @@ Variables
@@ -3848,7 +3840,7 @@ Variables
@@ -3896,7 +3888,7 @@ Variables
@@ -3932,7 +3924,7 @@ Variables
@@ -5276,7 +5268,7 @@ Variables
@@ -14193,7 +14185,7 @@ Variables
A convenient wrapper so we can write Not(x) instead of x.Not() which is sometimes clearer.
-Definition at line 79 of file cp_model.cc.
+Definition at line 83 of file cp_model.cc.
@@ -14288,7 +14280,7 @@ Variables
@@ -14326,7 +14318,7 @@ Variables
@@ -14364,7 +14356,7 @@ Variables
@@ -14402,12 +14394,12 @@ Variables
-◆ operator+() [1/12]
+◆ operator+() [1/10]
@@ -14440,50 +14432,12 @@ Variables
-
-
-◆ operator+() [2/12]
-
-
-◆ operator+() [3/12]
+◆ operator+() [2/10]
@@ -14516,12 +14470,12 @@ Variables
-◆ operator+() [4/12]
+◆ operator+() [3/10]
@@ -14554,12 +14508,12 @@ Variables
-◆ operator+() [5/12]
+◆ operator+() [4/10]
@@ -14592,12 +14546,12 @@ Variables
-
-◆ operator+() [6/12]
+
+◆ operator+() [5/10]
@@ -14614,122 +14568,8 @@ Variables
|
|
- const DoubleLinearExpr & |
- rhs |
-
-
- |
- ) |
- | |
-
-
-
-
-inline |
-
-
-
-
-
-◆ operator+() [7/12]
-
-
-
-◆ operator+() [8/12]
-
-
-
-◆ operator+() [9/12]
-
-
-
-
-
-
-
-
- | DoubleLinearExpr operations_research::sat::operator+ |
- ( |
- DoubleLinearExpr && |
- lhs, |
-
-
- |
- |
- double |
- rhs |
+ DoubleLinearExpr |
+ expr |
|
@@ -14746,10 +14586,48 @@ Variables
Definition at line 1246 of file cp_model.h.
+
+
+
+◆ operator+() [6/10]
+
+
-◆ operator+() [10/12]
+◆ operator+() [7/10]
@@ -14782,12 +14660,50 @@ Variables
+
+
+◆ operator+() [8/10]
+
+
-◆ operator+() [11/12]
+◆ operator+() [9/10]
@@ -14820,12 +14736,12 @@ Variables |
◆ operator+() [12/12]
+◆ operator+() [10/10]
@@ -14858,12 +14774,12 @@ Variables
-◆ operator-() [1/14]
+◆ operator-() [1/12]
@@ -14896,50 +14812,12 @@ Variables
-
-
-◆ operator-() [2/14]
-
-
-◆ operator-() [3/14]
+◆ operator-() [2/12]
@@ -14972,12 +14850,12 @@ Variables
-◆ operator-() [4/14]
+◆ operator-() [3/12]
@@ -15010,12 +14888,12 @@ Variables
-◆ operator-() [5/14]
+◆ operator-() [4/12]
@@ -15048,12 +14926,12 @@ Variables
-
-◆ operator-() [6/14]
+
+◆ operator-() [5/12]
-
-◆ operator-() [7/14]
-
-
-◆ operator-() [8/14]
+◆ operator-() [6/12]
@@ -15162,12 +15002,12 @@ Variables
-
-◆ operator-() [9/14]
+
+◆ operator-() [7/12]
+
+◆ operator-() [8/12]
+
+
+
+
+
+
+
-
-
-◆ operator-() [10/14]
-
-
-◆ operator-() [11/14]
+◆ operator-() [9/12]
@@ -15266,12 +15106,12 @@ Variables |
◆ operator-() [12/14]
+◆ operator-() [10/12]
@@ -15304,12 +15144,12 @@ Variables
-◆ operator-() [13/14]
+◆ operator-() [11/12]
@@ -15342,12 +15182,12 @@ Variables
-◆ operator-() [14/14]
+◆ operator-() [12/12]
@@ -15370,7 +15210,7 @@ Variables
@@ -15438,7 +15278,7 @@ Variables
@@ -15468,7 +15308,7 @@ Variables
@@ -15498,7 +15338,7 @@ Variables
@@ -15528,7 +15368,7 @@ Variables
@@ -15596,7 +15436,7 @@ Variables
@@ -19033,7 +18873,7 @@ Variables
Evaluates the value of a Boolean literal in a solver response.
-Definition at line 1339 of file cp_model.cc.
+Definition at line 1373 of file cp_model.cc.
@@ -19065,7 +18905,7 @@ Variables
Evaluates the value of an linear expression in a solver response.
-Definition at line 1328 of file cp_model.cc.
+Definition at line 1362 of file cp_model.cc.
@@ -20317,7 +20157,7 @@ Variables
@@ -20735,7 +20575,7 @@ Variables
diff --git a/docs/cpp/navtreedata.js b/docs/cpp/navtreedata.js
index e2cb2edcdd..96309f87bb 100644
--- a/docs/cpp/navtreedata.js
+++ b/docs/cpp/navtreedata.js
@@ -1245,27 +1245,23 @@ var NAVTREE =
[ "operator*", "namespaceoperations__research_1_1sat.html#a1b127fca095a77a5c789d443f522fbbb", null ],
[ "operator*", "namespaceoperations__research_1_1sat.html#ae5e220860af1fa89265bd640ab575c94", null ],
[ "operator+", "namespaceoperations__research_1_1sat.html#adedef397b25c1cc6909adcae18a820e9", null ],
- [ "operator+", "namespaceoperations__research_1_1sat.html#a880c86015007715e39e0d638d595f90a", null ],
[ "operator+", "namespaceoperations__research_1_1sat.html#a0bdaf49a2294d9fd664ce3ad0360d501", null ],
[ "operator+", "namespaceoperations__research_1_1sat.html#a14d680e53b769b0bf60b6613d27994df", null ],
[ "operator+", "namespaceoperations__research_1_1sat.html#af5d9b25ef5642c457636001e9393034e", null ],
- [ "operator+", "namespaceoperations__research_1_1sat.html#a1400ddaec2d03291cb4930b40d473490", null ],
- [ "operator+", "namespaceoperations__research_1_1sat.html#ade884e51118469ac2d3f46da775f0e0e", null ],
+ [ "operator+", "namespaceoperations__research_1_1sat.html#a8958bf1527cb994a0d7553282dd731f2", null ],
[ "operator+", "namespaceoperations__research_1_1sat.html#a23499bc93d6b2ab81e91ea946e2780c8", null ],
- [ "operator+", "namespaceoperations__research_1_1sat.html#abf85f46b2a5a861212995b8b30890d63", null ],
[ "operator+", "namespaceoperations__research_1_1sat.html#a5317d7f37f16096d85dfc5a7f05bed77", null ],
+ [ "operator+", "namespaceoperations__research_1_1sat.html#a60111592f54952fd8d14692750ac5617", null ],
[ "operator+", "namespaceoperations__research_1_1sat.html#a70c3650a2627f7072b46545ba712da1c", null ],
[ "operator+", "namespaceoperations__research_1_1sat.html#a12a296a3b389239ce1ffef3527bfa1e3", null ],
[ "operator-", "namespaceoperations__research_1_1sat.html#a1ed1cd9aca1c45ff97111ebfe1d8c555", null ],
- [ "operator-", "namespaceoperations__research_1_1sat.html#a3140d971daef3de86ab71735b57c58bf", null ],
[ "operator-", "namespaceoperations__research_1_1sat.html#a37a77b7fe5f2ae90130d7f9cf20a995a", null ],
[ "operator-", "namespaceoperations__research_1_1sat.html#aedd485d7f6b2ccacff90294455d30ae5", null ],
[ "operator-", "namespaceoperations__research_1_1sat.html#a1083f8028e54d27eec081e45d92da3da", null ],
- [ "operator-", "namespaceoperations__research_1_1sat.html#ac1ddbf6a02889772d677e107a2ba46c9", null ],
- [ "operator-", "namespaceoperations__research_1_1sat.html#a071654105c5e2fbb6bfab91c5a5cf3ff", null ],
+ [ "operator-", "namespaceoperations__research_1_1sat.html#a962810e4d6e648b9bdd8a6147e6ecd8c", null ],
[ "operator-", "namespaceoperations__research_1_1sat.html#ade32b256f6277fd7a7e52c3a17128b96", null ],
- [ "operator-", "namespaceoperations__research_1_1sat.html#aaf22dfdf4475e858e7ff0e8920f11f7b", null ],
[ "operator-", "namespaceoperations__research_1_1sat.html#a90add9340d2579eed96c65f248306982", null ],
+ [ "operator-", "namespaceoperations__research_1_1sat.html#a49cbabfb6c894b12ffb48181248c2c87", null ],
[ "operator-", "namespaceoperations__research_1_1sat.html#a3ef55954ce104b703b05f5a926a55c52", null ],
[ "operator-", "namespaceoperations__research_1_1sat.html#a62d4cee395c01f64847f322fd74f3613", null ],
[ "operator-", "namespaceoperations__research_1_1sat.html#ab29f5117f4220225e73e5984196315a7", null ],
diff --git a/docs/cpp/pb__constraint_8h_source.html b/docs/cpp/pb__constraint_8h_source.html
index bd01a448d7..148823f2f6 100644
--- a/docs/cpp/pb__constraint_8h_source.html
+++ b/docs/cpp/pb__constraint_8h_source.html
@@ -918,7 +918,7 @@ $(document).ready(function(){initNavTree('pb__constraint_8h_source.html',''); in
std::tuple< int64_t, int64_t, const double > Coefficient
Coefficient ComputeCanonicalRhs(Coefficient upper_bound, Coefficient bound_shift, Coefficient max_value)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
bool ApplyLiteralMapping(const absl::StrongVector< LiteralIndex, LiteralIndex > &mapping, std::vector< LiteralWithCoeff > *cst, Coefficient *bound_shift, Coefficient *max_value)
Coefficient ComputeNegatedCanonicalRhs(Coefficient lower_bound, Coefficient bound_shift, Coefficient max_value)
void SimplifyCanonicalBooleanLinearConstraint(std::vector< LiteralWithCoeff > *cst, Coefficient *rhs)
std::function< void(Model *)> NewFeasibleSolutionObserver(const std::function< void(const CpSolverResponse &response)> &observer)
Creates a solution observer with the model with model.Add(NewFeasibleSolutionObserver([](response){....
constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::function< SatParameters(Model *)> NewSatParameters(const std::string ¶ms)
Creates parameters for the solver, which you can add to the model with.
constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)
CpSolverResponse SolveCpModel(const CpModelProto &model_proto, Model *model)
Solves the given CpModelProto.
bool ValidateLinearConstraintForOverflow(const LinearConstraint &constraint, const IntegerTrail &integer_trail)
constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)
IntegerValue LinExprLowerBound(const LinearExpression &expr, const IntegerTrail &integer_trail)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)
std::string IntegerTermDebugString(IntegerVariable var, IntegerValue coeff)
void RemoveZeroTerms(LinearConstraint *constraint)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
const LiteralIndex kNoLiteralIndex(-1)
const LiteralIndex kTrueLiteralIndex(-2)
DEFINE_INT_TYPE(ClauseIndex, int)
std::tuple< int64_t, int64_t, const double > Coefficient
std::function< void(Model *)> Equality(IntegerVariable v, int64_t value)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::ostream & operator<<(std::ostream &os, const BoolVar &var)
std::function< void(Model *)> ReifiedBoolOr(const std::vector< Literal > &literals, Literal r)
std::function< void(Model *)> ClauseConstraint(absl::Span< const Literal > literals)
std::function< void(Model *)> EnforcedClause(absl::Span< const Literal > enforcement_literals, absl::Span< const Literal > clause)
1266 Rectangle& rectangle = cached_rectangles[box];
-
-
-
-
-
- 1272 active_boxes.push_back(box);
-
-
- 1275 if (active_boxes.size() <= 1)
return true;
-
- 1277 std::vector<absl::Span<int>> components =
-
- 1279 absl::MakeSpan(active_boxes));
-
-
-
-
- 1284 for (absl::Span<int> boxes : components) {
- 1285 if (boxes.size() <= 1)
continue;
-
-
- 1288 lp_values,
model, integer_trail, encoder, manager, energies,
- 1289 boxes,
"NoOverlap2dXEnergy", x_helper, y_helper);
-
- 1291 lp_values,
model, integer_trail, encoder, manager, energies,
- 1292 boxes,
"NoOverlap2dYEnergy", y_helper, x_helper);
-
-
-
-
-
- 1298 for (absl::Span<int> boxes : components) {
- 1299 if (boxes.size() <= 1)
continue;
-
-
- 1302 lp_values,
model, integer_trail, encoder, manager, energies,
- 1303 boxes,
"NoOverlap2dXEnergyMirror", x_helper, y_helper);
-
- 1305 lp_values,
model, integer_trail, encoder, manager, energies,
- 1306 boxes,
"NoOverlap2dYEnergyMirror", y_helper, x_helper);
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+ 1265 Rectangle& rectangle = cached_rectangles[box];
+
+
+
+
+
+ 1271 active_boxes.push_back(box);
+
+
+ 1274 if (active_boxes.size() <= 1)
return true;
+
+ 1276 std::vector<absl::Span<int>> components =
+
+ 1278 absl::MakeSpan(active_boxes));
+
+
+
+
+ 1283 for (absl::Span<int> boxes : components) {
+ 1284 if (boxes.size() <= 1)
continue;
+
+
+ 1287 lp_values,
model, integer_trail, encoder, manager, energies,
+ 1288 boxes,
"NoOverlap2dXEnergy", x_helper, y_helper);
+
+ 1290 lp_values,
model, integer_trail, encoder, manager, energies,
+ 1291 boxes,
"NoOverlap2dYEnergy", y_helper, x_helper);
+
+
+
+
+
+ 1297 for (absl::Span<int> boxes : components) {
+ 1298 if (boxes.size() <= 1)
continue;
+
+
+ 1301 lp_values,
model, integer_trail, encoder, manager, energies,
+ 1302 boxes,
"NoOverlap2dXEnergyMirror", x_helper, y_helper);
+
+ 1304 lp_values,
model, integer_trail, encoder, manager, energies,
+ 1305 boxes,
"NoOverlap2dYEnergyMirror", y_helper, x_helper);
+
+
+
+
+
+
+
+
#define DCHECK_NE(val1, val2)