diff --git a/docs/cpp_algorithms/annotated.html b/docs/cpp_algorithms/annotated.html index acc434d504..19b035e5b1 100644 --- a/docs/cpp_algorithms/annotated.html +++ b/docs/cpp_algorithms/annotated.html @@ -33,20 +33,11 @@ -
diff --git a/docs/cpp_algorithms/classes.html b/docs/cpp_algorithms/classes.html index ba1fd71192..83dc5d2610 100644 --- a/docs/cpp_algorithms/classes.html +++ b/docs/cpp_algorithms/classes.html @@ -33,20 +33,11 @@ -
diff --git a/docs/cpp_algorithms/classoperations__research_1_1BaseKnapsackSolver-members.html b/docs/cpp_algorithms/classoperations__research_1_1BaseKnapsackSolver-members.html index 334aa1a17b..c1651c9fd1 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1BaseKnapsackSolver-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1BaseKnapsackSolver-members.html @@ -33,20 +33,11 @@ -
- -

#include <knapsack_solver.h>

-
-Inheritance diagram for BaseKnapsackSolver:
-
-
Inheritance graph
- - - - -
[legend]
- +

Detailed Description

+
+

Definition at line 556 of file knapsack_solver.h.

+
@@ -89,10 +72,7 @@ Public Member Functions

Public Member Functions

 BaseKnapsackSolver (const std::string &solver_name)
virtual std::string GetName () const
 
-

Detailed Description

-
-

Definition at line 556 of file knapsack_solver.h.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ BaseKnapsackSolver()

diff --git a/docs/cpp_algorithms/classoperations__research_1_1DenseDoublyLinkedList-members.html b/docs/cpp_algorithms/classoperations__research_1_1DenseDoublyLinkedList-members.html index adf6a4ec25..a928cdf9e0 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1DenseDoublyLinkedList-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1DenseDoublyLinkedList-members.html @@ -33,20 +33,11 @@ -
- -

#include <dense_doubly_linked_list.h>

- +

Detailed Description

+
+

Definition at line 29 of file dense_doubly_linked_list.h.

+
@@ -77,10 +69,7 @@ Public Member Functions

Public Member Functions

template<class T >
void Remove (int i)
 
-

Detailed Description

-
-

Definition at line 29 of file dense_doubly_linked_list.h.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ DenseDoublyLinkedList()

diff --git a/docs/cpp_algorithms/classoperations__research_1_1DynamicPartition-members.html b/docs/cpp_algorithms/classoperations__research_1_1DynamicPartition-members.html index 3780ac19bd..76bcd19768 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1DynamicPartition-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1DynamicPartition-members.html @@ -33,20 +33,11 @@ -
- -

#include <dynamic_partition.h>

- +

Detailed Description

+
+

Definition at line 49 of file dynamic_partition.h.

+
@@ -108,10 +100,7 @@ Public Member Functions

Classes

struct  IterablePart
const std::vector< int > & ElementsInHierarchicalOrder () const
 
-

Detailed Description

-
-

Definition at line 49 of file dynamic_partition.h.

-

Member Enumeration Documentation

+

Member Enumeration Documentation

◆ DebugStringSorting

diff --git a/docs/cpp_algorithms/classoperations__research_1_1DynamicPermutation-members.html b/docs/cpp_algorithms/classoperations__research_1_1DynamicPermutation-members.html index 026a26f493..8fc25344cc 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1DynamicPermutation-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1DynamicPermutation-members.html @@ -33,20 +33,11 @@ -
- -

#include <dynamic_permutation.h>

- +

Detailed Description

+
+

Definition at line 33 of file dynamic_permutation.h.

+
@@ -88,10 +80,7 @@ Public Member Functions

Public Member Functions

 DynamicPermutation (int n)
std::string DebugString () const
 
-

Detailed Description

-
-

Definition at line 33 of file dynamic_permutation.h.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ DynamicPermutation()

diff --git a/docs/cpp_algorithms/classoperations__research_1_1GraphSymmetryFinder-members.html b/docs/cpp_algorithms/classoperations__research_1_1GraphSymmetryFinder-members.html index 821fa7b2a0..03d32324f2 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1GraphSymmetryFinder-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1GraphSymmetryFinder-members.html @@ -33,20 +33,11 @@ -
- -

#include <find_graph_symmetries.h>

- +

Detailed Description

+
+

Definition at line 43 of file find_graph_symmetries.h.

+
@@ -83,10 +75,7 @@ Public Member Functions

Public Types

typedef ::util::StaticGraph Graph
void DistinguishNodeInPartition (int node, DynamicPartition *partition, std::vector< int > *new_singletons_or_null)
 
-

Detailed Description

-
-

Definition at line 43 of file find_graph_symmetries.h.

-

Member Typedef Documentation

+

Member Typedef Documentation

◆ Graph

diff --git a/docs/cpp_algorithms/classoperations__research_1_1KnapsackCapacityPropagator-members.html b/docs/cpp_algorithms/classoperations__research_1_1KnapsackCapacityPropagator-members.html index a12e579fd1..1771f94547 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1KnapsackCapacityPropagator-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1KnapsackCapacityPropagator-members.html @@ -33,20 +33,11 @@ -
- -

#include <knapsack_solver.h>

-
-Inheritance diagram for KnapsackCapacityPropagator:
-
-
Inheritance graph
- - - - -
[legend]
-
-Collaboration diagram for KnapsackCapacityPropagator:
-
-
Collaboration graph
- - - - -
[legend]
- +

