<ahref="constraint__solveri_8h.html">Go to the documentation of this file.</a><divclass="fragment"><divclass="line"><aname="l00001"></a><spanclass="lineno"> 1</span> <spanclass="comment">// Copyright 2010-2021 Google LLC</span></div><divclass="line"><aname="l00002"></a><spanclass="lineno"> 2</span> <spanclass="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><divclass="line"><aname="l00003"></a><spanclass="lineno"> 3</span> <spanclass="comment">// you may not use this file except in compliance with the License.</span></div><divclass="line"><aname="l00004"></a><spanclass="lineno"> 4</span> <spanclass="comment">// You may obtain a copy of the License at</span></div><divclass="line"><aname="l00005"></a><spanclass="lineno"> 5</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00006"></a><spanclass="lineno"> 6</span> <spanclass="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><divclass="line"><aname="l00007"></a><spanclass="lineno"> 7</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00008"></a><spanclass="lineno"> 8</span> <spanclass="comment">// Unless required by applicable law or agreed to in writing, software</span></div><divclass="line"><aname="l00009"></a><spanclass="lineno"> 9</span> <spanclass="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><divclass="line"><aname="l00010"></a><spanclass="lineno"> 10</span> <spanclass="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><divclass="line"><aname="l00011"></a><spanclass="lineno"> 11</span> <spanclass="comment">// See the License for the specific language governing permissions and</span></div><divclass="line"><aname="l00012"></a><spanclass="lineno"> 12</span> <spanclass="comment">// limitations under the License.</span></div><divclass="line"><aname="l00013"></a><spanclass="lineno"> 13</span> </div><divclass="line"><aname="l00048"></a><spanclass="lineno"> 48</span> </div><divclass="line"><aname="l00049"></a><spanclass="lineno"> 49</span> <spanclass="preprocessor">#ifndef OR_TOOLS_CONSTRAINT_SOLVER_CONSTRAINT_SOLVERI_H_</span></div><divclass="line"><aname="l00050"></a><spanclass="lineno"> 50</span> <spanclass="preprocessor">#define OR_TOOLS_CONSTRAINT_SOLVER_CONSTRAINT_SOLVERI_H_</span></div><divclass="line"><aname="l00051"></a><spanclass="lineno"> 51</span> </div><divclass="line"><aname="l00052"></a><spanclass="lineno"> 52</span> <spanclass="preprocessor">#include <stdint.h></span></div><divclass="line"><aname="l00053"></a><spanclass="lineno"> 53</span> <spanclass="preprocessor">#include <string.h></span></div><divclass="line"><aname="l00054"></a><spanclass="lineno"> 54</span> </div><divclass="line"><aname="l00055"></a><spanclass="lineno"> 55</span> <spanclass="preprocessor">#include <algorithm></span></div><divclass="line"><aname="l00056"></a><spanclass="lineno"> 56</span> <spanclass="preprocessor">#include <functional></span></div><divclass="line"><aname="l00057"></a><spanclass="lineno"> 57</span> <spanclass="preprocessor">#include <memory></span></div><divclass="line"><aname="l00058"></a><spanclass="lineno"> 58</span> <spanclass="preprocessor">#include <string></span></div><divclass="line"><aname="l00059"></a><spanclass="lineno"> 59</span> <spanclass="preprocessor">#include <utility></span></div><divclass="line"><aname="l00060"></a><spanclass="lineno"> 60</span> <spanclass="preprocessor">#include <vector></span></div><divclass="line"><aname="l00061"></a><spanclass="lineno"> 61</span> </div><divclass="line"><aname="l00062"></a><spanclass="lineno"> 62</span> <spanclass="preprocessor">#include "absl/containe
<divclass="ttc"id="classoperations__research_1_1_path_state_1_1_node_range_1_1_iterator_html_aef12ef33726bc591f569f822c7b5ac41"><divclass="ttname"><ahref="classoperations__research_1_1_path_state_1_1_node_range_1_1_iterator.html#aef12ef33726bc591f569f822c7b5ac41">operations_research::PathState::NodeRange::Iterator::operator++</a></div><divclass="ttdeci">Iterator & operator++()</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l03332">constraint_solveri.h:3332</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_delayed_call_method2_html"><divclass="ttname"><ahref="classoperations__research_1_1_delayed_call_method2.html">operations_research::DelayedCallMethod2</a></div><divclass="ttdoc">Low-priority demon proxy to a method on the constraint with two arguments.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00725">constraint_solveri.h:725</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_base_int_expr_html_aabb6b039a96b1f9aaed302ba620c08cd"><divclass="ttname"><ahref="classoperations__research_1_1_base_int_expr.html#aabb6b039a96b1f9aaed302ba620c08cd">operations_research::BaseIntExpr::Var</a></div><divclass="ttdeci">IntVar * Var() override</div><divclass="ttdoc">Creates a variable from the expression.</div><divclass="ttdef"><b>Definition:</b><ahref="expressions_8cc_source.html#l07442">expressions.cc:7442</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html">operations_research::VarLocalSearchOperator</a></div><divclass="ttdoc">Base operator class for operators manipulating variables.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00807">constraint_solveri.h:807</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_argument_holder_html_ae23e57e443be817e98c18896384f5f8f"><divclass="ttname"><ahref="classoperations__research_1_1_argument_holder.html#ae23e57e443be817e98c18896384f5f8f">operations_research::ArgumentHolder::HasIntegerExpressionArgument</a></div><divclass="ttdeci">bool HasIntegerExpressionArgument(const std::string &arg_name) const</div><divclass="ttdoc">Checks if arguments exist.</div><divclass="ttdef"><b>Definition:</b><ahref="visitor_8cc_source.html#l00085">visitor.cc:85</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_base_lns_html"><divclass="ttname"><ahref="classoperations__research_1_1_base_lns.html">operations_research::BaseLns</a></div><divclass="ttdoc">This is the base class for building an Lns operator.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01259">constraint_solveri.h:1259</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_symmetry_breaker_html_a6e2dffe1ae5b83f75a3568f320d9d060"><divclass="ttname"><ahref="classoperations__research_1_1_symmetry_breaker.html#a6e2dffe1ae5b83f75a3568f320d9d060">operations_research::SymmetryBreaker::AddIntegerVariableEqualValueClause</a></div><divclass="ttdeci">void AddIntegerVariableEqualValueClause(IntVar *const var, int64_t value)</div><divclass="ttdef"><b>Definition:</b><ahref="search_8cc_source.html#l04830">search.cc:4830</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a4f36c21ecd69ac0eda49cd44375e88b4"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a4f36c21ecd69ac0eda49cd44375e88b4">operations_research::PathOperator::IsPathEnd</a></div><divclass="ttdeci">bool IsPathEnd(int64_t node) const</div><divclass="ttdoc">Returns true if node is the last node on the path; defined by the fact that node is outside the range...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01497">constraint_solveri.h:1497</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_int_set_html"><divclass="ttname"><ahref="classoperations__research_1_1_rev_int_set.html">operations_research::RevIntSet</a></div><divclass="ttdoc">This is a special class to represent a 'residual' set of T.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02566">constraint_solveri.h:2566</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_immutable_multi_map_html_abdfc0716a485fde5b997f58b1c4c822e"><divclass="ttname"><ahref="classoperations__research_1_1_rev_immutable_multi_map.html#abdfc0716a485fde5b997f58b1c4c822e">operations_research::RevImmutableMultiMap::FindWithDefault</a></div><divclass="ttdeci">const V & FindWithDefault(const K &key, const V &default_value) const</div><divclass="ttdoc">Returns one value attached to 'key', or 'default_value' if 'key' is not in the multi-map.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00304">constraint_solveri.h:304</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_int_var_local_search_filter_html_a8aee4c2eced4f3924981864dffcb9f4b"><divclass="ttname"><ahref="classoperations__research_1_1_int_var_local_search_filter.html#a8aee4c2eced4f3924981864dffcb9f4b">operations_research::IntVarLocalSearchFilter::FindIndex</a></div><divclass="ttdeci">bool FindIndex(IntVar *const var, int64_t *index) const</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01830">constraint_solveri.h:1830</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_small_rev_bit_set_html_a16202f709ab06d78dcae8db3ff21fd9c"><divclass="ttname"><ahref="classoperations__research_1_1_small_rev_bit_set.html#a16202f709ab06d78dcae8db3ff21fd9c">operations_research::SmallRevBitSet::IsCardinalityOne</a></div><divclass="ttdeci">bool IsCardinalityOne() const</div><divclass="ttdoc">Does it contains only one bit set?</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00408">constraint_solveri.h:408</a></div></div>
<divclass="ttc"id="structoperations__research_1_1_path_operator_1_1_iteration_parameters_html"><divclass="ttname"><ahref="structoperations__research_1_1_path_operator_1_1_iteration_parameters.html">operations_research::PathOperator::IterationParameters</a></div><divclass="ttdoc">Set of parameters used to configure how the neighnorhood is traversed.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01315">constraint_solveri.h:1315</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a54470bffc3ea32cc37d0222e5dbb62a6"><divclass="ttname"><ahref="namespaceoperations__research.html#a54470bffc3ea32cc37d0222e5dbb62a6">operations_research::AreAllBoundOrNull</a></div><divclass="ttdeci">bool AreAllBoundOrNull(const std::vector< IntVar * >&vars, const std::vector< T >&values)</div><divclass="ttdoc">Returns true if all the variables are assigned to a single value, or if their corresponding value is ...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02961">constraint_solveri.h:2961</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_delayed_call_method2_html_ac863f0fdd6a476ca003c99f58f14e623"><divclass="ttname"><ahref="classoperations__research_1_1_delayed_call_method2.html#ac863f0fdd6a476ca003c99f58f14e623">operations_research::DelayedCallMethod2::Run</a></div><divclass="ttdeci">void Run(Solver *const s) override</div><divclass="ttdoc">This is the main callback of the demon.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00737">constraint_solveri.h:737</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_partial_sequence_html_aae1ff1f02500de1b7cf8042c10a5a36d"><divclass="ttname"><ahref="classoperations__research_1_1_rev_partial_sequence.html#aae1ff1f02500de1b7cf8042c10a5a36d">operations_research::RevPartialSequence::RankFirst</a></div><divclass="ttdeci">void RankFirst(Solver *const solver, int elt)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02720">constraint_solveri.h:2720</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_small_rev_bit_set_html_a9b5d965cdd1d77de0d2b55c41d86b116"><divclass="ttname"><ahref="classoperations__research_1_1_small_rev_bit_set.html#a9b5d965cdd1d77de0d2b55c41d86b116">operations_research::SmallRevBitSet::SetToZero</a></div><divclass="ttdeci">void SetToZero(Solver *const solver, int64_t pos)</div><divclass="ttdoc">Erases the 'pos' bit.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00043">utilities.cc:43</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_sequence_var_element_html_a448be08e73b90cd86345acc79613a051"><divclass="ttname"><ahref="classoperations__research_1_1_sequence_var_element.html#a448be08e73b90cd86345acc79613a051">operations_research::SequenceVarElement::SetBackwardSequence</a></div><divclass="ttdeci">void SetBackwardSequence(const std::vector< int >&backward_sequence)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_2assignment_8cc_source.html#l00375">constraint_solver/assignment.cc:375</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_a36e70c572bdec688f16496ea06c39ee5"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#a36e70c572bdec688f16496ea06c39ee5">operations_research::BooleanVar::WhenBound</a></div><divclass="ttdeci">void WhenBound(Demon *d) override</div><divclass="ttdoc">This method attaches a demon that will be awakened when the variable is bound.</div><divclass="ttdef"><b>Definition:</b><ahref="expressions_8cc_source.html#l00116">expressions.cc:116</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html_a0aeeba03eeb9514e2946c44c733e994a"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html#a0aeeba03eeb9514e2946c44c733e994a">operations_research::VarLocalSearchOperator::old_values_</a></div><divclass="ttdeci">std::vector< Val > old_values_</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00925">constraint_solveri.h:925</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_operator_html"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_operator.html">operations_research::LocalSearchOperator</a></div><divclass="ttdoc">The base class for all local search operators.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00791">constraint_solveri.h:791</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_assignment_html_a30d2df8ab5db405440580f7db5ee4aaa"><divclass="ttname"><ahref="classoperations__research_1_1_assignment.html#a30d2df8ab5db405440580f7db5ee4aaa">operations_research::Assignment::SequenceVarContainer</a></div><divclass="ttdeci">const SequenceContainer & SequenceVarContainer() const</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l05201">constraint_solver.h:5201</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_filter_html_a683280a81651f9073086324eb6d0cee9"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_filter.html#a683280a81651f9073086324eb6d0cee9">operations_research::LocalSearchFilter::Relax</a></div><divclass="ttdeci">virtual void Relax(const Assignment *delta, const Assignment *deltadelta)</div><divclass="ttdoc">Lets the filter know what delta and deltadelta will be passed in the next Accept().</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01733">constraint_solveri.h:1733</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html_ae2af73491ab2aa6804b443d442026a5e"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html#ae2af73491ab2aa6804b443d442026a5e">operations_research::VarLocalSearchOperator::AddVars</a></div><divclass="ttdeci">void AddVars(const std::vector< V * >&vars)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00894">constraint_solveri.h:894</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_matrix_html_ac5c126872434730d4dde8a14a83b142b"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_matrix.html#ac5c126872434730d4dde8a14a83b142b">operations_research::RevBitMatrix::GetFirstBit</a></div><divclass="ttdeci">int64_t GetFirstBit(int row, int start) const</div><divclass="ttdoc">Returns the first bit in the row 'row' which position is >= 'start'.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00204">utilities.cc:204</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a9f9007781da398bc03b61ab99864295c"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a9f9007781da398bc03b61ab99864295c">operations_research::PathOperator::BaseSiblingAlternativeNode</a></div><divclass="ttdeci">int64_t BaseSiblingAlternativeNode(int i) const</div><divclass="ttdoc">Returns the alternative node for the sibling of the ith base node.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01401">constraint_solveri.h:1401</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_ade1945fe75ec08245775fc4df20153d6"><divclass="ttname"><ahref="namespaceoperations__research.html#ade1945fe75ec08245775fc4df20153d6">operations_research::PosIntDivDown</a></div><divclass="ttdeci">int64_t PosIntDivDown(int64_t e, int64_t v)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l03015">constraint_solveri.h:3015</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_ac94bcebc6d1699e2292cf5fb56970a80"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#ac94bcebc6d1699e2292cf5fb56970a80">operations_research::PathOperator::BaseAlternativeNode</a></div><divclass="ttdeci">int64_t BaseAlternativeNode(int i) const</div><divclass="ttdoc">Returns the alternative node for the ith base node.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01389">constraint_solveri.h:1389</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a3f4525e71a6b05d97c868f0832750a60"><divclass="ttname"><ahref="namespaceoperations__research.html#a3f4525e71a6b05d97c868f0832750a60">operations_research::IsArrayBoolean</a></div><divclass="ttdeci">bool IsArrayBoolean(const std::vector< T >&values)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02855">constraint_solveri.h:2855</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_ac9d41c75de01039a11af9b5d3cecc37f"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#ac9d41c75de01039a11af9b5d3cecc37f">operations_research::PathOperator::GetSiblingAlternativeIndex</a></div><divclass="ttdeci">int GetSiblingAlternativeIndex(int node) const</div><divclass="ttdoc">Returns the index of the alternative set of the sibling of node.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01552">constraint_solveri.h:1552</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_assignment_html_af5fcf5e7a47ae0e325fb1df409ac8e24"><divclass="ttname"><ahref="classoperations__research_1_1_assignment.html#af5fcf5e7a47ae0e325fb1df409ac8e24">operations_research::Assignment::FastAdd</a></div><divclass="ttdeci">IntVarElement * FastAdd(IntVar *const var)</div><divclass="ttdoc">Adds without checking if variable has been previously added.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_2assignment_8cc_source.html#l00650">constraint_solver/assignment.cc:650</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html">operations_research::PathOperator</a></div><divclass="ttdoc">Base class of the local search operators dedicated to path modifications (a path is a set of nodes li...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01312">constraint_solveri.h:1312</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_aad7695e494039d607c26afb6acd0644a"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#aad7695e494039d607c26afb6acd0644a">operations_research::PathOperator::number_of_nexts_</a></div><divclass="ttdeci">const int number_of_nexts_</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01571">constraint_solveri.h:1571</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_set_html_a98b1ea1fa2f50e5d846e0e1b425db458"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_set.html#a98b1ea1fa2f50e5d846e0e1b425db458">operations_research::RevBitSet::IsSet</a></div><divclass="ttdeci">bool IsSet(int64_t index) const</div><divclass="ttdoc">Returns whether the 'index' bit is set.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00106">utilities.cc:106</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_immutable_multi_map_html_a8f6b848968f58150836b9fba3dea4aef"><divclass="ttname"><ahref="classoperations__research_1_1_rev_immutable_multi_map.html#a8f6b848968f58150836b9fba3dea4aef">operations_research::RevImmutableMultiMap::ContainsKey</a></div><divclass="ttdeci">bool ContainsKey(const K &key) const</div><divclass="ttdoc">Returns true if the multi-map contains at least one instance of 'key'.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00289">constraint_solveri.h:289</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_int_set_html_ab57ce8f50aeb2f7e4171b04ca42fd447"><divclass="ttname"><ahref="classoperations__research_1_1_rev_int_set.html#ab57ce8f50aeb2f7e4171b04ca42fd447">operations_research::RevIntSet::Restore</a></div><divclass="ttdeci">void Restore(Solver *const solver, const T &value_index)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02630">constraint_solveri.h:2630</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_afb0903025d265c67199f5f09cee57ed0"><divclass="ttname"><ahref="namespaceoperations__research.html#afb0903025d265c67199f5f09cee57ed0">operations_research::PosIntDivUp</a></div><divclass="ttdeci">int64_t PosIntDivUp(int64_t e, int64_t v)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l03010">constraint_solveri.h:3010</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_unsorted_nullable_rev_bitset_html_a5a8b4cef7032d8784c06443e987896ce"><divclass="ttname"><ahref="classoperations__research_1_1_unsorted_nullable_rev_bitset.html#a5a8b4cef7032d8784c06443e987896ce">operations_research::UnsortedNullableRevBitset::RevSubtract</a></div><divclass="ttdeci">bool RevSubtract(Solver *const solver, const std::vector< uint64_t >&mask)</div><divclass="ttdoc">This method subtracts the mask from the active bitset.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00243">utilities.cc:243</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_set_html_a06d0831df3626060e4b9b80c7f96c682"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_set.html#a06d0831df3626060e4b9b80c7f96c682">operations_research::RevBitSet::SetToOne</a></div><divclass="ttdeci">void SetToOne(Solver *const solver, int64_t index)</div><divclass="ttdoc">Sets the 'index' bit.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00084">utilities.cc:84</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_a4be7736c8af523453a71228afe6e95d7"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#a4be7736c8af523453a71228afe6e95d7">operations_research::BooleanVar::Size</a></div><divclass="ttdeci">uint64_t Size() const override</div><divclass="ttdoc">This method returns the number of values in the domain of the variable.</div><divclass="ttdef"><b>Definition:</b><ahref="expressions_8cc_source.html#l00126">expressions.cc:126</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a8351829c324863ddda52e201df4f9f84"><divclass="ttname"><ahref="namespaceoperations__research.html#a8351829c324863ddda52e201df4f9f84">operations_research::AreAllStrictlyNegative</a></div><divclass="ttdeci">bool AreAllStrictlyNegative(const std::vector< T >&values)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02910">constraint_solveri.h:2910</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_matrix_html"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_matrix.html">operations_research::RevBitMatrix</a></div><divclass="ttdoc">Matrix version of the RevBitSet class.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00456">constraint_solveri.h:456</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a968f3a82c5dbaba4f0725200b00ee97f"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a968f3a82c5dbaba4f0725200b00ee97f">operations_research::PathOperator::SetNext</a></div><divclass="ttdeci">void SetNext(int64_t from, int64_t to, int64_t path)</div><divclass="ttdoc">Sets 'to' to be the node after 'from' on the given path.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01485">constraint_solveri.h:1485</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html_a7b62af3db29eeb312e3cb06f7bb331ce"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html#a7b62af3db29eeb312e3cb06f7bb331ce">operations_research::VarLocalSearchOperator::assignment_indices_</a></div><divclass="ttdeci">std::vector< int > assignment_indices_</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00927">constraint_solveri.h:927</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a027b0d17fd972bee95a8023e7d4f81c9"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">operations_research::PathOperator::StartNode</a></div><divclass="ttdeci">int64_t StartNode(int i) const</div><divclass="ttdoc">Returns the start node of the ith base node.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01411">constraint_solveri.h:1411</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_set_html_a16202f709ab06d78dcae8db3ff21fd9c"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_set.html#a16202f709ab06d78dcae8db3ff21fd9c">operations_research::RevBitSet::IsCardinalityOne</a></div><divclass="ttdeci">bool IsCardinalityOne() const</div><divclass="ttdoc">Does it contains only one bit set?</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00129">utilities.cc:129</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_argument_holder_html_a5d4d21593ad33197d70fd4c881702120"><divclass="ttname"><ahref="classoperations__research_1_1_argument_holder.html#a5d4d21593ad33197d70fd4c881702120">operations_research::ArgumentHolder::TypeName</a></div><divclass="ttdeci">const std::string & TypeName() const</div><divclass="ttdoc">Type of the argument.</div><divclass="ttdef"><b>Definition:</b><ahref="visitor_8cc_source.html#l00032">visitor.cc:32</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_solver_html_a675d33a9ef9aa399017fb68e652c7a5c"><divclass="ttname"><ahref="classoperations__research_1_1_solver.html#a675d33a9ef9aa399017fb68e652c7a5c">operations_research::Solver::SaveAndSetValue</a></div><divclass="ttdeci">void SaveAndSetValue(T *adr, T val)</div><divclass="ttdoc">All-in-one SaveAndSetValue.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l02812">constraint_solver.h:2812</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_search_log_html_afe2b705fd5af7c1c6812f69e9a9dcdf1"><divclass="ttname"><ahref="classoperations__research_1_1_search_log.html#afe2b705fd5af7c1c6812f69e9a9dcdf1">operations_research::SearchLog::EndInitialPropagation</a></div><divclass="ttdeci">void EndInitialPropagation() override</div><divclass="ttdoc">After the initial propagation.</div><divclass="ttdef"><b>Definition:</b><ahref="search_8cc_source.html#l00252">search.cc:252</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_ab8846cc7a17291cb0dffd4c0fc4933ea"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">operations_research::PathOperator::BaseNode</a></div><divclass="ttdeci">int64_t BaseNode(int i) const</div><divclass="ttdoc">Returns the ith base node of the operator.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01385">constraint_solveri.h:1385</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_int_var_local_search_filter_html_a625550edd889d6c9a3b73db329d52a72"><divclass="ttname"><ahref="classoperations__research_1_1_int_var_local_search_filter.html#a625550edd889d6c9a3b73db329d52a72">operations_research::IntVarLocalSearchFilter::Synchronize</a></div><divclass="ttdeci">void Synchronize(const Assignment *assignment, const Assignment *delta) override</div><divclass="ttdoc">This method should not be overridden.</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l03278">local_search.cc:3278</a></div></div>
<divclass="ttc"id="structoperations__research_1_1_path_operator_1_1_iteration_parameters_html_ab789487f0da61ea5fffb910d587d18b3"><divclass="ttname"><ahref="structoperations__research_1_1_path_operator_1_1_iteration_parameters.html#ab789487f0da61ea5fffb910d587d18b3">operations_research::PathOperator::IterationParameters::skip_locally_optimal_paths</a></div><divclass="ttdeci">bool skip_locally_optimal_paths</div><divclass="ttdoc">Skip paths which have been proven locally optimal.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01320">constraint_solveri.h:1320</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a11b8ad366b686132736854e7029e7bff"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a11b8ad366b686132736854e7029e7bff">operations_research::PathOperator::PathClass</a></div><divclass="ttdeci">int PathClass(int i) const</div><divclass="ttdoc">Returns the class of the path of the ith base node.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01415">constraint_solveri.h:1415</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_a75899b659afcf1f3cecb0a3d3c571d79"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#a75899b659afcf1f3cecb0a3d3c571d79">operations_research::BooleanVar::Contains</a></div><divclass="ttdeci">bool Contains(int64_t v) const override</div><divclass="ttdoc">This method returns whether the value 'v' is in the domain of the variable.</div><divclass="ttdef"><b>Definition:</b><ahref="expressions_8cc_source.html#l00130">expressions.cc:130</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_demon_html"><divclass="ttname"><ahref="classoperations__research_1_1_demon.html">operations_research::Demon</a></div><divclass="ttdoc">A Demon is the base element of a propagation queue.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l03303">constraint_solver.h:3303</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_decision_visitor_html"><divclass="ttname"><ahref="classoperations__research_1_1_decision_visitor.html">operations_research::DecisionVisitor</a></div><divclass="ttdoc">A DecisionVisitor is used to inspect a decision.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l03251">constraint_solver.h:3251</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_search_log_html_a4d07aaa3fe401d52e938c2f8f7f2e26f"><divclass="ttname"><ahref="classoperations__research_1_1_search_log.html#a4d07aaa3fe401d52e938c2f8f7f2e26f">operations_research::SearchLog::ExitSearch</a></div><divclass="ttdeci">void ExitSearch() override</div><divclass="ttdoc">End of the search.</div><divclass="ttdef"><b>Definition:</b><ahref="search_8cc_source.html#l00095">search.cc:95</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_delayed_call_method1_html"><divclass="ttname"><ahref="classoperations__research_1_1_delayed_call_method1.html">operations_research::DelayedCallMethod1</a></div><divclass="ttdoc">Low-priority demon proxy to a method on the constraint with one argument.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00689">constraint_solveri.h:689</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_unsorted_nullable_rev_bitset_html"><divclass="ttname"><ahref="classoperations__research_1_1_unsorted_nullable_rev_bitset.html">operations_research::UnsortedNullableRevBitset</a></div><divclass="ttdoc">This class represents a reversible bitset.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02792">constraint_solveri.h:2792</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_state_html_af38c69e531519ffae99a9b0d3481506d"><divclass="ttname"><ahref="classoperations__research_1_1_path_state.html#af38c69e531519ffae99a9b0d3481506d">operations_research::PathState::ChangedArcs</a></div><divclass="ttdeci">const std::vector< std::pair< int, int >>& ChangedArcs() const</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l03104">constraint_solveri.h:3104</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_constraint_html"><divclass="ttname"><ahref="classoperations__research_1_1_constraint.html">operations_research::Constraint</a></div><divclass="ttdoc">A constraint is the main modeling object.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l03587">constraint_solver.h:3587</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html_a68dd19d6f0517e2bfb128f87fbad4fea"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html#a68dd19d6f0517e2bfb128f87fbad4fea">operations_research::VarLocalSearchOperator::prev_values_</a></div><divclass="ttdeci">std::vector< Val > prev_values_</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00926">constraint_solveri.h:926</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html_ad3f7d71b09c99c9b939cb5cf495edf7b"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html#ad3f7d71b09c99c9b939cb5cf495edf7b">operations_research::VarLocalSearchOperator::Var</a></div><divclass="ttdeci">V * Var(int64_t index) const</div><divclass="ttdoc">Returns the variable of given index.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00841">constraint_solveri.h:841</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_growing_array_html"><divclass="ttname"><ahref="classoperations__research_1_1_rev_growing_array.html">operations_research::RevGrowingArray</a></div><divclass="ttdoc">This class is a reversible growing array.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02483">constraint_solveri.h:2483</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_partial_sequence_html_a7a0cad593e63d53f505bb7da17fcd1d4"><divclass="ttname"><ahref="classoperations__research_1_1_rev_partial_sequence.html#a7a0cad593e63d53f505bb7da17fcd1d4">operations_research::RevPartialSequence::RankLast</a></div><divclass="ttdeci">void RankLast(Solver *const solver, int elt)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02726">constraint_solveri.h:2726</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a03283bdc4a6447ff4882cb1e42662b00"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a03283bdc4a6447ff4882cb1e42662b00">operations_research::PathOperator::IsInactive</a></div><divclass="ttdeci">bool IsInactive(int64_t node) const</div><divclass="ttdoc">Returns true if node is inactive.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01503">constraint_solveri.h:1503</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_argument_holder_html_a0a72c0c2a6fd25822715e54b9da9e6bd"><divclass="ttname"><ahref="classoperations__research_1_1_argument_holder.html#a0a72c0c2a6fd25822715e54b9da9e6bd">operations_research::ArgumentHolder::FindIntegerMatrixArgumentOrDie</a></div><divclass="ttdeci">const IntTupleSet & FindIntegerMatrixArgumentOrDie(const std::string &arg_name) const</div><divclass="ttdef"><b>Definition:</b><ahref="visitor_8cc_source.html#l00121">visitor.cc:121</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_matrix_html_a35395dc664c7939e68c29390a8591e1c"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_matrix.html#a35395dc664c7939e68c29390a8591e1c">operations_research::RevBitMatrix::IsSet</a></div><divclass="ttdeci">bool IsSet(int64_t row, int64_t column) const</div><divclass="ttdoc">Returns whether the 'column' bit in the 'row' row is set.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00466">constraint_solveri.h:466</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_propagation_monitor_html_a127c860aa3b5024666f308c553edf2a5"><divclass="ttname"><ahref="classoperations__research_1_1_propagation_monitor.html#a127c860aa3b5024666f308c553edf2a5">operations_research::PropagationMonitor::Install</a></div><divclass="ttdeci">void Install() override</div><divclass="ttdoc">Install itself on the solver.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8cc_source.html#l02908">constraint_solver.cc:2908</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_propagation_monitor_html_a6467f671a40283eed2a71c51741d93b8"><divclass="ttname"><ahref="classoperations__research_1_1_propagation_monitor.html#a6467f671a40283eed2a71c51741d93b8">operations_research::PropagationMonitor::RankNotLast</a></div><divclass="ttdeci">virtual void RankNotLast(SequenceVar *const var, int index)=0</div></div>
<divclass="ttc"id="classoperations__research_1_1_delayed_call_method1_html_ac863f0fdd6a476ca003c99f58f14e623"><divclass="ttname"><ahref="classoperations__research_1_1_delayed_call_method1.html#ac863f0fdd6a476ca003c99f58f14e623">operations_research::DelayedCallMethod1::Run</a></div><divclass="ttdeci">void Run(Solver *const s) override</div><divclass="ttdoc">This is the main callback of the demon.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00697">constraint_solveri.h:697</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_set_html_ac4f70832be8ef45fb84c8170f17cc187"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_set.html#ac4f70832be8ef45fb84c8170f17cc187">operations_research::RevBitSet::ClearAll</a></div><divclass="ttdeci">void ClearAll(Solver *const solver)</div><divclass="ttdoc">Cleans all bits.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00151">utilities.cc:151</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_aa2ea96360ac4370b31fc72090b55e7cc"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#aa2ea96360ac4370b31fc72090b55e7cc">operations_research::PathOperator::GetActiveAlternativeSibling</a></div><divclass="ttdeci">int64_t GetActiveAlternativeSibling(int node) const</div><divclass="ttdoc">Returns the active node in the alternative set of the sibling of the given node.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01559">constraint_solveri.h:1559</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_assignment_container_html_a907ce7f41938cc755b6b1f4a55b5cd27"><divclass="ttname"><ahref="classoperations__research_1_1_assignment_container.html#a907ce7f41938cc755b6b1f4a55b5cd27">operations_research::AssignmentContainer::Element</a></div><divclass="ttdeci">const E & Element(const V *const var) const</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l04945">constraint_solver.h:4945</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_adf2aea6c68fe502389c9264b971b2f85"><divclass="ttname"><ahref="namespaceoperations__research.html#adf2aea6c68fe502389c9264b971b2f85">operations_research::IsArrayInRange</a></div><divclass="ttdeci">bool IsArrayInRange(const std::vector< IntVar * >&vars, T range_min, T range_max)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02935">constraint_solveri.h:2935</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_sequence_var_local_search_operator_html_ac83e6bbc34d0f50a45a419801689a033"><divclass="ttname"><ahref="classoperations__research_1_1_sequence_var_local_search_operator.html#ac83e6bbc34d0f50a45a419801689a033">operations_research::SequenceVarLocalSearchOperator::OldSequence</a></div><divclass="ttdeci">const std::vector< int >& OldSequence(int64_t index) const</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01162">constraint_solveri.h:1162</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_call_method3_html_ac863f0fdd6a476ca003c99f58f14e623"><divclass="ttname"><ahref="classoperations__research_1_1_call_method3.html#ac863f0fdd6a476ca003c99f58f14e623">operations_research::CallMethod3::Run</a></div><divclass="ttdeci">void Run(Solver *const s) override</div><divclass="ttdoc">This is the main callback of the demon.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00619">constraint_solveri.h:619</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_a5d794218448e5119fe2034719dc55c6f"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#a5d794218448e5119fe2034719dc55c6f">operations_research::BooleanVar::WhenDomain</a></div><divclass="ttdeci">void WhenDomain(Demon *d) override</div><divclass="ttdoc">This method attaches a demon that will watch any domain modification of the domain of the variable.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01978">constraint_solveri.h:1978</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_matrix_html_ab1f7d7749ed4799119614efc507ebc64"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_matrix.html#ab1f7d7749ed4799119614efc507ebc64">operations_research::RevBitMatrix::SetToOne</a></div><divclass="ttdeci">void SetToOne(Solver *const solver, int64_t row, int64_t column)</div><divclass="ttdoc">Sets the 'column' bit in the 'row' row.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00170">utilities.cc:170</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a1223e0b8dbca7cd9c296fc4de65080b2"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a1223e0b8dbca7cd9c296fc4de65080b2">operations_research::PathOperator::OnNodeInitialization</a></div><divclass="ttdeci">virtual void OnNodeInitialization()</div><divclass="ttdoc">Called by OnStart() after initializing node information.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01382">constraint_solveri.h:1382</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_search_log_html_a00e1c5e76ceb9b425ddea62748673d9b"><divclass="ttname"><ahref="classoperations__research_1_1_search_log.html#a00e1c5e76ceb9b425ddea62748673d9b">operations_research::SearchLog::BeginFail</a></div><divclass="ttdeci">void BeginFail() override</div><divclass="ttdoc">Just when the failure occurs.</div><divclass="ttdef"><b>Definition:</b><ahref="search_8cc_source.html#l00180">search.cc:180</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html_acb9668115d3d60818099ce9ce80d1ec1"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html#acb9668115d3d60818099ce9ce80d1ec1">operations_research::VarLocalSearchOperator::vars_</a></div><divclass="ttdeci">std::vector< V * > vars_</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00923">constraint_solveri.h:923</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html_aae6d852f10b483ddfa68658e43130028"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html#aae6d852f10b483ddfa68658e43130028">operations_research::VarLocalSearchOperator::OnStart</a></div><divclass="ttdeci">virtual void OnStart()</div><divclass="ttdoc">Called by Start() after synchronizing the operator with the current assignment.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00913">constraint_solveri.h:913</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_propagation_monitor_html_a133d6644c8ea52f45e657b4c268e0cbf"><divclass="ttname"><ahref="classoperations__research_1_1_propagation_monitor.html#a133d6644c8ea52f45e657b4c268e0cbf">operations_research::PropagationMonitor::RankLast</a></div><divclass="ttdeci">virtual void RankLast(SequenceVar *const var, int index)=0</div></div>
<divclass="ttc"id="classoperations__research_1_1_sequence_var_element_html_abd09fe08f368306c986382df61a20c73"><divclass="ttname"><ahref="classoperations__research_1_1_sequence_var_element.html#abd09fe08f368306c986382df61a20c73">operations_research::SequenceVarElement::SetForwardSequence</a></div><divclass="ttdeci">void SetForwardSequence(const std::vector< int >&forward_sequence)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_2assignment_8cc_source.html#l00370">constraint_solver/assignment.cc:370</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_search_log_html_a73895ddf1e732b9d3fa365f05977c8a6"><divclass="ttname"><ahref="classoperations__research_1_1_search_log.html#a73895ddf1e732b9d3fa365f05977c8a6">operations_research::SearchLog::BeginInitialPropagation</a></div><divclass="ttdeci">void BeginInitialPropagation() override</div><divclass="ttdoc">Before the initial propagation.</div><divclass="ttdef"><b>Definition:</b><ahref="search_8cc_source.html#l00250">search.cc:250</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_a87f10c34e603d2580b846d04bd682113"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#a87f10c34e603d2580b846d04bd682113">operations_research::BooleanVar::RemoveValue</a></div><divclass="ttdeci">void RemoveValue(int64_t v) override</div><divclass="ttdoc">This method removes the value 'v' from the domain of the variable.</div><divclass="ttdef"><b>Definition:</b><ahref="expressions_8cc_source.html#l00093">expressions.cc:93</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_change_value_html"><divclass="ttname"><ahref="classoperations__research_1_1_change_value.html">operations_research::ChangeValue</a></div><divclass="ttdoc">Defines operators which change the value of variables; each neighbor corresponds to one modified vari...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01283">constraint_solveri.h:1283</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_html_affc0b3b0a5efa3efc9d0d86344d4a29f"><divclass="ttname"><ahref="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">operations_research::Rev::Value</a></div><divclass="ttdeci">const T & Value() const</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l03742">constraint_solver.h:3742</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_propagation_monitor_html_a4df31041e5a5d2b96b4fd1e2fc7c78fe"><divclass="ttname"><ahref="classoperations__research_1_1_propagation_monitor.html#a4df31041e5a5d2b96b4fd1e2fc7c78fe">operations_research::PropagationMonitor::SetValue</a></div><divclass="ttdeci">virtual void SetValue(IntVar *const var, int64_t value)=0</div></div>
<divclass="ttc"id="classoperations__research_1_1_propagation_monitor_html_a0de3d793976b21f8b85ba61c49fe3aaa"><divclass="ttname"><ahref="classoperations__research_1_1_propagation_monitor.html#a0de3d793976b21f8b85ba61c49fe3aaa">operations_research::PropagationMonitor::SetDurationRange</a></div><divclass="ttdeci">virtual void SetDurationRange(IntervalVar *const var, int64_t new_min, int64_t new_max)=0</div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a208d45797eebd7cad439cc43b049103d"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a208d45797eebd7cad439cc43b049103d">operations_research::PathOperator::number_of_nexts</a></div><divclass="ttdeci">int number_of_nexts() const</div><divclass="ttdoc">Number of next variables.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01374">constraint_solveri.h:1374</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_interval_var_html"><divclass="ttname"><ahref="classoperations__research_1_1_interval_var.html">operations_research::IntervalVar</a></div><divclass="ttdoc">Interval variables are often used in scheduling.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l04398">constraint_solver.h:4398</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_int_set_html_a563ff7bb4f40754b5b1bfb01a3dd95c1"><divclass="ttname"><ahref="classoperations__research_1_1_rev_int_set.html#a563ff7bb4f40754b5b1bfb01a3dd95c1">operations_research::RevIntSet::kNoInserted</a></div><divclass="ttdeci">static constexpr int kNoInserted</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02568">constraint_solveri.h:2568</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_set_html"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_set.html">operations_research::RevBitSet</a></div><divclass="ttdoc">This class represents a reversible bitset.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00421">constraint_solveri.h:421</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_int_var_local_search_filter_html_ad0c622b7f274388822c9f35659a56542"><divclass="ttname"><ahref="classoperations__research_1_1_int_var_local_search_filter.html#ad0c622b7f274388822c9f35659a56542">operations_research::IntVarLocalSearchFilter::AddVars</a></div><divclass="ttdeci">void AddVars(const std::vector< IntVar * >&vars)</div><divclass="ttdoc">Add variables to "track" to the filter.</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l03261">local_search.cc:3261</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a950e665d5de4e126e31b503f3e42a916"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a950e665d5de4e126e31b503f3e42a916">operations_research::PathOperator::path_starts</a></div><divclass="ttdeci">const std::vector< int64_t >& path_starts() const</div><divclass="ttdoc">Returns the vector of path start nodes.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01413">constraint_solveri.h:1413</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a78ff06a9b302c6c96d8d917da235b749"><divclass="ttname"><ahref="namespaceoperations__research.html#a78ff06a9b302c6c96d8d917da235b749">operations_research::AreAllBoundTo</a></div><divclass="ttdeci">bool AreAllBoundTo(const std::vector< IntVar * >&vars, int64_t value)</div><divclass="ttdoc">Returns true if all variables are assigned to 'value'.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02972">constraint_solveri.h:2972</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a5f9e1016a5bb6a7d5cded8599a50fce1"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">operations_research::PathOperator::Next</a></div><divclass="ttdeci">int64_t Next(int64_t node) const</div><divclass="ttdoc">Returns the node after node in the current delta.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01355">constraint_solveri.h:1355</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_set_html_a50b7e2f9702d2416550ce54327b73a9c"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_set.html#a50b7e2f9702d2416550ce54327b73a9c">operations_research::RevBitSet::Cardinality</a></div><divclass="ttdeci">int64_t Cardinality() const</div><divclass="ttdoc">Returns the number of bits set to one.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00112">utilities.cc:112</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_unsorted_nullable_rev_bitset_html_a44d180cc00f52b2c221bb9a59c598d78"><divclass="ttname"><ahref="classoperations__research_1_1_unsorted_nullable_rev_bitset.html#a44d180cc00f52b2c221bb9a59c598d78">operations_research::UnsortedNullableRevBitset::bit_size</a></div><divclass="ttdeci">int64_t bit_size() const</div><divclass="ttdoc">Returns the number of bits given in the constructor of the bitset.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02828">constraint_solveri.h:2828</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_search_log_html_a9af93e0c2f02218bf4e586dda448fabe"><divclass="ttname"><ahref="classoperations__research_1_1_search_log.html#a9af93e0c2f02218bf4e586dda448fabe">operations_research::SearchLog::ApplyDecision</a></div><divclass="ttdeci">void ApplyDecision(Decision *const decision) override</div><divclass="ttdoc">Before applying the decision.</div><divclass="ttdef"><b>Definition:</b><ahref="search_8cc_source.html#l00202">search.cc:202</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_a7802eb55709a1bfd49897f203b867c66"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#a7802eb55709a1bfd49897f203b867c66">operations_research::BooleanVar::MakeHoleIterator</a></div><divclass="ttdeci">IntVarIterator * MakeHoleIterator(bool reversible) const override</div><divclass="ttdoc">Creates a hole iterator.</div><divclass="ttdef"><b>Definition:</b><ahref="expressions_8cc_source.html#l06350">expressions.cc:6350</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_model_cache_html"><divclass="ttname"><ahref="classoperations__research_1_1_model_cache.html">operations_research::ModelCache</a></div><divclass="ttdoc">Implements a complete cache for model elements: expressions and constraints.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02087">constraint_solveri.h:2087</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_small_rev_bit_set_html_ad1bc0969b66434da4c13ee6404dffce9"><divclass="ttname"><ahref="classoperations__research_1_1_small_rev_bit_set.html#ad1bc0969b66434da4c13ee6404dffce9">operations_research::SmallRevBitSet::GetFirstOne</a></div><divclass="ttdeci">int64_t GetFirstOne() const</div><divclass="ttdoc">Gets the index of the first bit set starting from 0.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00052">utilities.cc:52</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_delayed_call_method0_html_a0a34701cff1b1ac2fabd11e27c7cebc9"><divclass="ttname"><ahref="classoperations__research_1_1_delayed_call_method0.html#a0a34701cff1b1ac2fabd11e27c7cebc9">operations_research::DelayedCallMethod0::priority</a></div><divclass="ttdeci">Solver::DemonPriority priority() const override</div><divclass="ttdoc">This method returns the priority of the demon.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00665">constraint_solveri.h:665</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_matrix_html_a0bbb89e6f783ea950b5bd38049428b4c"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_matrix.html#a0bbb89e6f783ea950b5bd38049428b4c">operations_research::RevBitMatrix::SetToZero</a></div><divclass="ttdeci">void SetToZero(Solver *const solver, int64_t row, int64_t column)</div><divclass="ttdoc">Erases the 'column' bit in the 'row' row.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00178">utilities.cc:178</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_search_log_html_a970b194bb0e12ae42db1f1b3ca7ba43e"><divclass="ttname"><ahref="classoperations__research_1_1_search_log.html#a970b194bb0e12ae42db1f1b3ca7ba43e">operations_research::SearchLog::NoMoreSolutions</a></div><divclass="ttdeci">void NoMoreSolutions() override</div><divclass="ttdoc">When the search tree is finished.</div><divclass="ttdef"><b>Definition:</b><ahref="search_8cc_source.html#l00182">search.cc:182</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_filter_manager_html"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_filter_manager.html">operations_research::LocalSearchFilterManager</a></div><divclass="ttdoc">Filter manager: when a move is made, filters are executed to decide whether the solution is feasible ...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01773">constraint_solveri.h:1773</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_int_set_html_ace705075d1b47c62aa622a912c14626c"><divclass="ttname"><ahref="classoperations__research_1_1_rev_int_set.html#ace705075d1b47c62aa622a912c14626c">operations_research::RevIntSet::Remove</a></div><divclass="ttdeci">void Remove(Solver *const solver, const T &value_index)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02625">constraint_solveri.h:2625</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_int_set_html_a23bf807dec205b7965271a2980ba7aa1"><divclass="ttname"><ahref="classoperations__research_1_1_rev_int_set.html#a23bf807dec205b7965271a2980ba7aa1">operations_research::RevIntSet::RevIntSet</a></div><divclass="ttdeci">RevIntSet(int capacity)</div><divclass="ttdoc">Capacity is the fixed size of the set (it cannot grow).</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02571">constraint_solveri.h:2571</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_a4c709f12a536ae7bf0bd938e4c93a809"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#a4c709f12a536ae7bf0bd938e4c93a809">operations_research::BooleanVar::SetRange</a></div><divclass="ttdeci">void SetRange(int64_t mi, int64_t ma) override</div><divclass="ttdoc">This method sets both the min and the max of the expression.</div><divclass="ttdef"><b>Definition:</b><ahref="expressions_8cc_source.html#l00082">expressions.cc:82</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_optimize_var_html"><divclass="ttname"><ahref="classoperations__research_1_1_optimize_var.html">operations_research::OptimizeVar</a></div><divclass="ttdoc">This class encapsulates an objective.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l04208">constraint_solver.h:4208</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_call_method1_html_ac863f0fdd6a476ca003c99f58f14e623"><divclass="ttname"><ahref="classoperations__research_1_1_call_method1.html#ac863f0fdd6a476ca003c99f58f14e623">operations_research::CallMethod1::Run</a></div><divclass="ttdeci">void Run(Solver *const s) override</div><divclass="ttdoc">This is the main callback of the demon.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00544">constraint_solveri.h:544</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_unsorted_nullable_rev_bitset_html_a3e7853de206b761301ac2ab64d10cee7"><divclass="ttname"><ahref="classoperations__research_1_1_unsorted_nullable_rev_bitset.html#a3e7853de206b761301ac2ab64d10cee7">operations_research::UnsortedNullableRevBitset::word_size</a></div><divclass="ttdeci">int64_t word_size() const</div><divclass="ttdoc">Returns the number of 64 bit words used to store the bitset.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02830">constraint_solveri.h:2830</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a3aea406979285a28c91fd1ee8115af74"><divclass="ttname"><ahref="namespaceoperations__research.html#a3aea406979285a28c91fd1ee8115af74">operations_research::AreAllGreaterOrEqual</a></div><divclass="ttdeci">bool AreAllGreaterOrEqual(const std::vector< T >&values, const T &value)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02875">constraint_solveri.h:2875</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_int_var_iterator_html"><divclass="ttname"><ahref="classoperations__research_1_1_int_var_iterator.html">operations_research::IntVarIterator</a></div><divclass="ttdoc">The class Iterator has two direct subclasses.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l03917">constraint_solver.h:3917</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a28146a7f59f91f25281c97d55abce60d"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a28146a7f59f91f25281c97d55abce60d">operations_research::PathOperator::CheckChainValidity</a></div><divclass="ttdeci">bool CheckChainValidity(int64_t before_chain, int64_t chain_end, int64_t exclude) const</div><divclass="ttdoc">Returns true if the chain is a valid path without cycles from before_chain to chain_end and does not ...</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l00839">local_search.cc:839</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_call_method0_html"><divclass="ttname"><ahref="classoperations__research_1_1_call_method0.html">operations_research::CallMethod0</a></div><divclass="ttdoc">Demon proxy to a method on the constraint with no arguments.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00498">constraint_solveri.h:498</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_filter_html_abd469dc354c620c06a2f7b45df1abc39"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_filter.html#abd469dc354c620c06a2f7b45df1abc39">operations_research::LocalSearchFilter::Revert</a></div><divclass="ttdeci">virtual void Revert()</div><divclass="ttdoc">Cancels the changes made by the last Relax()/Accept() calls.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01758">constraint_solveri.h:1758</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_simple_rev_f_i_f_o_html_abc8f4bc09139f8f3951cc8280823a0f3"><divclass="ttname"><ahref="classoperations__research_1_1_simple_rev_f_i_f_o.html#abc8f4bc09139f8f3951cc8280823a0f3">operations_research::SimpleRevFIFO::PushIfNotTop</a></div><divclass="ttdeci">void PushIfNotTop(Solver *const s, T val)</div><divclass="ttdoc">Pushes the var on top if is not a duplicate of the current top object.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00181">constraint_solveri.h:181</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_partial_sequence_html_ae105423091c231e0fd3ba3288c11d725"><divclass="ttname"><ahref="classoperations__research_1_1_rev_partial_sequence.html#ae105423091c231e0fd3ba3288c11d725">operations_research::RevPartialSequence::operator[]</a></div><divclass="ttdeci">const int & operator[](int index) const</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02713">constraint_solveri.h:2713</a></div></div>
<divclass="ttc"id="structoperations__research_1_1_path_operator_1_1_iteration_parameters_html_a06ba9faa1da8bc11b9bad1b28184d66a"><divclass="ttname"><ahref="structoperations__research_1_1_path_operator_1_1_iteration_parameters.html#a06ba9faa1da8bc11b9bad1b28184d66a">operations_research::PathOperator::IterationParameters::accept_path_end_base</a></div><divclass="ttdeci">bool accept_path_end_base</div><divclass="ttdoc">True if path ends should be considered when iterating over neighbors.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01322">constraint_solveri.h:1322</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_search_log_html"><divclass="ttname"><ahref="classoperations__research_1_1_search_log.html">operations_research::SearchLog</a></div><divclass="ttdoc">The base class of all search logs that periodically outputs information when the search is running.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02037">constraint_solveri.h:2037</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_unsorted_nullable_rev_bitset_html_a9e0dd5c07e777869355c6ea58a7335bd"><divclass="ttname"><ahref="classoperations__research_1_1_unsorted_nullable_rev_bitset.html#a9e0dd5c07e777869355c6ea58a7335bd">operations_research::UnsortedNullableRevBitset::RevAnd</a></div><divclass="ttdeci">bool RevAnd(Solver *const solver, const std::vector< uint64_t >&mask)</div><divclass="ttdoc">This method ANDs the mask with the active bitset.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00270">utilities.cc:270</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html_a6813d015a11bf9bad5a5b9b335df989f"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html#a6813d015a11bf9bad5a5b9b335df989f">operations_research::VarLocalSearchOperator::Value</a></div><divclass="ttdeci">const Val & Value(int64_t index) const</div><divclass="ttdoc">Returns the value in the current assignment of the variable of given index.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00836">constraint_solveri.h:836</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_unsorted_nullable_rev_bitset_html_abcfbdba215d3b15fbb4b682969943a6e"><divclass="ttname"><ahref="classoperations__research_1_1_unsorted_nullable_rev_bitset.html#abcfbdba215d3b15fbb4b682969943a6e">operations_research::UnsortedNullableRevBitset::Empty</a></div><divclass="ttdeci">bool Empty() const</div><divclass="ttdoc">This method returns true if the active bitset is null.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02816">constraint_solveri.h:2816</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_ad14cde260686e5b4174e691675df3139"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#ad14cde260686e5b4174e691675df3139">operations_research::PathOperator::MakeOneNeighbor</a></div><divclass="ttdeci">bool MakeOneNeighbor() override</div><divclass="ttdoc">This method should not be overridden. Override MakeNeighbor() instead.</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l00388">local_search.cc:388</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a403e52e933033645c3388146d5e2edd2"><divclass="ttname"><ahref="namespaceoperations__research.html#a403e52e933033645c3388146d5e2edd2">operations_research::VarTypes</a></div><divclass="ttdeci">VarTypes</div><divclass="ttdoc">This enum is used internally to do dynamic typing on subclasses of integer variables.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00114">constraint_solveri.h:114</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_adf2175ee598b241dcc5459573ebdc886"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#adf2175ee598b241dcc5459573ebdc886">operations_research::PathOperator::Path</a></div><divclass="ttdeci">int64_t Path(int64_t node) const</div><divclass="ttdoc">Returns the index of the path to which node belongs in the current delta.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01369">constraint_solveri.h:1369</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_sequence_var_element_html"><divclass="ttname"><ahref="classoperations__research_1_1_sequence_var_element.html">operations_research::SequenceVarElement</a></div><divclass="ttdoc">The SequenceVarElement stores a partial representation of ranked interval variables in the underlying...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l04819">constraint_solver.h:4819</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a3de09f9134b976e5ba64751ac0f4440b"><divclass="ttname"><ahref="namespaceoperations__research.html#a3de09f9134b976e5ba64751ac0f4440b">operations_research::AreAllStrictlyPositive</a></div><divclass="ttdeci">bool AreAllStrictlyPositive(const std::vector< T >&values)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02905">constraint_solveri.h:2905</a></div></div>
<divclass="ttc"id="parser_8yy_8cc_html_a5a634cf4429798b1c921a81de8250051"><divclass="ttname"><ahref="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a></div><divclass="ttdeci">static int input(yyscan_t yyscanner)</div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_switch_html"><divclass="ttname"><ahref="classoperations__research_1_1_rev_switch.html">operations_research::RevSwitch</a></div><divclass="ttdoc">A reversible switch that can switch once from false to true.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00382">constraint_solveri.h:382</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_simple_rev_f_i_f_o_1_1_iterator_html_a5d5b15d8c55444f6730c4b54e8365e34"><divclass="ttname"><ahref="classoperations__research_1_1_simple_rev_f_i_f_o_1_1_iterator.html#a5d5b15d8c55444f6730c4b54e8365e34">operations_research::SimpleRevFIFO::Iterator::Iterator</a></div><divclass="ttdeci">Iterator(const SimpleRevFIFO< T > *l)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00149">constraint_solveri.h:149</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_ab5ccf1d0572985fd266702a181b9cf8d"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#ab5ccf1d0572985fd266702a181b9cf8d">operations_research::PathOperator::SwapActiveAndInactive</a></div><divclass="ttdeci">bool SwapActiveAndInactive(int64_t active, int64_t inactive)</div><divclass="ttdoc">Replaces active by inactive in the current path, making active inactive.</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l00485">local_search.cc:485</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a752100eca408efb4a9392f16f21f9cf7"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a752100eca408efb4a9392f16f21f9cf7">operations_research::PathOperator::BaseAlternative</a></div><divclass="ttdeci">int BaseAlternative(int i) const</div><divclass="ttdoc">Returns the alternative for the ith base node.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01387">constraint_solveri.h:1387</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_ab692c3573e15cc79cf2dbaffdbc033a4"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#ab692c3573e15cc79cf2dbaffdbc033a4">operations_research::BooleanVar::Value</a></div><divclass="ttdeci">int64_t Value() const override</div><divclass="ttdoc">This method returns the value of the variable.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01970">constraint_solveri.h:1970</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_assignment_html"><divclass="ttname"><ahref="classoperations__research_1_1_assignment.html">operations_research::Assignment</a></div><divclass="ttdoc">An Assignment is a variable -> domains mapping, used to report solutions to the user.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l05042">constraint_solver.h:5042</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_sequence_var_local_search_operator_html_a182179d1af399fa1d3c3d79f0b78af29"><divclass="ttname"><ahref="classoperations__research_1_1_sequence_var_local_search_operator.html#a182179d1af399fa1d3c3d79f0b78af29">operations_research::SequenceVarLocalSearchOperator::SetBackwardSequence</a></div><divclass="ttdeci">void SetBackwardSequence(int64_t index, const std::vector< int >&value)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01168">constraint_solveri.h:1168</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_aafac7375c23337f25821aa6f86ca627c"><divclass="ttname"><ahref="namespaceoperations__research.html#aafac7375c23337f25821aa6f86ca627c">operations_research::IsIncreasingContiguous</a></div><divclass="ttdeci">bool IsIncreasingContiguous(const std::vector< T >&values)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02915">constraint_solveri.h:2915</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_delayed_call_method0_html"><divclass="ttname"><ahref="classoperations__research_1_1_delayed_call_method0.html">operations_research::DelayedCallMethod0</a></div><divclass="ttdoc">Low-priority demon proxy to a method on the constraint with no arguments.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00656">constraint_solveri.h:656</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_argument_holder_html"><divclass="ttname"><ahref="classoperations__research_1_1_argument_holder.html">operations_research::ArgumentHolder</a></div><divclass="ttdoc">Argument Holder: useful when visiting a model.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02325">constraint_solveri.h:2325</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_symmetry_breaker_html_aa126bb367514a24cbd6e0b2c48fda9ee"><divclass="ttname"><ahref="classoperations__research_1_1_symmetry_breaker.html#aa126bb367514a24cbd6e0b2c48fda9ee">operations_research::SymmetryBreaker::SymmetryManager</a></div><divclass="ttdeci">friend class SymmetryManager</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02020">constraint_solveri.h:2020</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_base_object_html"><divclass="ttname"><ahref="classoperations__research_1_1_base_object.html">operations_research::BaseObject</a></div><divclass="ttdoc">A BaseObject is the root of all reversibly allocated objects.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l03154">constraint_solver.h:3154</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_propagation_monitor_html_ac7773149191696aae6b16b9c9f6c1614"><divclass="ttname"><ahref="classoperations__research_1_1_propagation_monitor.html#ac7773149191696aae6b16b9c9f6c1614">operations_research::PropagationMonitor::SetStartMax</a></div><divclass="ttdeci">virtual void SetStartMax(IntervalVar *const var, int64_t new_max)=0</div></div>
<divclass="ttc"id="classoperations__research_1_1_delayed_call_method2_html_a0a34701cff1b1ac2fabd11e27c7cebc9"><divclass="ttname"><ahref="classoperations__research_1_1_delayed_call_method2.html#a0a34701cff1b1ac2fabd11e27c7cebc9">operations_research::DelayedCallMethod2::priority</a></div><divclass="ttdeci">Solver::DemonPriority priority() const override</div><divclass="ttdoc">This method returns the priority of the demon.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00741">constraint_solveri.h:741</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_int_var_html"><divclass="ttname"><ahref="classoperations__research_1_1_int_var.html">operations_research::IntVar</a></div><divclass="ttdoc">The class IntVar is a subset of IntExpr.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l04001">constraint_solver.h:4001</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_search_log_html_a0c955ff1b2eae2daece0f25f1e57fb16"><divclass="ttname"><ahref="classoperations__research_1_1_search_log.html#a0c955ff1b2eae2daece0f25f1e57fb16">operations_research::SearchLog::EnterSearch</a></div><divclass="ttdeci">void EnterSearch() override</div><divclass="ttdoc">Beginning of the search.</div><divclass="ttdef"><b>Definition:</b><ahref="search_8cc_source.html#l00087">search.cc:87</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_growing_array_html_a4ead353fd8ad8d4432366add9247f991"><divclass="ttname"><ahref="classoperations__research_1_1_rev_growing_array.html#a4ead353fd8ad8d4432366add9247f991">operations_research::RevGrowingArray::RevInsert</a></div><divclass="ttdeci">void RevInsert(Solver *const solver, int64_t index, T value)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02506">constraint_solveri.h:2506</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_set_html_a68ac6adba6fc78b4499583900c4a2648"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_set.html#a68ac6adba6fc78b4499583900c4a2648">operations_research::RevBitSet::GetFirstBit</a></div><divclass="ttdeci">int64_t GetFirstBit(int start) const</div><divclass="ttdoc">Gets the index of the first bit set starting from start.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00147">utilities.cc:147</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_symmetry_breaker_html_a187174fc9c08a954355d3fc239dcbf2d"><divclass="ttname"><ahref="classoperations__research_1_1_symmetry_breaker.html#a187174fc9c08a954355d3fc239dcbf2d">operations_research::SymmetryBreaker::AddIntegerVariableLessOrEqualValueClause</a></div><divclass="ttdeci">void AddIntegerVariableLessOrEqualValueClause(IntVar *const var, int64_t value)</div><divclass="ttdef"><b>Definition:</b><ahref="search_8cc_source.html#l04846">search.cc:4846</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_int_expr_html"><divclass="ttname"><ahref="classoperations__research_1_1_int_expr.html">operations_research::IntExpr</a></div><divclass="ttdoc">The class IntExpr is the base of all integer expressions in constraint programming.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l03839">constraint_solver.h:3839</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_int_set_html_a2fc97dce62b7053449cc868607540dba"><divclass="ttname"><ahref="classoperations__research_1_1_rev_int_set.html#a2fc97dce62b7053449cc868607540dba">operations_research::RevIntSet::const_iterator</a></div><divclass="ttdeci">const T * const_iterator</div><divclass="ttdoc">Iterators on the indices.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02638">constraint_solveri.h:2638</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a12527c82ffc8b31c5d8dc836c366d624"><divclass="ttname"><ahref="namespaceoperations__research.html#a12527c82ffc8b31c5d8dc836c366d624">operations_research::IsArrayConstant</a></div><divclass="ttdeci">bool IsArrayConstant(const std::vector< T >&values, const T &value)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02845">constraint_solveri.h:2845</a></div></div>
<divclass="ttc"id="structoperations__research_1_1_path_operator_1_1_iteration_parameters_html_a0e2c2f3c021b1d8cff2e0f0458f8ee29"><divclass="ttname"><ahref="structoperations__research_1_1_path_operator_1_1_iteration_parameters.html#a0e2c2f3c021b1d8cff2e0f0458f8ee29">operations_research::PathOperator::IterationParameters::number_of_base_nodes</a></div><divclass="ttdeci">int number_of_base_nodes</div><divclass="ttdoc">Number of nodes needed to define a neighbor.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01317">constraint_solveri.h:1317</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_unsorted_nullable_rev_bitset_html_ac1cb8e65b730ce99b1d99d5a37f578bd"><divclass="ttname"><ahref="classoperations__research_1_1_unsorted_nullable_rev_bitset.html#ac1cb8e65b730ce99b1d99d5a37f578bd">operations_research::UnsortedNullableRevBitset::active_words</a></div><divclass="ttdeci">const RevIntSet< int >& active_words() const</div><divclass="ttdoc">Returns the set of active word indices.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02832">constraint_solveri.h:2832</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_ae3e4f71c4c79e0b4ec00c4e715a7c298"><divclass="ttname"><ahref="namespaceoperations__research.html#ae3e4f71c4c79e0b4ec00c4e715a7c298">operations_research::AreAllOnes</a></div><divclass="ttdeci">bool AreAllOnes(const std::vector< T >&values)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02865">constraint_solveri.h:2865</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_aec4cb9ff1023933f7c5570a65a7208e7"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#aec4cb9ff1023933f7c5570a65a7208e7">operations_research::PathOperator::SetNextBaseToIncrement</a></div><divclass="ttdeci">virtual void SetNextBaseToIncrement(int64_t base_index)</div><divclass="ttdoc">Set the next base to increment on next iteration.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01446">constraint_solveri.h:1446</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_propagation_monitor_html_a770ac0e58ac711e3866c3731d9417bd8"><divclass="ttname"><ahref="classoperations__research_1_1_propagation_monitor.html#a770ac0e58ac711e3866c3731d9417bd8">operations_research::PropagationMonitor::RemoveInterval</a></div><divclass="ttdeci">virtual void RemoveInterval(IntVar *const var, int64_t imin, int64_t imax)=0</div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a0d3deb689556a77ed6f99860918d7f21"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a0d3deb689556a77ed6f99860918d7f21">operations_research::PathOperator::ConsiderAlternatives</a></div><divclass="ttdeci">virtual bool ConsiderAlternatives(int64_t base_index) const</div><divclass="ttdoc">Indicates if alternatives should be considered when iterating over base nodes.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01451">constraint_solveri.h:1451</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_state_1_1_chain_1_1_iterator_html_aef12ef33726bc591f569f822c7b5ac41"><divclass="ttname"><ahref="classoperations__research_1_1_path_state_1_1_chain_1_1_iterator.html#aef12ef33726bc591f569f822c7b5ac41">operations_research::PathState::Chain::Iterator::operator++</a></div><divclass="ttdeci">Iterator & operator++()</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l03252">constraint_solveri.h:3252</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a38972723946490ea4df4e34298d8805d"><divclass="ttname"><ahref="namespaceoperations__research.html#a38972723946490ea4df4e34298d8805d">operations_research::AreAllNegative</a></div><divclass="ttdeci">bool AreAllNegative(const std::vector< T >&values)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02900">constraint_solveri.h:2900</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_unsorted_nullable_rev_bitset_html_ae3e0d47f72e6e07c2332b872b372cd4c"><divclass="ttname"><ahref="classoperations__research_1_1_unsorted_nullable_rev_bitset.html#ae3e0d47f72e6e07c2332b872b372cd4c">operations_research::UnsortedNullableRevBitset::UnsortedNullableRevBitset</a></div><divclass="ttdeci">UnsortedNullableRevBitset(int bit_size)</div><divclass="ttdoc">Size is the number of bits to store in the bitset.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00226">utilities.cc:226</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_search_log_html_a363e3361f6a6b52343e69cbff81deff5"><divclass="ttname"><ahref="classoperations__research_1_1_search_log.html#a363e3361f6a6b52343e69cbff81deff5">operations_research::SearchLog::RefuteDecision</a></div><divclass="ttdeci">void RefuteDecision(Decision *const decision) override</div><divclass="ttdoc">Before refuting the decision.</div><divclass="ttdef"><b>Definition:</b><ahref="search_8cc_source.html#l00210">search.cc:210</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a5bc40a93b9ba709cfb3ca78cea7435e1"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a5bc40a93b9ba709cfb3ca78cea7435e1">operations_research::PathOperator::BaseSiblingAlternative</a></div><divclass="ttdeci">int BaseSiblingAlternative(int i) const</div><divclass="ttdoc">Returns the alternative for the sibling of the ith base node.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01397">constraint_solveri.h:1397</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_filter_manager_html_a712060303eea0e26ca9a072b57bbf227"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_filter_manager.html#a712060303eea0e26ca9a072b57bbf227">operations_research::LocalSearchFilterManager::Accept</a></div><divclass="ttdeci">bool Accept(LocalSearchMonitor *const monitor, const Assignment *delta, const Assignment *deltadelta, int64_t objective_min, int64_t objective_max)</div><divclass="ttdoc">Returns true iff all filters return true, and the sum of their accepted objectives is between objecti...</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l03924">local_search.cc:3924</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_simple_rev_f_i_f_o_html"><divclass="ttname"><ahref="classoperations__research_1_1_simple_rev_f_i_f_o.html">operations_research::SimpleRevFIFO</a></div><divclass="ttdoc">This class represent a reversible FIFO structure.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l00156">constraint_solver.h:156</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_int_var_local_search_operator_html_a3441b36fa04791719efbfae2faca30a0"><divclass="ttname"><ahref="classoperations__research_1_1_int_var_local_search_operator.html#a3441b36fa04791719efbfae2faca30a0">operations_research::IntVarLocalSearchOperator::IntVarLocalSearchHandler</a></div><divclass="ttdeci">friend class IntVarLocalSearchHandler</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01052">constraint_solveri.h:1052</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_solver_html_ab741cb25dd32d1cbe02fbfb36337d9bb"><divclass="ttname"><ahref="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">operations_research::Solver::RevAlloc</a></div><divclass="ttdeci">T * RevAlloc(T *object)</div><divclass="ttdoc">Registers the given object as being reversible.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l00789">constraint_solver.h:789</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_call_method2_html_ac863f0fdd6a476ca003c99f58f14e623"><divclass="ttname"><ahref="classoperations__research_1_1_call_method2.html#ac863f0fdd6a476ca003c99f58f14e623">operations_research::CallMethod2::Run</a></div><divclass="ttdeci">void Run(Solver *const s) override</div><divclass="ttdoc">This is the main callback of the demon.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00578">constraint_solveri.h:578</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_call_method3_html"><divclass="ttname"><ahref="classoperations__research_1_1_call_method3.html">operations_research::CallMethod3</a></div><divclass="ttdoc">Demon proxy to a method on the constraint with three arguments.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00606">constraint_solveri.h:606</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_ad502b08bb4d69dfbaf025415310b8da8"><divclass="ttname"><ahref="namespaceoperations__research.html#ad502b08bb4d69dfbaf025415310b8da8">operations_research::SequenceVarLocalSearchOperatorTemplate</a></div><divclass="ttdeci">VarLocalSearchOperator< SequenceVar, std::vector< int >, SequenceVarLocalSearchHandler > SequenceVarLocalSearchOperatorTemplate</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01147">constraint_solveri.h:1147</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_abf767486aa5751c9ad0654541f485438"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#abf767486aa5751c9ad0654541f485438">operations_research::BooleanVar::SetMax</a></div><divclass="ttdeci">void SetMax(int64_t m) override</div><divclass="ttdef"><b>Definition:</b><ahref="expressions_8cc_source.html#l00076">expressions.cc:76</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_ab661b8d8259dac8444804d91809fbb0a"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#ab661b8d8259dac8444804d91809fbb0a">operations_research::PathOperator::ResetPosition</a></div><divclass="ttdeci">void ResetPosition()</div><divclass="ttdoc">Reset the position of the operator to its position when Start() was last called; this can be used to ...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01513">constraint_solveri.h:1513</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_sequence_var_html"><divclass="ttname"><ahref="classoperations__research_1_1_sequence_var.html">operations_research::SequenceVar</a></div><divclass="ttdoc">A sequence variable is a variable whose domain is a set of possible orderings of the interval variabl...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l04552">constraint_solver.h:4552</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_call_method1_html"><divclass="ttname"><ahref="classoperations__research_1_1_call_method1.html">operations_research::CallMethod1</a></div><divclass="ttdoc">Demon proxy to a method on the constraint with one argument.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00536">constraint_solveri.h:536</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_ae1c162cfc11069e25becbd53cdce7def"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#ae1c162cfc11069e25becbd53cdce7def">operations_research::PathOperator::InitPosition</a></div><divclass="ttdeci">virtual bool InitPosition() const</div><divclass="ttdoc">Returns true if the operator needs to restart its initial position at each call to Start()</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01509">constraint_solveri.h:1509</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a38b76e1e3a147226d4981b05e4ec2c55"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a38b76e1e3a147226d4981b05e4ec2c55">operations_research::PathOperator::RestartAtPathStartOnSynchronize</a></div><divclass="ttdeci">virtual bool RestartAtPathStartOnSynchronize()</div><divclass="ttdoc">When the operator is being synchronized with a new solution (when Start() is called),...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01428">constraint_solveri.h:1428</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a2123fcbe0cb3d64582bbc625d666cacd"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a2123fcbe0cb3d64582bbc625d666cacd">operations_research::PathOperator::GetActiveInAlternativeSet</a></div><divclass="ttdeci">int64_t GetActiveInAlternativeSet(int alternative_index) const</div><divclass="ttdoc">Returns the active node in the given alternative set.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01542">constraint_solveri.h:1542</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_adbfe3c73b9cad61f112ccb082b553c51"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#adbfe3c73b9cad61f112ccb082b553c51">operations_research::BooleanVar::BaseName</a></div><divclass="ttdeci">std::string BaseName() const override</div><divclass="ttdoc">Returns a base name for automatic naming.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01992">constraint_solveri.h:1992</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_filter_html_a4551beb12e80737f9c1d110cefa2f342"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_filter.html#a4551beb12e80737f9c1d110cefa2f342">operations_research::LocalSearchFilter::GetAcceptedObjectiveValue</a></div><divclass="ttdeci">virtual int64_t GetAcceptedObjectiveValue() const</div><divclass="ttdoc">Objective value from the last time Accept() was called and returned true.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01767">constraint_solveri.h:1767</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_a303c8b67c301d6d436bd06e50d41cd6b"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#a303c8b67c301d6d436bd06e50d41cd6b">operations_research::BooleanVar::Bound</a></div><divclass="ttdeci">bool Bound() const override</div><divclass="ttdoc">Returns true if the min and the max of the expression are equal.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01969">constraint_solveri.h:1969</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_sequence_var_local_search_operator_html_a3c5ae4c11c6ee64f9b7183cbb67b7968"><divclass="ttname"><ahref="classoperations__research_1_1_sequence_var_local_search_operator.html#a3c5ae4c11c6ee64f9b7183cbb67b7968">operations_research::SequenceVarLocalSearchOperator::Sequence</a></div><divclass="ttdeci">const std::vector< int >& Sequence(int64_t index) const</div><divclass="ttdoc">Returns the value in the current assignment of the variable of given index.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01161">constraint_solveri.h:1161</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_simple_rev_f_i_f_o_html_aef6737cd15964935e24b68467aa4b6f1"><divclass="ttname"><ahref="classoperations__research_1_1_simple_rev_f_i_f_o.html#aef6737cd15964935e24b68467aa4b6f1">operations_research::SimpleRevFIFO::Last</a></div><divclass="ttdeci">const T * Last() const</div><divclass="ttdoc">Returns the last item of the FIFO.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00188">constraint_solveri.h:188</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_aa14dad2d86c18296f9a5227b87d5caad"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">operations_research::PathOperator::Prev</a></div><divclass="ttdeci">int64_t Prev(int64_t node) const</div><divclass="ttdoc">Returns the node before node in the current delta.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01361">constraint_solveri.h:1361</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_immutable_multi_map_html_a3c7e62a9a396c5d8fd2b85b762c2a850"><divclass="ttname"><ahref="classoperations__research_1_1_rev_immutable_multi_map.html#a3c7e62a9a396c5d8fd2b85b762c2a850">operations_research::RevImmutableMultiMap::RevImmutableMultiMap</a></div><divclass="ttdeci">RevImmutableMultiMap(Solver *const solver, int initial_size)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00276">constraint_solveri.h:276</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_propagation_monitor_html_af5aaffbf16ee150934ca1d7feddffdf7"><divclass="ttname"><ahref="classoperations__research_1_1_propagation_monitor.html#af5aaffbf16ee150934ca1d7feddffdf7">operations_research::PropagationMonitor::RankFirst</a></div><divclass="ttdeci">virtual void RankFirst(SequenceVar *const var, int index)=0</div><divclass="ttdoc">SequenceVar modifiers.</div></div>
<divclass="ttc"id="classoperations__research_1_1_propagation_monitor_html_a6e8312c7b6a02f813e345b99f98a8458"><divclass="ttname"><ahref="classoperations__research_1_1_propagation_monitor.html#a6e8312c7b6a02f813e345b99f98a8458">operations_research::PropagationMonitor::RankSequence</a></div><divclass="ttdeci">virtual void RankSequence(SequenceVar *const var, const std::vector< int >&rank_first, const std::vector< int >&rank_last, const std::vector< int >&unperformed)=0</div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_int_set_html_a9dc6b5dd524a344be68d49dfe713445b"><divclass="ttname"><ahref="classoperations__research_1_1_rev_int_set.html#a9dc6b5dd524a344be68d49dfe713445b">operations_research::RevIntSet::RevIntSet</a></div><divclass="ttdeci">RevIntSet(int capacity, int *shared_positions, int shared_positions_size)</div><divclass="ttdoc">Capacity is the fixed size of the set (it cannot grow).</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02583">constraint_solveri.h:2583</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html_a38b2df531e660bd3c43b896970a4f014"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html#a38b2df531e660bd3c43b896970a4f014">operations_research::VarLocalSearchOperator::values_</a></div><divclass="ttdeci">std::vector< Val > values_</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00924">constraint_solveri.h:924</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_int_set_html_a09b435e833bb97525ef2e54735f632ea"><divclass="ttname"><ahref="classoperations__research_1_1_rev_int_set.html#a09b435e833bb97525ef2e54735f632ea">operations_research::RevIntSet::Insert</a></div><divclass="ttdeci">void Insert(Solver *const solver, const T &elt)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02616">constraint_solveri.h:2616</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_html_a95da6a138a3b56de0cf0c3c4ba7c4688"><divclass="ttname"><ahref="classoperations__research_1_1_rev.html#a95da6a138a3b56de0cf0c3c4ba7c4688">operations_research::Rev::SetValue</a></div><divclass="ttdeci">void SetValue(Solver *const s, const T &val)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l03744">constraint_solver.h:3744</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_base_lns_html_ad14cde260686e5b4174e691675df3139"><divclass="ttname"><ahref="classoperations__research_1_1_base_lns.html#ad14cde260686e5b4174e691675df3139">operations_research::BaseLns::MakeOneNeighbor</a></div><divclass="ttdeci">bool MakeOneNeighbor() override</div><divclass="ttdoc">This method should not be overridden. Override NextFragment() instead.</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l00106">local_search.cc:106</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_solver_html_a293233c46e5eaa308f65c7c2350553f7"><divclass="ttname"><ahref="classoperations__research_1_1_solver.html#a293233c46e5eaa308f65c7c2350553f7">operations_research::Solver::DemonPriority</a></div><divclass="ttdeci">DemonPriority</div><divclass="ttdoc">This enum represents the three possible priorities for a demon in the Solver queue.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l00603">constraint_solver.h:603</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_decision_html"><divclass="ttname"><ahref="classoperations__research_1_1_decision.html">operations_research::Decision</a></div><divclass="ttdoc">A Decision represents a choice point in the search tree.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l03230">constraint_solver.h:3230</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_filter_html_abbc1e9f86296b06847f28247b420c376"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_filter.html#abbc1e9f86296b06847f28247b420c376">operations_research::LocalSearchFilter::GetSynchronizedObjectiveValue</a></div><divclass="ttdeci">virtual int64_t GetSynchronizedObjectiveValue() const</div><divclass="ttdoc">Objective value from last time Synchronize() was called.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01764">constraint_solveri.h:1764</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html_aeacffb05338262fd232dc77fed8cc586"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html#aeacffb05338262fd232dc77fed8cc586">operations_research::VarLocalSearchOperator::Start</a></div><divclass="ttdeci">void Start(const Assignment *assignment) override</div><divclass="ttdoc">This method should not be overridden.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00819">constraint_solveri.h:819</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_unsorted_nullable_rev_bitset_html_a6a6195bb5ef6729c4a28cf8d4c786626"><divclass="ttname"><ahref="classoperations__research_1_1_unsorted_nullable_rev_bitset.html#a6a6195bb5ef6729c4a28cf8d4c786626">operations_research::UnsortedNullableRevBitset::Init</a></div><divclass="ttdeci">void Init(Solver *const solver, const std::vector< uint64_t >&mask)</div><divclass="ttdoc">This methods overwrites the active bitset with the mask.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00232">utilities.cc:232</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_a4aa5eab0485ae0ec6eac0a81e5d5b9bd"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#a4aa5eab0485ae0ec6eac0a81e5d5b9bd">operations_research::BooleanVar::WhenRange</a></div><divclass="ttdeci">void WhenRange(Demon *d) override</div><divclass="ttdoc">Attach a demon that will watch the min or the max of the expression.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01977">constraint_solveri.h:1977</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_unsorted_nullable_rev_bitset_html_ada04ce569a49fe3804791c402ce71d06"><divclass="ttname"><ahref="classoperations__research_1_1_unsorted_nullable_rev_bitset.html#ada04ce569a49fe3804791c402ce71d06">operations_research::UnsortedNullableRevBitset::Intersects</a></div><divclass="ttdeci">bool Intersects(const std::vector< uint64_t >&mask, int *support_index)</div><divclass="ttdoc">This method returns true iff the mask and the active bitset have a non null intersection.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00295">utilities.cc:295</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_delayed_call_method0_html_ac863f0fdd6a476ca003c99f58f14e623"><divclass="ttname"><ahref="classoperations__research_1_1_delayed_call_method0.html#ac863f0fdd6a476ca003c99f58f14e623">operations_research::DelayedCallMethod0::Run</a></div><divclass="ttdeci">void Run(Solver *const s) override</div><divclass="ttdoc">This is the main callback of the demon.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00663">constraint_solveri.h:663</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_search_monitor_html"><divclass="ttname"><ahref="classoperations__research_1_1_search_monitor.html">operations_research::SearchMonitor</a></div><divclass="ttdoc">A search monitor is a simple set of callbacks to monitor all search events.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l03638">constraint_solver.h:3638</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_unsorted_nullable_rev_bitset_html_ae6bce1d393b8e189c1d550ed4f02b07f"><divclass="ttname"><ahref="classoperations__research_1_1_unsorted_nullable_rev_bitset.html#ae6bce1d393b8e189c1d550ed4f02b07f">operations_research::UnsortedNullableRevBitset::ActiveWordSize</a></div><divclass="ttdeci">int ActiveWordSize() const</div><divclass="ttdoc">This method returns the number of non null 64 bit words in the bitset representation.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02813">constraint_solveri.h:2813</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_search_log_html_afc36af1852ba6e2dbe650aa172e4c680"><divclass="ttname"><ahref="classoperations__research_1_1_search_log.html#afc36af1852ba6e2dbe650aa172e4c680">operations_research::SearchLog::AcceptUncheckedNeighbor</a></div><divclass="ttdeci">void AcceptUncheckedNeighbor() override</div><divclass="ttdoc">After accepting an unchecked neighbor during local search.</div><divclass="ttdef"><b>Definition:</b><ahref="search_8cc_source.html#l00178">search.cc:178</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_search_log_html_ab3631067f88ccc24c5db6a8a0dc64e47"><divclass="ttname"><ahref="classoperations__research_1_1_search_log.html#ab3631067f88ccc24c5db6a8a0dc64e47">operations_research::SearchLog::AtSolution</a></div><divclass="ttdeci">bool AtSolution() override</div><divclass="ttdoc">This method is called when a valid solution is found.</div><divclass="ttdef"><b>Definition:</b><ahref="search_8cc_source.html#l00108">search.cc:108</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_simple_rev_f_i_f_o_1_1_iterator_html"><divclass="ttname"><ahref="classoperations__research_1_1_simple_rev_f_i_f_o_1_1_iterator.html">operations_research::SimpleRevFIFO::Iterator</a></div><divclass="ttdoc">This iterator is not stable with respect to deletion.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00147">constraint_solveri.h:147</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html"><divclass="ttname"><ahref="namespaceoperations__research.html">operations_research</a></div><divclass="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><divclass="ttdef"><b>Definition:</b><ahref="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_partial_sequence_html_ae94f333127d093281b44be431c78162c"><divclass="ttname"><ahref="classoperations__research_1_1_rev_partial_sequence.html#ae94f333127d093281b44be431c78162c">operations_research::RevPartialSequence::RevPartialSequence</a></div><divclass="ttdeci">RevPartialSequence(const std::vector< int >&items)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02680">constraint_solveri.h:2680</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_aea9787c24ee8fe0e3fa88451ddadeb54"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#aea9787c24ee8fe0e3fa88451ddadeb54">operations_research::PathOperator::PathOperator</a></div><divclass="ttdeci">PathOperator(const std::vector< IntVar * >&next_vars, const std::vector< IntVar * >&path_vars, IterationParameters iteration_parameters)</div><divclass="ttdoc">Builds an instance of PathOperator from next and path variables.</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l00345">local_search.cc:345</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_array_with_offset_html_a77762357fb482084e1500646aba19f02"><divclass="ttname"><ahref="classoperations__research_1_1_array_with_offset.html#a77762357fb482084e1500646aba19f02">operations_research::ArrayWithOffset::Evaluate</a></div><divclass="ttdeci">virtual T Evaluate(int64_t index) const</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02457">constraint_solveri.h:2457</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_filter_html_a9f206932241656bf51d072480284ec9a"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_filter.html#a9f206932241656bf51d072480284ec9a">operations_research::LocalSearchFilter::Accept</a></div><divclass="ttdeci">virtual bool Accept(const Assignment *delta, const Assignment *deltadelta, int64_t objective_min, int64_t objective_max)=0</div><divclass="ttdoc">Accepts a "delta" given the assignment with which the filter has been synchronized; the delta holds t...</div></div>
<divclass="ttc"id="classoperations__research_1_1_call_method3_html_a7faffef6c714afe185ea30a930bb6ff6"><divclass="ttname"><ahref="classoperations__research_1_1_call_method3.html#a7faffef6c714afe185ea30a930bb6ff6">operations_research::CallMethod3::CallMethod3</a></div><divclass="ttdeci">CallMethod3(T *const ct, void(T::*method)(P, Q, R), const std::string &name, P param1, Q param2, R param3)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00608">constraint_solveri.h:608</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_symmetry_breaker_html"><divclass="ttname"><ahref="classoperations__research_1_1_symmetry_breaker.html">operations_research::SymmetryBreaker</a></div><divclass="ttdoc">A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in r...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02007">constraint_solveri.h:2007</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_ab0ae787392a8dd8a499eb55ac0916aa4"><divclass="ttname"><ahref="namespaceoperations__research.html#ab0ae787392a8dd8a499eb55ac0916aa4">operations_research::AreAllNull</a></div><divclass="ttdeci">bool AreAllNull(const std::vector< T >&values)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02870">constraint_solveri.h:2870</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_aea5901833f54f13948533de9dd621fa0"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#aea5901833f54f13948533de9dd621fa0">operations_research::BooleanVar::SetMin</a></div><divclass="ttdeci">void SetMin(int64_t m) override</div><divclass="ttdef"><b>Definition:</b><ahref="expressions_8cc_source.html#l00070">expressions.cc:70</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a17be752616a53fcfe8d4b04babfe1632"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a17be752616a53fcfe8d4b04babfe1632">operations_research::PathOperator::GetActiveAlternativeNode</a></div><divclass="ttdeci">int64_t GetActiveAlternativeNode(int node) const</div><divclass="ttdoc">Returns the active node in the alternative set of the given node.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01548">constraint_solveri.h:1548</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_simple_rev_f_i_f_o_html_a374c7d46981794e6b107b12a0f3b4dea"><divclass="ttname"><ahref="classoperations__research_1_1_simple_rev_f_i_f_o.html#a374c7d46981794e6b107b12a0f3b4dea">operations_research::SimpleRevFIFO::SetLastValue</a></div><divclass="ttdeci">void SetLastValue(const T &v)</div><divclass="ttdoc">Sets the last value in the FIFO.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00201">constraint_solveri.h:201</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_filter_manager_html_ae90693395653f673140e7bee51daf656"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_filter_manager.html#ae90693395653f673140e7bee51daf656">operations_research::LocalSearchFilterManager::Synchronize</a></div><divclass="ttdeci">void Synchronize(const Assignment *assignment, const Assignment *delta)</div><divclass="ttdoc">Synchronizes all filters to assignment.</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l03969">local_search.cc:3969</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_small_rev_bit_set_html_a50b7e2f9702d2416550ce54327b73a9c"><divclass="ttname"><ahref="classoperations__research_1_1_small_rev_bit_set.html#a50b7e2f9702d2416550ce54327b73a9c">operations_research::SmallRevBitSet::Cardinality</a></div><divclass="ttdeci">int64_t Cardinality() const</div><divclass="ttdoc">Returns the number of bits set to one.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00048">utilities.cc:48</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_call_method0_html_ac863f0fdd6a476ca003c99f58f14e623"><divclass="ttname"><ahref="classoperations__research_1_1_call_method0.html#ac863f0fdd6a476ca003c99f58f14e623">operations_research::CallMethod0::Run</a></div><divclass="ttdeci">void Run(Solver *const s) override</div><divclass="ttdoc">This is the main callback of the demon.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00505">constraint_solveri.h:505</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_ab62b402f767cda48eb67ef8b50397f8f"><divclass="ttname"><ahref="namespaceoperations__research.html#ab62b402f767cda48eb67ef8b50397f8f">operations_research::AreAllPositive</a></div><divclass="ttdeci">bool AreAllPositive(const std::vector< T >&values)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02895">constraint_solveri.h:2895</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a683f9daa3c8c8d6695ed277a470942f5"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a683f9daa3c8c8d6695ed277a470942f5">operations_research::PathOperator::MakeActive</a></div><divclass="ttdeci">bool MakeActive(int64_t node, int64_t destination)</div><divclass="ttdoc">Insert the inactive node after destination.</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l00458">local_search.cc:458</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_array_with_offset_html_ad117938b130bcd505b71898bcdef3450"><divclass="ttname"><ahref="classoperations__research_1_1_array_with_offset.html#ad117938b130bcd505b71898bcdef3450">operations_research::ArrayWithOffset::SetValue</a></div><divclass="ttdeci">void SetValue(int64_t index, T value)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02463">constraint_solveri.h:2463</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a753f1802e83fb21039b87a64a1769983"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a753f1802e83fb21039b87a64a1769983">operations_research::PathOperator::ReverseChain</a></div><divclass="ttdeci">bool ReverseChain(int64_t before_chain, int64_t after_chain, int64_t *chain_last)</div><divclass="ttdoc">Reverses the chain starting after before_chain and ending before after_chain.</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l00435">local_search.cc:435</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a29b8113bf656aa61493c9459508ed953"><divclass="ttname"><ahref="namespaceoperations__research.html#a29b8113bf656aa61493c9459508ed953">operations_research::MakeDelayedConstraintDemon2</a></div><divclass="ttdeci">Demon * MakeDelayedConstraintDemon2(Solver *const s, T *const ct, void(T::*method)(P, Q), const std::string &name, P param1, Q param2)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00761">constraint_solveri.h:761</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_state_html_af6d5206c3dd14d6b3ad08f0109cedf1e"><divclass="ttname"><ahref="classoperations__research_1_1_path_state.html#af6d5206c3dd14d6b3ad08f0109cedf1e">operations_research::PathState::ChangeNext</a></div><divclass="ttdeci">void ChangeNext(int node, int new_next)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l03119">constraint_solveri.h:3119</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_numerical_rev_html"><divclass="ttname"><ahref="classoperations__research_1_1_numerical_rev.html">operations_research::NumericalRev< int ></a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_ab720cd311ecdce747e444192edd3ea78"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#ab720cd311ecdce747e444192edd3ea78">operations_research::PathOperator::GetBaseNodeRestartPosition</a></div><divclass="ttdeci">virtual int64_t GetBaseNodeRestartPosition(int base_index)</div><divclass="ttdoc">Returns the index of the node to which the base node of index base_index must be set to when it reach...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01441">constraint_solveri.h:1441</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a17bdf687f4bf47cb68ea163f28876608"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a17bdf687f4bf47cb68ea163f28876608">operations_research::PathOperator::IsPathStart</a></div><divclass="ttdeci">bool IsPathStart(int64_t node) const</div><divclass="ttdoc">Returns true if node is the first node on the path.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01500">constraint_solveri.h:1500</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_int_var_local_search_operator_html"><divclass="ttname"><ahref="classoperations__research_1_1_int_var_local_search_operator.html">operations_research::IntVarLocalSearchOperator</a></div><divclass="ttdoc">Specialization of LocalSearchOperator built from an array of IntVars which specifies the scope of the...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01020">constraint_solveri.h:1020</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a625a8523af421e43b7ac500b934e7dbd"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">operations_research::PathOperator::MoveChain</a></div><divclass="ttdeci">bool MoveChain(int64_t before_chain, int64_t chain_end, int64_t destination)</div><divclass="ttdoc">Moves the chain starting after the node before_chain and ending at the node chain_end after the node ...</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l00412">local_search.cc:412</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_ad5846aaa2ab58aded455393cc5e93027"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#ad5846aaa2ab58aded455393cc5e93027">operations_research::PathOperator::AddPairAlternativeSets</a></div><divclass="ttdeci">void AddPairAlternativeSets(const std::vector< std::pair< std::vector< int64_t >, std::vector< int64_t >>>&pair_alternative_sets)</div><divclass="ttdoc">Adds all sets of node alternatives of a vector of alternative pairs.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01531">constraint_solveri.h:1531</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_call_method2_html"><divclass="ttname"><ahref="classoperations__research_1_1_call_method2.html">operations_research::CallMethod2</a></div><divclass="ttdoc">Demon proxy to a method on the constraint with two arguments.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00566">constraint_solveri.h:566</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_aff25e92fae946063c5a4a786e58e37a2"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#aff25e92fae946063c5a4a786e58e37a2">operations_research::PathOperator::MakeChainInactive</a></div><divclass="ttdeci">bool MakeChainInactive(int64_t before_chain, int64_t chain_end)</div><divclass="ttdoc">Makes the nodes on the chain starting after before_chain and ending at chain_end inactive.</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l00468">local_search.cc:468</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_simple_rev_f_i_f_o_html_ae247d6af463a190ddfc1ee36eee1a880"><divclass="ttname"><ahref="classoperations__research_1_1_simple_rev_f_i_f_o.html#ae247d6af463a190ddfc1ee36eee1a880">operations_research::SimpleRevFIFO::LastValue</a></div><divclass="ttdeci">const T & LastValue() const</div><divclass="ttdoc">Returns the last value in the FIFO.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00195">constraint_solveri.h:195</a></div></div>
<divclass="ttc"id="structoperations__research_1_1_path_operator_1_1_iteration_parameters_html_a1581ad954b08df9d34aeab8c61baa926"><divclass="ttname"><ahref="structoperations__research_1_1_path_operator_1_1_iteration_parameters.html#a1581ad954b08df9d34aeab8c61baa926">operations_research::PathOperator::IterationParameters::start_empty_path_class</a></div><divclass="ttdeci">std::function< int(int64_t)> start_empty_path_class</div><divclass="ttdoc">Callback returning an index such that if c1 = start_empty_path_class(StartNode(p1)),...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01333">constraint_solveri.h:1333</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_assignment_html_a1f16f5a2e5767013b620efd255fb35ea"><divclass="ttname"><ahref="classoperations__research_1_1_assignment.html#a1f16f5a2e5767013b620efd255fb35ea">operations_research::Assignment::IntVarContainer</a></div><divclass="ttdeci">const IntContainer & IntVarContainer() const</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l05193">constraint_solver.h:5193</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_monitor_html_a127c860aa3b5024666f308c553edf2a5"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_monitor.html#a127c860aa3b5024666f308c553edf2a5">operations_research::LocalSearchMonitor::Install</a></div><divclass="ttdeci">void Install() override</div><divclass="ttdoc">Install itself on the solver.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8cc_source.html#l02921">constraint_solver.cc:2921</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_filter_html_abfb57ca737847644064b3accdddbc8ba"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_filter.html#abfb57ca737847644064b3accdddbc8ba">operations_research::LocalSearchFilter::Commit</a></div><divclass="ttdeci">virtual void Commit(const Assignment *delta, const Assignment *deltadelta)</div><divclass="ttdoc">Dual of Relax(), lets the filter know that the delta was accepted.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01735">constraint_solveri.h:1735</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html_ac7c91384d4426bc617f24056e8cceca3"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html#ac7c91384d4426bc617f24056e8cceca3">operations_research::VarLocalSearchOperator::OldValue</a></div><divclass="ttdeci">const Val & OldValue(int64_t index) const</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00843">constraint_solveri.h:843</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_sequence_var_local_search_operator_html_a32d7461a11748f6614455083c485e7b7"><divclass="ttname"><ahref="classoperations__research_1_1_sequence_var_local_search_operator.html#a32d7461a11748f6614455083c485e7b7">operations_research::SequenceVarLocalSearchOperator::SetForwardSequence</a></div><divclass="ttdeci">void SetForwardSequence(int64_t index, const std::vector< int >&value)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01165">constraint_solveri.h:1165</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_filter_html"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_filter.html">operations_research::LocalSearchFilter</a></div><divclass="ttdoc">Local Search Filters are used for fast neighbor pruning.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01729">constraint_solveri.h:1729</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_change_value_html_ad14cde260686e5b4174e691675df3139"><divclass="ttname"><ahref="classoperations__research_1_1_change_value.html#ad14cde260686e5b4174e691675df3139">operations_research::ChangeValue::MakeOneNeighbor</a></div><divclass="ttdeci">bool MakeOneNeighbor() override</div><divclass="ttdoc">This method should not be overridden. Override ModifyValue() instead.</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l00300">local_search.cc:300</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_small_rev_bit_set_html"><divclass="ttname"><ahref="classoperations__research_1_1_small_rev_bit_set.html">operations_research::SmallRevBitSet</a></div><divclass="ttdoc">This class represents a small reversible bitset (size <= 64).</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00396">constraint_solveri.h:396</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_solver_html_a293233c46e5eaa308f65c7c2350553f7ad38fb80cf0d5468a2b5efdb0f4cd6068"><divclass="ttname"><ahref="classoperations__research_1_1_solver.html#a293233c46e5eaa308f65c7c2350553f7ad38fb80cf0d5468a2b5efdb0f4cd6068">operations_research::Solver::DELAYED_PRIORITY</a></div><divclass="ttdoc">DELAYED_PRIORITY is the lowest priority: Demons will be processed after VAR_PRIORITY and NORMAL_PRIOR...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solver_8h_source.html#l00606">constraint_solver.h:606</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a15f08cfbb35e2b8b1eb76f79caea924a"><divclass="ttname"><ahref="namespaceoperations__research.html#a15f08cfbb35e2b8b1eb76f79caea924a">operations_research::AreAllLessOrEqual</a></div><divclass="ttdeci">bool AreAllLessOrEqual(const std::vector< T >&values, const T &value)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02885">constraint_solveri.h:2885</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a4fb750da00c784e5ffd1763fd3ce88f7"><divclass="ttname"><ahref="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">operations_research::MakeConstraintDemon1</a></div><divclass="ttdeci">Demon * MakeConstraintDemon1(Solver *const s, T *const ct, void(T::*method)(P), const std::string &name, P param1)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00559">constraint_solveri.h:559</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_immutable_multi_map_html_a0b5c13dc004b78fa86ae2a2e76f25f99"><divclass="ttname"><ahref="classoperations__research_1_1_rev_immutable_multi_map.html#a0b5c13dc004b78fa86ae2a2e76f25f99">operations_research::RevImmutableMultiMap::Insert</a></div><divclass="ttdeci">void Insert(const K &key, const V &value)</div><divclass="ttdoc">Inserts (key, value) in the multi-map.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00317">constraint_solveri.h:317</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_var_local_search_operator_html_ab309dc20c7f6458d60ef0e8de08b3c7c"><divclass="ttname"><ahref="classoperations__research_1_1_var_local_search_operator.html#ab309dc20c7f6458d60ef0e8de08b3c7c">operations_research::VarLocalSearchOperator::MarkChange</a></div><divclass="ttdeci">void MarkChange(int64_t index)</div><divclass="ttdoc">OnStart() should really be protected, but then SWIG doesn't see it.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00918">constraint_solveri.h:918</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_sequence_var_local_search_operator_html_a9288959c9052582be99babec1f808b6f"><divclass="ttname"><ahref="classoperations__research_1_1_sequence_var_local_search_operator.html#a9288959c9052582be99babec1f808b6f">operations_research::SequenceVarLocalSearchOperator::backward_values_</a></div><divclass="ttdeci">std::vector< std::vector< int >> backward_values_</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01176">constraint_solveri.h:1176</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_operator_html_a126d8d622ba60f333308fd98bcf8ed2b"><divclass="ttname"><ahref="classoperations__research_1_1_path_operator.html#a126d8d622ba60f333308fd98bcf8ed2b">operations_research::PathOperator::OnSamePathAsPreviousBase</a></div><divclass="ttdeci">virtual bool OnSamePathAsPreviousBase(int64_t base_index)</div><divclass="ttdoc">Returns true if a base node has to be on the same path as the "previous" base node (base node of inde...</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01435">constraint_solveri.h:1435</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_state_1_1_chain_range_1_1_iterator_html_aef12ef33726bc591f569f822c7b5ac41"><divclass="ttname"><ahref="classoperations__research_1_1_path_state_1_1_chain_range_1_1_iterator.html#aef12ef33726bc591f569f822c7b5ac41">operations_research::PathState::ChainRange::Iterator::operator++</a></div><divclass="ttdeci">Iterator & operator++()</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l03289">constraint_solveri.h:3289</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_propagation_monitor_html_a670d62cb4741bc10b2332a8a67fd3f5a"><divclass="ttname"><ahref="classoperations__research_1_1_propagation_monitor.html#a670d62cb4741bc10b2332a8a67fd3f5a">operations_research::PropagationMonitor::RankNotFirst</a></div><divclass="ttdeci">virtual void RankNotFirst(SequenceVar *const var, int index)=0</div></div>
<divclass="ttc"id="namespaceoperations__research_html_abdca98f14c02e004ab5e19d2c3985667"><divclass="ttname"><ahref="namespaceoperations__research.html#abdca98f14c02e004ab5e19d2c3985667">operations_research::MakeConstraintDemon3</a></div><divclass="ttdeci">Demon * MakeConstraintDemon3(Solver *const s, T *const ct, void(T::*method)(P, Q, R), const std::string &name, P param1, Q param2, R param3)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00641">constraint_solveri.h:641</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_rev_bit_set_html_a4a36258ad75b9ddbb095da574c172b1b"><divclass="ttname"><ahref="classoperations__research_1_1_rev_bit_set.html#a4a36258ad75b9ddbb095da574c172b1b">operations_research::RevBitSet::SetToZero</a></div><divclass="ttdeci">void SetToZero(Solver *const solver, int64_t index)</div><divclass="ttdoc">Erases the 'index' bit.</div><divclass="ttdef"><b>Definition:</b><ahref="utilities_8cc_source.html#l00095">utilities.cc:95</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_filter_html_a4c4ba0ffe635d14b93794268bd8e5995"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_filter.html#a4c4ba0ffe635d14b93794268bd8e5995">operations_research::LocalSearchFilter::Reset</a></div><divclass="ttdeci">virtual void Reset()</div><divclass="ttdoc">Sets the filter to empty solution.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01761">constraint_solveri.h:1761</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_local_search_filter_html_a014f20f582a46468dff392fcf77aa55c"><divclass="ttname"><ahref="classoperations__research_1_1_local_search_filter.html#a014f20f582a46468dff392fcf77aa55c">operations_research::LocalSearchFilter::Synchronize</a></div><divclass="ttdeci">virtual void Synchronize(const Assignment *assignment, const Assignment *delta)=0</div><divclass="ttdoc">Synchronizes the filter with the current solution, delta being the difference with the solution passe...</div></div>
<divclass="ttc"id="namespaceoperations__research_html_a3d434774c07815a25ffaa7adb343c19e"><divclass="ttname"><ahref="namespaceoperations__research.html#a3d434774c07815a25ffaa7adb343c19e">operations_research::IsIncreasing</a></div><divclass="ttdeci">bool IsIncreasing(const std::vector< T >&values)</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l02925">constraint_solveri.h:2925</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_path_state_html_afff8650ff7cd2d26a74e6dd518744a81"><divclass="ttname"><ahref="classoperations__research_1_1_path_state.html#afff8650ff7cd2d26a74e6dd518744a81">operations_research::PathState::PathState</a></div><divclass="ttdeci">PathState(int num_nodes, std::vector< int > path_start, std::vector< int > path_end)</div><divclass="ttdef"><b>Definition:</b><ahref="local__search_8cc_source.html#l02566">local_search.cc:2566</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_boolean_var_html_a970f18a42acc024041506587b8f79e74"><divclass="ttname"><ahref="classoperations__research_1_1_boolean_var.html#a970f18a42acc024041506587b8f79e74">operations_research::BooleanVar::kUnboundBooleanVarValue</a></div><divclass="ttdeci">static const int kUnboundBooleanVarValue</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l01957">constraint_solveri.h:1957</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_delayed_call_method1_html_a0a34701cff1b1ac2fabd11e27c7cebc9"><divclass="ttname"><ahref="classoperations__research_1_1_delayed_call_method1.html#a0a34701cff1b1ac2fabd11e27c7cebc9">operations_research::DelayedCallMethod1::priority</a></div><divclass="ttdeci">Solver::DemonPriority priority() const override</div><divclass="ttdoc">This method returns the priority of the demon.</div><divclass="ttdef"><b>Definition:</b><ahref="constraint__solveri_8h_source.html#l00699">constraint_solveri.h:699</a></div></div>
