<trid="row_0_"class="even"><tdclass="entry"><spanstyle="width:0px;display:inline-block;"> </span><spanid="arr_0_"class="arrow"onclick="toggleFolder('0_')">►</span><spanclass="icona"><spanclass="icon">N</span></span><aclass="el"href="namespaceoperations__research.html"target="_self">operations_research</a></td><tdclass="desc">Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License </td></tr>
<trid="row_0_0_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1ArgumentHolder.html"target="_self">ArgumentHolder</a></td><tdclass="desc">Argument Holder: useful when visiting a model </td></tr>
<trid="row_0_1_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1ArrayWithOffset.html"target="_self">ArrayWithOffset</a></td><tdclass="desc">--— Utility Class for Callbacks --—</td></tr>
<trid="row_0_5_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1BaseIntExpr.html"target="_self">BaseIntExpr</a></td><tdclass="desc">This is the base class for all expressions that are not variables </td></tr>
<trid="row_0_6_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1BaseLns.html"target="_self">BaseLns</a></td><tdclass="desc">--— Base Large Neighborhood Search operator class -—</td></tr>
<trid="row_0_7_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1BaseObject.html"target="_self">BaseObject</a></td><tdclass="desc">Useful Search and Modeling Objects </td></tr>
<trid="row_0_9_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1CallMethod0.html"target="_self">CallMethod0</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1Demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> proxy to a method on the constraint with no arguments </td></tr>
<trid="row_0_10_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1CallMethod1.html"target="_self">CallMethod1</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1Demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> proxy to a method on the constraint with one argument </td></tr>
<trid="row_0_11_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1CallMethod2.html"target="_self">CallMethod2</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1Demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> proxy to a method on the constraint with two arguments </td></tr>
<trid="row_0_12_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1CallMethod3.html"target="_self">CallMethod3</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1Demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> proxy to a method on the constraint with three arguments </td></tr>
<trid="row_0_13_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1CastConstraint.html"target="_self">CastConstraint</a></td><tdclass="desc">Cast constraints are special channeling constraints designed to keep a variable in sync with an expression </td></tr>
<trid="row_0_15_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1Constraint.html"target="_self">Constraint</a></td><tdclass="desc">A constraint is the main modeling object </td></tr>
<trid="row_0_16_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1Decision.html"target="_self">Decision</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1Decision.html"title="A Decision represents a choice point in the search tree.">Decision</a> represents a choice point in the search tree </td></tr>
<trid="row_0_17_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1DecisionBuilder.html"target="_self">DecisionBuilder</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1DecisionBuilder.html"title="A DecisionBuilder is responsible for creating the search tree.">DecisionBuilder</a> is responsible for creating the search tree </td></tr>
<trid="row_0_18_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1DecisionVisitor.html"target="_self">DecisionVisitor</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1DecisionVisitor.html"title="A DecisionVisitor is used to inspect a decision.">DecisionVisitor</a> is used to inspect a decision </td></tr>
<trid="row_0_19_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1DefaultPhaseParameters.html"target="_self">DefaultPhaseParameters</a></td><tdclass="desc">This struct holds all parameters for the default search </td></tr>
<trid="row_0_20_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1DelayedCallMethod0.html"target="_self">DelayedCallMethod0</a></td><tdclass="desc">Low-priority demon proxy to a method on the constraint with no arguments </td></tr>
<trid="row_0_21_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1DelayedCallMethod1.html"target="_self">DelayedCallMethod1</a></td><tdclass="desc">Low-priority demon proxy to a method on the constraint with one argument </td></tr>
<trid="row_0_22_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1DelayedCallMethod2.html"target="_self">DelayedCallMethod2</a></td><tdclass="desc">Low-priority demon proxy to a method on the constraint with two arguments </td></tr>
<trid="row_0_23_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1Demon.html"target="_self">Demon</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1Demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> is the base element of a propagation queue </td></tr>
<trid="row_0_24_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1DimensionCumulOptimizerCore.html"target="_self">DimensionCumulOptimizerCore</a></td><tdclass="desc">Classes to solve dimension cumul placement (aka scheduling) problems using linear programming </td></tr>
<trid="row_0_25_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1DisjunctiveConstraint.html"target="_self">DisjunctiveConstraint</a></td><tdclass="desc">--— Disjunctive <aclass="el"href="classoperations__research_1_1Constraint.html"title="A constraint is the main modeling object.">Constraint</a> --—</td></tr>
<trid="row_0_29_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1IndexPairSwapActiveOperator.html"target="_self">IndexPairSwapActiveOperator</a></td><tdclass="desc">Operator which inserts inactive nodes into a path and makes a pair of active nodes inactive </td></tr>
<trid="row_0_30_"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_30_"class="arrow"onclick="toggleFolder('0_30_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1InitAndGetValues.html"target="_self">InitAndGetValues</a></td><tdclass="desc">Utility class to encapsulate an <aclass="el"href="classoperations__research_1_1IntVarIterator.html"title="The class Iterator has two direct subclasses.">IntVarIterator</a> and use it in a range-based loop </td></tr>
<trid="row_0_31_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1IntervalVar.html"target="_self">IntervalVar</a></td><tdclass="desc">-------— Interval Var -------—</td></tr>
<trid="row_0_33_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1IntExpr.html"target="_self">IntExpr</a></td><tdclass="desc">The class <aclass="el"href="classoperations__research_1_1IntExpr.html"title="The class IntExpr is the base of all integer expressions in constraint programming.">IntExpr</a> is the base of all integer expressions in constraint programming </td></tr>
<trid="row_0_34_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1IntVar.html"target="_self">IntVar</a></td><tdclass="desc">The class <aclass="el"href="classoperations__research_1_1IntVar.html"title="The class IntVar is a subset of IntExpr.">IntVar</a> is a subset of <aclass="el"href="classoperations__research_1_1IntExpr.html"title="The class IntExpr is the base of all integer expressions in constraint programming.">IntExpr</a></td></tr>
<trid="row_0_36_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1IntVarIterator.html"target="_self">IntVarIterator</a></td><tdclass="desc">The class Iterator has two direct subclasses </td></tr>
<trid="row_0_38_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1IntVarLocalSearchHandler.html"target="_self">IntVarLocalSearchHandler</a></td><tdclass="desc">--— Base operator class for operators manipulating IntVars --—</td></tr>
<trid="row_0_39_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1IntVarLocalSearchOperator.html"target="_self">IntVarLocalSearchOperator</a></td><tdclass="desc">Specialization of <aclass="el"href="classoperations__research_1_1LocalSearchOperator.html"title="-------— Local search operators -------—">LocalSearchOperator</a> built from an array of IntVars which specifies the scope of the operator </td></tr>
<trid="row_0_41_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1LocalDimensionCumulOptimizer.html"target="_self">LocalDimensionCumulOptimizer</a></td><tdclass="desc">Class used to compute optimal values for dimension cumuls of routes, minimizing cumul soft lower and upper bound costs, and vehicle span costs of a route </td></tr>
<trid="row_0_42_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1LocalSearchFilter.html"target="_self">LocalSearchFilter</a></td><tdclass="desc">--— Local Search Filters ---—</td></tr>
<trid="row_0_43_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1LocalSearchFilterManager.html"target="_self">LocalSearchFilterManager</a></td><tdclass="desc">Filter manager: when a move is made, filters are executed to decide whether the solution is feasible and compute parts of the new cost </td></tr>
<trid="row_0_46_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1LocalSearchOperator.html"target="_self">LocalSearchOperator</a></td><tdclass="desc">-------— Local search operators -------—</td></tr>
<trid="row_0_47_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1MakePairActiveOperator.html"target="_self">MakePairActiveOperator</a></td><tdclass="desc">Pair-based neighborhood operators, designed to move nodes by pairs (pairs are static and given) </td></tr>
<trid="row_0_48_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1MakePairInactiveOperator.html"target="_self">MakePairInactiveOperator</a></td><tdclass="desc">Operator which makes pairs of active nodes inactive </td></tr>
<trid="row_0_49_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1MakeRelocateNeighborsOperator.html"target="_self">MakeRelocateNeighborsOperator</a></td><tdclass="desc">Relocate neighborhood which moves chains of neighbors </td></tr>
<trid="row_0_50_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1ModelCache.html"target="_self">ModelCache</a></td><tdclass="desc">Implements a complete cache for model elements: expressions and constraints </td></tr>
<trid="row_0_53_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1NumericalRev.html"target="_self">NumericalRev</a></td><tdclass="desc">Subclass of Rev<T> which adds numerical operations </td></tr>
<trid="row_0_54_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1NumericalRevArray.html"target="_self">NumericalRevArray</a></td><tdclass="desc">Subclass of RevArray<T> which adds numerical operations </td></tr>
<trid="row_0_56_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1Pack.html"target="_self">Pack</a></td><tdclass="desc">-------—<aclass="el"href="classoperations__research_1_1Pack.html"title="-------— Pack Constraint -------—">Pack</a><aclass="el"href="classoperations__research_1_1Constraint.html"title="A constraint is the main modeling object.">Constraint</a> -------—</td></tr>
<trid="row_0_57_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1PairExchangeOperator.html"target="_self">PairExchangeOperator</a></td><tdclass="desc">Operator which exchanges the position of two pairs; for both pairs the first node of the pair must be before the second node on the same path </td></tr>
<trid="row_0_58_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1PairExchangeRelocateOperator.html"target="_self">PairExchangeRelocateOperator</a></td><tdclass="desc">Operator which exchanges the paths of two pairs (path have to be different) </td></tr>
<trid="row_0_59_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1PairNodeSwapActiveOperator.html"target="_self">PairNodeSwapActiveOperator</a></td><tdclass="desc">Operator which inserts pairs of inactive nodes into a path and makes an active node inactive </td></tr>
<trid="row_0_60_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1PairRelocateOperator.html"target="_self">PairRelocateOperator</a></td><tdclass="desc">Operator which moves a pair of nodes to another position where the first node of the pair must be before the second node on the same path </td></tr>
<trid="row_0_62_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1PathWithPreviousNodesOperator.html"target="_self">PathWithPreviousNodesOperator</a></td><tdclass="desc">Simple <aclass="el"href="classoperations__research_1_1PathOperator.html"title="--— Path-based Operators --—">PathOperator</a> wrapper that also stores the current previous nodes, and is thus able to provide the "Prev" and "IsPathStart" functions </td></tr>
<trid="row_0_63_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1PropagationBaseObject.html"target="_self">PropagationBaseObject</a></td><tdclass="desc">The <aclass="el"href="classoperations__research_1_1PropagationBaseObject.html"title="The PropagationBaseObject is a subclass of BaseObject that is also friend to the Solver class.">PropagationBaseObject</a> is a subclass of <aclass="el"href="classoperations__research_1_1BaseObject.html"title="Useful Search and Modeling Objects.">BaseObject</a> that is also friend to the <aclass="el"href="classoperations__research_1_1Solver.html"title="Solver Class.">Solver</a> class </td></tr>
<trid="row_0_66_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RelocateExpensiveChain.html"target="_self">RelocateExpensiveChain</a></td><tdclass="desc">--—<aclass="el"href="classoperations__research_1_1RelocateExpensiveChain.html"title="--— RelocateExpensiveChain --— Operator which relocates the most expensive subchains (given a cost ca...">RelocateExpensiveChain</a> --— Operator which relocates the most expensive subchains (given a cost callback) in a path to a different position </td></tr>
<trid="row_0_67_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RelocateSubtrip.html"target="_self">RelocateSubtrip</a></td><tdclass="desc">Tries to move subtrips after an insertion node </td></tr>
<trid="row_0_68_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1Rev.html"target="_self">Rev</a></td><tdclass="desc">This class adds reversibility to a POD type </td></tr>
<trid="row_0_69_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RevArray.html"target="_self">RevArray</a></td><tdclass="desc">Reversible array of POD types </td></tr>
<trid="row_0_70_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RevBitMatrix.html"target="_self">RevBitMatrix</a></td><tdclass="desc">Matrix version of the <aclass="el"href="classoperations__research_1_1RevBitSet.html"title="This class represents a reversible bitset.">RevBitSet</a> class </td></tr>
<trid="row_0_71_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RevBitSet.html"target="_self">RevBitSet</a></td><tdclass="desc">This class represents a reversible bitset </td></tr>
<trid="row_0_72_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RevGrowingArray.html"target="_self">RevGrowingArray</a></td><tdclass="desc">This class is a reversible growing array </td></tr>
<trid="row_0_73_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RevImmutableMultiMap.html"target="_self">RevImmutableMultiMap</a></td><tdclass="desc">--— Immutable Multi Map --—</td></tr>
<trid="row_0_76_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RevSwitch.html"target="_self">RevSwitch</a></td><tdclass="desc">A reversible switch that can switch once from false to true </td></tr>
<trid="row_0_82_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SearchMonitor.html"target="_self">SearchMonitor</a></td><tdclass="desc">A search monitor is a simple set of callbacks to monitor all search events </td></tr>
<trid="row_0_87_0_"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SimpleRevFIFO_1_1Iterator.html"target="_self">Iterator</a></td><tdclass="desc">This iterator is not stable with respect to deletion </td></tr>
<trid="row_0_88_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SmallRevBitSet.html"target="_self">SmallRevBitSet</a></td><tdclass="desc">This class represents a small reversible bitset (size <= 64) </td></tr>
<trid="row_0_91_"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_91_"class="arrow"onclick="toggleFolder('0_91_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1Solver.html"target="_self">Solver</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1Solver.html"title="Solver Class.">Solver</a> Class </td></tr>
<trid="row_0_91_0_"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1Solver_1_1IntegerCastInfo.html"target="_self">IntegerCastInfo</a></td><tdclass="desc">Holds semantic information stating that the 'expression' has been cast into 'variable' using the Var() method, and that 'maintainer' is responsible for maintaining the equality between 'variable' and 'expression' </td></tr>
<trid="row_0_91_1_"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1Solver_1_1SearchLogParameters.html"target="_self">SearchLogParameters</a></td><tdclass="desc">Creates a search monitor from logging parameters </td></tr>
<trid="row_0_92_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SwapIndexPairOperator.html"target="_self">SwapIndexPairOperator</a></td><tdclass="desc">Operator which iterates through each alternative of a set of pairs </td></tr>
<trid="row_0_93_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SymmetryBreaker.html"target="_self">SymmetryBreaker</a></td><tdclass="desc">A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in return </td></tr>
<trid="row_0_94_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1UnsortedNullableRevBitset.html"target="_self">UnsortedNullableRevBitset</a></td><tdclass="desc">This class represents a reversible bitset </td></tr>
<trid="row_0_95_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1VarLocalSearchOperator.html"target="_self">VarLocalSearchOperator</a></td><tdclass="desc">--— Base operator class for operators manipulating variables --—</td></tr>
<trid="row_3_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structTableStruct__ortools__2fconstraint__5fsolver__2frouting__5fenums__2eproto.html"target="_self">TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fenums_2eproto</a></td><tdclass="desc">Internal implementation detail – do not use these members </td></tr>
<trid="row_4_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structTableStruct__ortools__2fconstraint__5fsolver__2frouting__5fparameters__2eproto.html"target="_self">TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto</a></td><tdclass="desc">Internal implementation detail – do not use these members </td></tr>