Detailed Description

+
+

Definition at line 516 of file knapsack_solver.h.

+
@@ -122,10 +96,7 @@ Protected Member Functions

Public Member Functions

 KnapsackCapacityPropagator (const KnapsackState &state, int64 capacity)
void set_profit_upper_bound (int64 profit)
 
-

Detailed Description

-
-

Definition at line 516 of file knapsack_solver.h.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ KnapsackCapacityPropagator()

diff --git a/docs/cpp_algorithms/classoperations__research_1_1KnapsackGenericSolver-members.html b/docs/cpp_algorithms/classoperations__research_1_1KnapsackGenericSolver-members.html index 384fa728c9..ddafa98e5c 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1KnapsackGenericSolver-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1KnapsackGenericSolver-members.html @@ -33,20 +33,11 @@ -
- -

#include <knapsack_solver.h>

-
-Inheritance diagram for KnapsackGenericSolver:
-
-
Inheritance graph
- - - - -
[legend]
-
-Collaboration diagram for KnapsackGenericSolver:
-
-
Collaboration graph
- - - - -
[legend]
- +

Detailed Description

+
+

Definition at line 595 of file knapsack_solver.h.

+
@@ -102,10 +76,7 @@ Public Member Functions

Public Member Functions

 KnapsackGenericSolver (const std::string &solver_name)
virtual std::string GetName () const
 
-

Detailed Description

-
-

Definition at line 595 of file knapsack_solver.h.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ KnapsackGenericSolver()

diff --git a/docs/cpp_algorithms/classoperations__research_1_1KnapsackPropagator-members.html b/docs/cpp_algorithms/classoperations__research_1_1KnapsackPropagator-members.html index 01c85e6cc3..6789a550ed 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1KnapsackPropagator-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1KnapsackPropagator-members.html @@ -33,20 +33,11 @@ -
- -

#include <knapsack_solver.h>

-
-Inheritance diagram for KnapsackPropagator:
-
-
Inheritance graph
- - - - -
[legend]
- +

Detailed Description

+
+

Definition at line 430 of file knapsack_solver.h.

+
@@ -113,10 +96,7 @@ Protected Member Functions

Public Member Functions

 KnapsackPropagator (const KnapsackState &state)
void set_profit_upper_bound (int64 profit)
 
-

Detailed Description

-
-

Definition at line 430 of file knapsack_solver.h.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ KnapsackPropagator()

diff --git a/docs/cpp_algorithms/classoperations__research_1_1KnapsackSearchNode-members.html b/docs/cpp_algorithms/classoperations__research_1_1KnapsackSearchNode-members.html index b0ba996c83..e34ee8c0a7 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1KnapsackSearchNode-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1KnapsackSearchNode-members.html @@ -33,20 +33,11 @@ -
- -

#include <knapsack_solver.h>

- +

Detailed Description

+
+

Definition at line 321 of file knapsack_solver.h.

+
@@ -86,10 +78,7 @@ Public Member Functions

Public Member Functions

 KnapsackSearchNode (const KnapsackSearchNode *const parent, const KnapsackAssignment &assignment)
void set_next_item_id (int id)
 
-

Detailed Description

-
-

Definition at line 321 of file knapsack_solver.h.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ KnapsackSearchNode()

diff --git a/docs/cpp_algorithms/classoperations__research_1_1KnapsackSearchPath-members.html b/docs/cpp_algorithms/classoperations__research_1_1KnapsackSearchPath-members.html index 8309864f14..d7b17ff376 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1KnapsackSearchPath-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1KnapsackSearchPath-members.html @@ -33,20 +33,11 @@ -
- -

#include <knapsack_solver.h>

- +

Detailed Description

+
+

Definition at line 375 of file knapsack_solver.h.

+
@@ -78,10 +70,7 @@ Public Member Functions

Public Member Functions

 KnapsackSearchPath (const KnapsackSearchNode &from, const KnapsackSearchNode &to)
const KnapsackSearchNode * MoveUpToDepth (const KnapsackSearchNode &node, int depth) const
 
-

Detailed Description

-
-

Definition at line 375 of file knapsack_solver.h.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ KnapsackSearchPath()

diff --git a/docs/cpp_algorithms/classoperations__research_1_1KnapsackSolver-members.html b/docs/cpp_algorithms/classoperations__research_1_1KnapsackSolver-members.html index 1cc9cecc8b..1bf9df3917 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1KnapsackSolver-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1KnapsackSolver-members.html @@ -33,20 +33,11 @@ -
- -

This library solves knapsack problems. - More...

- -

#include <knapsack_solver.h>

- +

Detailed Description

+

This library solves knapsack problems.

+

Problems the library solves include:

    +
  • 0-1 knapsack problems,
    • +
  • Multi-dimensional knapsack problems,
    • +
+

Given n items, each with a profit and a weight, given a knapsack of capacity c, the goal is to find a subset of items which fits inside c and maximizes the total profit. The knapsack problem can easily be extended from 1 to d dimensions. As an example, this can be useful to constrain the maximum number of items inside the knapsack. Without loss of generality, profits and weights are assumed to be positive.

+

From a mathematical point of view, the multi-dimensional knapsack problem can be modeled by d linear constraints: 

