49#ifndef OR_TOOLS_CONSTRAINT_SOLVER_CONSTRAINT_SOLVERI_H_
50#define OR_TOOLS_CONSTRAINT_SOLVER_CONSTRAINT_SOLVERI_H_
63#include "absl/algorithm/container.h"
64#include "absl/container/flat_hash_map.h"
65#include "absl/container/flat_hash_set.h"
66#include "absl/log/check.h"
67#include "absl/strings/str_cat.h"
68#include "absl/strings/str_format.h"
69#include "absl/time/time.h"
70#include "absl/types/span.h"
114 IntVar*
Var()
override;
147 enum { CHUNK_SIZE = 16 };
150 const Chunk*
const next;
151 explicit Chunk(
const Chunk* next) : next(next) {}
159 : chunk_(l->chunks_), value_(l->
Last()) {}
160 bool ok()
const {
return (value_ !=
nullptr); }
164 if (value_ == chunk_->data + CHUNK_SIZE) {
165 chunk_ = chunk_->next;
166 value_ = chunk_ ? chunk_->data :
nullptr;
178 if (pos_.
Value() == 0) {
179 Chunk*
const chunk = s->UnsafeRevAlloc(
new Chunk(chunks_));
181 reinterpret_cast<void*
>(chunk));
182 pos_.SetValue(s, CHUNK_SIZE - 1);
186 chunks_->data[pos_.
Value()] = val;
191 if (chunks_ ==
nullptr ||
LastValue() != val) {
198 return chunks_ ? &chunks_->data[pos_.Value()] :
nullptr;
201 T*
MutableLast() {
return chunks_ ? &chunks_->data[pos_.
Value()] :
nullptr; }
206 return chunks_->data[pos_.Value()];
212 chunks_->data[pos_.Value()] = v;
222inline uint64_t
Hash1(uint64_t value) {
223 value = (~value) + (value << 21);
224 value ^= value >> 24;
225 value += (value << 3) + (value << 8);
226 value ^= value >> 14;
227 value += (value << 2) + (value << 4);
228 value ^= value >> 28;
229 value += (value << 31);
233inline uint64_t
Hash1(uint32_t value) {
235 a = (a + 0x7ed55d16) + (a << 12);
236 a = (a ^ 0xc761c23c) ^ (a >> 19);
237 a = (a + 0x165667b1) + (a << 5);
238 a = (a + 0xd3a2646c) ^ (a << 9);
239 a = (a + 0xfd7046c5) + (a << 3);
240 a = (a ^ 0xb55a4f09) ^ (a >> 16);
244inline uint64_t
Hash1(int64_t value) {
245 return Hash1(
static_cast<uint64_t
>(value));
248inline uint64_t
Hash1(
int value) {
return Hash1(
static_cast<uint32_t
>(value)); }
250inline uint64_t
Hash1(
void*
const ptr) {
251#if defined(__x86_64__) || defined(_M_X64) || defined(__powerpc64__) || \
252 defined(__aarch64__) || (defined(_MIPS_SZPTR) && (_MIPS_SZPTR == 64))
253 return Hash1(
reinterpret_cast<uint64_t
>(ptr));
255 return Hash1(
reinterpret_cast<uint32_t
>(ptr));
260uint64_t
Hash1(
const std::vector<T*>& ptrs) {
261 if (ptrs.empty())
return 0;
262 if (ptrs.size() == 1)
return Hash1(ptrs[0]);
263 uint64_t hash =
Hash1(ptrs[0]);
264 for (
int i = 1; i < ptrs.size(); ++i) {
265 hash = hash * i +
Hash1(ptrs[i]);
270inline uint64_t
Hash1(
const std::vector<int64_t>& ptrs) {
271 if (ptrs.empty())
return 0;
272 if (ptrs.size() == 1)
return Hash1(ptrs[0]);
273 uint64_t hash =
Hash1(ptrs[0]);
274 for (
int i = 1; i < ptrs.size(); ++i) {
275 hash = hash * i +
Hash1(ptrs[i]);
282template <
class K,
class V>
283class RevImmutableMultiMap {
287 array_(solver->UnsafeRevAllocArray(
new Cell*[initial_size])),
290 memset(array_, 0,
sizeof(*array_) * size_.Value());
300 Cell* tmp = array_[code];
302 if (tmp->key() == key) {
315 Cell* tmp = array_[code];
317 if (tmp->key() == key) {
322 return default_value;
326 void Insert(
const K& key,
const V& value) {
327 const int position =
Hash1(key) % size_.
Value();
329 solver_->UnsafeRevAlloc(
new Cell(key, value, array_[position]));
331 reinterpret_cast<void*
>(cell));
332 num_items_.
Incr(solver_);
333 if (num_items_.Value() > 2 * size_.Value()) {
341 Cell(
const K& key,
const V& value, Cell*
const next)
342 : key_(key), value_(value), next_(next) {}
344 void SetRevNext(Solver*
const solver, Cell*
const next) {
345 solver->SaveAndSetValue(
reinterpret_cast<void**
>(&next_),
346 reinterpret_cast<void*
>(next));
349 Cell* next()
const {
return next_; }
351 const K& key()
const {
return key_; }
353 const V& value()
const {
return value_; }
362 Cell**
const old_cell_array = array_;
363 const int old_size = size_.Value();
364 size_.SetValue(solver_, size_.Value() * 2);
365 solver_->SaveAndSetValue(
366 reinterpret_cast<void**
>(&array_),
367 reinterpret_cast<void*
>(
368 solver_->UnsafeRevAllocArray(
new Cell*[size_.Value()])));
369 memset(array_, 0, size_.Value() *
sizeof(*array_));
370 for (
int i = 0;
i < old_size; ++
i) {
371 Cell* tmp = old_cell_array[
i];
372 while (tmp !=
nullptr) {
373 Cell*
const to_reinsert = tmp;
375 const uint64_t new_position =
Hash1(to_reinsert->key()) % size_.Value();
376 to_reinsert->SetRevNext(solver_, array_[new_position]);
377 solver_->SaveAndSetValue(
378 reinterpret_cast<void**
>(&array_[new_position]),
379 reinterpret_cast<void*
>(to_reinsert));
384 Solver*
const solver_;
386 NumericalRev<int> size_;
387 NumericalRev<int> num_items_;
395 bool Switched()
const {
return value_; }
397 void Switch(Solver*
const solver) { solver->SaveAndSetValue(&value_,
true); }
440 bool IsSet(int64_t index)
const;
457 void Save(
Solver* solver,
int offset);
459 const int64_t length_;
475 bool IsSet(int64_t row, int64_t column)
const {
477 DCHECK_LT(row, rows_);
478 DCHECK_GE(column, 0);
479 DCHECK_LT(column, columns_);
496 const int64_t columns_;
509 CallMethod0(T*
const ct,
void (T::*method)(),
const std::string& name)
510 : constraint_(ct), method_(method), name_(name) {}
514 void Run(
Solver*
const)
override { (constraint_->*method_)(); }
517 return "CallMethod_" + name_ +
"(" + constraint_->DebugString() +
")";
521 T*
const constraint_;
522 void (T::*
const method_)();
523 const std::string name_;
528 const std::string& name) {
534 return absl::StrCat(param);
540 return param->DebugString();
544template <
class T,
class P>
545class CallMethod1 :
public Demon {
547 CallMethod1(T*
const ct,
void (T::*method)(P),
const std::string& name,
549 : constraint_(ct), method_(method), name_(name), param1_(param1) {}
553 void Run(
Solver*
const)
override { (constraint_->*method_)(param1_); }
556 return absl::StrCat(
"CallMethod_", name_,
"(", constraint_->DebugString(),
561 T*
const constraint_;
562 void (T::*
const method_)(P);
563 const std::string name_;
567template <
class T,
class P>
569 const std::string& name, P param1) {
574template <
class T,
class P,
class Q>
577 CallMethod2(T*
const ct,
void (T::*method)(P, Q),
const std::string& name,
588 (constraint_->*method_)(param1_, param2_);
592 return absl::StrCat(
"CallMethod_", name_,
"(", constraint_->DebugString(),
598 T*
const constraint_;
599 void (T::*
const method_)(P, Q);
600 const std::string name_;
605template <
class T,
class P,
class Q>
607 void (T::*method)(P, Q),
const std::string& name,
608 P param1, Q param2) {
613template <
class T,
class P,
class Q,
class R>
616 CallMethod3(T*
const ct,
void (T::*method)(P, Q, R),
const std::string& name,
617 P param1, Q param2, R param3)
627 void Run(Solver*
const)
override {
628 (constraint_->*method_)(param1_, param2_, param3_);
632 return absl::StrCat(absl::StrCat(
"CallMethod_", name_),
633 absl::StrCat(
"(", constraint_->DebugString()),
640 T*
const constraint_;
641 void (T::*
const method_)(P, Q, R);
642 const std::string name_;
648template <
class T,
class P,
class Q,
class R>
650 void (T::*method)(P, Q, R),
const std::string& name,
651 P param1, Q param2, R param3) {
667 : constraint_(ct), method_(method), name_(name) {}
671 void Run(
Solver*
const)
override { (constraint_->*method_)(); }
678 return "DelayedCallMethod_" + name_ +
"(" + constraint_->DebugString() +
683 T*
const constraint_;
684 void (T::*
const method_)();
685 const std::string name_;
691 const std::string& name) {
696template <
class T,
class P>
701 : constraint_(ct), method_(method), name_(name), param1_(param1) {}
705 void Run(
Solver*
const)
override { (constraint_->*method_)(param1_); }
712 return absl::StrCat(
"DelayedCallMethod_", name_,
"(",
713 constraint_->DebugString(),
", ",
718 T*
const constraint_;
719 void (T::*
const method_)(P);
720 const std::string name_;
724template <
class T,
class P>
726 void (T::*method)(P),
727 const std::string& name, P param1) {
732template <
class T,
class P,
class Q>
736 const std::string& name, P param1, Q param2)
746 (constraint_->*method_)(param1_, param2_);
754 return absl::StrCat(absl::StrCat(
"DelayedCallMethod_", name_),
755 absl::StrCat(
"(", constraint_->DebugString()),
761 T*
const constraint_;
762 void (T::*
const method_)(P, Q);
763 const std::string name_;
768template <
class T,
class P,
class Q>
770 void (T::*method)(P, Q),
771 const std::string& name, P param1,
786 IntVar*
const index, F values,
787 std::function<
bool()> deep_serialize)
791 values_(std::move(values)),
792 deep_serialize_(std::move(deep_serialize)) {}
795 void Post()
override {
797 solver(),
this, &LightIntFunctionElementCt::IndexBound,
"IndexBound");
802 if (index_->Bound()) {
808 return absl::StrFormat(
"LightIntFunctionElementCt(%s, %s)",
809 var_->DebugString(), index_->DebugString());
819 if (deep_serialize_ ==
nullptr || deep_serialize_()) {
827 void IndexBound() { var_->
SetValue(values_(index_->
Min())); }
830 IntVar*
const index_;
832 std::function<bool()> deep_serialize_;
841 IntVar*
const index1, IntVar*
const index2,
842 F values, std::function<
bool()> deep_serialize)
847 values_(
std::move(values)),
848 deep_serialize_(
std::move(deep_serialize)) {}
850 void Post()
override {
852 solver(),
this, &LightIntIntFunctionElementCt::IndexBound,
860 return "LightIntIntFunctionElementCt";
863 void Accept(ModelVisitor*
const visitor)
const override {
872 const int64_t index1_min = index1_->Min();
873 const int64_t index1_max = index1_->Max();
876 if (deep_serialize_ ==
nullptr || deep_serialize_()) {
877 for (
int i = index1_min; i <= index1_max; ++i) {
878 visitor->VisitInt64ToInt64Extension(
879 [
this, i](int64_t j) {
return values_(i, j); }, index2_->Min(),
894 IntVar*
const index1_;
895 IntVar*
const index2_;
897 std::function<bool()> deep_serialize_;
906 IntVar*
const index1, IntVar*
const index2,
907 IntVar*
const index3, F values)
913 values_(
std::move(values)) {}
915 void Post()
override {
917 solver(),
this, &LightIntIntIntFunctionElementCt::IndexBound,
921 index3_->WhenBound(demon);
926 return "LightIntIntFunctionElementCt";
929 void Accept(ModelVisitor*
const visitor)
const override {
950 IntVar*
const index1_;
951 IntVar*
const index2_;
952 IntVar*
const index3_;
979 virtual bool MakeNextNeighbor(Assignment* delta, Assignment* deltadelta) = 0;
981 virtual void Start(
const Assignment* assignment) = 0;
982 virtual void Reset() {}
987 virtual bool HoldsDelta()
const {
return false; }
995 max_inversible_index_ = candidate_values_.size();
996 candidate_value_to_index_.resize(max_value + 1, -1);
997 committed_value_to_index_.resize(max_value + 1, -1);
1003 DCHECK_LT(index, candidate_values_.size());
1004 return candidate_values_[index];
1007 return committed_values_[index];
1010 return checkpoint_values_[index];
1013 candidate_values_[index] = value;
1014 if (index < max_inversible_index_) {
1015 candidate_value_to_index_[value] = index;
1021 return candidate_is_active_[index];
1025 candidate_is_active_.Set(index);
1027 candidate_is_active_.Clear(index);
1033 for (
const int64_t index : changes_.PositionsSetAtLeastOnce()) {
1034 const int64_t value = candidate_values_[index];
1035 committed_values_[index] = value;
1036 if (index < max_inversible_index_) {
1037 committed_value_to_index_[value] = index;
1039 committed_is_active_.
CopyBucket(candidate_is_active_, index);
1045 void CheckPoint() { checkpoint_values_ = committed_values_; }
1047 void Revert(
bool only_incremental) {
1049 if (only_incremental)
return;
1052 const int64_t committed_value = committed_values_[index];
1053 candidate_values_[index] = committed_value;
1054 if (index < max_inversible_index_) {
1055 candidate_value_to_index_[committed_value] = index;
1057 candidate_is_active_.
CopyBucket(committed_is_active_, index);
1066 return incremental_changes_.PositionsSetAtLeastOnce();
1070 candidate_values_.resize(size);
1071 committed_values_.resize(size);
1072 checkpoint_values_.resize(size);
1073 candidate_is_active_.Resize(size);
1074 committed_is_active_.Resize(size);
1075 changes_.ClearAndResize(size);
1076 incremental_changes_.ClearAndResize(size);
1080 return candidate_value_to_index_[value];
1083 return committed_value_to_index_[value];
1087 void MarkChange(int64_t index) {
1088 incremental_changes_.
Set(index);
1089 changes_.
Set(index);
1092 std::vector<int64_t> candidate_values_;
1093 std::vector<int64_t> committed_values_;
1094 std::vector<int64_t> checkpoint_values_;
1102 int64_t max_inversible_index_ = -1;
1103 std::vector<int64_t> candidate_value_to_index_;
1104 std::vector<int64_t> committed_value_to_index_;
1118 bool keep_inverse_values =
false) {
1120 if (keep_inverse_values) {
1121 int64_t max_value = -1;
1122 for (
const IntVar*
const var : vars) {
1123 max_value = std::max(max_value, var->Max());
1130 bool HoldsDelta()
const override {
return true; }
1133 void Start(
const Assignment* assignment)
override {
1136 const int size =
Size();
1137 CHECK_LE(size, assignment->Size())
1138 <<
"Assignment contains fewer variables than operator";
1140 for (
int i = 0; i < size; ++i) {
1142 if (element->
Var() != vars_[i]) {
1143 CHECK(container.
Contains(vars_[i]))
1144 <<
"Assignment does not contain operator variable " << vars_[i];
1145 element = &(container.
Element(vars_[i]));
1155 int Size()
const {
return vars_.size(); }
1158 int64_t
Value(int64_t index)
const {
1159 DCHECK_LT(index, vars_.size());
1160 return state_.CandidateValue(index);
1163 IntVar*
Var(int64_t index)
const {
return vars_[index]; }
1167 return state_.CheckPointValue(index);
1170 state_.SetCandidateValue(index, value);
1175 void Activate(int64_t index) { state_.SetCandidateActive(index,
true); }
1176 void Deactivate(int64_t index) { state_.SetCandidateActive(index,
false); }
1180 for (
const int64_t index : state_.IncrementalIndicesChanged()) {
1182 const int64_t value =
Value(index);
1190 for (
const int64_t index : state_.CandidateIndicesChanged()) {
1191 const int64_t value =
Value(index);
1192 const bool activated =
Activated(index);
1203 candidate_has_changes_ = change_was_incremental &&
IsIncremental();
1205 if (!candidate_has_changes_) {
1206 for (
const int64_t index : state_.CandidateIndicesChanged()) {
1207 assignment_indices_[index] = -1;
1210 state_.Revert(candidate_has_changes_);
1214 if (!vars.empty()) {
1215 vars_.insert(vars_.end(), vars.begin(), vars.end());
1216 const int64_t size =
Size();
1217 assignment_indices_.resize(size, -1);
1218 state_.Resize(size);
1246 return state_.CandidateInverseValue(index);
1253 std::vector<int>* assignment_indices, int64_t index,
1254 Assignment* assignment)
const {
1256 assignment->MutableIntVarContainer();
1258 if (assignment_indices !=
nullptr) {
1259 if ((*assignment_indices)[index] == -1) {
1260 (*assignment_indices)[index] = container->Size();
1261 element = assignment->FastAdd(var);
1263 element = container->MutableElement((*assignment_indices)[index]);
1266 element = assignment->FastAdd(var);
1277 std::vector<IntVar*> vars_;
1278 mutable std::vector<int> assignment_indices_;
1279 bool candidate_has_changes_ =
false;
1281 LocalSearchOperatorState state_;
1313 explicit BaseLns(
const std::vector<IntVar*>& vars);
1327 void OnStart()
override;
1328 std::vector<int> fragment_;
1337 explicit ChangeValue(
const std::vector<IntVar*>& vars);
1339 virtual int64_t
ModifyValue(int64_t index, int64_t value) = 0;
1346 void OnStart()
override;
1356 : use_sibling_(use_sibling) {}
1358 template <
class PathOperator>
1362 const int64_t base_node = path_operator.
BaseNode(base_index_reference);
1363 const int alternative_index =
1367 alternative_index >= 0
1368 ? absl::Span<const int64_t>(
1369 path_operator.alternative_sets_[alternative_index])
1370 :
absl::Span<const int64_t>();
1372 bool Next() {
return ++index_ < alternative_set_.size(); }
1374 return (index_ >= alternative_set_.size()) ? -1 : alternative_set_[index_];
1378 const bool use_sibling_;
1380 absl::Span<const int64_t> alternative_set_;
1383class NodeNeighborIterator {
1387 template <
class PathOperator>
1389 using Span = absl::Span<const int>;
1391 const int64_t base_node = path_operator.
BaseNode(base_index_reference);
1392 const int64_t start_node = path_operator.
StartNode(base_index_reference);
1393 const auto& get_incoming_neighbors =
1395 incoming_neighbors_ =
1396 path_operator.
IsPathStart(base_node) || !get_incoming_neighbors
1398 : Span(get_incoming_neighbors(base_node, start_node));
1399 const auto& get_outgoing_neighbors =
1401 outgoing_neighbors_ =
1402 path_operator.
IsPathEnd(base_node) || !get_outgoing_neighbors
1404 : Span(get_outgoing_neighbors(base_node, start_node));
1407 return ++index_ < incoming_neighbors_.size() + outgoing_neighbors_.size();
1410 if (index_ < incoming_neighbors_.size()) {
1411 return incoming_neighbors_[index_];
1413 const int index = index_ - incoming_neighbors_.size();
1414 return (index >= outgoing_neighbors_.size()) ? -1
1415 : outgoing_neighbors_[index];
1418 return index_ < incoming_neighbors_.size();
1421 return index_ >= incoming_neighbors_.size();
1426 absl::Span<const int> incoming_neighbors_;
1427 absl::Span<const int> outgoing_neighbors_;
1430template <
class PathOperator>
1434 : path_operator_(*path_operator),
1435 base_index_reference_(base_index_reference) {}
1437 DCHECK(!alternatives_.empty());
1439 return alternatives_[0].get();
1442 DCHECK(!alternatives_.empty());
1444 return alternatives_[1].get();
1449 return neighbors_.get();
1453 alternatives_.push_back(std::make_unique<AlternativeNodeIterator>(
1455 alternatives_.push_back(std::make_unique<AlternativeNodeIterator>(
1459 neighbors_ = std::make_unique<NodeNeighborIterator>();
1462 void Reset(
bool update_end_nodes =
false) {
1464 for (
auto& alternative_iterator : alternatives_) {
1465 alternative_iterator->Reset(path_operator_, base_index_reference_);
1468 neighbors_->Reset(path_operator_, base_index_reference_);
1469 if (update_end_nodes) neighbor_end_node_ = neighbors_->GetValue();
1474 for (
auto& alternative_iterator : alternatives_) {
1475 if (alternative_iterator->Next())
return true;
1476 alternative_iterator->Reset(path_operator_, base_index_reference_);
1479 if (neighbors_->Next())
return true;
1480 neighbors_->Reset(path_operator_, base_index_reference_);
1487 if (!neighbors_)
return true;
1488 return neighbor_end_node_ == neighbors_->GetValue();
1493 int base_index_reference_ = -1;
1495 std::vector<std::unique_ptr<AlternativeNodeIterator>> alternatives_;
1497 std::unique_ptr<NodeNeighborIterator> neighbors_;
1498 int neighbor_end_node_ = -1;
1499 bool finished_ =
false;
1515template <
bool ignore_path_vars>
1519 struct IterationParameters {
1540 std::function<const std::vector<int>&(
1543 std::function<const std::vector<int>&(
1549 const std::vector<IntVar*>& path_vars,
1561 just_started_(false),
1563 next_base_to_increment_(iteration_parameters.number_of_base_nodes),
1564 iteration_parameters_(
std::move(iteration_parameters)),
1565 optimal_paths_enabled_(false),
1567 alternative_index_(next_vars.size(), -1) {
1568 DCHECK_GT(iteration_parameters_.number_of_base_nodes, 0);
1569 for (
int i = 0; i < iteration_parameters_.number_of_base_nodes; ++i) {
1572 if constexpr (!ignore_path_vars) {
1575 path_basis_.push_back(0);
1576 for (
int i = 1; i < iteration_parameters_.number_of_base_nodes; ++i) {
1579 if ((path_basis_.size() > 2) ||
1580 (!next_vars.empty() && !next_vars.back()
1583 .skip_locally_optimal_paths())) {
1584 iteration_parameters_.skip_locally_optimal_paths =
false;
1588 const std::vector<IntVar*>& next_vars,
1589 const std::vector<IntVar*>& path_vars,
int number_of_base_nodes,
1590 bool skip_locally_optimal_paths,
bool accept_path_end_base,
1591 std::function<
int(int64_t)> start_empty_path_class,
1592 std::function<
const std::vector<int>&(
int,
int)> get_incoming_neighbors,
1593 std::function<
const std::vector<int>&(
int,
int)> get_outgoing_neighbors)
1595 {number_of_base_nodes, skip_locally_optimal_paths,
1596 accept_path_end_base, std::move(start_empty_path_class),
1597 std::move(get_incoming_neighbors),
1598 std::move(get_outgoing_neighbors)}) {}
1602 first_start_ =
true;
1605 void Reset()
override {
1606 active_paths_.Clear();
1612 if constexpr (ignore_path_vars)
return true;
1622 int64_t
Next(int64_t node)
const {
1628 int64_t
Prev(int64_t node)
const {
1637 if constexpr (ignore_path_vars)
return 0LL;
1647 while (IncrementPosition()) {
1669 int64_t
BaseNode(
int i)
const {
return base_nodes_[i]; }
1672 return GetNodeWithDefault(base_node_iterators_[i].GetAlternativeIterator(),
1677 return GetNodeWithDefault(
1678 base_node_iterators_[i].GetSiblingAlternativeIterator(),
BaseNode(i));
1681 int64_t
StartNode(
int i)
const {
return path_starts_[base_paths_[i]]; }
1683 int64_t
EndNode(
int i)
const {
return path_ends_[base_paths_[i]]; }
1685 const std::vector<int64_t>&
path_starts()
const {
return path_starts_; }
1690 ? iteration_parameters_.start_empty_path_class(start_node)
1720 next_base_to_increment_ = base_index;
1726 int64_t
OldNext(int64_t node)
const {
1731 int64_t
PrevNext(int64_t node)
const {
1736 int64_t
OldPrev(int64_t node)
const {
1741 int64_t
OldPath(int64_t node)
const {
1742 if constexpr (ignore_path_vars)
return 0LL;
1747 return node_path_starts_[node];
1754 bool MoveChain(int64_t before_chain, int64_t chain_end, int64_t destination) {
1755 if (destination == before_chain || destination == chain_end)
return false;
1758 const int64_t destination_path =
Path(destination);
1759 const int64_t after_chain =
Next(chain_end);
1761 if constexpr (!ignore_path_vars) {
1762 int current = destination;
1763 int next =
Next(before_chain);
1764 while (current != chain_end) {
1765 SetNext(current, next, destination_path);
1770 SetNext(destination,
Next(before_chain), destination_path);
1772 SetNext(before_chain, after_chain,
Path(before_chain));
1778 bool ReverseChain(int64_t before_chain, int64_t after_chain,
1779 int64_t* chain_last) {
1781 int64_t path =
Path(before_chain);
1782 int64_t current =
Next(before_chain);
1783 if (current == after_chain) {
1786 int64_t current_next =
Next(current);
1787 SetNext(current, after_chain, path);
1788 while (current_next != after_chain) {
1789 const int64_t next =
Next(current_next);
1790 SetNext(current_next, current, path);
1791 current = current_next;
1792 current_next = next;
1794 SetNext(before_chain, current, path);
1795 *chain_last = current;
1802 bool SwapNodes(int64_t node1, int64_t node2) {
1807 if (node1 == node2)
return false;
1808 const int64_t prev_node1 =
Prev(node1);
1814 bool MakeActive(int64_t node, int64_t destination) {
1815 if (
IsPathEnd(destination))
return false;
1816 const int64_t destination_path =
Path(destination);
1817 SetNext(node,
Next(destination), destination_path);
1818 SetNext(destination, node, destination_path);
1824 const int64_t kNoPath = -1;
1827 const int64_t after_chain =
Next(chain_end);
1828 int64_t current =
Next(before_chain);
1829 while (current != after_chain) {
1830 const int64_t next =
Next(current);
1831 SetNext(current, current, kNoPath);
1834 SetNext(before_chain, after_chain,
Path(before_chain));
1842 if (active == inactive)
return false;
1843 const int64_t prev =
Prev(active);
1849 absl::Span<const int64_t> inactive_chain) {
1850 if (active_chain.empty())
return false;
1851 if (active_chain == inactive_chain)
return false;
1852 const int before_active_chain =
Prev(active_chain.front());
1856 for (
auto it = inactive_chain.crbegin(); it != inactive_chain.crend();
1858 if (!
MakeActive(*it, before_active_chain))
return false;
1864 void SetNext(int64_t from, int64_t
to, int64_t path) {
1867 if constexpr (!ignore_path_vars) {
1882 return !
IsPathEnd(node) && inactives_[node];
1897 const int alternative = alternative_sets_.size();
1898 for (int64_t node : alternative_set) {
1899 DCHECK_EQ(-1, alternative_index_[node]);
1900 alternative_index_[node] = alternative;
1902 alternative_sets_.push_back(alternative_set);
1903 sibling_alternative_.push_back(-1);
1909 template <
typename PairType>
1911 const std::vector<PairType>& pair_alternative_sets) {
1912 for (
const auto& [alternative_set, sibling_alternative_set] :
1913 pair_alternative_sets) {
1920 int64_t GetActiveInAlternativeSet(int alternative_index) const {
1921 return alternative_index >= 0
1922 ? active_in_alternative_set_[alternative_index]
1926 int64_t GetActiveAlternativeNode(
int node)
const {
1927 return GetActiveInAlternativeSet(alternative_index_[node]);
1930 int GetSiblingAlternativeIndex(
int node)
const {
1931 const int alternative = GetAlternativeIndex(node);
1932 return alternative >= 0 ? sibling_alternative_[alternative] : -1;
1936 return (node >= alternative_index_.size()) ? -1 : alternative_index_[node];
1949 int64_t exclude)
const {
1950 if (before_chain == chain_end || before_chain == exclude)
return false;
1951 int64_t current = before_chain;
1953 while (current != chain_end) {
1956 current =
Next(current);
1958 if (current == exclude)
return false;
1964 return iteration_parameters_.get_incoming_neighbors !=
nullptr ||
1965 iteration_parameters_.get_outgoing_neighbors !=
nullptr;
1975 Neighbor GetNeighborForBaseNode(int64_t base_index)
const {
1976 auto* iterator = base_node_iterators_[base_index].GetNeighborIterator();
1977 return {.neighbor = iterator->GetValue(),
1978 .outgoing = iterator->IsOutgoingNeighbor()};
1981 const int number_of_nexts_;
1984 template <
class NodeIterator>
1985 static int GetNodeWithDefault(
const NodeIterator* node_iterator,
1986 int default_value) {
1987 const int node = node_iterator->GetValue();
1988 return node >= 0 ? node : default_value;
1991 void OnStart()
override {
1992 optimal_paths_enabled_ =
false;
1993 if (!iterators_initialized_) {
1994 iterators_initialized_ =
true;
1995 for (
int i = 0; i < iteration_parameters_.number_of_base_nodes; ++i) {
1996 base_node_iterators_[i].Initialize();
1999 InitializeBaseNodes();
2000 InitializeAlternatives();
2001 OnNodeInitialization();
2005 bool OnSamePath(int64_t node1, int64_t node2)
const {
2006 if (IsInactive(node1) != IsInactive(node2)) {
2009 for (
int node = node1; !IsPathEnd(node); node = OldNext(node)) {
2010 if (node == node2) {
2014 for (
int node = node2; !IsPathEnd(node); node = OldNext(node)) {
2015 if (node == node1) {
2022 bool CheckEnds()
const {
2023 for (
int i = iteration_parameters_.number_of_base_nodes - 1; i >= 0; --i) {
2024 if (base_nodes_[i] != end_nodes_[i] ||
2025 !base_node_iterators_[i].HasReachedEnd()) {
2031 bool IncrementPosition() {
2032 const int base_node_size = iteration_parameters_.number_of_base_nodes;
2034 if (just_started_) {
2035 just_started_ =
false;
2038 const int number_of_paths = path_starts_.size();
2044 int last_restarted = base_node_size;
2045 for (
int i = base_node_size - 1;
i >= 0; --
i) {
2046 if (base_nodes_[i] < number_of_nexts_ && i <= next_base_to_increment_) {
2047 if (base_node_iterators_[i].Increment())
break;
2048 base_nodes_[
i] = OldNext(base_nodes_[i]);
2049 base_node_iterators_[
i].Reset();
2050 if (iteration_parameters_.accept_path_end_base ||
2051 !IsPathEnd(base_nodes_[i])) {
2055 base_nodes_[
i] = StartNode(i);
2056 base_node_iterators_[
i].Reset();
2059 next_base_to_increment_ = base_node_size;
2069 for (
int i = last_restarted;
i < base_node_size; ++
i) {
2070 base_nodes_[
i] = GetBaseNodeRestartPosition(i);
2071 base_node_iterators_[
i].Reset();
2073 if (last_restarted > 0) {
2079 if (optimal_paths_enabled_ &&
2080 iteration_parameters_.skip_locally_optimal_paths) {
2081 if (path_basis_.size() > 1) {
2082 for (
int i = 1;
i < path_basis_.size(); ++
i) {
2083 active_paths_.DeactivatePathPair(StartNode(path_basis_[i - 1]),
2084 StartNode(path_basis_[i]));
2087 active_paths_.DeactivatePathPair(StartNode(path_basis_[0]),
2088 StartNode(path_basis_[0]));
2091 std::vector<int> current_starts(base_node_size);
2092 for (
int i = 0;
i < base_node_size; ++
i) {
2093 current_starts[
i] = StartNode(i);
2097 optimal_paths_enabled_ =
true;
2099 for (
int i = base_node_size - 1;
i >= 0; --
i) {
2100 const int next_path_index = base_paths_[
i] + 1;
2101 if (next_path_index < number_of_paths) {
2102 base_paths_[
i] = next_path_index;
2103 base_nodes_[
i] = path_starts_[next_path_index];
2104 base_node_iterators_[
i].Reset();
2105 if (i == 0 || !OnSamePathAsPreviousBase(i)) {
2110 base_nodes_[
i] = path_starts_[0];
2111 base_node_iterators_[
i].Reset();
2114 if (!iteration_parameters_.skip_locally_optimal_paths)
return CheckEnds();
2117 if (path_basis_.size() > 1) {
2118 for (
int j = 1; j < path_basis_.size(); ++j) {
2119 if (active_paths_.IsPathPairActive(StartNode(path_basis_[j - 1]),
2120 StartNode(path_basis_[j]))) {
2125 if (active_paths_.IsPathPairActive(StartNode(path_basis_[0]),
2126 StartNode(path_basis_[0]))) {
2132 if (!CheckEnds())
return false;
2134 for (
int i = 0;
i < base_node_size; ++
i) {
2135 if (StartNode(i) != current_starts[i]) {
2140 if (stop)
return false;
2145 void InitializePathStarts() {
2149 std::vector<bool> has_prevs(number_of_nexts_,
false);
2150 for (
int i = 0;
i < number_of_nexts_; ++
i) {
2151 const int next = OldNext(i);
2152 if (next < number_of_nexts_) {
2153 has_prevs[next] =
true;
2155 max_next = std::max(max_next, next);
2158 if (iteration_parameters_.skip_locally_optimal_paths) {
2159 active_paths_.Initialize(
2160 [&has_prevs](
int node) {
return !has_prevs[node]; });
2161 for (
int i = 0;
i < number_of_nexts_; ++
i) {
2162 if (!has_prevs[i]) {
2164 while (!IsPathEnd(current)) {
2165 if ((OldNext(current) != PrevNext(current))) {
2166 active_paths_.ActivatePath(i);
2169 current = OldNext(current);
2176 std::vector<bool> empty_found(number_of_nexts_,
false);
2177 std::vector<int64_t> new_path_starts;
2178 for (
int i = 0;
i < number_of_nexts_; ++
i) {
2179 if (!has_prevs[i]) {
2180 if (IsPathEnd(OldNext(i))) {
2181 if (iteration_parameters_.start_empty_path_class !=
nullptr) {
2182 if (empty_found[iteration_parameters_.start_empty_path_class(i)])
2184 empty_found[iteration_parameters_.start_empty_path_class(i)] =
true;
2187 new_path_starts.push_back(i);
2190 if (!first_start_) {
2195 std::vector<int> node_paths(max_next + 1, -1);
2196 for (
int i = 0;
i < path_starts_.size(); ++
i) {
2197 int node = path_starts_[
i];
2198 while (!IsPathEnd(node)) {
2199 node_paths[node] =
i;
2200 node = OldNext(node);
2202 node_paths[node] =
i;
2204 for (
int j = 0; j < iteration_parameters_.number_of_base_nodes; ++j) {
2205 if (IsInactive(base_nodes_[j]) || node_paths[base_nodes_[j]] == -1) {
2208 base_nodes_[j] = GetBaseNodeRestartPosition(j);
2209 base_paths_[j] = node_paths[base_nodes_[j]];
2211 base_paths_[j] = node_paths[base_nodes_[j]];
2214 base_node_iterators_[j].Reset();
2220 absl::flat_hash_set<int> found_bases;
2221 for (
int i = 0;
i < path_starts_.size(); ++
i) {
2222 int index = new_index;
2224 while (index < new_path_starts.size() &&
2225 new_path_starts[index] < path_starts_[i]) {
2228 const bool found = (index < new_path_starts.size() &&
2229 new_path_starts[index] == path_starts_[i]);
2233 for (
int j = 0; j < iteration_parameters_.number_of_base_nodes; ++j) {
2234 if (base_paths_[j] == i && !found_bases.contains(j)) {
2235 found_bases.insert(j);
2236 base_paths_[j] = new_index;
2240 base_nodes_[j] = new_path_starts[new_index];
2246 path_starts_.swap(new_path_starts);
2250 path_ends_.reserve(path_starts_.size());
2251 int64_t max_node_index = number_of_nexts_ - 1;
2252 for (
const int start_node : path_starts_) {
2253 int64_t node = start_node;
2254 while (!IsPathEnd(node)) node = OldNext(node);
2255 path_ends_.push_back(node);
2256 max_node_index = std::max(max_node_index, node);
2258 node_path_starts_.assign(max_node_index + 1, -1);
2259 node_path_ends_.assign(max_node_index + 1, -1);
2260 for (
int i = 0;
i < path_starts_.size(); ++
i) {
2261 const int64_t start_node = path_starts_[
i];
2262 const int64_t end_node = path_ends_[
i];
2263 int64_t node = start_node;
2264 while (!IsPathEnd(node)) {
2265 node_path_starts_[node] = start_node;
2266 node_path_ends_[node] = end_node;
2267 node = OldNext(node);
2269 node_path_starts_[node] = start_node;
2270 node_path_ends_[node] = end_node;
2273 void InitializeInactives() {
2275 for (
int i = 0;
i < number_of_nexts_; ++
i) {
2276 inactives_.push_back(OldNext(i) == i);
2279 void InitializeBaseNodes() {
2281 InitializeInactives();
2282 InitializePathStarts();
2283 if (first_start_ || InitPosition()) {
2286 for (
int i = 0;
i < iteration_parameters_.number_of_base_nodes; ++
i) {
2288 base_nodes_[
i] = path_starts_[0];
2290 first_start_ =
false;
2292 for (
int i = 0;
i < iteration_parameters_.number_of_base_nodes; ++
i) {
2294 int64_t base_node = base_nodes_[
i];
2295 if (RestartAtPathStartOnSynchronize() || IsInactive(base_node)) {
2296 base_node = path_starts_[base_paths_[
i]];
2297 base_nodes_[
i] = base_node;
2299 end_nodes_[
i] = base_node;
2303 for (
int i = 1;
i < iteration_parameters_.number_of_base_nodes; ++
i) {
2304 if (OnSamePathAsPreviousBase(i) &&
2305 !OnSamePath(base_nodes_[i - 1], base_nodes_[i])) {
2306 const int64_t base_node = base_nodes_[
i - 1];
2307 base_nodes_[
i] = base_node;
2308 end_nodes_[
i] = base_node;
2309 base_paths_[
i] = base_paths_[
i - 1];
2312 for (
int i = 0;
i < iteration_parameters_.number_of_base_nodes; ++
i) {
2313 base_node_iterators_[
i].Reset(
true);
2315 just_started_ =
true;
2317 void InitializeAlternatives() {
2318 active_in_alternative_set_.resize(alternative_sets_.size(), -1);
2319 for (
int i = 0;
i < alternative_sets_.size(); ++
i) {
2320 const int64_t current_active = active_in_alternative_set_[
i];
2321 if (current_active >= 0 && !IsInactive(current_active))
continue;
2322 for (int64_t index : alternative_sets_[i]) {
2323 if (!IsInactive(index)) {
2324 active_in_alternative_set_[
i] = index;
2333 explicit ActivePaths(
int num_nodes) : start_to_path_(num_nodes, -1) {}
2334 void Clear() { is_path_pair_active_.clear(); }
2335 template <
typename T>
2336 void Initialize(T is_start) {
2337 if (is_path_pair_active_.empty()) {
2339 absl::c_fill(start_to_path_, -1);
2340 for (
int i = 0;
i < start_to_path_.size(); ++
i) {
2342 start_to_path_[
i] = num_paths_;
2346 is_path_pair_active_.resize(num_paths_ * num_paths_,
true);
2349 void DeactivatePathPair(
int start1,
int start2) {
2350 is_path_pair_active_[start_to_path_[start1] * num_paths_ +
2351 start_to_path_[start2]] =
false;
2353 void ActivatePath(
int start) {
2354 const int p1 = start_to_path_[start];
2355 const int p1_block = num_paths_ * p1;
2356 for (
int p2 = 0; p2 < num_paths_; ++p2) {
2357 is_path_pair_active_[p1_block + p2] =
true;
2359 for (
int p2_block = 0; p2_block < is_path_pair_active_.size();
2360 p2_block += num_paths_) {
2361 is_path_pair_active_[p2_block + p1] =
true;
2364 bool IsPathPairActive(
int start1,
int start2)
const {
2365 return is_path_pair_active_[start_to_path_[start1] * num_paths_ +
2366 start_to_path_[start2]];
2371 std::vector<int64_t> start_to_path_;
2372 std::vector<bool> is_path_pair_active_;
2375 std::unique_ptr<int[]> base_nodes_;
2376 std::unique_ptr<int[]> end_nodes_;
2377 std::unique_ptr<int[]> base_paths_;
2378 std::vector<int> node_path_starts_;
2379 std::vector<int> node_path_ends_;
2380 bool iterators_initialized_ =
false;
2382 std::vector<BaseNodeIterators<PathOperator>> base_node_iterators_;
2384 std::vector<int64_t> path_starts_;
2385 std::vector<int64_t> path_ends_;
2386 std::vector<bool> inactives_;
2389 int next_base_to_increment_;
2390 IterationParameters iteration_parameters_;
2391 bool optimal_paths_enabled_;
2392 std::vector<int> path_basis_;
2393 ActivePaths active_paths_;
2396 std::vector<std::vector<int64_t>> alternative_sets_;
2398 std::vector<int> alternative_index_;
2399 std::vector<int64_t> active_in_alternative_set_;
2400 std::vector<int> sibling_alternative_;
2420 Solver* solver,
const std::vector<IntVar*>& vars,
2421 const std::vector<IntVar*>& secondary_vars,
2422 std::function<
int(int64_t)> start_empty_path_class,
2423 std::function<
const std::vector<int>&(
int,
int)> get_incoming_neighbors =
2425 std::function<
const std::vector<int>&(
int,
int)> get_outgoing_neighbors =
2444 Solver* solver,
const std::vector<IntVar*>& vars,
2445 const std::vector<IntVar*>& secondary_vars,
2446 std::function<
int(int64_t)> start_empty_path_class,
2447 std::function<
const std::vector<int>&(
int,
int)> get_incoming_neighbors =
2449 std::function<
const std::vector<int>&(
int,
int)> get_outgoing_neighbors =
2451 int64_t chain_length = 1LL,
bool single_path =
false,
2452 const std::string& name =
"Relocate");
2465 Solver* solver,
const std::vector<IntVar*>& vars,
2466 const std::vector<IntVar*>& secondary_vars,
2467 std::function<
int(int64_t)> start_empty_path_class,
2468 std::function<
const std::vector<int>&(
int,
int)> get_incoming_neighbors =
2470 std::function<
const std::vector<int>&(
int,
int)> get_outgoing_neighbors =
2486 Solver* solver,
const std::vector<IntVar*>& vars,
2487 const std::vector<IntVar*>& secondary_vars,
2488 std::function<
int(int64_t)> start_empty_path_class,
2489 std::function<
const std::vector<int>&(
int,
int)> get_incoming_neighbors =
2491 std::function<
const std::vector<int>&(
int,
int)> get_outgoing_neighbors =
2504 Solver* solver,
const std::vector<IntVar*>& vars,
2505 const std::vector<IntVar*>& secondary_vars,
2506 std::function<
int(int64_t)> start_empty_path_class,
2507 std::function<
const std::vector<int>&(
int,
int)> get_incoming_neighbors =
2509 std::function<
const std::vector<int>&(
int,
int)> get_outgoing_neighbors =
2522 Solver* solver,
const std::vector<IntVar*>& vars,
2523 const std::vector<IntVar*>& secondary_vars,
2524 std::function<
int(int64_t)> start_empty_path_class);
2542 Solver* solver,
const std::vector<IntVar*>& vars,
2543 const std::vector<IntVar*>& secondary_vars,
2544 std::function<
int(int64_t)> start_empty_path_class);
2563 Solver* solver,
const std::vector<IntVar*>& vars,
2564 const std::vector<IntVar*>& secondary_vars,
2565 std::function<
int(int64_t)> start_empty_path_class);
2574 Solver* solver,
const std::vector<IntVar*>& vars,
2575 const std::vector<IntVar*>& secondary_vars,
2576 std::function<
int(int64_t)> start_empty_path_class);
2587 Solver* solver,
const std::vector<IntVar*>& vars,
2588 const std::vector<IntVar*>& secondary_vars,
2589 std::function<
int(int64_t)> start_empty_path_class);
2600 Solver* solver,
const std::vector<IntVar*>& vars,
2601 const std::vector<IntVar*>& secondary_vars,
2602 std::function<
int(int64_t)> start_empty_path_class);
2614 Solver* solver,
const std::vector<IntVar*>& vars,
2615 const std::vector<IntVar*>& secondary_vars,
2616 std::function<
int(int64_t)> start_empty_path_class);
2627 Solver* solver,
const std::vector<IntVar*>& vars,
2628 const std::vector<IntVar*>& secondary_vars,
2629 std::function<
int(int64_t)> start_empty_path_class);
2634 Solver* solver,
const std::vector<IntVar*>& vars,
2635 const std::vector<IntVar*>& secondary_vars,
2636 std::function<
int(int64_t)> start_empty_path_class,
int max_chain_size);
2652 Solver* solver,
const std::vector<IntVar*>& vars,
2653 const std::vector<IntVar*>& secondary_vars,
2654 std::function<
int(int64_t)> start_empty_path_class);
2666 const std::vector<IntVar*>& vars,
2667 const std::vector<IntVar*>& secondary_vars,
2680 const std::vector<IntVar*>& vars,
2681 const std::vector<IntVar*>& secondary_vars,
2688 Solver* solver,
const std::vector<IntVar*>& vars,
2689 const std::vector<IntVar*>& secondary_vars,
2699 const std::vector<IntVar*>& vars,
2700 const std::vector<IntVar*>& secondary_vars,
2701 int number_of_chunks,
int chunk_size,
2702 bool unactive_fragments);
2731 DCHECK(!graph_was_built_);
2732 num_nodes_ = std::max(num_nodes_, std::max(tail.value(), head.value()) + 1);
2733 const ArcId arc_id(arcs_.size());
2734 arcs_.push_back({.tail = tail, .head = head, .arc_id = arc_id});
2747 bool HasDirectedCycle()
const;
2753 bool operator<(
const Arc& other)
const {
2754 return std::tie(tail, arc_id) < std::tie(other.tail, other.arc_id);
2758 std::vector<Arc> arcs_;
2764 bool graph_was_built_ =
false;
2768 std::vector<NodeId> nodes_to_visit_;
2770 std::vector<ArcId> sorted_arcs_;
2784class LocalSearchState {
2790 VariableDomainId AddVariableDomain(int64_t relaxed_min, int64_t relaxed_max);
2792 bool RelaxVariableDomain(VariableDomainId domain_id);
2793 bool TightenVariableDomainMin(VariableDomainId domain_id, int64_t value);
2794 bool TightenVariableDomainMax(VariableDomainId domain_id, int64_t value);
2795 int64_t VariableDomainMin(VariableDomainId domain_id)
const;
2796 int64_t VariableDomainMax(VariableDomainId domain_id)
const;
2797 void ChangeRelaxedVariableDomain(VariableDomainId domain_id, int64_t min,
2815 return state_domains_are_all_nonempty_ && num_committed_empty_domains_ == 0;
2818 void AddWeightedSumConstraint(
2819 const std::vector<VariableDomainId>& input_domain_ids,
2820 const std::vector<int64_t>& input_weights, int64_t input_offset,
2824 void CompileConstraints();
2830 struct VariableDomain {
2834 bool IntersectionIsEmpty(
const VariableDomain& d1,
2835 const VariableDomain& d2)
const {
2836 return d1.max < d2.min || d2.max < d1.min;
2840 struct TrailedVariableDomain {
2841 VariableDomain committed_domain;
2842 VariableDomainId domain_id;
2844 std::vector<TrailedVariableDomain> trailed_domains_;
2845 util_intops::StrongVector<VariableDomainId, bool> domain_is_trailed_;
2847 bool state_domains_are_all_nonempty_ =
true;
2848 bool state_has_relaxed_domains_ =
false;
2851 int num_committed_empty_domains_ = 0;
2852 int trailed_num_committed_empty_domains_ = 0;
2857 void TrailConstraint(Constraint* constraint) {
2858 trailed_constraints_.push_back(constraint);
2860 std::vector<Constraint*> trailed_constraints_;
2864 class DependencyGraph {
2866 DependencyGraph() {}
2875 ConstraintId constraint_id;
2878 void AddDomainsConstraintDependencies(
2879 const std::vector<VariableDomainId>& domain_ids,
2880 ConstraintId constraint_id);
2882 void AddConstraintDomainDependency(ConstraintId constraint_id,
2883 VariableDomainId domain_id);
2886 void BuildDependencyDAG(
int num_domains);
2890 const std::vector<Dependency>& ComputeSortedDependencies(
2894 using ArcId = SubDagComputer::ArcId;
2895 using NodeId = SubDagComputer::NodeId;
2902 NodeId GetOrCreateNodeOfConstraintId(ConstraintId
constraint_id);
2913 int num_dag_nodes_ = 1;
2915 std::vector<Dependency> sorted_dependencies_;
2917 DependencyGraph dependency_graph_;
2923 Constraint* constraint;
2929 std::vector<Trigger> triggers_;
2937 virtual ~Constraint() =
default;
2938 virtual LocalSearchState::VariableDomain Propagate(
int input_index) = 0;
2940 virtual void Commit() = 0;
2941 virtual void Revert() = 0;
2945 class WeightedSum final :
public Constraint {
2948 const std::vector<VariableDomainId>& input_domain_ids,
2949 const std::vector<int64_t>& input_weights, int64_t input_offset,
2951 ~WeightedSum()
override =
default;
2952 LocalSearchState::VariableDomain Propagate(
int input_index)
override;
2953 void Commit()
override;
2954 void Revert()
override;
2960 struct WeightedVariable {
2963 int64_t committed_min;
2964 int64_t committed_max;
2966 VariableDomainId domain;
2969 committed_min = min;
2970 committed_max = max;
2974 min = committed_min;
2975 max = committed_max;
2979 std::vector<WeightedVariable> inputs_;
2980 std::vector<WeightedVariable*> trailed_inputs_;
2984 int64_t num_neg_inf;
2988 int64_t num_pos_inf;
2992 Invariants invariants_;
2993 Invariants committed_invariants_;
2996 LocalSearchState*
const state_;
2997 bool constraint_is_trailed_ =
false;
3000 util_intops::StrongVector<ConstraintId, std::unique_ptr<Constraint>>
3009class LocalSearchState::Variable {
3012 int64_t Min()
const {
3014 return state_->VariableDomainMin(domain_id_);
3016 int64_t Max()
const {
3018 return state_->VariableDomainMax(domain_id_);
3022 bool SetMin(int64_t new_min)
const {
3023 if (!
Exists())
return true;
3024 return state_->TightenVariableDomainMin(domain_id_, new_min) &&
3025 state_->PropagateTighten(domain_id_);
3029 bool SetMax(int64_t new_max)
const {
3030 if (!
Exists())
return true;
3031 return state_->TightenVariableDomainMax(domain_id_, new_max) &&
3032 state_->PropagateTighten(domain_id_);
3034 void Relax()
const {
3035 if (state_ ==
nullptr)
return;
3036 if (state_->RelaxVariableDomain(domain_id_)) {
3037 state_->PropagateRelax(domain_id_);
3040 bool Exists()
const {
return state_ !=
nullptr; }
3047 : state_(state), domain_id_(domain_id) {}
3088 int64_t objective_min, int64_t objective_max) = 0;
3108 virtual int64_t GetAcceptedObjectiveValue()
const {
return 0LL; }
3118 enum FilterEventType { kAccept, kRelax };
3119 struct FilterEvent {
3121 FilterEventType event_type;
3125 std::string DebugString()
const override {
3126 return "LocalSearchFilterManager";
3142 const Assignment* deltadelta, int64_t objective_min,
3143 int64_t objective_max);
3147 int64_t GetAcceptedObjectiveValue()
const {
return accepted_value_; }
3152 void FindIncrementalEventEnd();
3154 std::vector<FilterEvent> events_;
3155 int last_event_called_ = -1;
3160 int incremental_events_end_ = 0;
3161 int64_t synchronized_value_;
3162 int64_t accepted_value_;
3174 bool FindIndex(
IntVar*
const var, int64_t* index)
const {
3175 DCHECK(index !=
nullptr);
3176 const int var_index = var->
index();
3177 *index = (var_index < var_index_to_index_.size())
3178 ? var_index_to_index_[var_index]
3180 return *index != kUnassigned;
3184 void AddVars(
const std::vector<IntVar*>& vars);
3185 int Size()
const {
return vars_.size(); }
3186 IntVar* Var(
int index)
const {
return vars_[index]; }
3187 int64_t
Value(
int index)
const {
3188 DCHECK(IsVarSynced(index));
3189 return values_[index];
3191 bool IsVarSynced(
int index)
const {
return var_synced_[index]; }
3194 virtual void OnSynchronize(
const Assignment*) {}
3195 void SynchronizeOnAssignment(
const Assignment* assignment);
3198 std::vector<IntVar*> vars_;
3199 std::vector<int64_t> values_;
3200 std::vector<bool> var_synced_;
3201 std::vector<int> var_index_to_index_;
3202 static const int kUnassigned;
3209 std::string
DebugString()
const override {
return "PropagationMonitor"; }
3212 virtual void BeginConstraintInitialPropagation(
Constraint* constraint) = 0;
3213 virtual void EndConstraintInitialPropagation(
Constraint* constraint) = 0;
3214 virtual void BeginNestedConstraintInitialPropagation(
Constraint* parent,
3216 virtual void EndNestedConstraintInitialPropagation(
Constraint* parent,
3219 virtual void BeginDemonRun(
Demon* demon) = 0;
3223 virtual void PushContext(
const std::string& context) = 0;
3232 virtual void SetRange(
IntVar* var, int64_t new_min, int64_t new_max) = 0;
3238 const std::vector<int64_t>& values) = 0;
3243 int64_t new_max) = 0;
3247 int64_t new_max) = 0;
3251 int64_t new_max) = 0;
3259 const std::vector<int>& rank_first,
3260 const std::vector<int>& rank_last,
3261 const std::vector<int>& unperformed) = 0;
3271 std::string
DebugString()
const override {
return "LocalSearchMonitor"; }
3274 virtual void BeginOperatorStart() = 0;
3275 virtual void EndOperatorStart() = 0;
3278 bool neighbor_found,
const Assignment* delta,
3282 bool neighbor_found) = 0;
3285 bool neighbor_found) = 0;
3297 static const int kUnboundBooleanVarValue;
3300 :
IntVar(s, name), value_(kUnboundBooleanVarValue) {}
3304 int64_t Min()
const override {
return (value_ == 1); }
3305 void SetMin(int64_t m)
override;
3306 int64_t Max()
const override {
return (value_ != 0); }
3307 void SetMax(int64_t m)
override;
3308 void SetRange(int64_t mi, int64_t ma)
override;
3309 bool Bound()
const override {
return (value_ != kUnboundBooleanVarValue); }
3318 void WhenDomain(
Demon* d)
override { WhenBound(d); }
3320 bool Contains(int64_t v)
const override;
3332 std::string
BaseName()
const override {
return "BooleanVar"; }
3350 : symmetry_manager_(nullptr), index_in_symmetry_manager_(-1) {}
3353 void AddIntegerVariableEqualValueClause(
IntVar* var, int64_t value);
3354 void AddIntegerVariableGreaterOrEqualValueClause(
IntVar* var, int64_t value);
3355 void AddIntegerVariableLessOrEqualValueClause(
IntVar* var, int64_t value);
3360 CHECK(symmetry_manager_ ==
nullptr);
3361 CHECK_EQ(-1, index_in_symmetry_manager_);
3362 symmetry_manager_ = manager;
3363 index_in_symmetry_manager_ = index;
3365 SymmetryManager* symmetry_manager()
const {
return symmetry_manager_; }
3366 int index_in_symmetry_manager()
const {
return index_in_symmetry_manager_; }
3370 int index_in_symmetry_manager_;
3377 SearchLog(
Solver* solver, std::vector<IntVar*> vars, std::string vars_name,
3378 std::vector<double> scaling_factors, std::vector<double> offsets,
3379 std::function<std::string()> display_callback,
3380 bool display_on_new_solutions_only,
int period);
3382 void EnterSearch()
override;
3383 void ExitSearch()
override;
3384 bool AtSolution()
override;
3385 void BeginFail()
override;
3386 void NoMoreSolutions()
override;
3388 void ApplyDecision(
Decision* decision)
override;
3389 void RefuteDecision(
Decision* decision)
override;
3398 virtual void OutputLine(
const std::string& line);
3404 std::unique_ptr<WallTimer> timer_;
3405 const std::vector<IntVar*> vars_;
3406 const std::string vars_name_;
3407 const std::vector<double> scaling_factors_;
3408 const std::vector<double> offsets_;
3409 std::function<std::string()> display_callback_;
3410 const bool display_on_new_solutions_only_;
3412 absl::Duration tick_;
3413 std::vector<int64_t> objective_min_;
3414 std::vector<int64_t> objective_max_;
3415 std::vector<int64_t> last_objective_value_;
3416 absl::Duration last_objective_timestamp_;
3417 int min_right_depth_;
3419 int sliding_min_depth_;
3420 int sliding_max_depth_;
3421 int neighbors_offset_ = 0;
3430 enum VoidConstraintType {
3431 VOID_FALSE_CONSTRAINT = 0,
3432 VOID_TRUE_CONSTRAINT,
3433 VOID_CONSTRAINT_MAX,
3436 enum VarConstantConstraintType {
3437 VAR_CONSTANT_EQUALITY = 0,
3438 VAR_CONSTANT_GREATER_OR_EQUAL,
3439 VAR_CONSTANT_LESS_OR_EQUAL,
3440 VAR_CONSTANT_NON_EQUALITY,
3441 VAR_CONSTANT_CONSTRAINT_MAX,
3480 enum ExprExprConstantExpressionType {
3498 enum VarConstantConstantExpressionType {
3499 VAR_CONSTANT_CONSTANT_SEMI_CONTINUOUS = 0,
3548 IntVar* var, int64_t value1, int64_t value2,
3603 IntVar* var, int64_t value1, int64_t value2,
3613 IntVar* var,
const std::vector<int64_t>& values,
3626 const std::vector<IntVar*>& vars,
3632 const std::vector<IntVar*>& vars,
const std::vector<int64_t>& values,
3636 IntExpr* expression,
const std::vector<IntVar*>& var,
3637 const std::vector<int64_t>& values,
3643 const std::vector<IntVar*>& vars, int64_t value,
3647 IntExpr* expression,
const std::vector<IntVar*>& var, int64_t value,
3661 const std::string& TypeName()
const;
3662 void SetTypeName(
const std::string& type_name);
3665 void SetIntegerArgument(
const std::string& arg_name, int64_t value);
3666 void SetIntegerArrayArgument(
const std::string& arg_name,
3667 const std::vector<int64_t>& values);
3668 void SetIntegerMatrixArgument(
const std::string& arg_name,
3670 void SetIntegerExpressionArgument(
const std::string& arg_name,
IntExpr* expr);
3671 void SetIntegerVariableArrayArgument(
const std::string& arg_name,
3672 const std::vector<IntVar*>& vars);
3675 const std::vector<IntervalVar*>& vars);
3678 const std::vector<SequenceVar*>& vars);
3689 const std::string& arg_name)
const;
3691 const std::string& arg_name)
const;
3694 const std::string& arg_name)
const;
3696 const std::string& arg_name)
const;
3699 std::string type_name_;
3700 absl::flat_hash_map<std::string, int64_t> integer_argument_;
3701 absl::flat_hash_map<std::string, std::vector<int64_t>>
3702 integer_array_argument_;
3703 absl::flat_hash_map<std::string, IntTupleSet> matrix_argument_;
3704 absl::flat_hash_map<std::string, IntExpr*> integer_expression_argument_;
3705 absl::flat_hash_map<std::string, IntervalVar*> interval_argument_;
3706 absl::flat_hash_map<std::string, SequenceVar*> sequence_argument_;
3707 absl::flat_hash_map<std::string, std::vector<IntVar*>>
3708 integer_variable_array_argument_;
3709 absl::flat_hash_map<std::string, std::vector<IntervalVar*>>
3710 interval_array_argument_;
3711 absl::flat_hash_map<std::string, std::vector<SequenceVar*>>
3712 sequence_array_argument_;
3723 void BeginVisitModel(
const std::string& solver_name)
override;
3724 void EndVisitModel(
const std::string& solver_name)
override;
3725 void BeginVisitConstraint(
const std::string& type_name,
3727 void EndVisitConstraint(
const std::string& type_name,
3729 void BeginVisitIntegerExpression(
const std::string& type_name,
3730 const IntExpr* expr)
override;
3732 const IntExpr* expr)
override;
3735 const std::string& operation, int64_t value,
3736 IntVar* delegate)
override;
3738 const std::string& operation, int64_t value,
3743 int64_t value)
override;
3745 const std::vector<int64_t>& values)
override;
3752 const std::string& arg_name,
3753 const std::vector<IntVar*>& arguments)
override;
3758 const std::string& arg_name,
3759 const std::vector<IntervalVar*>& arguments)
override;
3764 const std::string& arg_name,
3765 const std::vector<SequenceVar*>& arguments)
override;
3773 std::vector<ArgumentHolder*> holders_;
3780 : index_min_(index_min),
3781 index_max_(index_max),
3782 values_(new T[index_max - index_min + 1]) {
3783 DCHECK_LE(index_min, index_max);
3786 ~ArrayWithOffset()
override {}
3788 virtual T Evaluate(int64_t index)
const {
3789 DCHECK_GE(index, index_min_);
3790 DCHECK_LE(index, index_max_);
3791 return values_[index - index_min_];
3795 DCHECK_GE(index, index_min_);
3796 DCHECK_LE(index, index_max_);
3797 values_[index - index_min_] = value;
3800 std::string DebugString()
const override {
return "ArrayWithOffset"; }
3803 const int64_t index_min_;
3804 const int64_t index_max_;
3805 std::unique_ptr<T[]> values_;
3813template <
class T,
class C>
3817 : block_size_(block_size), block_offset_(0) {
3818 CHECK_GT(block_size, 0);
3822 for (
int i = 0; i < elements_.size(); ++i) {
3823 delete[] elements_[i];
3827 T At(int64_t index)
const {
3828 const int64_t block_index = ComputeBlockIndex(index);
3829 const int64_t relative_index = block_index - block_offset_;
3830 if (relative_index < 0 || relative_index >= elements_.size()) {
3833 const T* block = elements_[relative_index];
3834 return block !=
nullptr ? block[index - block_index * block_size_] : T();
3838 const int64_t block_index = ComputeBlockIndex(index);
3839 T*
const block = GetOrCreateBlock(block_index);
3840 const int64_t residual = index - block_index * block_size_;
3842 reinterpret_cast<C
>(value));
3846 T* NewBlock()
const {
3847 T*
const result =
new T[block_size_];
3848 for (
int i = 0; i < block_size_; ++i) {
3854 T* GetOrCreateBlock(
int block_index) {
3855 if (elements_.size() == 0) {
3856 block_offset_ = block_index;
3857 GrowUp(block_index);
3858 }
else if (block_index < block_offset_) {
3859 GrowDown(block_index);
3860 }
else if (block_index - block_offset_ >= elements_.size()) {
3861 GrowUp(block_index);
3863 T* block = elements_[block_index - block_offset_];
3864 if (block ==
nullptr) {
3866 elements_[block_index - block_offset_] = block;
3871 int64_t ComputeBlockIndex(int64_t value)
const {
3872 return value >= 0 ? value / block_size_
3873 : (value - block_size_ + 1) / block_size_;
3876 void GrowUp(int64_t block_index) {
3877 elements_.resize(block_index - block_offset_ + 1);
3880 void GrowDown(int64_t block_index) {
3881 const int64_t delta = block_offset_ - block_index;
3882 block_offset_ = block_index;
3883 DCHECK_GT(delta, 0);
3884 elements_.insert(elements_.begin(), delta,
nullptr);
3887 const int64_t block_size_;
3888 std::vector<T*> elements_;
3899 static constexpr int kNoInserted = -1;
3902 explicit RevIntSet(
int capacity)
3903 : elements_(new
T[capacity]),
3905 capacity_(capacity),
3906 position_(new int[capacity]),
3907 delete_position_(
true) {
3908 for (
int i = 0;
i < capacity; ++
i) {
3909 position_[
i] = kNoInserted;
3914 RevIntSet(
int capacity,
int* shared_positions,
int shared_positions_size)
3915 : elements_(new T[capacity]),
3917 capacity_(capacity),
3918 position_(shared_positions),
3919 delete_position_(false) {
3920 for (
int i = 0; i < shared_positions_size; ++i) {
3926 if (delete_position_) {
3931 int Size()
const {
return num_elements_.Value(); }
3933 int Capacity()
const {
return capacity_; }
3935 T Element(
int i)
const {
3937 DCHECK_LT(i, num_elements_.Value());
3938 return elements_[
i];
3943 DCHECK_LT(i + num_elements_.Value(), capacity_);
3944 return elements_[i + num_elements_.Value()];
3948 const int position = num_elements_.Value();
3949 DCHECK_LT(position, capacity_);
3950 DCHECK(NotAlreadyInserted(elt));
3951 elements_[position] = elt;
3952 position_[elt] = position;
3953 num_elements_.Incr(solver);
3957 num_elements_.Decr(solver);
3958 SwapTo(value_index, num_elements_.Value());
3961 void Restore(
Solver*
const solver,
const T& value_index) {
3962 SwapTo(value_index, num_elements_.Value());
3963 num_elements_.Incr(solver);
3966 void Clear(
Solver*
const solver) { num_elements_.SetValue(solver, 0); }
3969 typedef const T* const_iterator;
3970 const_iterator begin()
const {
return elements_.get(); }
3975 bool NotAlreadyInserted(
const T& elt) {
3976 for (
int i = 0; i < num_elements_.Value(); ++i) {
3977 if (elt == elements_[i]) {
3984 void SwapTo(T value_index,
int next_position) {
3985 const int current_position = position_[value_index];
3986 if (current_position != next_position) {
3987 const T next_value_index = elements_[next_position];
3988 elements_[current_position] = next_value_index;
3989 elements_[next_position] = value_index;
3990 position_[value_index] = next_position;
3991 position_[next_value_index] = current_position;
3996 std::unique_ptr<T[]> elements_;
3998 NumericalRev<int> num_elements_;
4000 const int capacity_;
4004 const bool delete_position_;
4009class RevPartialSequence {
4011 explicit RevPartialSequence(
const std::vector<int>& items)
4014 last_ranked_(items.size() - 1),
4015 size_(items.size()),
4016 position_(new int[size_]) {
4017 for (
int i = 0;
i < size_; ++
i) {
4018 elements_[
i] = items[
i];
4023 explicit RevPartialSequence(
int size)
4026 last_ranked_(size - 1),
4028 position_(new int[size_]) {
4029 for (
int i = 0; i < size_; ++i) {
4037 int NumFirstRanked()
const {
return first_ranked_.Value(); }
4039 int NumLastRanked()
const {
return size_ - 1 - last_ranked_.Value(); }
4041 int Size()
const {
return size_; }
4044 const int& operator[](
int index)
const {
4045 DCHECK_GE(index, 0);
4046 DCHECK_LT(index, size_);
4047 return elements_[index];
4052 DCHECK_LE(first_ranked_.Value(), last_ranked_.Value());
4053 SwapTo(elt, first_ranked_.Value());
4054 first_ranked_.Incr(solver);
4058 DCHECK_LE(first_ranked_.Value(), last_ranked_.Value());
4059 SwapTo(elt, last_ranked_.Value());
4060 last_ranked_.Decr(solver);
4063 bool IsRanked(
int elt)
const {
4064 const int position = position_[elt];
4065 return (position < first_ranked_.Value() ||
4066 position > last_ranked_.Value());
4069 std::string DebugString()
const {
4070 std::string result =
"[";
4071 for (
int i = 0; i < first_ranked_.Value(); ++i) {
4072 absl::StrAppend(&result, elements_[i]);
4073 if (i != first_ranked_.Value() - 1) {
4078 for (
int i = first_ranked_.Value(); i <= last_ranked_.Value(); ++i) {
4079 absl::StrAppend(&result, elements_[i]);
4080 if (i != last_ranked_.Value()) {
4085 for (
int i = last_ranked_.Value() + 1; i < size_; ++i) {
4086 absl::StrAppend(&result, elements_[i]);
4087 if (i != size_ - 1) {
4096 void SwapTo(
int elt,
int next_position) {
4097 const int current_position = position_[elt];
4098 if (current_position != next_position) {
4099 const int next_elt = elements_[next_position];
4100 elements_[current_position] = next_elt;
4101 elements_[next_position] = elt;
4102 position_[elt] = next_position;
4103 position_[next_elt] = current_position;
4108 std::vector<int> elements_;
4110 NumericalRev<int> first_ranked_;
4112 NumericalRev<int> last_ranked_;
4116 std::unique_ptr<int[]> position_;
4123class UnsortedNullableRevBitset {
4126 explicit UnsortedNullableRevBitset(
int bit_size);
4128 ~UnsortedNullableRevBitset() {}
4132 void Init(Solver* solver,
const std::vector<uint64_t>& mask);
4136 bool RevSubtract(Solver* solver,
const std::vector<uint64_t>& mask);
4140 bool RevAnd(
Solver* solver,
const std::vector<uint64_t>& mask);
4147 bool Empty()
const {
return active_words_.Size() == 0; }
4156 bool Intersects(
const std::vector<uint64_t>& mask,
int* support_index);
4161 int64_t word_size()
const {
return word_size_; }
4166 void CleanUpActives(
Solver* solver);
4168 const int64_t bit_size_;
4169 const int64_t word_size_;
4172 std::vector<int> to_remove_;
4177 for (
int i = 0; i < values.size(); ++i) {
4178 if (values[i] != value) {
4187 for (
int i = 0;
i < values.size(); ++
i) {
4188 if (values[i] != 0 && values[i] != 1) {
4196bool AreAllOnes(
const std::vector<T>& values) {
4206bool AreAllGreaterOrEqual(
const std::vector<T>& values,
const T& value) {
4207 for (
const T& current_value : values) {
4208 if (current_value < value) {
4217 for (
const T& current_value : values) {
4218 if (current_value > value) {
4236bool AreAllStrictlyPositive(
const std::vector<T>& values) {
4237 return AreAllGreaterOrEqual(values, T(1));
4247 for (
int i = 0; i < values.size() - 1; ++i) {
4248 if (values[i + 1] != values[i] + 1) {
4257 for (
int i = 0; i < values.size() - 1; ++i) {
4258 if (values[i + 1] < values[i]) {
4266bool IsArrayInRange(
const std::vector<IntVar*>& vars, T range_min,
4268 for (
int i = 0;
i < vars.size(); ++
i) {
4269 if (vars[
i]->Min() < range_min || vars[
i]->Max() > range_max) {
4276inline bool AreAllBound(
const std::vector<IntVar*>& vars) {
4277 for (
int i = 0;
i < vars.size(); ++
i) {
4278 if (!vars[
i]->Bound()) {
4293 const std::vector<T>& values) {
4294 for (
int i = 0; i < vars.size(); ++i) {
4295 if (values[i] != 0 && !vars[i]->Bound()) {
4303inline bool AreAllBoundTo(
const std::vector<IntVar*>& vars, int64_t value) {
4304 for (
int i = 0; i < vars.size(); ++i) {
4305 if (!vars[i]->Bound() || vars[i]->Min() != value) {
4312inline int64_t
MaxVarArray(
const std::vector<IntVar*>& vars) {
4313 DCHECK(!vars.empty());
4315 for (
int i = 0;
i < vars.size(); ++
i) {
4317 result = std::max<int64_t>(result, vars[
i]->Max());
4322inline int64_t
MinVarArray(
const std::vector<IntVar*>& vars) {
4323 DCHECK(!vars.empty());
4325 for (
int i = 0;
i < vars.size(); ++
i) {
4327 result = std::min<int64_t>(result, vars[i]->Min());
4332inline void FillValues(
const std::vector<IntVar*>& vars,
4333 std::vector<int64_t>*
const values) {
4335 values->resize(vars.size());
4336 for (
int i = 0;
i < vars.size(); ++
i) {
4337 (*values)[i] = vars[i]->Value();
4343 return (e < 0 || e % v == 0) ? e / v : e / v + 1;
4348 return (e >= 0 || e % v == 0) ? e / v : e / v - 1;
4351std::vector<int64_t> ToInt64Vector(
const std::vector<int>&
input);
int64_t MemoryUsage(int unused)
Iterators on nodes used by Pathoperator to traverse the search space.
AlternativeNodeIterator(bool use_sibling)
void Reset(const PathOperator &path_operator, int base_index_reference)
~AlternativeNodeIterator()
Argument Holder: useful when visiting a model.
const IntTupleSet & FindIntegerMatrixArgumentOrDie(const std::string &arg_name) const
void SetIntervalArgument(const std::string &arg_name, IntervalVar *var)
void SetIntervalArrayArgument(const std::string &arg_name, const std::vector< IntervalVar * > &vars)
IntExpr * FindIntegerExpressionArgumentOrDie(const std::string &arg_name) const
bool HasIntegerExpressionArgument(const std::string &arg_name) const
Checks if arguments exist.
const std::vector< IntVar * > & FindIntegerVariableArrayArgumentOrDie(const std::string &arg_name) const
void SetSequenceArgument(const std::string &arg_name, SequenceVar *var)
bool HasIntegerVariableArrayArgument(const std::string &arg_name) const
const std::vector< int64_t > & FindIntegerArrayArgumentOrDie(const std::string &arg_name) const
int64_t FindIntegerArgumentOrDie(const std::string &arg_name) const
void SetSequenceArrayArgument(const std::string &arg_name, const std::vector< SequenceVar * > &vars)
int64_t FindIntegerArgumentWithDefault(const std::string &arg_name, int64_t def) const
Getters.
void SetValue(int64_t index, T value)
const E & Element(const V *const var) const
bool Contains(const V *const var) const
AssignmentContainer< IntVar, IntVarElement > IntContainer
virtual IntVar * CastToVar()
IntVar * Var() override
Creates a variable from the expression.
BaseIntExpr(Solver *const s)
void AppendToFragment(int index)
bool HasFragments() const override
virtual void InitFragments()
BaseLns(const std::vector< IntVar * > &vars)
--— Base Large Neighborhood Search operator --—
bool MakeOneNeighbor() override
This method should not be overridden. Override NextFragment() instead.
virtual bool NextFragment()=0
BaseNodeIterators(const PathOperator *path_operator, int base_index_reference)
AlternativeNodeIterator * GetAlternativeIterator() const
NodeNeighborIterator * GetNeighborIterator() const
void Reset(bool update_end_nodes=false)
AlternativeNodeIterator * GetSiblingAlternativeIterator() const
bool HasReachedEnd() const
virtual std::string DebugString() const
void CopyBucket(const Bitset64< IndexType > &other, IndexType i)
Copies bucket containing bit i from "other" to "this".
bool Contains(int64_t v) const override
IntVarIterator * MakeDomainIterator(bool reversible) const override
IntVar * IsGreaterOrEqual(int64_t constant) override
IntVarIterator * MakeHoleIterator(bool reversible) const override
--— Misc --—
IntVar * IsEqual(int64_t constant) override
IsEqual.
void RemoveValue(int64_t v) override
This method removes the value 'v' from the domain of the variable.
int64_t Value() const override
IntVar * IsDifferent(int64_t constant) override
SimpleRevFIFO< Demon * > delayed_bound_demons_
void RemoveInterval(int64_t l, int64_t u) override
virtual void RestoreValue()=0
uint64_t Size() const override
This method returns the number of values in the domain of the variable.
static const int kUnboundBooleanVarValue
--— Boolean variable --—
void WhenBound(Demon *d) override
int VarType() const override
------— IntVar ------—
IntVar * IsLessOrEqual(int64_t constant) override
std::string BaseName() const override
Returns a base name for automatic naming.
void WhenRange(Demon *d) override
Attach a demon that will watch the min or the max of the expression.
Demon proxy to a method on the constraint with no arguments.
std::string DebugString() const override
CallMethod0(T *const ct, void(T::*method)(), const std::string &name)
Demon proxy to a method on the constraint with one argument.
CallMethod1(T *const ct, void(T::*method)(P), const std::string &name, P param1)
std::string DebugString() const override
Demon proxy to a method on the constraint with two arguments.
std::string DebugString() const override
CallMethod2(T *const ct, void(T::*method)(P, Q), const std::string &name, P param1, Q param2)
Demon proxy to a method on the constraint with three arguments.
CallMethod3(T *const ct, void(T::*method)(P, Q, R), const std::string &name, P param1, Q param2, R param3)
std::string DebugString() const override
virtual int64_t ModifyValue(int64_t index, int64_t value)=0
bool MakeOneNeighbor() override
This method should not be overridden. Override ModifyValue() instead.
ChangeValue(const std::vector< IntVar * > &vars)
--— ChangeValue Operators --—
Constraint(Solver *const solver)
Low-priority demon proxy to a method on the constraint with no arguments.
~DelayedCallMethod0() override
DelayedCallMethod0(T *const ct, void(T::*method)(), const std::string &name)
std::string DebugString() const override
Solver::DemonPriority priority() const override
---------------— Demon class -------------—
Low-priority demon proxy to a method on the constraint with one argument.
~DelayedCallMethod1() override
DelayedCallMethod1(T *const ct, void(T::*method)(P), const std::string &name, P param1)
Solver::DemonPriority priority() const override
---------------— Demon class -------------—
std::string DebugString() const override
Low-priority demon proxy to a method on the constraint with two arguments.
std::string DebugString() const override
Solver::DemonPriority priority() const override
---------------— Demon class -------------—
DelayedCallMethod2(T *const ct, void(T::*method)(P, Q), const std::string &name, P param1, Q param2)
~DelayedCallMethod2() override
virtual void SetValue(int64_t v)
This method sets the value of the expression.
virtual bool Bound() const
Returns true if the min and the max of the expression are equal.
virtual int64_t Min() const =0
--— Main IntTupleSet class --—
int64_t OldInverseValue(int64_t index) const
void AddToAssignment(IntVar *var, int64_t value, bool active, std::vector< int > *assignment_indices, int64_t index, Assignment *assignment) const
virtual bool SkipUnchanged(int) const
virtual bool IsIncremental() const
bool Activated(int64_t index) const
void SetValue(int64_t index, int64_t value)
void Start(const Assignment *assignment) override
void RevertChanges(bool change_was_incremental)
bool MakeNextNeighbor(Assignment *delta, Assignment *deltadelta) override
--— Base operator class for operators manipulating IntVars --—
void AddVars(const std::vector< IntVar * > &vars)
void Deactivate(int64_t index)
IntVar * Var(int64_t index) const
Returns the variable of given index.
int64_t Value(int64_t index) const
int64_t InverseValue(int64_t index) const
bool ApplyChanges(Assignment *delta, Assignment *deltadelta) const
int64_t PrevValue(int64_t index) const
bool HoldsDelta() const override
IntVarLocalSearchOperator(const std::vector< IntVar * > &vars, bool keep_inverse_values=false)
void Activate(int64_t index)
int64_t OldValue(int64_t index) const
virtual bool MakeOneNeighbor()
~IntVarLocalSearchOperator() override
virtual void WhenBound(Demon *d)=0
int index() const
Returns the index of the variable.
IntVar(Solver *s)
-------— IntVar -------—
--— LightIntFunctionElementCt --—
LightIntFunctionElementCt(Solver *const solver, IntVar *const var, IntVar *const index, F values, std::function< bool()> deep_serialize)
~LightIntFunctionElementCt() override
void InitialPropagate() override
void Accept(ModelVisitor *const visitor) const override
Accepts the given visitor.
std::string DebugString() const override
--------------— Constraint class ----------------—
--— LightIntIntFunctionElementCt --—
~LightIntIntFunctionElementCt() override
void Accept(ModelVisitor *const visitor) const override
Accepts the given visitor.
void InitialPropagate() override
LightIntIntFunctionElementCt(Solver *const solver, IntVar *const var, IntVar *const index1, IntVar *const index2, F values, std::function< bool()> deep_serialize)
std::string DebugString() const override
--------------— Constraint class ----------------—
--— LightIntIntIntFunctionElementCt --—
LightIntIntIntFunctionElementCt(Solver *const solver, IntVar *const var, IntVar *const index1, IntVar *const index2, IntVar *const index3, F values)
std::string DebugString() const override
--------------— Constraint class ----------------—
void Accept(ModelVisitor *const visitor) const override
Accepts the given visitor.
~LightIntIntIntFunctionElementCt() override
void InitialPropagate() override
LocalSearchFilterManager(std::vector< FilterEvent > filter_events)
void Revert()
Calls Revert() of filters, in reverse order of Relax events.
int64_t GetSynchronizedObjectiveValue() const
void Synchronize(const Assignment *assignment, const Assignment *delta)
Synchronizes all filters to assignment.
bool Accept(LocalSearchMonitor *monitor, const Assignment *delta, const Assignment *deltadelta, int64_t objective_min, int64_t objective_max)
virtual bool IsIncremental() const
virtual void Reset()
Sets the filter to empty solution.
virtual void Revert()
Cancels the changes made by the last Relax()/Accept() calls.
virtual bool Accept(const Assignment *delta, const Assignment *deltadelta, int64_t objective_min, int64_t objective_max)=0
virtual int64_t GetSynchronizedObjectiveValue() const
Objective value from last time Synchronize() was called.
virtual void Synchronize(const Assignment *assignment, const Assignment *delta)=0
virtual bool IsActive() const =0
virtual void EndAcceptNeighbor(const LocalSearchOperator *op, bool neighbor_found)=0
virtual void BeginAcceptNeighbor(const LocalSearchOperator *op)=0
void Install() override
Install itself on the solver.
virtual void BeginFiltering(const LocalSearchFilter *filter)=0
virtual void EndFilterNeighbor(const LocalSearchOperator *op, bool neighbor_found)=0
virtual void EndFiltering(const LocalSearchFilter *filter, bool reject)=0
int64_t CheckPointValue(int64_t index) const
void SetCandidateActive(int64_t index, bool active)
void SetCurrentDomainInjectiveAndKeepInverseValues(int max_value)
void Revert(bool only_incremental)
int64_t CandidateValue(int64_t index) const
LocalSearchOperatorState()
void SetCandidateValue(int64_t index, int64_t value)
const std::vector< int64_t > & IncrementalIndicesChanged() const
const std::vector< int64_t > & CandidateIndicesChanged() const
int64_t CommittedInverseValue(int64_t value) const
int64_t CommittedValue(int64_t index) const
bool CandidateIsActive(int64_t index) const
int64_t CandidateInverseValue(int64_t value) const
virtual bool HoldsDelta() const
virtual bool MakeNextNeighbor(Assignment *delta, Assignment *deltadelta)=0
virtual const LocalSearchOperator * Self() const
virtual void EnterSearch()
virtual bool HasFragments() const
~LocalSearchOperator() override
virtual void Start(const Assignment *assignment)=0
bool SetMax(int64_t new_max) const
friend class LocalSearchState
Only LocalSearchState can construct LocalSearchVariables.
bool StateIsFeasible() const
void PropagateRelax(VariableDomainId domain_id)
Propagation of all events.
static Variable DummyVariable()
Makes a variable with no state, this is meant as a placeholder.
Variable MakeVariable(VariableDomainId domain_id)
Variable MakeVariableWithRelaxedDomain(int64_t min, int64_t max)
bool PropagateTighten(VariableDomainId domain_id)
virtual void InsertVarArrayConstantArrayExpression(IntExpr *expression, const std::vector< IntVar * > &var, const std::vector< int64_t > &values, VarArrayConstantArrayExpressionType type)=0
VarArrayConstantExpressionType
@ VAR_ARRAY_CONSTANT_INDEX
@ VAR_ARRAY_CONSTANT_EXPRESSION_MAX
VarArrayConstantArrayExpressionType
@ VAR_ARRAY_CONSTANT_ARRAY_EXPRESSION_MAX
@ VAR_ARRAY_CONSTANT_ARRAY_SCAL_PROD
virtual void InsertVarConstantConstraint(Constraint *ct, IntVar *var, int64_t value, VarConstantConstraintType type)=0
virtual IntExpr * FindExprExprExpression(IntExpr *var1, IntExpr *var2, ExprExprExpressionType type) const =0
Expr Expr Expressions.
virtual Constraint * FindExprExprConstraint(IntExpr *expr1, IntExpr *expr2, ExprExprConstraintType type) const =0
Expr Expr Constraints.
virtual Constraint * FindVoidConstraint(VoidConstraintType type) const =0
Void constraints.
virtual IntExpr * FindVarArrayConstantArrayExpression(const std::vector< IntVar * > &vars, const std::vector< int64_t > &values, VarArrayConstantArrayExpressionType type) const =0
Var Array Constant Array Expressions.
virtual IntExpr * FindVarArrayExpression(const std::vector< IntVar * > &vars, VarArrayExpressionType type) const =0
Var Array Expressions.
virtual IntExpr * FindExprExpression(IntExpr *expr, ExprExpressionType type) const =0
Expr Expressions.
VarConstantConstraintType
virtual void InsertExprExprConstraint(Constraint *ct, IntExpr *expr1, IntExpr *expr2, ExprExprConstraintType type)=0
ExprConstantExpressionType
@ EXPR_CONSTANT_IS_NOT_EQUAL
@ EXPR_CONSTANT_IS_GREATER_OR_EQUAL
@ EXPR_CONSTANT_IS_LESS_OR_EQUAL
@ EXPR_CONSTANT_DIFFERENCE
@ EXPR_CONSTANT_EXPRESSION_MAX
virtual void InsertExprExpression(IntExpr *expression, IntExpr *expr, ExprExpressionType type)=0
VarConstantArrayExpressionType
@ VAR_CONSTANT_ARRAY_EXPRESSION_MAX
@ VAR_CONSTANT_ARRAY_ELEMENT
virtual void InsertVoidConstraint(Constraint *ct, VoidConstraintType type)=0
virtual void InsertExprExprExpression(IntExpr *expression, IntExpr *var1, IntExpr *var2, ExprExprExpressionType type)=0
virtual void InsertVarConstantArrayExpression(IntExpr *expression, IntVar *var, const std::vector< int64_t > &values, VarConstantArrayExpressionType type)=0
@ EXPR_EXPR_EXPRESSION_MAX
@ EXPR_EXPR_IS_LESS_OR_EQUAL
virtual IntExpr * FindVarArrayConstantExpression(const std::vector< IntVar * > &vars, int64_t value, VarArrayConstantExpressionType type) const =0
Var Array Constant Expressions.
virtual void InsertExprConstantExpression(IntExpr *expression, IntExpr *var, int64_t value, ExprConstantExpressionType type)=0
VarConstantConstantExpressionType
@ VAR_CONSTANT_CONSTANT_EXPRESSION_MAX
virtual void InsertVarConstantConstantConstraint(Constraint *ct, IntVar *var, int64_t value1, int64_t value2, VarConstantConstantConstraintType type)=0
virtual void InsertVarArrayConstantExpression(IntExpr *expression, const std::vector< IntVar * > &var, int64_t value, VarArrayConstantExpressionType type)=0
virtual void InsertVarConstantConstantExpression(IntExpr *expression, IntVar *var, int64_t value1, int64_t value2, VarConstantConstantExpressionType type)=0
ExprExprConstantExpressionType
@ EXPR_EXPR_CONSTANT_CONDITIONAL
@ EXPR_EXPR_CONSTANT_EXPRESSION_MAX
virtual Constraint * FindVarConstantConstraint(IntVar *var, int64_t value, VarConstantConstraintType type) const =0
Var Constant Constraints.
virtual IntExpr * FindVarConstantArrayExpression(IntVar *var, const std::vector< int64_t > &values, VarConstantArrayExpressionType type) const =0
Var Constant Array Expressions.
@ VAR_ARRAY_EXPRESSION_MAX
@ EXPR_EXPR_GREATER_OR_EQUAL
@ EXPR_EXPR_LESS_OR_EQUAL
@ EXPR_EXPR_CONSTRAINT_MAX
ModelCache(Solver *solver)
--— ModelCache --—
virtual IntExpr * FindExprConstantExpression(IntExpr *expr, int64_t value, ExprConstantExpressionType type) const =0
Expr Constant Expressions.
virtual void InsertExprExprConstantExpression(IntExpr *expression, IntExpr *var1, IntExpr *var2, int64_t constant, ExprExprConstantExpressionType type)=0
virtual IntExpr * FindExprExprConstantExpression(IntExpr *var1, IntExpr *var2, int64_t constant, ExprExprConstantExpressionType type) const =0
Expr Expr Constant Expressions.
virtual IntExpr * FindVarConstantConstantExpression(IntVar *var, int64_t value1, int64_t value2, VarConstantConstantExpressionType type) const =0
Var Constant Constant Expressions.
virtual Constraint * FindVarConstantConstantConstraint(IntVar *var, int64_t value1, int64_t value2, VarConstantConstantConstraintType type) const =0
Var Constant Constant Constraints.
virtual void InsertVarArrayExpression(IntExpr *expression, const std::vector< IntVar * > &vars, VarArrayExpressionType type)=0
VarConstantConstantConstraintType
@ VAR_CONSTANT_CONSTANT_CONSTRAINT_MAX
@ VAR_CONSTANT_CONSTANT_BETWEEN
void VisitIntervalArgument(const std::string &arg_name, IntervalVar *argument) override
Visit interval argument.
void VisitIntervalArrayArgument(const std::string &arg_name, const std::vector< IntervalVar * > &arguments) override
void VisitIntervalVariable(const IntervalVar *variable, const std::string &operation, int64_t value, IntervalVar *delegate) override
void VisitIntegerArgument(const std::string &arg_name, int64_t value) override
Integer arguments.
void VisitIntegerArrayArgument(const std::string &arg_name, const std::vector< int64_t > &values) override
void VisitSequenceVariable(const SequenceVar *variable) override
void VisitSequenceArgument(const std::string &arg_name, SequenceVar *argument) override
Visit sequence argument.
void VisitSequenceArrayArgument(const std::string &arg_name, const std::vector< SequenceVar * > &arguments) override
void VisitIntegerVariable(const IntVar *variable, IntExpr *delegate) override
void VisitIntegerVariableArrayArgument(const std::string &arg_name, const std::vector< IntVar * > &arguments) override
void PushArgumentHolder()
ArgumentHolder * Top() const
void VisitIntegerMatrixArgument(const std::string &arg_name, const IntTupleSet &values) override
void EndVisitIntegerExpression(const std::string &type_name, const IntExpr *expr) override
void VisitIntegerExpressionArgument(const std::string &arg_name, IntExpr *argument) override
Variables.
static const char kMinArgument[]
static const char kTargetArgument[]
static const char kMaxArgument[]
virtual void VisitIntegerExpressionArgument(const std::string &arg_name, IntExpr *argument)
Visit integer expression argument.
static const char kIndexArgument[]
static const char kLightElementEqual[]
virtual void BeginVisitConstraint(const std::string &type_name, const Constraint *constraint)
static const char kIndex2Argument[]
void VisitInt64ToInt64Extension(const Solver::IndexEvaluator1 &eval, int64_t index_min, int64_t index_max)
static const char kIndex3Argument[]
virtual void EndVisitConstraint(const std::string &type_name, const Constraint *constraint)
bool IsIncomingNeighbor() const
bool IsOutgoingNeighbor() const
void Reset(const PathOperator &path_operator, int base_index_reference)
Subclass of Rev<T> which adds numerical operations.
void Incr(Solver *const s)
bool HasNeighbors() const
int number_of_nexts() const
Number of next variables.
bool SkipUnchanged(int index) const override
bool MakeChainInactive(int64_t before_chain, int64_t chain_end)
int64_t Prev(int64_t node) const
Returns the node before node in the current delta.
bool SwapActiveAndInactive(int64_t active, int64_t inactive)
Replaces active by inactive in the current path, making active inactive.
int PathClassFromStartNode(int64_t start_node) const
int64_t Path(int64_t node) const
void AddPairAlternativeSets(const std::vector< PairType > &pair_alternative_sets)
bool MakeActive(int64_t node, int64_t destination)
Insert the inactive node after destination.
int64_t OldNext(int64_t node) const
virtual void ResetIncrementalism()
virtual bool ConsiderAlternatives(int64_t) const
bool SwapNodes(int64_t node1, int64_t node2)
Swaps the nodes node1 and node2.
int64_t BaseSiblingAlternativeNode(int i) const
Returns the alternative node for the sibling of the ith base node.
void SetNext(int64_t from, int64_t to, int64_t path)
Sets 'to' to be the node after 'from' on the given path.
const int number_of_nexts_
virtual bool OnSamePathAsPreviousBase(int64_t)
virtual int64_t GetBaseNodeRestartPosition(int base_index)
int CurrentNodePathStart(int64_t node) const
int GetSiblingAlternativeIndex(int node) const
Returns the index of the alternative set of the sibling of node.
int64_t OldPath(int64_t node) const
int GetAlternativeIndex(int node) const
Returns the index of the alternative set of the node.
int64_t PrevNext(int64_t node) const
virtual bool InitPosition() const
int64_t OldPrev(int64_t node) const
virtual void OnNodeInitialization()
int AddAlternativeSet(const std::vector< int64_t > &alternative_set)
int64_t GetActiveAlternativeSibling(int node) const
bool IsPathStart(int64_t node) const
Returns true if node is the first node on the path.
bool MoveChain(int64_t before_chain, int64_t chain_end, int64_t destination)
bool IsPathEnd(int64_t node) const
bool SwapActiveAndInactiveChains(absl::Span< const int64_t > active_chain, absl::Span< const int64_t > inactive_chain)
virtual bool MakeNeighbor()=0
int64_t EndNode(int i) const
Returns the end node of the ith base node.
int64_t GetActiveInAlternativeSet(int alternative_index) const
Returns the active node in the given alternative set.
PathOperator(const std::vector< IntVar * > &next_vars, const std::vector< IntVar * > &path_vars, IterationParameters iteration_parameters)
Builds an instance of PathOperator from next and path variables.
virtual bool RestartAtPathStartOnSynchronize()
bool IsInactive(int64_t node) const
Returns true if node is inactive.
const std::vector< int64_t > & path_starts() const
Returns the vector of path start nodes.
bool CheckChainValidity(int64_t before_chain, int64_t chain_end, int64_t exclude) const
bool ReverseChain(int64_t before_chain, int64_t after_chain, int64_t *chain_last)
int PathClass(int i) const
Returns the class of the path of the ith base node.
void EnterSearch() override
virtual void SetNextBaseToIncrement(int64_t base_index)
int64_t BaseAlternativeNode(int i) const
Returns the alternative node for the ith base node.
bool MakeOneNeighbor() override
This method should not be overridden. Override MakeNeighbor() instead.
int64_t StartNode(int i) const
Returns the start node of the ith base node.
int64_t BaseNode(int i) const
Returns the ith base node of the operator.
int CurrentNodePathEnd(int64_t node) const
virtual void SetValues(IntVar *var, const std::vector< int64_t > &values)=0
virtual void SetDurationMax(IntervalVar *var, int64_t new_max)=0
virtual void SetStartMax(IntervalVar *var, int64_t new_max)=0
virtual void SetStartMin(IntervalVar *var, int64_t new_min)=0
IntervalVar modifiers.
virtual void PopContext()=0
virtual void RankSequence(SequenceVar *var, const std::vector< int > &rank_first, const std::vector< int > &rank_last, const std::vector< int > &unperformed)=0
virtual void RankNotFirst(SequenceVar *var, int index)=0
std::string DebugString() const override
virtual void RankNotLast(SequenceVar *var, int index)=0
virtual void PushContext(const std::string &context)=0
virtual void SetPerformed(IntervalVar *var, bool value)=0
virtual void SetEndMax(IntervalVar *var, int64_t new_max)=0
virtual void RemoveValue(IntVar *var, int64_t value)=0
virtual void EndDemonRun(Demon *demon)=0
virtual void SetDurationMin(IntervalVar *var, int64_t new_min)=0
virtual void SetMin(IntExpr *expr, int64_t new_min)=0
IntExpr modifiers.
virtual void SetEndMin(IntervalVar *var, int64_t new_min)=0
virtual void RankFirst(SequenceVar *var, int index)=0
SequenceVar modifiers.
virtual void SetMax(IntExpr *expr, int64_t new_max)=0
virtual void RankLast(SequenceVar *var, int index)=0
virtual void SetDurationRange(IntervalVar *var, int64_t new_min, int64_t new_max)=0
virtual void StartProcessingIntegerVariable(IntVar *var)=0
virtual void EndProcessingIntegerVariable(IntVar *var)=0
void Install() override
Install itself on the solver.
virtual void RemoveInterval(IntVar *var, int64_t imin, int64_t imax)=0
virtual void SetRange(IntExpr *expr, int64_t new_min, int64_t new_max)=0
virtual void RemoveValues(IntVar *var, const std::vector< int64_t > &values)=0
virtual void SetStartRange(IntervalVar *var, int64_t new_min, int64_t new_max)=0
virtual void SetValue(IntVar *var, int64_t value)=0
virtual void SetEndRange(IntervalVar *var, int64_t new_min, int64_t new_max)=0
Matrix version of the RevBitSet class.
bool IsSet(int64_t row, int64_t column) const
Returns whether the 'column' bit in the 'row' row is set.
void ClearAll(Solver *solver)
Cleans all bits.
int64_t GetFirstBit(int row, int start) const
void SetToZero(Solver *solver, int64_t row, int64_t column)
Erases the 'column' bit in the 'row' row.
void SetToOne(Solver *solver, int64_t row, int64_t column)
Sets the 'column' bit in the 'row' row.
int64_t Cardinality() const
Returns the number of bits set to one.
void ClearAll(Solver *solver)
Cleans all bits.
RevBitSet(int64_t size)
-------— RevBitSet -------—
void SetToZero(Solver *solver, int64_t index)
Erases the 'index' bit.
bool IsCardinalityOne() const
Does it contains only one bit set?
void SetToOne(Solver *solver, int64_t index)
Sets the 'index' bit.
friend class RevBitMatrix
bool IsSet(int64_t index) const
Returns whether the 'index' bit is set.
int64_t GetFirstBit(int start) const
bool IsCardinalityZero() const
Is bitset null?
void RevInsert(Solver *const solver, int64_t index, T value)
void Insert(const K &key, const V &value)
Inserts (key, value) in the multi-map.
bool ContainsKey(const K &key) const
Returns true if the multi-map contains at least one instance of 'key'.
RevImmutableMultiMap(Solver *const solver, int initial_size)
const V & FindWithDefault(const K &key, const V &default_value) const
RevIntSet(int capacity)
Capacity is the fixed size of the set (it cannot grow).
void Remove(Solver *const solver, const T &value_index)
const T * const_iterator
Iterators on the indices.
void Insert(Solver *const solver, const T &elt)
T RemovedElement(int i) const
const_iterator end() const
static constexpr int kNoInserted
--— RevPartialSequence --—
void RankLast(Solver *const solver, int elt)
int NumLastRanked() const
void RankFirst(Solver *const solver, int elt)
A reversible switch that can switch once from false to true.
void Switch(Solver *const solver)
virtual void OutputLine(const std::string &line)
void EndInitialPropagation() override
After the initial propagation.
void BeginInitialPropagation() override
Before the initial propagation.
std::string DebugString() const override
A search monitor is a simple set of callbacks to monitor all search events.
SearchMonitor(Solver *const s)
Iterator(const SimpleRevFIFO< T > *l)
void SetLastValue(const T &v)
Sets the last value in the FIFO.
const T * Last() const
Returns the last item of the FIFO.
void Push(Solver *const s, T val)
void PushIfNotTop(Solver *const s, T val)
Pushes the var on top if is not a duplicate of the current top object.
const T & LastValue() const
Returns the last value in the FIFO.
void SetToZero(Solver *solver, int64_t pos)
Erases the 'pos' bit.
SmallRevBitSet(int64_t size)
-------— SmallRevBitSet -------—
void SetToOne(Solver *solver, int64_t pos)
Sets the 'pos' bit.
bool IsCardinalityZero() const
Is bitset null?
int64_t Cardinality() const
Returns the number of bits set to one.
int64_t GetFirstOne() const
bool IsCardinalityOne() const
Does it contains only one bit set?
For the time being, Solver is neither MT_SAFE nor MT_HOT.
std::function< int64_t(int64_t, int64_t, int64_t)> IndexEvaluator3
void SaveAndSetValue(T *adr, T val)
All-in-one SaveAndSetValue.
const std::vector< IntegerType > & PositionsSetAtLeastOnce() const
void Set(IntegerType index)
const std::vector< ArcId > & ComputeSortedSubDagArcs(NodeId node)
void BuildGraph(int num_nodes)
-------— Symmetry Breaking -------—
int64_t bit_size() const
Returns the number of bits given in the constructor of the bitset.
const RevIntSet< int > & active_words() const
Returns the set of active word indices.
int ActiveWordSize() const
bool RevAnd(Solver *solver, const std::vector< uint64_t > &mask)
absl::Status Exists(absl::string_view path, Options options)
For infeasible and unbounded see Not checked if options check_solutions_if_inf_or_unbounded and the If options first_solution_only is false
problem is infeasible or unbounded (default).
dual_gradient T(y - `dual_solution`) class DiagonalTrustRegionProblemFromQp
std::function< int64_t(const Model &)> Value(IntegerVariable v)
This checks that the variable is fixed.
In SWIG mode, we don't want anything besides these top-level includes.
LocalSearchOperator * MakeExtendedSwapActive(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class)
--— ExtendedSwapActive --—
std::string ParameterDebugString(P param)
bool IsArrayConstant(const std::vector< T > &values, const T &value)
bool AreAllLessOrEqual(const std::vector< T > &values, const T &value)
LocalSearchOperator * RelocateAndMakeInactive(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class)
--— RelocateAndMakeInactive --—
LocalSearchOperator * MakeTSPOpt(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, Solver::IndexEvaluator3 evaluator, int chain_length)
--— TSP-based operators --—
LocalSearchOperator * MakeCross(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors=nullptr, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors=nullptr)
--— Cross --—
SubDagComputer::ArcId ArcId
Demon * MakeConstraintDemon3(Solver *const s, T *const ct, void(T::*method)(P, Q, R), const std::string &name, P param1, Q param2, R param3)
LocalSearchOperator * MakeSwapActive(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class)
--— SwapActive --—
LocalSearchOperator * ExchangeAndMakeActive(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class)
--— ExchangeAndMakeActive --—
bool AreAllNegative(const std::vector< T > &values)
bool AreAllGreaterOrEqual(const std::vector< T > &values, const T &value)
bool IsIncreasing(const std::vector< T > &values)
bool IsArrayBoolean(const std::vector< T > &values)
LocalSearchOperator * MakeExchange(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors=nullptr, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors=nullptr)
--— Exchange --—
void AcceptUncheckedNeighbor(Search *search)
LocalSearchOperator * MakeActiveAndRelocate(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class)
--— MakeActiveAndRelocate --—
bool AreAllBoundOrNull(const std::vector< IntVar * > &vars, const std::vector< T > &values)
int64_t MaxVarArray(const std::vector< IntVar * > &vars)
LocalSearchOperator * MakeTSPLns(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, Solver::IndexEvaluator3 evaluator, int tsp_size)
Demon * MakeConstraintDemon2(Solver *const s, T *const ct, void(T::*method)(P, Q), const std::string &name, P param1, Q param2)
Demon * MakeDelayedConstraintDemon0(Solver *const s, T *const ct, void(T::*method)(), const std::string &name)
Demon * MakeDelayedConstraintDemon2(Solver *const s, T *const ct, void(T::*method)(P, Q), const std::string &name, P param1, Q param2)
LocalSearchOperator * MakeRelocate(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors=nullptr, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors=nullptr, int64_t chain_length=1LL, bool single_path=false, const std::string &name="Relocate")
--— Relocate --—
LocalSearchOperator * RelocateAndMakeActive(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class)
-— RelocateAndMakeActive --—
void FillValues(const std::vector< IntVar * > &vars, std::vector< int64_t > *const values)
bool AreAllBooleans(const std::vector< IntVar * > &vars)
bool AreAllStrictlyNegative(const std::vector< T > &values)
LocalSearchOperator * MakePathLns(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, int number_of_chunks, int chunk_size, bool unactive_fragments)
--— Path-based Large Neighborhood Search --—
int64_t MinVarArray(const std::vector< IntVar * > &vars)
LocalSearchOperator * MakeInactive(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class)
--— MakeInactive --—
void RegisterDemon(Solver *const solver, Demon *const demon, DemonProfiler *const monitor)
--— Exported Methods for Unit Tests --—
LocalSearchOperator * MakeTwoOpt(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors=nullptr, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors=nullptr)
--— 2Opt --—
LocalSearchOperator * MakeChainInactive(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class)
--— MakeChainInactive --—
Demon * MakeConstraintDemon0(Solver *const s, T *const ct, void(T::*method)(), const std::string &name)
static const int kUnassigned
--— Routing model --—
bool IsIncreasingContiguous(const std::vector< T > &values)
bool AreAllNull(const std::vector< T > &values)
bool AreAllPositive(const std::vector< T > &values)
LocalSearchOperator * ExchangePathStartEndsAndMakeActive(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class)
--— ExchangePathEndsAndMakeActive --—
Demon * MakeDelayedConstraintDemon1(Solver *const s, T *const ct, void(T::*method)(P), const std::string &name, P param1)
LocalSearchOperator * MakeSwapActiveChain(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, int max_chain_size)
--— SwapActiveChain --—
LocalSearchOperator * MakeLinKernighan(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, const Solver::IndexEvaluator3 &evaluator, bool topt)
--— Lin-Kernighan --—
LocalSearchState::VariableDomainId VariableDomainId
int64_t PosIntDivDown(int64_t e, int64_t v)
bool IsArrayInRange(const std::vector< IntVar * > &vars, T range_min, T range_max)
Demon * MakeConstraintDemon1(Solver *const s, T *const ct, void(T::*method)(P), const std::string &name, P param1)
bool AreAllOnes(const std::vector< T > &values)
bool AreAllBound(const std::vector< IntVar * > &vars)
uint64_t Hash1(uint64_t value)
LocalSearchOperator * MakeActive(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors=nullptr, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors=nullptr)
--— MakeActive --—
int64_t PosIntDivUp(int64_t e, int64_t v)
SubDagComputer::NodeId NodeId
trees with all degrees equal to
static int input(yyscan_t yyscanner)
#define DEFINE_STRONG_INT_TYPE(int_type_name, value_type)
ConstraintId constraint_id
VariableDomainId domain_id
Set of parameters used to configure how the neighnorhood is traversed.
bool accept_path_end_base
True if path ends should be considered when iterating over neighbors.
std::function< int(int64_t)> start_empty_path_class
std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors
bool skip_locally_optimal_paths
int number_of_base_nodes
Number of nodes needed to define a neighbor.
std::function< const std::vector< int > &(int, int)> get_incoming_neighbors
static const int64_t kint64max
static const int64_t kint64min