<trid="row_0_"class="even"><tdclass="entry"><spanstyle="width:16px;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_1_0_"class="even"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< T ></a></td><tdclass="desc"></td></tr>
<trid="row_1_1_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_1_1_"class="arrow"onclick="toggleFolder('1_1_')">►</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 are used for fast neighbor pruning </td></tr>
<trid="row_1_1_0_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1BasePathFilter.html"target="_self">BasePathFilter</a></td><tdclass="desc">Generic path-based filter class </td></tr>
<trid="row_1_1_0_1_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1CPFeasibilityFilter.html"target="_self">CPFeasibilityFilter</a></td><tdclass="desc">This filter accepts deltas for which the assignment satisfies the constraints of the Solver </td></tr>
<trid="row_1_2_"class="even"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_1_3_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_1_3_"class="arrow"onclick="toggleFolder('1_3_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1LocalSearchOperator.html"target="_self">LocalSearchOperator</a></td><tdclass="desc">The base class for all local search operators </td></tr>
<trid="row_1_3_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanid="arr_1_3_0_"class="arrow"onclick="toggleFolder('1_3_0_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1VarLocalSearchOperator.html"target="_self">VarLocalSearchOperator< V, Val, Handler ></a></td><tdclass="desc">Base operator class for operators manipulating variables </td></tr>
<trid="row_1_3_1_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanid="arr_1_3_1_0_"class="arrow"onclick="toggleFolder('1_3_1_0_')">►</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="The base class for all local search operators.">LocalSearchOperator</a> built from an array of IntVars which specifies the scope of the operator </td></tr>
<trid="row_1_3_1_0_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;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">This is the base class for building an Lns operator </td></tr>
<trid="row_1_3_1_0_1_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1ChangeValue.html"target="_self">ChangeValue</a></td><tdclass="desc">Defines operators which change the value of variables; each neighbor corresponds to <em>one</em> modified variable </td></tr>
<trid="row_1_3_1_0_3_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1FilteredHeuristicExpensiveChainLNSOperator.html"target="_self">FilteredHeuristicExpensiveChainLNSOperator</a></td><tdclass="desc">Similar to the move above, but instead of removing one route entirely, the destruction phase consists of removing all nodes on an "expensive" chain from a route </td></tr>
<trid="row_1_3_1_0_4_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1FilteredHeuristicPathLNSOperator.html"target="_self">FilteredHeuristicPathLNSOperator</a></td><tdclass="desc">LNS-like operator based on a filtered first solution heuristic to rebuild the solution, after the destruction phase consisting of removing one route </td></tr>
<trid="row_1_3_1_0_5_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanid="arr_1_3_1_0_5_"class="arrow"onclick="toggleFolder('1_3_1_0_5_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1PathOperator.html"target="_self">PathOperator</a></td><tdclass="desc">Base class of the local search operators dedicated to path modifications (a path is a set of nodes linked together by arcs) </td></tr>
<trid="row_1_3_1_0_5_1_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:96px;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_1_3_1_0_5_3_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:96px;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_1_3_1_0_5_4_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:96px;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_1_3_1_0_5_5_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:96px;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_1_3_1_0_5_6_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:96px;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_1_3_1_0_5_7_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:96px;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_1_3_1_0_5_8_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1PairNodeSwapActiveOperator.html"target="_self">PairNodeSwapActiveOperator< swap_first ></a></td><tdclass="desc">Operator which inserts pairs of inactive nodes into a path and makes an active node inactive </td></tr>
<trid="row_1_3_1_0_5_9_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:96px;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_1_3_1_0_5_11_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:96px;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_1_3_1_0_6_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;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_1_4_"class="even"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_1RoutingModelVisitor.html"target="_self">RoutingModelVisitor</a></td><tdclass="desc">Routing model visitor </td></tr>
<trid="row_5_0_"class="even"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_1GlobalVehicleBreaksConstraint.html"target="_self">GlobalVehicleBreaksConstraint</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1GlobalVehicleBreaksConstraint.html"title="GlobalVehicleBreaksConstraint ensures breaks constraints are enforced on all vehicles in the dimensio...">GlobalVehicleBreaksConstraint</a> ensures breaks constraints are enforced on all vehicles in the dimension passed to its constructor </td></tr>
<trid="row_5_1_"class="even"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_1TypeRegulationsConstraint.html"target="_self">TypeRegulationsConstraint</a></td><tdclass="desc">The following constraint ensures that incompatibilities and requirements between types are respected </td></tr>
<trid="row_8_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_1IntVarFilteredDecisionBuilder.html"target="_self">IntVarFilteredDecisionBuilder</a></td><tdclass="desc">Decision builder building a solution using heuristics with local search filters to evaluate its feasibility </td></tr>
<trid="row_9_0_"class="even"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_10_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_1CallMethod0.html"target="_self">CallMethod0< T ></a></td><tdclass="desc">Demon proxy to a method on the constraint with no arguments </td></tr>
<trid="row_10_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_1CallMethod1.html"target="_self">CallMethod1< T, P ></a></td><tdclass="desc">Demon proxy to a method on the constraint with one argument </td></tr>
<trid="row_10_2_"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< T, P, Q ></a></td><tdclass="desc">Demon proxy to a method on the constraint with two arguments </td></tr>
<trid="row_10_3_"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< T, P, Q, R ></a></td><tdclass="desc">Demon proxy to a method on the constraint with three arguments </td></tr>
<trid="row_10_4_"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< T ></a></td><tdclass="desc">Low-priority demon proxy to a method on the constraint with no arguments </td></tr>
<trid="row_10_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_1DelayedCallMethod1.html"target="_self">DelayedCallMethod1< T, P ></a></td><tdclass="desc">Low-priority demon proxy to a method on the constraint with one argument </td></tr>
<trid="row_10_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_1DelayedCallMethod2.html"target="_self">DelayedCallMethod2< T, P, Q ></a></td><tdclass="desc">Low-priority demon proxy to a method on the constraint with two arguments </td></tr>
<trid="row_11_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1RoutingModel_1_1CostClass_1_1DimensionCost.html"target="_self">RoutingModel::CostClass::DimensionCost</a></td><tdclass="desc">SUBTLE: The vehicle's fixed cost is skipped on purpose here, because we can afford to do so: </td></tr>
<trid="row_13_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1DisjunctivePropagator.html"target="_self">DisjunctivePropagator</a></td><tdclass="desc">This class acts like a CP propagator: it takes a set of tasks given by their start/duration/end features, and reduces the range of possible values </td></tr>
<trid="row_18_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_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_20_"class="even"><tdclass="entry"><spanstyle="width:0px;display:inline-block;"> </span><spanid="arr_20_"class="arrow"onclick="toggleFolder('20_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1IntVarFilteredHeuristic.html"target="_self">IntVarFilteredHeuristic</a></td><tdclass="desc">Generic filter-based heuristic applied to IntVars </td></tr>
<trid="row_20_0_"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_20_0_"class="arrow"onclick="toggleFolder('20_0_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RoutingFilteredHeuristic.html"target="_self">RoutingFilteredHeuristic</a></td><tdclass="desc">Filter-based heuristic dedicated to routing </td></tr>
<trid="row_20_0_0_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanid="arr_20_0_0_"class="arrow"onclick="toggleFolder('20_0_0_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1CheapestAdditionFilteredHeuristic.html"target="_self">CheapestAdditionFilteredHeuristic</a></td><tdclass="desc">Filtered-base decision builder based on the addition heuristic, extending a path from its start node with the cheapest arc </td></tr>
<trid="row_20_0_0_0_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1ComparatorCheapestAdditionFilteredHeuristic.html"target="_self">ComparatorCheapestAdditionFilteredHeuristic</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1CheapestAdditionFilteredHeuristic.html"title="Filtered-base decision builder based on the addition heuristic, extending a path from its start node ...">CheapestAdditionFilteredHeuristic</a> where the notion of 'cheapest arc' comes from an arc comparator </td></tr>
<trid="row_20_0_0_1_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1EvaluatorCheapestAdditionFilteredHeuristic.html"target="_self">EvaluatorCheapestAdditionFilteredHeuristic</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1CheapestAdditionFilteredHeuristic.html"title="Filtered-base decision builder based on the addition heuristic, extending a path from its start node ...">CheapestAdditionFilteredHeuristic</a> where the notion of 'cheapest arc' comes from an arc evaluator </td></tr>
<trid="row_20_0_1_0_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1GlobalCheapestInsertionFilteredHeuristic.html"target="_self">GlobalCheapestInsertionFilteredHeuristic</a></td><tdclass="desc">Filter-based decision builder which builds a solution by inserting nodes at their cheapest position on any route; potentially several routes can be built in parallel </td></tr>
<trid="row_20_0_1_1_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1LocalCheapestInsertionFilteredHeuristic.html"target="_self">LocalCheapestInsertionFilteredHeuristic</a></td><tdclass="desc">Filter-base decision builder which builds a solution by inserting nodes at their cheapest position </td></tr>
<trid="row_20_0_3_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanid="arr_20_0_3_"class="arrow"onclick="toggleFolder('20_0_3_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SavingsFilteredHeuristic.html"target="_self">SavingsFilteredHeuristic</a></td><tdclass="desc">Filter-based decision builder which builds a solution by using Clarke & Wright's Savings heuristic </td></tr>
<trid="row_25_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SimpleRevFIFO_1_1Iterator.html"target="_self">SimpleRevFIFO< T >::Iterator</a></td><tdclass="desc">This iterator is not stable with respect to deletion </td></tr>
<trid="row_30_"class="even"><tdclass="entry"><spanstyle="width:16px;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_35_"><tdclass="entry"><spanstyle="width:0px;display:inline-block;"> </span><spanid="arr_35_"class="arrow"onclick="toggleFolder('35_')">►</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_35_0_"class="even"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_36_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RevGrowingArray.html"target="_self">RevGrowingArray< T, C ></a></td><tdclass="desc">This class is a reversible growing array </td></tr>
<trid="row_37_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RevImmutableMultiMap.html"target="_self">RevImmutableMultiMap< K, V ></a></td><tdclass="desc">Reversible Immutable MultiMap class </td></tr>
<trid="row_38_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RevIntSet.html"target="_self">RevIntSet< T ></a></td><tdclass="desc">This is a special class to represent a 'residual' set of T </td></tr>
<trid="row_39_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RevIntSet.html"target="_self">RevIntSet< int ></a></td><tdclass="desc"></td></tr>
<trid="row_41_"><tdclass="entry"><spanstyle="width:16px;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_42_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RoutingDimension.html"target="_self">RoutingDimension</a></td><tdclass="desc">Dimensions represent quantities accumulated at nodes along the routes </td></tr>
<trid="row_43_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1RoutingIndexManager.html"target="_self">RoutingIndexManager</a></td><tdclass="desc">Manager for any NodeIndex <-> variable index conversion </td></tr>
<trid="row_46_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SavingsFilteredHeuristic_1_1SavingsContainer.html"target="_self">SavingsFilteredHeuristic::SavingsContainer< S ></a></td><tdclass="desc"></td></tr>
<trid="row_49_2_"class="even"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_1SearchLog.html"target="_self">SearchLog</a></td><tdclass="desc">The base class of all search logs that periodically outputs information when the search is running </td></tr>
<trid="row_51_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SimpleBoundCosts.html"target="_self">SimpleBoundCosts</a></td><tdclass="desc">A structure meant to store soft bounds and associated violation constants </td></tr>
<trid="row_52_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SimpleRevFIFO.html"target="_self">SimpleRevFIFO< T ></a></td><tdclass="desc">This class represent a reversible FIFO structure </td></tr>
<trid="row_54_"class="even"><tdclass="entry"><spanstyle="width:16px;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_56_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1RoutingModel_1_1StateDependentTransit.html"target="_self">RoutingModel::StateDependentTransit</a></td><tdclass="desc">What follows is relevant for models with time/state dependent transits </td></tr>
<trid="row_57_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SweepArranger.html"target="_self">SweepArranger</a></td><tdclass="desc">Class to arrange indices by by their distance and their angles from the depot </td></tr>
<trid="row_64_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html"target="_self">DisjunctivePropagator::Tasks</a></td><tdclass="desc">A structure to hold tasks described by their features </td></tr>
<trid="row_68_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_1TypeIncompatibilityChecker.html"target="_self">TypeIncompatibilityChecker</a></td><tdclass="desc">Checker for type incompatibilities </td></tr>
<trid="row_68_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_1TypeRequirementChecker.html"target="_self">TypeRequirementChecker</a></td><tdclass="desc">Checker for type requirements </td></tr>
<trid="row_70_"class="even"><tdclass="entry"><spanstyle="width:16px;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_73_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1RoutingModel_1_1VehicleTypeContainer.html"target="_self">RoutingModel::VehicleTypeContainer</a></td><tdclass="desc">Struct used to sort and store vehicles by their type </td></tr>