ForEach(j:1..d)(Sum(i:1..n)(weight_ij * item_i) <= c_j
+    where item_i is a 0-1 integer variable.
+

Then the goal is to maximize: 

Sum(i:1..n)(profit_i * item_i).
+

There are several ways to solve knapsack problems. One of the most efficient is based on dynamic programming (mainly when weights, profits and dimensions are small, and the algorithm runs in pseudo polynomial time). Unfortunately, when adding conflict constraints the problem becomes strongly NP-hard, i.e. there is no pseudo-polynomial algorithm to solve it. That's the reason why the most of the following code is based on branch and bound search.

+

For instance to solve a 2-dimensional knapsack problem with 9 items, one just has to feed a profit vector with the 9 profits, a vector of 2 vectors for weights, and a vector of capacities. E.g.:

+

Python:

+
profits = [ 1, 2, 3, 4, 5, 6, 7, 8, 9 ]
weights = [ [ 1, 2, 3, 4, 5, 6, 7, 8, 9 ],
[ 1, 1, 1, 1, 1, 1, 1, 1, 1 ]
]
capacities = [ 34, 4 ]
solver = pywrapknapsack_solver.KnapsackSolver(
pywrapknapsack_solver.KnapsackSolver
.KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER,
'Multi-dimensional solver')
solver.Init(profits, weights, capacities)
profit = solver.Solve()

C++:

+
const std::vector<int64> profits = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
const std::vector<std::vector<int64>> weights =
{ { 1, 2, 3, 4, 5, 6, 7, 8, 9 },
{ 1, 1, 1, 1, 1, 1, 1, 1, 1 } };
const std::vector<int64> capacities = { 34, 4 };
KnapsackSolver solver(
KnapsackSolver::KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER,
"Multi-dimensional solver");
solver.Init(profits, weights, capacities);
const int64 profit = solver.Solve();

Java:

+
final long[] profits = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
final long[][] weights = { { 1, 2, 3, 4, 5, 6, 7, 8, 9 },
{ 1, 1, 1, 1, 1, 1, 1, 1, 1 } };
final long[] capacities = { 34, 4 };
KnapsackSolver solver = new KnapsackSolver(
KnapsackSolver.SolverType.KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER,
"Multi-dimensional solver");
solver.init(profits, weights, capacities);
final long profit = solver.solve();
+

Definition at line 120 of file knapsack_solver.h.

+

Public Types

enum  SolverType {
@@ -112,24 +115,7 @@ Public Member Functions
 Time limit in seconds. More...
 
-

Detailed Description

-

This library solves knapsack problems.

-

Problems the library solves include:

    -
  • 0-1 knapsack problems,
    • -
  • Multi-dimensional knapsack problems,
    • -
-

Given n items, each with a profit and a weight, given a knapsack of capacity c, the goal is to find a subset of items which fits inside c and maximizes the total profit. The knapsack problem can easily be extended from 1 to d dimensions. As an example, this can be useful to constrain the maximum number of items inside the knapsack. Without loss of generality, profits and weights are assumed to be positive.

-

From a mathematical point of view, the multi-dimensional knapsack problem can be modeled by d linear constraints: 

ForEach(j:1..d)(Sum(i:1..n)(weight_ij * item_i) <= c_j
-    where item_i is a 0-1 integer variable.
-

Then the goal is to maximize: 

Sum(i:1..n)(profit_i * item_i).
-

There are several ways to solve knapsack problems. One of the most efficient is based on dynamic programming (mainly when weights, profits and dimensions are small, and the algorithm runs in pseudo polynomial time). Unfortunately, when adding conflict constraints the problem becomes strongly NP-hard, i.e. there is no pseudo-polynomial algorithm to solve it. That's the reason why the most of the following code is based on branch and bound search.

-

For instance to solve a 2-dimensional knapsack problem with 9 items, one just has to feed a profit vector with the 9 profits, a vector of 2 vectors for weights, and a vector of capacities. E.g.:

-

Python:

-
profits = [ 1, 2, 3, 4, 5, 6, 7, 8, 9 ]
weights = [ [ 1, 2, 3, 4, 5, 6, 7, 8, 9 ],
[ 1, 1, 1, 1, 1, 1, 1, 1, 1 ]
]
capacities = [ 34, 4 ]
solver = pywrapknapsack_solver.KnapsackSolver(
pywrapknapsack_solver.KnapsackSolver
.KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER,
'Multi-dimensional solver')
solver.Init(profits, weights, capacities)
profit = solver.Solve()

C++:

-
const std::vector<int64> profits = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
const std::vector<std::vector<int64>> weights =
{ { 1, 2, 3, 4, 5, 6, 7, 8, 9 },
{ 1, 1, 1, 1, 1, 1, 1, 1, 1 } };
const std::vector<int64> capacities = { 34, 4 };
KnapsackSolver solver(
KnapsackSolver::KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER,
"Multi-dimensional solver");
solver.Init(profits, weights, capacities);
const int64 profit = solver.Solve();

Java:

-
final long[] profits = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
final long[][] weights = { { 1, 2, 3, 4, 5, 6, 7, 8, 9 },
{ 1, 1, 1, 1, 1, 1, 1, 1, 1 } };
final long[] capacities = { 34, 4 };
KnapsackSolver solver = new KnapsackSolver(
KnapsackSolver.SolverType.KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER,
"Multi-dimensional solver");
solver.init(profits, weights, capacities);
final long profit = solver.solve();
-

Definition at line 120 of file knapsack_solver.h.

-

Member Enumeration Documentation

+

Member Enumeration Documentation

◆ SolverType

diff --git a/docs/cpp_algorithms/classoperations__research_1_1KnapsackState-members.html b/docs/cpp_algorithms/classoperations__research_1_1KnapsackState-members.html index 3f5a233783..e236c06135 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1KnapsackState-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1KnapsackState-members.html @@ -33,20 +33,11 @@ -
- -

#include <knapsack_solver.h>

- +

Detailed Description

+
+

Definition at line 396 of file knapsack_solver.h.

+
@@ -78,10 +70,7 @@ Public Member Functions

Public Member Functions

 KnapsackState ()
bool is_in (int id) const
 
-

Detailed Description

-
-

Definition at line 396 of file knapsack_solver.h.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ KnapsackState()

diff --git a/docs/cpp_algorithms/classoperations__research_1_1MergingPartition-members.html b/docs/cpp_algorithms/classoperations__research_1_1MergingPartition-members.html index c35add4dc7..70b184b49d 100644 --- a/docs/cpp_algorithms/classoperations__research_1_1MergingPartition-members.html +++ b/docs/cpp_algorithms/classoperations__research_1_1MergingPartition-members.html @@ -33,20 +33,11 @@ -
- -

#include <dynamic_partition.h>

- +

Detailed Description

+
+

Definition at line 203 of file dynamic_partition.h.

+
@@ -90,10 +82,7 @@ Public Member Functions

Public Member Functions

 MergingPartition ()
int GetRoot (int node) const
 
-

Detailed Description

-
-

Definition at line 203 of file dynamic_partition.h.

-

Constructor & Destructor Documentation

+

Constructor & Destructor Documentation

◆ MergingPartition() [1/2]

diff --git a/docs/cpp_algorithms/dense__doubly__linked__list_8h.html b/docs/cpp_algorithms/dense__doubly__linked__list_8h.html index 7f8e5c69ba..42d3df621c 100644 --- a/docs/cpp_algorithms/dense__doubly__linked__list_8h.html +++ b/docs/cpp_algorithms/dense__doubly__linked__list_8h.html @@ -33,17 +33,11 @@ -
-
#include <vector>
-#include "ortools/base/logging.h"
-
-Include dependency graph for dense_doubly_linked_list.h:
-
-
- - - - - - - - - - - - -
-
+

Go to the source code of this file.

diff --git a/docs/cpp_algorithms/dense__doubly__linked__list_8h_source.html b/docs/cpp_algorithms/dense__doubly__linked__list_8h_source.html index f3093e883e..030af81c41 100644 --- a/docs/cpp_algorithms/dense__doubly__linked__list_8h_source.html +++ b/docs/cpp_algorithms/dense__doubly__linked__list_8h_source.html @@ -33,17 +33,11 @@ -

+

Returns the name of the constraint (or the empty std::string if not set).

+
@@ -211,6 +183,15 @@ Friends
+

The constraint will be enforced iff all literals listed here are true.

+

If this is empty, then the constraint will always be enforced. An enforced constraint must be satisfied, and an un-enforced one will simply be ignored.

+

This is also called half-reification. To have an equivalence between a literal and a constraint (full reification), one must add both a constraint (controlled by a literal l) and its negation (controlled by the negation of l).

+

Important: as of September 2018, only a few constraint support enforcement:

    +
  • bool_or, bool_and, linear: fully supported.
    • +
  • interval: only support a single enforcement literal.
    • +
  • other: no support (but can be added on a per-demand basis).
    • +
+
@@ -229,6 +210,8 @@ Friends
+

See OnlyEnforceIf(absl::Span<const BoolVar> literals).

+
@@ -254,7 +237,9 @@ Friends
-

Definition at line 367 of file cp_model.h.

+

Returns the underlying protobuf object (useful for testing).

+ +

Definition at line 417 of file cp_model.h.

@@ -274,6 +259,8 @@ Friends
+

Sets the name of the constraint.

+

Friends And Related Function Documentation

@@ -297,7 +284,7 @@ Friends
-

Definition at line 373 of file cp_model.h.

+

Definition at line 423 of file cp_model.h.

@@ -322,7 +309,7 @@ Friends
-

Definition at line 377 of file cp_model.h.

+

Definition at line 427 of file cp_model.h.

diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1ConstraintProto-members.html b/docs/cpp_sat/classoperations__research_1_1sat_1_1ConstraintProto-members.html index a45c3eb5e9..a49ed306f7 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1ConstraintProto-members.html +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1ConstraintProto-members.html @@ -33,20 +33,11 @@ -
- -

#include <cp_model.pb.h>

-
-Inheritance diagram for ConstraintProto:
-
-
Inheritance graph
- - - - -
[legend]
-
-Collaboration diagram for ConstraintProto:
-
-
Collaboration graph
- - - - -
[legend]
- +

Detailed Description

+
+

Definition at line 2929 of file cp_model.pb.h.

+
Static Public Attributes -

Public Types

enum  ConstraintCase {
@@ -533,20 +506,8 @@ Static Public Member Functions
static constexpr int kIndexInFileMessages
 
- - - - - - -

-Friends

class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata
 
struct ::TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto
 
void swap (ConstraintProto &a, ConstraintProto &b)
 
-

Detailed Description

-
-

Definition at line 2929 of file cp_model.pb.h.

-

Member Enumeration Documentation

+

Member Enumeration Documentation

◆ anonymous enum

diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__coll__graph.map b/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__coll__graph.map index 4939c105cf..af04ca8912 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__coll__graph.map +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__coll__graph.map @@ -1,5 +1,5 @@ - + diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__coll__graph.md5 b/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__coll__graph.md5 index 7ef05cbbdf..1b50e338d2 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__coll__graph.md5 +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__coll__graph.md5 @@ -1 +1 @@ -610756fe6250a73b5a9f6ddf207b90ac \ No newline at end of file +0c0ca74ec2759f48272216f17b535369 \ No newline at end of file diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__inherit__graph.map b/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__inherit__graph.map index dd34e281f2..ac27df532b 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__inherit__graph.map +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__inherit__graph.map @@ -1,9 +1,9 @@ - - - - - - - + + + + + + + diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__inherit__graph.md5 b/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__inherit__graph.md5 index 2f49070add..e3c522d1fb 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__inherit__graph.md5 +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1Constraint__inherit__graph.md5 @@ -1 +1 @@ -573c69554dfb836ecd19a4fea3f7e1ea \ No newline at end of file +821f13bd1243c0a7c589ff62de56508b \ No newline at end of file diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1CpModelBuilder-members.html b/docs/cpp_sat/classoperations__research_1_1sat_1_1CpModelBuilder-members.html index 33be557807..d234d8a064 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1CpModelBuilder-members.html +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1CpModelBuilder-members.html @@ -33,20 +33,11 @@ - @@ -229,6 +259,10 @@ Friends
+

Adds an allowed assignments constraint.

+

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 tuple added to the constraint.

+

It returns a table constraint that allows adding tuples incrementally after construction,

+
@@ -263,6 +297,12 @@ Friends
+

An automaton constraint/.

+

An automaton constraint takes a list of variables (of size n), an initial state, a set of final states, and a set of transitions. A transition is a triplet ('tail', 'head', 'label'), where 'tail' and 'head' are states, and 'label' is the label of an arc from 'head' to 'tail', corresponding to the value of one variable in the list of variables.

+

This automaton will be unrolled into a flow with n + 1 phases. Each phase contains the possible states of the automaton. The first state contains the initial state. The last phase contains the final states.

+

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.

+
@@ -281,6 +321,8 @@ Friends
+

Adds the constraint that all literals must be true.

+
@@ -299,6 +341,8 @@ Friends
+

Adds the constraint that at least one of the literals must be true.

+
@@ -336,6 +380,11 @@ Friends
+

Adds a circuit constraint.

+

The circuit constraint is defined on a graph where the arc presence are controlled by literals. That is the arc is part of the circuit of its corresponding literal is assigned to true.

+

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.

+
@@ -354,6 +403,9 @@ Friends
+

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.

+
@@ -388,6 +440,8 @@ Friends
+

Adds a decision strategy on a list of integer variables.

+
@@ -422,6 +476,8 @@ Friends
+

Adds a decision strategy on a list of boolean variables.

+
@@ -456,6 +512,8 @@ Friends
+

Adds target = num / denom (integer division rounded towards 0).

+
@@ -490,6 +548,8 @@ Friends
+

Adds the element constraint: values[index] == target.

+
@@ -518,6 +578,8 @@ Friends
+

Adds left == right.

+
@@ -536,6 +598,10 @@ Friends
+

Adds an forbidden assignments constraint.

+

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,

+
@@ -564,6 +630,8 @@ Friends
+

Adds left >= right.

+
@@ -592,6 +660,8 @@ Friends
+

Adds left > right.

+
@@ -628,7 +698,9 @@ Friends
-

Definition at line 507 of file cp_model.h.

+

Adds a => b.

+ +

Definition at line 594 of file cp_model.h.

@@ -658,6 +730,9 @@ Friends
+

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.

+
@@ -686,6 +761,8 @@ Friends
+

Adds left <= right.

+
@@ -714,6 +791,8 @@ Friends
+

Adds left < right.

+
@@ -742,6 +821,8 @@ Friends
+

Adds expr in domain.

+
@@ -770,6 +851,8 @@ Friends
+

Adds target == max(vars).

+
@@ -798,6 +881,8 @@ Friends
+

Adds target == min(vars).

+
@@ -832,6 +917,8 @@ Friends
+

Adds target = var % mod.

+
@@ -850,6 +937,9 @@ Friends
+

Adds a no-overlap constraint.

+

it ensures that all present intervals do not overlap in time.

+
@@ -867,6 +957,8 @@ Friends
+

The no_overlap_2d constraint prevents a set of boxes from overlapping.

+
@@ -895,6 +987,8 @@ Friends
+

Adds left != right.

+
@@ -923,6 +1017,8 @@ Friends
+

Adds target == prod(vars).

+
@@ -951,6 +1047,11 @@ Friends
+

Adds a reservoir constraint with optional refill/emptying events.

+

Maintain a reservoir level within bounds. The water level starts at 0, and at any time >= 0, it must be within min_level, and max_level. Furthermore, this constraints expect all times variables to be >= 0. Given an event (time, demand, active), if active is true, and if time is assigned a value t, then the level of the reservoir changes by demand (which is constant) at time t.

+

Note that level_min can be > 0, or level_max can be < 0. It just forces some demands to be executed at time 0 to make sure that we are within those bounds with the executed demands. Therefore, at any time t >= 0: sum(demands[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.

+
@@ -985,6 +1086,8 @@ Friends
+

Adds the element constraint: variables[index] == target.

+
@@ -1010,7 +1113,7 @@ Friends
-

Definition at line 684 of file cp_model.h.

+

Definition at line 799 of file cp_model.h.

@@ -1029,6 +1132,8 @@ Friends
+

Creates an always false Boolean variable.

+
@@ -1047,6 +1152,8 @@ Friends
+

Adds a linear maximization objective.

+
@@ -1065,6 +1172,8 @@ Friends
+

Adds a linear minimization objective.

+
@@ -1090,7 +1199,7 @@ Friends
-

Definition at line 687 of file cp_model.h.

+

Definition at line 802 of file cp_model.h.

@@ -1109,6 +1218,8 @@ Friends
+

Creates a Boolean variable.

+
@@ -1127,6 +1238,8 @@ Friends
+

Creates a constant variable.

+
@@ -1161,6 +1274,8 @@ Friends
+

Creates an interval variable.

+
@@ -1179,6 +1294,8 @@ Friends
+

Creates an integer variable with the given domain.

+
@@ -1219,6 +1336,8 @@ Friends
+

Creates an optional interval variable.

+
@@ -1244,7 +1363,7 @@ Friends
-

Definition at line 686 of file cp_model.h.

+

Definition at line 801 of file cp_model.h.

@@ -1264,6 +1383,10 @@ Friends
+

Sets scaling of the objective.

+

It must be called after Minimize() or Maximize()).

+

scaling must be > 0.0.

+
@@ -1281,6 +1404,8 @@ Friends
+

Creates an always true Boolean variable.

+

Friends And Related Function Documentation

@@ -1304,7 +1429,7 @@ Friends
-

Definition at line 690 of file cp_model.h.

+

Definition at line 805 of file cp_model.h.

@@ -1328,7 +1453,7 @@ Friends
-

Definition at line 691 of file cp_model.h.

+

Definition at line 806 of file cp_model.h.

diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1CpModelProto-members.html b/docs/cpp_sat/classoperations__research_1_1sat_1_1CpModelProto-members.html index ab790d41f2..d13edcce3b 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1CpModelProto-members.html +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1CpModelProto-members.html @@ -33,20 +33,11 @@ -
- -

#include <cp_model.pb.h>

-
-Inheritance diagram for CpModelProto:
-
-
Inheritance graph
- - - - -
[legend]
-
-Collaboration diagram for CpModelProto:
-
-
Collaboration graph
- - - - -
[legend]
- +

Detailed Description

+
+

Definition at line 4084 of file cp_model.pb.h.

+
Static Public Attributes -

Public Types

enum  : int {
@@ -247,20 +220,8 @@ Static Public Member Functions
static constexpr int kIndexInFileMessages
 
- - - - - - -

-Friends

class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata
 
struct ::TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto
 
void swap (CpModelProto &a, CpModelProto &b)
 
-

Detailed Description

-
-

Definition at line 4084 of file cp_model.pb.h.

-

Member Enumeration Documentation

+

Member Enumeration Documentation

◆ anonymous enum

diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1CpObjectiveProto-members.html b/docs/cpp_sat/classoperations__research_1_1sat_1_1CpObjectiveProto-members.html index 2b6a1c0f63..d9510aa121 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1CpObjectiveProto-members.html +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1CpObjectiveProto-members.html @@ -33,20 +33,11 @@ -
- -

#include <cp_model.pb.h>

-
-Inheritance diagram for CpObjectiveProto:
-
-
Inheritance graph
- - - - -
[legend]
-
-Collaboration diagram for CpObjectiveProto:
-
-
Collaboration graph
- - - - -
[legend]
- +

Detailed Description

+
+

Definition at line 3370 of file cp_model.pb.h.

+
Static Public Attributes -

Public Types

enum  : int {
@@ -216,20 +189,8 @@ Static Public Member Functions
static constexpr int kIndexInFileMessages
 
- - - - - - -

-Friends

class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata
 
struct ::TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto
 
void swap (CpObjectiveProto &a, CpObjectiveProto &b)
 
-

Detailed Description

-
-

Definition at line 3370 of file cp_model.pb.h.

-

Member Enumeration Documentation

+

Member Enumeration Documentation

◆ anonymous enum

diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1CpSolverResponse-members.html b/docs/cpp_sat/classoperations__research_1_1sat_1_1CpSolverResponse-members.html index b5d5b8b00b..c04cf05345 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1CpSolverResponse-members.html +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1CpSolverResponse-members.html @@ -33,20 +33,11 @@ -
- -

#include <cp_model.pb.h>

-
-Inheritance diagram for CpSolverResponse:
-
-
Inheritance graph
- - - - -
[legend]
-
-Collaboration diagram for CpSolverResponse:
-
-
Collaboration graph
- - - - -
[legend]
- +

Detailed Description

+
+

Definition at line 4280 of file cp_model.pb.h.

+
Static Public Attributes -

Public Types

enum  : int {
@@ -330,20 +303,8 @@ Static Public Member Functions
static constexpr int kIndexInFileMessages
 
- - - - - - -

-Friends

class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata
 
struct ::TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto
 
void swap (CpSolverResponse &a, CpSolverResponse &b)
 
-

Detailed Description

-
-

Definition at line 4280 of file cp_model.pb.h.

-

Member Enumeration Documentation

+

Member Enumeration Documentation

◆ anonymous enum

diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint-members.html b/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint-members.html index c5ff87487a..93dbd30aa9 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint-members.html +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint-members.html @@ -33,20 +33,11 @@ -
-

Definition at line 370 of file cp_model.h.

+

Returns the mutable underlying protobuf object (useful for model edition).

+ +

Definition at line 420 of file cp_model.h.

@@ -194,6 +170,8 @@ Friends
+

Returns the name of the constraint (or the empty std::string if not set).

+
@@ -220,6 +198,15 @@ Friends
+

The constraint will be enforced iff all literals listed here are true.

+

If this is empty, then the constraint will always be enforced. An enforced constraint must be satisfied, and an un-enforced one will simply be ignored.

+

This is also called half-reification. To have an equivalence between a literal and a constraint (full reification), one must add both a constraint (controlled by a literal l) and its negation (controlled by the negation of l).

+

Important: as of September 2018, only a few constraint support enforcement:

+
@@ -246,6 +233,8 @@ Friends
+

See OnlyEnforceIf(absl::Span<const BoolVar> literals).

+
@@ -271,7 +260,9 @@ Friends
-

Definition at line 367 of file cp_model.h.

+

Returns the underlying protobuf object (useful for testing).

+ +

Definition at line 417 of file cp_model.h.

@@ -299,6 +290,8 @@ Friends
+

Sets the name of the constraint.

+

Friends And Related Function Documentation

@@ -322,7 +315,7 @@ Friends
-

Definition at line 461 of file cp_model.h.

+

Definition at line 546 of file cp_model.h.

@@ -347,7 +340,7 @@ Friends
-

Definition at line 377 of file cp_model.h.

+

Definition at line 427 of file cp_model.h.

diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraintProto-members.html b/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraintProto-members.html index e27432049c..1384aabd56 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraintProto-members.html +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraintProto-members.html @@ -33,20 +33,11 @@ -
- -

#include <cp_model.pb.h>

-
-Inheritance diagram for CumulativeConstraintProto:
-
-
Inheritance graph
- - - - -
[legend]
-
-Collaboration diagram for CumulativeConstraintProto:
-
-
Collaboration graph
- - - - -
[legend]
- +

Detailed Description

+
+

Definition at line 1573 of file cp_model.pb.h.

+
Static Public Attributes -

Public Types

enum  : int { kIntervalsFieldNumber = 2, @@ -191,20 +164,8 @@ Static Public Member Functions
static constexpr int kIndexInFileMessages
 
- - - - - - -

-Friends

class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata
 
struct ::TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto
 
void swap (CumulativeConstraintProto &a, CumulativeConstraintProto &b)
 
-

Detailed Description

-
-

Definition at line 1573 of file cp_model.pb.h.

-

Member Enumeration Documentation

+

Member Enumeration Documentation

◆ anonymous enum

diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__coll__graph.map b/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__coll__graph.map index 88302c5106..f53b86ed0a 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__coll__graph.map +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__coll__graph.map @@ -1,6 +1,6 @@ - - + + diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__coll__graph.md5 b/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__coll__graph.md5 index c4358dbc62..8d327c0924 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__coll__graph.md5 +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__coll__graph.md5 @@ -1 +1 @@ -6deb33659e51dcf3fa2c5025a7ef82f2 \ No newline at end of file +6e8b7d28b6b3937deea1656967776fb5 \ No newline at end of file diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__inherit__graph.map b/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__inherit__graph.map index 808024f923..6caa00af92 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__inherit__graph.map +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__inherit__graph.map @@ -1,4 +1,4 @@ - - + + diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__inherit__graph.md5 b/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__inherit__graph.md5 index 95e4a6e8c1..2b3534358c 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__inherit__graph.md5 +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1CumulativeConstraint__inherit__graph.md5 @@ -1 +1 @@ -bc40a84568a0f74a9c6f94d0037cf841 \ No newline at end of file +7b0351c3e28851855483acb3aca30635 \ No newline at end of file diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1DecisionStrategyProto-members.html b/docs/cpp_sat/classoperations__research_1_1sat_1_1DecisionStrategyProto-members.html index 126297b697..c9fda79db6 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1DecisionStrategyProto-members.html +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1DecisionStrategyProto-members.html @@ -33,20 +33,11 @@ -
- -

#include <cp_model.pb.h>

-
-Inheritance diagram for DecisionStrategyProto:
-
-
Inheritance graph
- - - - -
[legend]
-
-Collaboration diagram for DecisionStrategyProto:
-
-
Collaboration graph
- - - - -
[legend]
- +

Detailed Description

+
+

Definition at line 3695 of file cp_model.pb.h.

+
-

Public Types

enum  : int { kVariablesFieldNumber = 1, @@ -252,20 +225,8 @@ Static Public Attributes
 
static constexpr int DomainReductionStrategy_ARRAYSIZE
 
- - - - - - -

-Friends

class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata
 
struct ::TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto
 
void swap (DecisionStrategyProto &a, DecisionStrategyProto &b)
 
-

Detailed Description

-
-

Definition at line 3695 of file cp_model.pb.h.

-

Member Typedef Documentation

+

Member Typedef Documentation

◆ AffineTransformation

diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1DecisionStrategyProto__AffineTransformation-members.html b/docs/cpp_sat/classoperations__research_1_1sat_1_1DecisionStrategyProto__AffineTransformation-members.html index 17e0413f53..ec2c83c6b2 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1DecisionStrategyProto__AffineTransformation-members.html +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1DecisionStrategyProto__AffineTransformation-members.html @@ -33,20 +33,11 @@ -
- -

#include <cp_model.pb.h>

-
-Inheritance diagram for DecisionStrategyProto_AffineTransformation:
-
-
Inheritance graph
- - - - -
[legend]
-
-Collaboration diagram for DecisionStrategyProto_AffineTransformation:
-
-
Collaboration graph
- - - - -
[legend]
- +

Detailed Description

+
+

Definition at line 3550 of file cp_model.pb.h.

+
Static Public Attributes -

Public Types

enum  : int { kOffsetFieldNumber = 2, @@ -175,20 +148,8 @@ Static Public Member Functions
static constexpr int kIndexInFileMessages
 
- - - - - - -

-Friends

class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata
 
struct ::TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto
 
void swap (DecisionStrategyProto_AffineTransformation &a, DecisionStrategyProto_AffineTransformation &b)
 
-

Detailed Description

-
-

Definition at line 3550 of file cp_model.pb.h.

-

Member Enumeration Documentation

+

Member Enumeration Documentation

◆ anonymous enum

diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1ElementConstraintProto-members.html b/docs/cpp_sat/classoperations__research_1_1sat_1_1ElementConstraintProto-members.html index e18588c133..38a5c9a213 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1ElementConstraintProto-members.html +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1ElementConstraintProto-members.html @@ -33,20 +33,11 @@ -
- -

#include <cp_model.pb.h>

-
-Inheritance diagram for ElementConstraintProto:
-
-
Inheritance graph
- - - - -
[legend]
-
-Collaboration diagram for ElementConstraintProto:
-
-
Collaboration graph
- - - - -
[legend]
- +

Detailed Description

+
+

Definition at line 986 of file cp_model.pb.h.

+
Static Public Attributes -

Public Types

enum  : int { kVarsFieldNumber = 3, @@ -183,20 +156,8 @@ Static Public Member Functions
static constexpr int kIndexInFileMessages
 
- - - - - - -

-Friends

class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata
 
struct ::TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto
 
void swap (ElementConstraintProto &a, ElementConstraintProto &b)
 
-

Detailed Description

-
-

Definition at line 986 of file cp_model.pb.h.

-

Member Enumeration Documentation

+

Member Enumeration Documentation

◆ anonymous enum

diff --git a/docs/cpp_sat/classoperations__research_1_1sat_1_1IntVar-members.html b/docs/cpp_sat/classoperations__research_1_1sat_1_1IntVar-members.html index baa944419a..8820f88d96 100644 --- a/docs/cpp_sat/classoperations__research_1_1sat_1_1IntVar-members.html +++ b/docs/cpp_sat/classoperations__research_1_1sat_1_1IntVar-members.html @@ -33,20 +33,11 @@ - @@ -186,7 +171,9 @@ Friends
-

Definition at line 157 of file cp_model.h.

+

Returns the index of the variable in the model.

+ +

Definition at line 180 of file cp_model.h.

@@ -213,7 +200,9 @@ Friends
-

Definition at line 152 of file cp_model.h.

+

Returns the mutable underlying protobuf object (useful for model edition).

+ +

Definition at line 175 of file cp_model.h.

@@ -240,7 +229,9 @@ Friends
-

Definition at line 134 of file cp_model.h.

+

Returns the name of the variable (or the empty std::string if not set).

+ +

Definition at line 154 of file cp_model.h.

@@ -268,7 +259,9 @@ Friends
-

Definition at line 140 of file cp_model.h.

+

Difference test with anpther IntVar.

+ +

Definition at line 162 of file cp_model.h.

@@ -296,7 +289,9 @@ Friends
-

Definition at line 136 of file cp_model.h.

+

Equality test with another IntVar.

+ +

Definition at line 157 of file cp_model.h.

@@ -323,7 +318,9 @@ Friends
-

Definition at line 147 of file cp_model.h.

+

Returns the underlying protobuf object (useful for testing).

+ +

Definition at line 170 of file cp_model.h.

@@ -343,6 +340,8 @@ Friends
+

Sets the name of the variable.

+

Friends And Related Function Documentation

@@ -366,7 +365,7 @@ Friends
-

Definition at line 160 of file cp_model.h.

+

Definition at line 183 of file cp_model.h.

@@ -390,7 +389,7 @@ Friends
-

Definition at line 161 of file cp_model.h.

+

Definition at line 184 of file cp_model.h.

@@ -414,7 +413,7 @@ Friends
-

Definition at line 163 of file cp_model.h.

+

Definition at line 186 of file cp_model.h.

@@ -438,7 +437,7 @@ Friends
-

Definition at line 162 of file cp_model.h.

+

Definition at line 185 of file cp_model.h.

@@ -462,7 +461,7 @@ Friends
-

Definition at line 164 of file cp_model.h.

+

Definition at line 187 of file cp_model.h.

@@ -500,6 +499,8 @@ Friends
+

Returns the max of an integer variable in a solution.

+
@@ -536,6 +537,8 @@ Friends
+

Returns the min of an integer variable in a solution.

+
@@ -572,6 +575,8 @@ Friends
+

Evaluates the value of an linear expression in a solver response.

+
The documentation for this class was generated from the following file: