<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">This is the base class for all expressions that are not variables. <ahref="classoperations__research_1_1_base_int_expr.html#details">More...</a><br/></td></tr>
<trclass="memitem:"><tdclass="memItemLeft"align="right"valign="top">class  </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="classoperations__research_1_1_simple_rev_f_i_f_o.html">SimpleRevFIFO< T ></a></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">This class represent a reversible FIFO structure. <ahref="classoperations__research_1_1_simple_rev_f_i_f_o.html#details">More...</a><br/></td></tr>
<trclass="memitem:"><tdclass="memItemLeft"align="right"valign="top">class  </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="classoperations__research_1_1_simple_rev_f_i_f_o_1_1_iterator.html">SimpleRevFIFO< T >::Iterator</a></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">This iterator is not stable with respect to deletion. <ahref="classoperations__research_1_1_simple_rev_f_i_f_o_1_1_iterator.html#details">More...</a><br/></td></tr>
<trclass="memitem:"><tdclass="memItemLeft"align="right"valign="top">class  </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="classoperations__research_1_1_rev_immutable_multi_map.html">RevImmutableMultiMap< K, V ></a></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">A reversible switch that can switch once from false to true. <ahref="classoperations__research_1_1_rev_switch.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">This class represents a small reversible bitset (size <= 64). <ahref="classoperations__research_1_1_small_rev_bit_set.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">This class represents a reversible bitset. <ahref="classoperations__research_1_1_rev_bit_set.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Matrix version of the <aclass="el"href="classoperations__research_1_1_rev_bit_set.html"title="This class represents a reversible bitset.">RevBitSet</a> class. <ahref="classoperations__research_1_1_rev_bit_matrix.html#details">More...</a><br/></td></tr>
<trclass="memitem:"><tdclass="memItemLeft"align="right"valign="top">class  </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="classoperations__research_1_1_call_method0.html">CallMethod0< T ></a></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight"><aclass="el"href="classoperations__research_1_1_demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> proxy to a method on the constraint with no arguments. <ahref="classoperations__research_1_1_call_method0.html#details">More...</a><br/></td></tr>
<trclass="memitem:"><tdclass="memItemLeft"align="right"valign="top">class  </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="classoperations__research_1_1_call_method1.html">CallMethod1< T, P ></a></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight"><aclass="el"href="classoperations__research_1_1_demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> proxy to a method on the constraint with one argument. <ahref="classoperations__research_1_1_call_method1.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight"><aclass="el"href="classoperations__research_1_1_demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> proxy to a method on the constraint with two arguments. <ahref="classoperations__research_1_1_call_method2.html#details">More...</a><br/></td></tr>
<trclass="memitem:"><tdclass="memItemLeft"align="right"valign="top">class  </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="classoperations__research_1_1_call_method3.html">CallMethod3< T, P, Q, R ></a></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight"><aclass="el"href="classoperations__research_1_1_demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> proxy to a method on the constraint with three arguments. <ahref="classoperations__research_1_1_call_method3.html#details">More...</a><br/></td></tr>
<trclass="memitem:"><tdclass="memItemLeft"align="right"valign="top">class  </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="classoperations__research_1_1_delayed_call_method0.html">DelayedCallMethod0< T ></a></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Low-priority demon proxy to a method on the constraint with no arguments. <ahref="classoperations__research_1_1_delayed_call_method0.html#details">More...</a><br/></td></tr>
<trclass="memitem:"><tdclass="memItemLeft"align="right"valign="top">class  </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="classoperations__research_1_1_delayed_call_method1.html">DelayedCallMethod1< T, P ></a></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Low-priority demon proxy to a method on the constraint with one argument. <ahref="classoperations__research_1_1_delayed_call_method1.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Low-priority demon proxy to a method on the constraint with two arguments. <ahref="classoperations__research_1_1_delayed_call_method2.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">The base class for all local search operators. <ahref="classoperations__research_1_1_local_search_operator.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Base operator class for operators manipulating variables. <ahref="classoperations__research_1_1_var_local_search_operator.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Specialization of <aclass="el"href="classoperations__research_1_1_local_search_operator.html"title="The base class for all local search operators.">LocalSearchOperator</a> built from an array of IntVars which specifies the scope of the operator. <ahref="classoperations__research_1_1_int_var_local_search_operator.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">This is the base class for building an Lns operator. <ahref="classoperations__research_1_1_base_lns.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Defines operators which change the value of variables; each neighbor corresponds to <em>one</em> modified variable. <ahref="classoperations__research_1_1_change_value.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Base class of the local search operators dedicated to path modifications (a path is a set of nodes linked together by arcs). <ahref="classoperations__research_1_1_path_operator.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Local <aclass="el"href="classoperations__research_1_1_search.html">Search</a> Filters are used for fast neighbor pruning. <ahref="classoperations__research_1_1_local_search_filter.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Filter manager: when a move is made, filters are executed to decide whether the solution is feasible and compute parts of the new cost. <ahref="classoperations__research_1_1_local_search_filter_manager.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in return. <ahref="classoperations__research_1_1_symmetry_breaker.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">The base class of all search logs that periodically outputs information when the search is running. <ahref="classoperations__research_1_1_search_log.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Implements a complete cache for model elements: expressions and constraints. <ahref="classoperations__research_1_1_model_cache.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Argument Holder: useful when visiting a model. <ahref="classoperations__research_1_1_argument_holder.html#details">More...</a><br/></td></tr>
<trclass="memitem:"><tdclass="memItemLeft"align="right"valign="top">class  </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="classoperations__research_1_1_array_with_offset.html">ArrayWithOffset< T ></a></td></tr>
<trclass="memitem:"><tdclass="memItemLeft"align="right"valign="top">class  </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="classoperations__research_1_1_rev_growing_array.html">RevGrowingArray< T, C ></a></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">This class is a reversible growing array. <ahref="classoperations__research_1_1_rev_growing_array.html#details">More...</a><br/></td></tr>
<trclass="memitem:"><tdclass="memItemLeft"align="right"valign="top">class  </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="classoperations__research_1_1_rev_int_set.html">RevIntSet< T ></a></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">This is a special class to represent a 'residual' set of T. <ahref="classoperations__research_1_1_rev_int_set.html#details">More...</a><br/></td></tr>
<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">This class represents a reversible bitset. <ahref="classoperations__research_1_1_unsorted_nullable_rev_bitset.html#details">More...</a><br/></td></tr>
<trclass="memdesc:namespaceoperations__research"><tdclass="mdescLeft"> </td><tdclass="mdescRight">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from the Traveling Salesman Problem to more complex problems such as the Capacitated Vehicle Routing Problem with Time Windows. <br/></td></tr>
<trclass="memdesc:a403e52e933033645c3388146d5e2edd2"><tdclass="mdescLeft"> </td><tdclass="mdescRight">This enum is used internally to do dynamic typing on subclasses of integer variables. <ahref="namespaceoperations__research.html#a403e52e933033645c3388146d5e2edd2">More...</a><br/></td></tr>
<trclass="memitem:a12527c82ffc8b31c5d8dc836c366d624"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:a12527c82ffc8b31c5d8dc836c366d624"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#a12527c82ffc8b31c5d8dc836c366d624">IsArrayConstant</a> (const std::vector< T >&values, const T &<aclass="el"href="matrix__utils_8cc.html#aee90379adb0307effb138f4871edbc5c">value</a>)</td></tr>
<trclass="memitem:a3f4525e71a6b05d97c868f0832750a60"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:a3f4525e71a6b05d97c868f0832750a60"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#a3f4525e71a6b05d97c868f0832750a60">IsArrayBoolean</a> (const std::vector< T >&values)</td></tr>
<trclass="memitem:ae3e4f71c4c79e0b4ec00c4e715a7c298"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:ae3e4f71c4c79e0b4ec00c4e715a7c298"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#ae3e4f71c4c79e0b4ec00c4e715a7c298">AreAllOnes</a> (const std::vector< T >&values)</td></tr>
<trclass="memitem:ab0ae787392a8dd8a499eb55ac0916aa4"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:ab0ae787392a8dd8a499eb55ac0916aa4"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#ab0ae787392a8dd8a499eb55ac0916aa4">AreAllNull</a> (const std::vector< T >&values)</td></tr>
<trclass="memitem:a3aea406979285a28c91fd1ee8115af74"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:a3aea406979285a28c91fd1ee8115af74"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#a3aea406979285a28c91fd1ee8115af74">AreAllGreaterOrEqual</a> (const std::vector< T >&values, const T &<aclass="el"href="matrix__utils_8cc.html#aee90379adb0307effb138f4871edbc5c">value</a>)</td></tr>
<trclass="memitem:a15f08cfbb35e2b8b1eb76f79caea924a"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:a15f08cfbb35e2b8b1eb76f79caea924a"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#a15f08cfbb35e2b8b1eb76f79caea924a">AreAllLessOrEqual</a> (const std::vector< T >&values, const T &<aclass="el"href="matrix__utils_8cc.html#aee90379adb0307effb138f4871edbc5c">value</a>)</td></tr>
<trclass="memitem:ab62b402f767cda48eb67ef8b50397f8f"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:ab62b402f767cda48eb67ef8b50397f8f"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#ab62b402f767cda48eb67ef8b50397f8f">AreAllPositive</a> (const std::vector< T >&values)</td></tr>
<trclass="memitem:a38972723946490ea4df4e34298d8805d"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:a38972723946490ea4df4e34298d8805d"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#a38972723946490ea4df4e34298d8805d">AreAllNegative</a> (const std::vector< T >&values)</td></tr>
<trclass="memitem:a3de09f9134b976e5ba64751ac0f4440b"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:a3de09f9134b976e5ba64751ac0f4440b"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#a3de09f9134b976e5ba64751ac0f4440b">AreAllStrictlyPositive</a> (const std::vector< T >&values)</td></tr>
<trclass="memitem:a8351829c324863ddda52e201df4f9f84"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:a8351829c324863ddda52e201df4f9f84"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#a8351829c324863ddda52e201df4f9f84">AreAllStrictlyNegative</a> (const std::vector< T >&values)</td></tr>
<trclass="memitem:aafac7375c23337f25821aa6f86ca627c"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:aafac7375c23337f25821aa6f86ca627c"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#aafac7375c23337f25821aa6f86ca627c">IsIncreasingContiguous</a> (const std::vector< T >&values)</td></tr>
<trclass="memitem:a3d434774c07815a25ffaa7adb343c19e"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:a3d434774c07815a25ffaa7adb343c19e"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#a3d434774c07815a25ffaa7adb343c19e">IsIncreasing</a> (const std::vector< T >&values)</td></tr>
<trclass="memitem:adf2aea6c68fe502389c9264b971b2f85"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:adf2aea6c68fe502389c9264b971b2f85"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#adf2aea6c68fe502389c9264b971b2f85">IsArrayInRange</a> (const std::vector< IntVar * >&vars, T range_min, T range_max)</td></tr>
<trclass="memitem:a54470bffc3ea32cc37d0222e5dbb62a6"><tdclass="memTemplParams"colspan="2">template<class T ></td></tr>
<trclass="memitem:a54470bffc3ea32cc37d0222e5dbb62a6"><tdclass="memTemplItemLeft"align="right"valign="top">bool </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#a54470bffc3ea32cc37d0222e5dbb62a6">AreAllBoundOrNull</a> (const std::vector< IntVar * >&vars, const std::vector< T >&values)</td></tr>
<trclass="memdesc:a54470bffc3ea32cc37d0222e5dbb62a6"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Returns true if all the variables are assigned to a single value, or if their corresponding value is null. <ahref="namespaceoperations__research.html#a54470bffc3ea32cc37d0222e5dbb62a6">More...</a><br/></td></tr>
<trclass="memdesc:a7028ce8b481be8cb6fca7a6925d41aa7"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Returns true if all variables are assigned to 'value'. <ahref="namespaceoperations__research.html#a7028ce8b481be8cb6fca7a6925d41aa7">More...</a><br/></td></tr>
<trclass="memitem:a60dabfa452b4264887ef76c75edf3765"><tdclass="memItemLeft"align="right"valign="top"><aclass="el"href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#a60dabfa452b4264887ef76c75edf3765">PosIntDivUp</a> (<aclass="el"href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> e, <aclass="el"href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v)</td></tr>
<trclass="memitem:a942ba2898a44303790c91e761b8f4630"><tdclass="memItemLeft"align="right"valign="top"><aclass="el"href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#a942ba2898a44303790c91e761b8f4630">PosIntDivDown</a> (<aclass="el"href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> e, <aclass="el"href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v)</td></tr>
<trclass="memitem:abf97a851d233a8ec9d94e1275fe7e34f"><tdclass="memItemLeft"align="right"valign="top">std::vector<<aclass="el"href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>> </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#abf97a851d233a8ec9d94e1275fe7e34f">ToInt64Vector</a> (const std::vector< int >&<aclass="el"href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>)</td></tr>
<trclass="memdesc:a3c2f93547af434566184b7dee7039c93"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Support limited to pointers to classes which define DebugString(). <ahref="namespaceoperations__research.html#a3c2f93547af434566184b7dee7039c93">More...</a><br/></td></tr>
<trclass="memitem:abdca98f14c02e004ab5e19d2c3985667"><tdclass="memTemplParams"colspan="2">template<class T , class P , class Q , class R ></td></tr>
<trclass="memitem:abdca98f14c02e004ab5e19d2c3985667"><tdclass="memTemplItemLeft"align="right"valign="top">Demon * </td><tdclass="memTemplItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#abdca98f14c02e004ab5e19d2c3985667">MakeConstraintDemon3</a> (Solver *const s, T *const <aclass="el"href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, void(T::*method)(P, Q, R), const std::string &<aclass="el"href="linear__solver_8cc.html#a82e2a7e0f28d620da677073b6b24574b">name</a>, P param1, Q param2, R param3)</td></tr>
