218 lines
64 KiB
HTML
218 lines
64 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<title>OR-Tools</title>
|
|
<meta http-equiv="Content-Type" content="text/html;"/>
|
|
<meta charset="utf-8"/>
|
|
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
|
|
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
</head>
|
|
<body>
|
|
<div id="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">Google OR-Tools 7.4</span>
|
|
</div>
|
|
</div>
|
|
<div id="content" style="width: 100%; overflow: hidden;">
|
|
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
|
|
<h2>C++ Reference</h2>
|
|
<ul>
|
|
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
|
|
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
|
|
<li><a href="../cpp_graph/annotated.html">Graph</a></li>
|
|
<li><a href="../cpp_routing/annotated.html">Routing</a></li>
|
|
<li><a href="../cpp_linear/annotated.html">Linear solver</a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="content">
|
|
<div align="center">
|
|
<h1 style="color: #145A32;">C++ Reference: Routing</h1>
|
|
</div>
|
|
<!-- Generated by Doxygen 1.8.16 -->
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
|
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li><a href="files.html"><span>Files</span></a></li>
|
|
</ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">Class Hierarchy</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="textblock">
|
|
<p><a href="inherits.html">Go to the graphical class hierarchy</a></p>
|
|
This inheritance list is sorted roughly, but not completely, alphabetically:</div><div class="directory">
|
|
<div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span><span onclick="javascript:toggleLevel(3);">3</span><span onclick="javascript:toggleLevel(4);">4</span><span onclick="javascript:toggleLevel(5);">5</span><span onclick="javascript:toggleLevel(6);">6</span><span onclick="javascript:toggleLevel(7);">7</span>]</div><table class="directory">
|
|
<tr id="row_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ArgumentHolder.html" target="_self">ArgumentHolder</a></td><td class="desc">Argument Holder: useful when visiting a model </td></tr>
|
|
<tr id="row_1_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1AssignmentContainer.html" target="_self">AssignmentContainer< V, E ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1AssignmentContainer.html" target="_self">AssignmentContainer< IntervalVar, IntervalVarElement ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_3_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1AssignmentContainer.html" target="_self">AssignmentContainer< IntVar, IntVarElement ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1AssignmentContainer.html" target="_self">AssignmentContainer< SequenceVar, SequenceVarElement ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_5_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1AssignmentElement.html" target="_self">AssignmentElement</a></td><td class="desc"></td></tr>
|
|
<tr id="row_5_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1IntervalVarElement.html" target="_self">IntervalVarElement</a></td><td class="desc"></td></tr>
|
|
<tr id="row_5_1_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1IntVarElement.html" target="_self">IntVarElement</a></td><td class="desc"></td></tr>
|
|
<tr id="row_5_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SequenceVarElement.html" target="_self">SequenceVarElement</a></td><td class="desc">The <a class="el" href="classoperations__research_1_1SequenceVarElement.html" title="The SequenceVarElement stores a partial representation of ranked interval variables in the underlying...">SequenceVarElement</a> stores a partial representation of ranked interval variables in the underlying sequence variable </td></tr>
|
|
<tr id="row_6_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_6_" class="arrow" onclick="toggleFolder('6_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1BaseObject.html" target="_self">BaseObject</a></td><td class="desc">A <a class="el" href="classoperations__research_1_1BaseObject.html" title="A BaseObject is the root of all reversibly allocated objects.">BaseObject</a> is the root of all reversibly allocated objects </td></tr>
|
|
<tr id="row_6_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ArrayWithOffset.html" target="_self">ArrayWithOffset< T ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_1_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1Decision.html" target="_self">Decision</a></td><td class="desc">A <a class="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>
|
|
<tr id="row_6_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_6_2_" class="arrow" onclick="toggleFolder('6_2_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1DecisionBuilder.html" target="_self">DecisionBuilder</a></td><td class="desc">A <a class="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>
|
|
<tr id="row_6_2_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1IntVarFilteredDecisionBuilder.html" target="_self">IntVarFilteredDecisionBuilder</a></td><td class="desc"><a class="el" href="classoperations__research_1_1Decision.html" title="A Decision represents a choice point in the search tree.">Decision</a> builder building a solution using heuristics with local search filters to evaluate its feasibility </td></tr>
|
|
<tr id="row_6_3_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_6_3_" class="arrow" onclick="toggleFolder('6_3_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1DecisionVisitor.html" target="_self">DecisionVisitor</a></td><td class="desc">A <a class="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>
|
|
<tr id="row_6_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SymmetryBreaker.html" target="_self">SymmetryBreaker</a></td><td class="desc">A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in return </td></tr>
|
|
<tr id="row_6_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_6_4_" class="arrow" onclick="toggleFolder('6_4_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1Demon.html" target="_self">Demon</a></td><td class="desc">A <a class="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>
|
|
<tr id="row_6_4_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1CallMethod0.html" target="_self">CallMethod0< T ></a></td><td class="desc"><a class="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>
|
|
<tr id="row_6_4_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1CallMethod1.html" target="_self">CallMethod1< T, P ></a></td><td class="desc"><a class="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>
|
|
<tr id="row_6_4_2_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1CallMethod2.html" target="_self">CallMethod2< T, P, Q ></a></td><td class="desc"><a class="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>
|
|
<tr id="row_6_4_3_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1CallMethod3.html" target="_self">CallMethod3< T, P, Q, R ></a></td><td class="desc"><a class="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>
|
|
<tr id="row_6_4_4_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1DelayedCallMethod0.html" target="_self">DelayedCallMethod0< T ></a></td><td class="desc">Low-priority demon proxy to a method on the constraint with no arguments </td></tr>
|
|
<tr id="row_6_4_5_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1DelayedCallMethod1.html" target="_self">DelayedCallMethod1< T, P ></a></td><td class="desc">Low-priority demon proxy to a method on the constraint with one argument </td></tr>
|
|
<tr id="row_6_4_6_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1DelayedCallMethod2.html" target="_self">DelayedCallMethod2< T, P, Q ></a></td><td class="desc">Low-priority demon proxy to a method on the constraint with two arguments </td></tr>
|
|
<tr id="row_6_5_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_6_5_" class="arrow" onclick="toggleFolder('6_5_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1IntVarFilteredHeuristic.html" target="_self">IntVarFilteredHeuristic</a></td><td class="desc">Generic filter-based heuristic applied to IntVars </td></tr>
|
|
<tr id="row_6_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_6_5_0_" class="arrow" onclick="toggleFolder('6_5_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RoutingFilteredHeuristic.html" target="_self">RoutingFilteredHeuristic</a></td><td class="desc">Filter-based heuristic dedicated to routing </td></tr>
|
|
<tr id="row_6_5_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span id="arr_6_5_0_0_" class="arrow" onclick="toggleFolder('6_5_0_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1CheapestAdditionFilteredHeuristic.html" target="_self">CheapestAdditionFilteredHeuristic</a></td><td class="desc">Filtered-base decision builder based on the addition heuristic, extending a path from its start node with the cheapest arc </td></tr>
|
|
<tr id="row_6_5_0_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ComparatorCheapestAdditionFilteredHeuristic.html" target="_self">ComparatorCheapestAdditionFilteredHeuristic</a></td><td class="desc">A <a class="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>
|
|
<tr id="row_6_5_0_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1EvaluatorCheapestAdditionFilteredHeuristic.html" target="_self">EvaluatorCheapestAdditionFilteredHeuristic</a></td><td class="desc">A <a class="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>
|
|
<tr id="row_6_5_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span id="arr_6_5_0_1_" class="arrow" onclick="toggleFolder('6_5_0_1_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1CheapestInsertionFilteredHeuristic.html" target="_self">CheapestInsertionFilteredHeuristic</a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_5_0_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1GlobalCheapestInsertionFilteredHeuristic.html" target="_self">GlobalCheapestInsertionFilteredHeuristic</a></td><td class="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>
|
|
<tr id="row_6_5_0_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LocalCheapestInsertionFilteredHeuristic.html" target="_self">LocalCheapestInsertionFilteredHeuristic</a></td><td class="desc">Filter-base decision builder which builds a solution by inserting nodes at their cheapest position </td></tr>
|
|
<tr id="row_6_5_0_2_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ChristofidesFilteredHeuristic.html" target="_self">ChristofidesFilteredHeuristic</a></td><td class="desc">Christofides addition heuristic </td></tr>
|
|
<tr id="row_6_5_0_3_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span id="arr_6_5_0_3_" class="arrow" onclick="toggleFolder('6_5_0_3_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SavingsFilteredHeuristic.html" target="_self">SavingsFilteredHeuristic</a></td><td class="desc">Filter-based decision builder which builds a solution by using Clarke & Wright's Savings heuristic </td></tr>
|
|
<tr id="row_6_5_0_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ParallelSavingsFilteredHeuristic.html" target="_self">ParallelSavingsFilteredHeuristic</a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_5_0_3_1_" class="even" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SequentialSavingsFilteredHeuristic.html" target="_self">SequentialSavingsFilteredHeuristic</a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_6_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1IntVarIterator.html" target="_self">IntVarIterator</a></td><td class="desc">The class Iterator has two direct subclasses </td></tr>
|
|
<tr id="row_6_7_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_6_7_" class="arrow" onclick="toggleFolder('6_7_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LocalSearchFilter.html" target="_self">LocalSearchFilter</a></td><td class="desc">Local Search Filters are used for fast neighbor pruning </td></tr>
|
|
<tr id="row_6_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_6_7_0_" class="arrow" onclick="toggleFolder('6_7_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1IntVarLocalSearchFilter.html" target="_self">IntVarLocalSearchFilter</a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_7_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1BasePathFilter.html" target="_self">BasePathFilter</a></td><td class="desc">Generic path-based filter class </td></tr>
|
|
<tr id="row_6_7_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1CPFeasibilityFilter.html" target="_self">CPFeasibilityFilter</a></td><td class="desc">This filter accepts deltas for which the assignment satisfies the constraints of the <a class="el" href="classoperations__research_1_1Solver.html" title="Solver Class.">Solver</a> </td></tr>
|
|
<tr id="row_6_7_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LocalSearchFilterManager.html" target="_self">LocalSearchFilterManager</a></td><td class="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>
|
|
<tr id="row_6_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_6_8_" class="arrow" onclick="toggleFolder('6_8_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LocalSearchOperator.html" target="_self">LocalSearchOperator</a></td><td class="desc">The base class for all local search operators </td></tr>
|
|
<tr id="row_6_8_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_6_8_0_" class="arrow" onclick="toggleFolder('6_8_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1VarLocalSearchOperator.html" target="_self">VarLocalSearchOperator< V, Val, Handler ></a></td><td class="desc">Base operator class for operators manipulating variables </td></tr>
|
|
<tr id="row_6_8_0_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SequenceVarLocalSearchOperator.html" target="_self">SequenceVarLocalSearchOperator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_8_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_6_8_1_" class="arrow" onclick="toggleFolder('6_8_1_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1VarLocalSearchOperator.html" target="_self">VarLocalSearchOperator< IntVar, int64, IntVarLocalSearchHandler ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_8_1_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span id="arr_6_8_1_0_" class="arrow" onclick="toggleFolder('6_8_1_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1IntVarLocalSearchOperator.html" target="_self">IntVarLocalSearchOperator</a></td><td class="desc">Specialization of <a class="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>
|
|
<tr id="row_6_8_1_0_0_" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1BaseLns.html" target="_self">BaseLns</a></td><td class="desc">This is the base class for building an Lns operator </td></tr>
|
|
<tr id="row_6_8_1_0_1_" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ChangeValue.html" target="_self">ChangeValue</a></td><td class="desc">Defines operators which change the value of variables; each neighbor corresponds to <em>one</em> modified variable </td></tr>
|
|
<tr id="row_6_8_1_0_2_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span id="arr_6_8_1_0_2_" class="arrow" onclick="toggleFolder('6_8_1_0_2_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1PathOperator.html" target="_self">PathOperator</a></td><td class="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>
|
|
<tr id="row_6_8_1_0_2_0_" style="display:none;"><td class="entry"><span style="width:96px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1MakePairActiveOperator.html" target="_self">MakePairActiveOperator</a></td><td class="desc">Pair-based neighborhood operators, designed to move nodes by pairs (pairs are static and given) </td></tr>
|
|
<tr id="row_6_8_1_0_2_1_" style="display:none;"><td class="entry"><span style="width:96px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1PairNodeSwapActiveOperator.html" target="_self">PairNodeSwapActiveOperator< swap_first ></a></td><td class="desc">Operator which inserts pairs of inactive nodes into a path and makes an active node inactive </td></tr>
|
|
<tr id="row_6_8_1_0_2_2_" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span id="arr_6_8_1_0_2_2_" class="arrow" onclick="toggleFolder('6_8_1_0_2_2_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1PathWithPreviousNodesOperator.html" target="_self">PathWithPreviousNodesOperator</a></td><td class="desc">Simple <a class="el" href="classoperations__research_1_1PathOperator.html" title="Base class of the local search operators dedicated to path modifications (a path is a set of nodes li...">PathOperator</a> wrapper that also stores the current previous nodes, and is thus able to provide the "Prev" and "IsPathStart" functions </td></tr>
|
|
<tr id="row_6_8_1_0_2_2_0_" style="display:none;"><td class="entry"><span style="width:112px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ExchangeSubtrip.html" target="_self">ExchangeSubtrip</a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_8_1_0_2_2_1_" style="display:none;"><td class="entry"><span style="width:112px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1IndexPairSwapActiveOperator.html" target="_self">IndexPairSwapActiveOperator</a></td><td class="desc">Operator which inserts inactive nodes into a path and makes a pair of active nodes inactive </td></tr>
|
|
<tr id="row_6_8_1_0_2_2_2_" style="display:none;"><td class="entry"><span style="width:112px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LightPairRelocateOperator.html" target="_self">LightPairRelocateOperator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_8_1_0_2_2_3_" style="display:none;"><td class="entry"><span style="width:112px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1MakePairInactiveOperator.html" target="_self">MakePairInactiveOperator</a></td><td class="desc">Operator which makes pairs of active nodes inactive </td></tr>
|
|
<tr id="row_6_8_1_0_2_2_4_" style="display:none;"><td class="entry"><span style="width:112px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1MakeRelocateNeighborsOperator.html" target="_self">MakeRelocateNeighborsOperator</a></td><td class="desc">Relocate neighborhood which moves chains of neighbors </td></tr>
|
|
<tr id="row_6_8_1_0_2_2_5_" style="display:none;"><td class="entry"><span style="width:112px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1PairExchangeOperator.html" target="_self">PairExchangeOperator</a></td><td class="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>
|
|
<tr id="row_6_8_1_0_2_2_6_" style="display:none;"><td class="entry"><span style="width:112px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1PairExchangeRelocateOperator.html" target="_self">PairExchangeRelocateOperator</a></td><td class="desc">Operator which exchanges the paths of two pairs (path have to be different) </td></tr>
|
|
<tr id="row_6_8_1_0_2_2_7_" style="display:none;"><td class="entry"><span style="width:112px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1PairRelocateOperator.html" target="_self">PairRelocateOperator</a></td><td class="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>
|
|
<tr id="row_6_8_1_0_2_2_8_" style="display:none;"><td class="entry"><span style="width:112px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RelocateSubtrip.html" target="_self">RelocateSubtrip</a></td><td class="desc">Tries to move subtrips after an insertion node </td></tr>
|
|
<tr id="row_6_8_1_0_2_3_" style="display:none;"><td class="entry"><span style="width:96px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RelocateExpensiveChain.html" target="_self">RelocateExpensiveChain</a></td><td class="desc"><a class="el" href="classoperations__research_1_1RelocateExpensiveChain.html" title="RelocateExpensiveChain.">RelocateExpensiveChain</a> </td></tr>
|
|
<tr id="row_6_8_1_0_3_" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SwapIndexPairOperator.html" target="_self">SwapIndexPairOperator</a></td><td class="desc">Operator which iterates through each alternative of a set of pairs </td></tr>
|
|
<tr id="row_6_9_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_6_9_" class="arrow" onclick="toggleFolder('6_9_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ModelVisitor.html" target="_self">ModelVisitor</a></td><td class="desc">Model visitor </td></tr>
|
|
<tr id="row_6_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ModelParser.html" target="_self">ModelParser</a></td><td class="desc">Model Parser </td></tr>
|
|
<tr id="row_6_10_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_6_10_" class="arrow" onclick="toggleFolder('6_10_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1PropagationBaseObject.html" target="_self">PropagationBaseObject</a></td><td class="desc">NOLINT </td></tr>
|
|
<tr id="row_6_10_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1Assignment.html" target="_self">Assignment</a></td><td class="desc">An <a class="el" href="classoperations__research_1_1Assignment.html" title="An Assignment is a variable -> domains mapping, used to report solutions to the user.">Assignment</a> is a variable -> domains mapping, used to report solutions to the user </td></tr>
|
|
<tr id="row_6_10_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_6_10_1_" class="arrow" onclick="toggleFolder('6_10_1_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1Constraint.html" target="_self">Constraint</a></td><td class="desc">A constraint is the main modeling object </td></tr>
|
|
<tr id="row_6_10_1_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1CastConstraint.html" target="_self">CastConstraint</a></td><td class="desc">Cast constraints are special channeling constraints designed to keep a variable in sync with an expression </td></tr>
|
|
<tr id="row_6_10_1_1_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1DisjunctiveConstraint.html" target="_self">DisjunctiveConstraint</a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_10_1_2_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1GlobalVehicleBreaksConstraint.html" target="_self">GlobalVehicleBreaksConstraint</a></td><td class="desc"><a class="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>
|
|
<tr id="row_6_10_1_3_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1Pack.html" target="_self">Pack</a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_10_1_4_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1TypeRegulationsConstraint.html" target="_self">TypeRegulationsConstraint</a></td><td class="desc">The following constraint ensures that incompatibilities and requirements between types are respected </td></tr>
|
|
<tr id="row_6_10_2_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1IntervalVar.html" target="_self">IntervalVar</a></td><td class="desc">Interval variables are often used in scheduling </td></tr>
|
|
<tr id="row_6_10_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_6_10_3_" class="arrow" onclick="toggleFolder('6_10_3_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1IntExpr.html" target="_self">IntExpr</a></td><td class="desc">The class <a class="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>
|
|
<tr id="row_6_10_3_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1BaseIntExpr.html" target="_self">BaseIntExpr</a></td><td class="desc">This is the base class for all expressions that are not variables </td></tr>
|
|
<tr id="row_6_10_3_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span id="arr_6_10_3_1_" class="arrow" onclick="toggleFolder('6_10_3_1_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1IntVar.html" target="_self">IntVar</a></td><td class="desc">The class <a class="el" href="classoperations__research_1_1IntVar.html" title="The class IntVar is a subset of IntExpr.">IntVar</a> is a subset of <a class="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>
|
|
<tr id="row_6_10_3_1_0_" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1BooleanVar.html" target="_self">BooleanVar</a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_10_4_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SequenceVar.html" target="_self">SequenceVar</a></td><td class="desc">A sequence variable is a variable whose domain is a set of possible orderings of the interval variables </td></tr>
|
|
<tr id="row_6_11_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RoutingModelVisitor.html" target="_self">RoutingModelVisitor</a></td><td class="desc">Routing model visitor </td></tr>
|
|
<tr id="row_6_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_6_12_" class="arrow" onclick="toggleFolder('6_12_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SearchMonitor.html" target="_self">SearchMonitor</a></td><td class="desc">A search monitor is a simple set of callbacks to monitor all search events </td></tr>
|
|
<tr id="row_6_12_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LocalSearchMonitor.html" target="_self">LocalSearchMonitor</a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_12_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1OptimizeVar.html" target="_self">OptimizeVar</a></td><td class="desc">This class encapsulates an objective </td></tr>
|
|
<tr id="row_6_12_2_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1PropagationMonitor.html" target="_self">PropagationMonitor</a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_12_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_6_12_3_" class="arrow" onclick="toggleFolder('6_12_3_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SearchLimit.html" target="_self">SearchLimit</a></td><td class="desc">Base class of all search limits </td></tr>
|
|
<tr id="row_6_12_3_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RegularLimit.html" target="_self">RegularLimit</a></td><td class="desc">Usual limit based on wall_time, number of explored branches and number of failures in the search tree </td></tr>
|
|
<tr id="row_6_12_4_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SearchLog.html" target="_self">SearchLog</a></td><td class="desc">The base class of all search logs that periodically outputs information when the search is running </td></tr>
|
|
<tr id="row_6_12_5_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SolutionCollector.html" target="_self">SolutionCollector</a></td><td class="desc">This class is the root class of all solution collectors </td></tr>
|
|
<tr id="row_6_13_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SolutionPool.html" target="_self">SolutionPool</a></td><td class="desc">This class is used to manage a pool of solutions </td></tr>
|
|
<tr id="row_7_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1SimpleBoundCosts_1_1BoundCost.html" target="_self">SimpleBoundCosts::BoundCost</a></td><td class="desc"></td></tr>
|
|
<tr id="row_8_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1RoutingModel_1_1CostClass.html" target="_self">RoutingModel::CostClass</a></td><td class="desc"></td></tr>
|
|
<tr id="row_9_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1CumulBoundsPropagator.html" target="_self">CumulBoundsPropagator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_10_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1DefaultPhaseParameters.html" target="_self">DefaultPhaseParameters</a></td><td class="desc">This struct holds all parameters for the default search </td></tr>
|
|
<tr id="row_11_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1RoutingModel_1_1CostClass_1_1DimensionCost.html" target="_self">RoutingModel::CostClass::DimensionCost</a></td><td class="desc">SUBTLE: The vehicle's fixed cost is skipped on purpose here, because we can afford to do so: </td></tr>
|
|
<tr id="row_12_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1DimensionCumulOptimizerCore.html" target="_self">DimensionCumulOptimizerCore</a></td><td class="desc"></td></tr>
|
|
<tr id="row_13_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html" target="_self">DisjunctivePropagator</a></td><td class="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>
|
|
<tr id="row_14_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1GlobalCheapestInsertionFilteredHeuristic_1_1GlobalCheapestInsertionParameters.html" target="_self">GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters</a></td><td class="desc"></td></tr>
|
|
<tr id="row_15_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html" target="_self">GlobalDimensionCumulOptimizer</a></td><td class="desc"></td></tr>
|
|
<tr id="row_16_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1InitAndGetValues.html" target="_self">InitAndGetValues</a></td><td class="desc">Utility class to encapsulate an <a class="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>
|
|
<tr id="row_17_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1Solver_1_1IntegerCastInfo.html" target="_self">Solver::IntegerCastInfo</a></td><td class="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>
|
|
<tr id="row_18_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1IntVarLocalSearchHandler.html" target="_self">IntVarLocalSearchHandler</a></td><td class="desc">Base operator class for operators manipulating IntVars </td></tr>
|
|
<tr id="row_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SimpleRevFIFO_1_1Iterator.html" target="_self">SimpleRevFIFO< T >::Iterator</a></td><td class="desc">This iterator is not stable with respect to deletion </td></tr>
|
|
<tr id="row_20_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1InitAndGetValues_1_1Iterator.html" target="_self">InitAndGetValues::Iterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LocalDimensionCumulOptimizer.html" target="_self">LocalDimensionCumulOptimizer</a></td><td class="desc"></td></tr>
|
|
<tr id="row_22_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LocalSearchState.html" target="_self">LocalSearchState</a></td><td class="desc"></td></tr>
|
|
<tr id="row_23_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LocalSearchVariable.html" target="_self">LocalSearchVariable</a></td><td class="desc"></td></tr>
|
|
<tr id="row_24_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_24_" class="arrow" onclick="toggleFolder('24_')">▼</span><span class="icona"><span class="icon">C</span></span><b>Message</b></td><td class="desc"></td></tr>
|
|
<tr id="row_24_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1FirstSolutionStrategy.html" target="_self">FirstSolutionStrategy</a></td><td class="desc"></td></tr>
|
|
<tr id="row_24_1_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LocalSearchMetaheuristic.html" target="_self">LocalSearchMetaheuristic</a></td><td class="desc"></td></tr>
|
|
<tr id="row_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ModelCache.html" target="_self">ModelCache</a></td><td class="desc">Implements a complete cache for model elements: expressions and constraints </td></tr>
|
|
<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1TypeRegulationsChecker_1_1NodeCount.html" target="_self">TypeRegulationsChecker::NodeCount</a></td><td class="desc"></td></tr>
|
|
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1RoutingDimension_1_1NodePrecedence.html" target="_self">RoutingDimension::NodePrecedence</a></td><td class="desc"></td></tr>
|
|
<tr id="row_28_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_28_" class="arrow" onclick="toggleFolder('28_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1Rev.html" target="_self">Rev< T ></a></td><td class="desc">This class adds reversibility to a POD type </td></tr>
|
|
<tr id="row_28_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1NumericalRev.html" target="_self">NumericalRev< T ></a></td><td class="desc">Subclass of Rev<T> which adds numerical operations </td></tr>
|
|
<tr id="row_29_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_29_" class="arrow" onclick="toggleFolder('29_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1Rev.html" target="_self">Rev< int ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_29_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1NumericalRev.html" target="_self">NumericalRev< int ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_30_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1Rev.html" target="_self">Rev< uint64 ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_31_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_31_" class="arrow" onclick="toggleFolder('31_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RevArray.html" target="_self">RevArray< T ></a></td><td class="desc">Reversible array of POD types </td></tr>
|
|
<tr id="row_31_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1NumericalRevArray.html" target="_self">NumericalRevArray< T ></a></td><td class="desc">Subclass of RevArray<T> which adds numerical operations </td></tr>
|
|
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RevArray.html" target="_self">RevArray< uint64 ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_33_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_33_" class="arrow" onclick="toggleFolder('33_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RevBitSet.html" target="_self">RevBitSet</a></td><td class="desc">This class represents a reversible bitset </td></tr>
|
|
<tr id="row_33_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RevBitMatrix.html" target="_self">RevBitMatrix</a></td><td class="desc">Matrix version of the <a class="el" href="classoperations__research_1_1RevBitSet.html" title="This class represents a reversible bitset.">RevBitSet</a> class </td></tr>
|
|
<tr id="row_34_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RevGrowingArray.html" target="_self">RevGrowingArray< T, C ></a></td><td class="desc">This class is a reversible growing array </td></tr>
|
|
<tr id="row_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RevImmutableMultiMap.html" target="_self">RevImmutableMultiMap< K, V ></a></td><td class="desc">Reversible Immutable MultiMap class </td></tr>
|
|
<tr id="row_36_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RevIntSet.html" target="_self">RevIntSet< T ></a></td><td class="desc">This is a special class to represent a 'residual' set of T </td></tr>
|
|
<tr id="row_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RevIntSet.html" target="_self">RevIntSet< int ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_38_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RevPartialSequence.html" target="_self">RevPartialSequence</a></td><td class="desc">--— <a class="el" href="classoperations__research_1_1RevPartialSequence.html" title="--— RevPartialSequence --—">RevPartialSequence</a> --— </td></tr>
|
|
<tr id="row_39_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RevSwitch.html" target="_self">RevSwitch</a></td><td class="desc">A reversible switch that can switch once from false to true </td></tr>
|
|
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RoutingDimension.html" target="_self">RoutingDimension</a></td><td class="desc">Dimensions represent quantities accumulated at nodes along the routes </td></tr>
|
|
<tr id="row_41_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RoutingIndexManager.html" target="_self">RoutingIndexManager</a></td><td class="desc">Manager for any NodeIndex <-> variable index conversion </td></tr>
|
|
<tr id="row_42_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1RoutingModel.html" target="_self">RoutingModel</a></td><td class="desc"></td></tr>
|
|
<tr id="row_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SavingsFilteredHeuristic_1_1SavingsContainer.html" target="_self">SavingsFilteredHeuristic::SavingsContainer< S ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_44_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1SavingsFilteredHeuristic_1_1SavingsParameters.html" target="_self">SavingsFilteredHeuristic::SavingsParameters</a></td><td class="desc"></td></tr>
|
|
<tr id="row_45_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1Solver_1_1SearchLogParameters.html" target="_self">Solver::SearchLogParameters</a></td><td class="desc">Creates a search monitor from logging parameters </td></tr>
|
|
<tr id="row_46_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SequenceVarLocalSearchHandler.html" target="_self">SequenceVarLocalSearchHandler</a></td><td class="desc"></td></tr>
|
|
<tr id="row_47_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SimpleBoundCosts.html" target="_self">SimpleBoundCosts</a></td><td class="desc">A structure meant to store soft bounds and associated violation constants </td></tr>
|
|
<tr id="row_48_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SimpleRevFIFO.html" target="_self">SimpleRevFIFO< T ></a></td><td class="desc">This class represent a reversible FIFO structure </td></tr>
|
|
<tr id="row_49_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SimpleRevFIFO.html" target="_self">SimpleRevFIFO< operations_research::Demon * ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_50_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SmallRevBitSet.html" target="_self">SmallRevBitSet</a></td><td class="desc">This class represents a small reversible bitset (size <= 64) </td></tr>
|
|
<tr id="row_51_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1SolutionCollector_1_1SolutionData.html" target="_self">SolutionCollector::SolutionData</a></td><td class="desc"></td></tr>
|
|
<tr id="row_52_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1Solver.html" target="_self">Solver</a></td><td class="desc"><a class="el" href="classoperations__research_1_1Solver.html" title="Solver Class.">Solver</a> Class </td></tr>
|
|
<tr id="row_53_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1CheapestInsertionFilteredHeuristic_1_1StartEndValue.html" target="_self">CheapestInsertionFilteredHeuristic::StartEndValue</a></td><td class="desc"></td></tr>
|
|
<tr id="row_54_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1RoutingModel_1_1StateDependentTransit.html" target="_self">RoutingModel::StateDependentTransit</a></td><td class="desc">What follows is relevant for models with time/state dependent transits </td></tr>
|
|
<tr id="row_55_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SweepArranger.html" target="_self">SweepArranger</a></td><td class="desc">Class to arrange indices by by their distance and their angles from the depot </td></tr>
|
|
<tr id="row_56_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structTableStruct__ortools__2fconstraint__5fsolver__2frouting__5fenums__2eproto.html" target="_self">TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fenums_2eproto</a></td><td class="desc"></td></tr>
|
|
<tr id="row_57_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html" target="_self">DisjunctivePropagator::Tasks</a></td><td class="desc">A structure to hold tasks described by their features </td></tr>
|
|
<tr id="row_58_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_58_" class="arrow" onclick="toggleFolder('58_')">▼</span><span class="icona"><span class="icon">C</span></span><b>true_type</b></td><td class="desc"></td></tr>
|
|
<tr id="row_58_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structis__proto__enum_3_01_1_1operations__research_1_1FirstSolutionStrategy__Value_01_4.html" target="_self">is_proto_enum< ::operations_research::FirstSolutionStrategy_Value ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_58_1_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structis__proto__enum_3_01_1_1operations__research_1_1LocalSearchMetaheuristic__Value_01_4.html" target="_self">is_proto_enum< ::operations_research::LocalSearchMetaheuristic_Value ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_59_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_59_" class="arrow" onclick="toggleFolder('59_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1TypeRegulationsChecker.html" target="_self">TypeRegulationsChecker</a></td><td class="desc"></td></tr>
|
|
<tr id="row_59_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1TypeIncompatibilityChecker.html" target="_self">TypeIncompatibilityChecker</a></td><td class="desc">Checker for type incompatibilities </td></tr>
|
|
<tr id="row_59_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1TypeRequirementChecker.html" target="_self">TypeRequirementChecker</a></td><td class="desc">Checker for type requirements </td></tr>
|
|
<tr id="row_60_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1UnsortedNullableRevBitset.html" target="_self">UnsortedNullableRevBitset</a></td><td class="desc">This class represents a reversible bitset </td></tr>
|
|
<tr id="row_61_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1RoutingModel_1_1VehicleClass.html" target="_self">RoutingModel::VehicleClass</a></td><td class="desc"></td></tr>
|
|
<tr id="row_62_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1SavingsFilteredHeuristic_1_1VehicleClassEntry.html" target="_self">SavingsFilteredHeuristic::VehicleClassEntry</a></td><td class="desc"></td></tr>
|
|
</table>
|
|
</div><!-- directory -->
|
|
</div><!-- contents -->
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|