246 lines
59 KiB
HTML
246 lines
59 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"/>-->
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">Google OR-Tools 8.0</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.20 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('hierarchy.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<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>]</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_1_argument_holder.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:0px;display:inline-block;"> </span><span id="arr_1_" class="arrow" onclick="toggleFolder('1_')">►</span><span class="icona"><span class="icon">C</span></span><b>BaseObject</b></td><td class="desc"></td></tr>
|
|
<tr id="row_1_0_" class="even" style="display:none;"><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_1_array_with_offset.html" target="_self">ArrayWithOffset< T ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_1_" class="arrow" onclick="toggleFolder('1_1_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_local_search_filter.html" target="_self">LocalSearchFilter</a></td><td class="desc">Local Search Filters are used for fast neighbor pruning </td></tr>
|
|
<tr id="row_1_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_1_1_0_" class="arrow" onclick="toggleFolder('1_1_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_int_var_local_search_filter.html" target="_self">IntVarLocalSearchFilter</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_1_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_1_base_path_filter.html" target="_self">BasePathFilter</a></td><td class="desc">Generic path-based filter class </td></tr>
|
|
<tr id="row_1_1_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_1_c_p_feasibility_filter.html" target="_self">CPFeasibilityFilter</a></td><td class="desc">This filter accepts deltas for which the assignment satisfies the constraints of the Solver </td></tr>
|
|
<tr id="row_1_2_" class="even" style="display:none;"><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_1_local_search_filter_manager.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_1_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_3_" class="arrow" onclick="toggleFolder('1_3_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_local_search_operator.html" target="_self">LocalSearchOperator</a></td><td class="desc">The base class for all local search operators </td></tr>
|
|
<tr id="row_1_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_1_3_0_" class="arrow" onclick="toggleFolder('1_3_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_var_local_search_operator.html" target="_self">VarLocalSearchOperator< V, Val, Handler ></a></td><td class="desc">Base operator class for operators manipulating variables </td></tr>
|
|
<tr id="row_1_3_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_1_sequence_var_local_search_operator.html" target="_self">SequenceVarLocalSearchOperator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_3_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_1_3_1_" class="arrow" onclick="toggleFolder('1_3_1_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_var_local_search_operator.html" target="_self">VarLocalSearchOperator< IntVar, int64, IntVarLocalSearchHandler ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_3_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span id="arr_1_3_1_0_" class="arrow" onclick="toggleFolder('1_3_1_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_int_var_local_search_operator.html" target="_self">IntVarLocalSearchOperator</a></td><td class="desc">Specialization of <a class="el" href="classoperations__research_1_1_local_search_operator.html" title="The base class for all local search operators.">LocalSearchOperator</a> built from an array of IntVars which specifies the scope of the operator </td></tr>
|
|
<tr id="row_1_3_1_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_1_base_lns.html" target="_self">BaseLns</a></td><td class="desc">This is the base class for building an Lns operator </td></tr>
|
|
<tr id="row_1_3_1_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_1_change_value.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_1_3_1_0_2_" 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_1_filtered_heuristic_close_nodes_l_n_s_operator.html" target="_self">FilteredHeuristicCloseNodesLNSOperator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_3_1_0_3_" 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_1_filtered_heuristic_expensive_chain_l_n_s_operator.html" target="_self">FilteredHeuristicExpensiveChainLNSOperator</a></td><td class="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>
|
|
<tr id="row_1_3_1_0_4_" 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_1_filtered_heuristic_path_l_n_s_operator.html" target="_self">FilteredHeuristicPathLNSOperator</a></td><td class="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>
|
|
<tr id="row_1_3_1_0_5_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span id="arr_1_3_1_0_5_" class="arrow" onclick="toggleFolder('1_3_1_0_5_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_path_operator.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_1_3_1_0_5_0_" class="even" 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_1_exchange_subtrip.html" target="_self">ExchangeSubtrip</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_3_1_0_5_1_" class="even" 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_1_index_pair_swap_active_operator.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_1_3_1_0_5_2_" class="even" 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_1_light_pair_relocate_operator.html" target="_self">LightPairRelocateOperator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_3_1_0_5_3_" class="even" 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_1_make_pair_active_operator.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_1_3_1_0_5_4_" class="even" 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_1_make_pair_inactive_operator.html" target="_self">MakePairInactiveOperator</a></td><td class="desc">Operator which makes pairs of active nodes inactive </td></tr>
|
|
<tr id="row_1_3_1_0_5_5_" class="even" 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_1_make_relocate_neighbors_operator.html" target="_self">MakeRelocateNeighborsOperator</a></td><td class="desc">Relocate neighborhood which moves chains of neighbors </td></tr>
|
|
<tr id="row_1_3_1_0_5_6_" class="even" 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_1_pair_exchange_operator.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_1_3_1_0_5_7_" class="even" 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_1_pair_exchange_relocate_operator.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_1_3_1_0_5_8_" class="even" 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_1_pair_node_swap_active_operator.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_1_3_1_0_5_9_" class="even" 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_1_pair_relocate_operator.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_1_3_1_0_5_10_" class="even" 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_1_relocate_expensive_chain.html" target="_self">RelocateExpensiveChain</a></td><td class="desc"><a class="el" href="classoperations__research_1_1_relocate_expensive_chain.html" title="RelocateExpensiveChain.">RelocateExpensiveChain</a> </td></tr>
|
|
<tr id="row_1_3_1_0_5_11_" class="even" 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_1_relocate_subtrip.html" target="_self">RelocateSubtrip</a></td><td class="desc">Tries to move subtrips after an insertion node </td></tr>
|
|
<tr id="row_1_3_1_0_6_" 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_1_swap_index_pair_operator.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_1_4_" class="even" style="display:none;"><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_1_routing_model_visitor.html" target="_self">RoutingModelVisitor</a></td><td class="desc">Routing model visitor </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="structoperations__research_1_1_simple_bound_costs_1_1_bound_cost.html" target="_self">SimpleBoundCosts::BoundCost</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_1_path_state_1_1_chain.html" target="_self">PathState::Chain</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_1_path_state_1_1_chain_range.html" target="_self">PathState::ChainRange</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><b>Constraint</b></td><td class="desc"></td></tr>
|
|
<tr id="row_5_0_" class="even" style="display:none;"><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_1_global_vehicle_breaks_constraint.html" target="_self">GlobalVehicleBreaksConstraint</a></td><td class="desc"><a class="el" href="classoperations__research_1_1_global_vehicle_breaks_constraint.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_5_1_" class="even" style="display:none;"><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_1_type_regulations_constraint.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_" 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_1_routing_model_1_1_cost_class.html" target="_self">RoutingModel::CostClass</a></td><td class="desc"></td></tr>
|
|
<tr id="row_7_"><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_1_cumul_bounds_propagator.html" target="_self">CumulBoundsPropagator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_8_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">►</span><span class="icona"><span class="icon">C</span></span><b>DecisionBuilder</b></td><td class="desc"></td></tr>
|
|
<tr id="row_8_0_" style="display:none;"><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_1_int_var_filtered_decision_builder.html" target="_self">IntVarFilteredDecisionBuilder</a></td><td class="desc">Decision builder building a solution using heuristics with local search filters to evaluate its feasibility </td></tr>
|
|
<tr id="row_9_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">►</span><span class="icona"><span class="icon">C</span></span><b>DecisionVisitor</b></td><td class="desc"></td></tr>
|
|
<tr id="row_9_0_" class="even" style="display:none;"><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_1_symmetry_breaker.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_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">►</span><span class="icona"><span class="icon">C</span></span><b>Demon</b></td><td class="desc"></td></tr>
|
|
<tr id="row_10_0_" style="display:none;"><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_1_call_method0.html" target="_self">CallMethod0< T ></a></td><td class="desc">Demon proxy to a method on the constraint with no arguments </td></tr>
|
|
<tr id="row_10_1_" style="display:none;"><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_1_call_method1.html" target="_self">CallMethod1< T, P ></a></td><td class="desc">Demon proxy to a method on the constraint with one argument </td></tr>
|
|
<tr id="row_10_2_" style="display:none;"><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_1_call_method2.html" target="_self">CallMethod2< T, P, Q ></a></td><td class="desc">Demon proxy to a method on the constraint with two arguments </td></tr>
|
|
<tr id="row_10_3_" style="display:none;"><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_1_call_method3.html" target="_self">CallMethod3< T, P, Q, R ></a></td><td class="desc">Demon proxy to a method on the constraint with three arguments </td></tr>
|
|
<tr id="row_10_4_" style="display:none;"><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_1_delayed_call_method0.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_10_5_" style="display:none;"><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_1_delayed_call_method1.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_10_6_" style="display:none;"><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_1_delayed_call_method2.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_11_"><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_1_routing_model_1_1_cost_class_1_1_dimension_cost.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_" 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_1_dimension_cumul_optimizer_core.html" target="_self">DimensionCumulOptimizerCore</a></td><td class="desc"></td></tr>
|
|
<tr id="row_13_"><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_1_disjunctive_propagator.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_" 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_1_local_search_filter_manager_1_1_filter_event.html" target="_self">LocalSearchFilterManager::FilterEvent</a></td><td class="desc"></td></tr>
|
|
<tr id="row_15_"><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_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html" target="_self">GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters</a></td><td class="desc"></td></tr>
|
|
<tr id="row_16_" 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_1_global_dimension_cumul_optimizer.html" target="_self">GlobalDimensionCumulOptimizer</a></td><td class="desc"></td></tr>
|
|
<tr id="row_17_"><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_1_unary_dimension_checker_1_1_interval.html" target="_self">UnaryDimensionChecker::Interval</a></td><td class="desc"></td></tr>
|
|
<tr id="row_18_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_18_" class="arrow" onclick="toggleFolder('18_')">►</span><span class="icona"><span class="icon">C</span></span><b>IntExpr</b></td><td class="desc"></td></tr>
|
|
<tr id="row_18_0_" style="display:none;"><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_1_base_int_expr.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_19_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_19_" class="arrow" onclick="toggleFolder('19_')">►</span><span class="icona"><span class="icon">C</span></span><b>IntVar</b></td><td class="desc"></td></tr>
|
|
<tr id="row_19_0_" class="even" style="display:none;"><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_1_boolean_var.html" target="_self">BooleanVar</a></td><td class="desc"></td></tr>
|
|
<tr id="row_20_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_20_" class="arrow" onclick="toggleFolder('20_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_int_var_filtered_heuristic.html" target="_self">IntVarFilteredHeuristic</a></td><td class="desc">Generic filter-based heuristic applied to IntVars </td></tr>
|
|
<tr id="row_20_0_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_20_0_" class="arrow" onclick="toggleFolder('20_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_routing_filtered_heuristic.html" target="_self">RoutingFilteredHeuristic</a></td><td class="desc">Filter-based heuristic dedicated to routing </td></tr>
|
|
<tr id="row_20_0_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_20_0_0_" class="arrow" onclick="toggleFolder('20_0_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.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_20_0_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_1_comparator_cheapest_addition_filtered_heuristic.html" target="_self">ComparatorCheapestAdditionFilteredHeuristic</a></td><td class="desc">A <a class="el" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.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_20_0_0_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_1_evaluator_cheapest_addition_filtered_heuristic.html" target="_self">EvaluatorCheapestAdditionFilteredHeuristic</a></td><td class="desc">A <a class="el" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.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_20_0_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_20_0_1_" class="arrow" onclick="toggleFolder('20_0_1_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html" target="_self">CheapestInsertionFilteredHeuristic</a></td><td class="desc"></td></tr>
|
|
<tr id="row_20_0_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_1_global_cheapest_insertion_filtered_heuristic.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_20_0_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_1_local_cheapest_insertion_filtered_heuristic.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_20_0_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_1_christofides_filtered_heuristic.html" target="_self">ChristofidesFilteredHeuristic</a></td><td class="desc">Christofides addition heuristic </td></tr>
|
|
<tr id="row_20_0_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_20_0_3_" class="arrow" onclick="toggleFolder('20_0_3_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_savings_filtered_heuristic.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_20_0_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_1_parallel_savings_filtered_heuristic.html" target="_self">ParallelSavingsFilteredHeuristic</a></td><td class="desc"></td></tr>
|
|
<tr id="row_20_0_3_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_1_sequential_savings_filtered_heuristic.html" target="_self">SequentialSavingsFilteredHeuristic</a></td><td class="desc"></td></tr>
|
|
<tr id="row_21_"><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_1_int_var_local_search_handler.html" target="_self">IntVarLocalSearchHandler</a></td><td class="desc"></td></tr>
|
|
<tr id="row_22_" 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_1_path_state_1_1_chain_1_1_iterator.html" target="_self">PathState::Chain::Iterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_23_"><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_1_path_state_1_1_chain_range_1_1_iterator.html" target="_self">PathState::ChainRange::Iterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_24_" 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_1_path_state_1_1_node_range_1_1_iterator.html" target="_self">PathState::NodeRange::Iterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_25_"><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_1_simple_rev_f_i_f_o_1_1_iterator.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_26_" 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_1_local_dimension_cumul_optimizer.html" target="_self">LocalDimensionCumulOptimizer</a></td><td class="desc"></td></tr>
|
|
<tr id="row_27_"><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_1_local_search_state.html" target="_self">LocalSearchState</a></td><td class="desc"></td></tr>
|
|
<tr id="row_28_" 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_1_local_search_variable.html" target="_self">LocalSearchVariable</a></td><td class="desc"></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><b>Message</b></td><td class="desc"></td></tr>
|
|
<tr id="row_29_0_" class="even" style="display:none;"><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_1_p_r_o_t_o_b_u_f___f_i_n_a_l.html" target="_self">PROTOBUF_FINAL</a></td><td class="desc"></td></tr>
|
|
<tr id="row_30_" 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_1_model_cache.html" target="_self">ModelCache</a></td><td class="desc">Implements a complete cache for model elements: expressions and constraints </td></tr>
|
|
<tr id="row_31_"><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><b>ModelVisitor</b></td><td class="desc"></td></tr>
|
|
<tr id="row_31_0_" class="even" style="display:none;"><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_1_model_parser.html" target="_self">ModelParser</a></td><td class="desc">Model Parser </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="structoperations__research_1_1_routing_dimension_1_1_node_precedence.html" target="_self">RoutingDimension::NodePrecedence</a></td><td class="desc"></td></tr>
|
|
<tr id="row_33_"><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_1_path_state_1_1_node_range.html" target="_self">PathState::NodeRange</a></td><td class="desc"></td></tr>
|
|
<tr id="row_34_" 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_1_path_state.html" target="_self">PathState</a></td><td class="desc"></td></tr>
|
|
<tr id="row_35_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_35_" class="arrow" onclick="toggleFolder('35_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_rev_bit_set.html" target="_self">RevBitSet</a></td><td class="desc">This class represents a reversible bitset </td></tr>
|
|
<tr id="row_35_0_" class="even" style="display:none;"><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_1_rev_bit_matrix.html" target="_self">RevBitMatrix</a></td><td class="desc">Matrix version of the <a class="el" href="classoperations__research_1_1_rev_bit_set.html" title="This class represents a reversible bitset.">RevBitSet</a> class </td></tr>
|
|
<tr id="row_36_" 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_1_rev_growing_array.html" target="_self">RevGrowingArray< T, C ></a></td><td class="desc">This class is a reversible growing array </td></tr>
|
|
<tr id="row_37_"><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_1_rev_immutable_multi_map.html" target="_self">RevImmutableMultiMap< K, V ></a></td><td class="desc">Reversible Immutable MultiMap class </td></tr>
|
|
<tr id="row_38_" 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_1_rev_int_set.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_39_"><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_1_rev_int_set.html" target="_self">RevIntSet< int ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_40_" 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_1_rev_partial_sequence.html" target="_self">RevPartialSequence</a></td><td class="desc">--— <a class="el" href="classoperations__research_1_1_rev_partial_sequence.html" title="--— RevPartialSequence --—">RevPartialSequence</a> --— </td></tr>
|
|
<tr id="row_41_"><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_1_rev_switch.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_42_" 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_1_routing_dimension.html" target="_self">RoutingDimension</a></td><td class="desc">Dimensions represent quantities accumulated at nodes along the routes </td></tr>
|
|
<tr id="row_43_"><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_1_routing_index_manager.html" target="_self">RoutingIndexManager</a></td><td class="desc">Manager for any NodeIndex <-> variable index conversion </td></tr>
|
|
<tr id="row_44_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_44_" class="arrow" onclick="toggleFolder('44_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_routing_linear_solver_wrapper.html" target="_self">RoutingLinearSolverWrapper</a></td><td class="desc"></td></tr>
|
|
<tr id="row_44_0_" style="display:none;"><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_1_routing_c_p_sat_wrapper.html" target="_self">RoutingCPSatWrapper</a></td><td class="desc"></td></tr>
|
|
<tr id="row_44_1_" style="display:none;"><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_1_routing_glop_wrapper.html" target="_self">RoutingGlopWrapper</a></td><td class="desc"></td></tr>
|
|
<tr id="row_45_"><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_1_routing_model.html" target="_self">RoutingModel</a></td><td class="desc"></td></tr>
|
|
<tr id="row_46_" 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_1_savings_filtered_heuristic_1_1_savings_container.html" target="_self">SavingsFilteredHeuristic::SavingsContainer< S ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_47_"><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_1_savings_filtered_heuristic_1_1_savings_container.html" target="_self">SavingsFilteredHeuristic::SavingsContainer< Saving ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_48_" 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_1_savings_filtered_heuristic_1_1_savings_parameters.html" target="_self">SavingsFilteredHeuristic::SavingsParameters</a></td><td class="desc"></td></tr>
|
|
<tr id="row_49_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_49_" class="arrow" onclick="toggleFolder('49_')">►</span><span class="icona"><span class="icon">C</span></span><b>SearchMonitor</b></td><td class="desc"></td></tr>
|
|
<tr id="row_49_0_" class="even" style="display:none;"><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_1_local_search_monitor.html" target="_self">LocalSearchMonitor</a></td><td class="desc"></td></tr>
|
|
<tr id="row_49_1_" class="even" style="display:none;"><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_1_propagation_monitor.html" target="_self">PropagationMonitor</a></td><td class="desc"></td></tr>
|
|
<tr id="row_49_2_" class="even" style="display:none;"><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_1_search_log.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_50_" 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_1_sequence_var_local_search_handler.html" target="_self">SequenceVarLocalSearchHandler</a></td><td class="desc"></td></tr>
|
|
<tr id="row_51_"><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_1_simple_bound_costs.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_52_" 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_1_simple_rev_f_i_f_o.html" target="_self">SimpleRevFIFO< T ></a></td><td class="desc">This class represent a reversible FIFO structure </td></tr>
|
|
<tr id="row_53_"><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_1_simple_rev_f_i_f_o.html" target="_self">SimpleRevFIFO< Demon * ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_54_" 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_1_small_rev_bit_set.html" target="_self">SmallRevBitSet</a></td><td class="desc">This class represents a small reversible bitset (size <= 64) </td></tr>
|
|
<tr id="row_55_"><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_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html" target="_self">CheapestInsertionFilteredHeuristic::StartEndValue</a></td><td class="desc"></td></tr>
|
|
<tr id="row_56_" 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_1_routing_model_1_1_state_dependent_transit.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_57_"><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_1_sweep_arranger.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_58_" 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="struct_table_struct__ortools__2fconstraint__5fsolver__2fassignment__2eproto.html" target="_self">TableStruct_ortools_2fconstraint_5fsolver_2fassignment_2eproto</a></td><td class="desc"></td></tr>
|
|
<tr id="row_59_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="struct_table_struct__ortools__2fconstraint__5fsolver__2fdemon__5fprofiler__2eproto.html" target="_self">TableStruct_ortools_2fconstraint_5fsolver_2fdemon_5fprofiler_2eproto</a></td><td class="desc"></td></tr>
|
|
<tr id="row_60_" 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="struct_table_struct__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_61_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="struct_table_struct__ortools__2fconstraint__5fsolver__2frouting__5fparameters__2eproto.html" target="_self">TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto</a></td><td class="desc"></td></tr>
|
|
<tr id="row_62_" 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="struct_table_struct__ortools__2fconstraint__5fsolver__2fsearch__5flimit__2eproto.html" target="_self">TableStruct_ortools_2fconstraint_5fsolver_2fsearch_5flimit_2eproto</a></td><td class="desc"></td></tr>
|
|
<tr id="row_63_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="struct_table_struct__ortools__2fconstraint__5fsolver__2fsolver__5fparameters__2eproto.html" target="_self">TableStruct_ortools_2fconstraint_5fsolver_2fsolver_5fparameters_2eproto</a></td><td class="desc"></td></tr>
|
|
<tr id="row_64_" 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_1_disjunctive_propagator_1_1_tasks.html" target="_self">DisjunctivePropagator::Tasks</a></td><td class="desc">A structure to hold tasks described by their features </td></tr>
|
|
<tr id="row_65_"><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_1_travel_bounds.html" target="_self">TravelBounds</a></td><td class="desc"></td></tr>
|
|
<tr id="row_66_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_66_" class="arrow" onclick="toggleFolder('66_')">►</span><span class="icona"><span class="icon">C</span></span><b>true_type</b></td><td class="desc"></td></tr>
|
|
<tr id="row_66_0_" style="display:none;"><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_1_constraint_solver_parameters___trail_compression_01_4.html" target="_self">is_proto_enum< ::operations_research::ConstraintSolverParameters_TrailCompression ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_66_1_" style="display:none;"><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_1_first_solution_strategy___value_01_4.html" target="_self">is_proto_enum< ::operations_research::FirstSolutionStrategy_Value ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_66_2_" style="display:none;"><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_1_local_search_metaheuristic___value_01_4.html" target="_self">is_proto_enum< ::operations_research::LocalSearchMetaheuristic_Value ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_66_3_" style="display:none;"><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_1_routing_search_parameters___scheduling_solver_01_4.html" target="_self">is_proto_enum< ::operations_research::RoutingSearchParameters_SchedulingSolver ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_67_"><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_1_type_regulations_checker_1_1_type_policy_occurrence.html" target="_self">TypeRegulationsChecker::TypePolicyOccurrence</a></td><td class="desc"></td></tr>
|
|
<tr id="row_68_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_68_" class="arrow" onclick="toggleFolder('68_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_type_regulations_checker.html" target="_self">TypeRegulationsChecker</a></td><td class="desc"></td></tr>
|
|
<tr id="row_68_0_" style="display:none;"><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_1_type_incompatibility_checker.html" target="_self">TypeIncompatibilityChecker</a></td><td class="desc">Checker for type incompatibilities </td></tr>
|
|
<tr id="row_68_1_" style="display:none;"><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_1_type_requirement_checker.html" target="_self">TypeRequirementChecker</a></td><td class="desc">Checker for type requirements </td></tr>
|
|
<tr id="row_69_"><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_1_unary_dimension_checker.html" target="_self">UnaryDimensionChecker</a></td><td class="desc"></td></tr>
|
|
<tr id="row_70_" 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_1_unsorted_nullable_rev_bitset.html" target="_self">UnsortedNullableRevBitset</a></td><td class="desc">This class represents a reversible bitset </td></tr>
|
|
<tr id="row_71_"><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_1_routing_model_1_1_vehicle_class.html" target="_self">RoutingModel::VehicleClass</a></td><td class="desc"></td></tr>
|
|
<tr id="row_72_" 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_1_routing_model_1_1_vehicle_type_container_1_1_vehicle_class_entry.html" target="_self">RoutingModel::VehicleTypeContainer::VehicleClassEntry</a></td><td class="desc"></td></tr>
|
|
<tr id="row_73_"><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_1_routing_model_1_1_vehicle_type_container.html" target="_self">RoutingModel::VehicleTypeContainer</a></td><td class="desc">Struct used to sort and store vehicles by their type </td></tr>
|
|
<tr id="row_74_" 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_1_vehicle_type_curator.html" target="_self">VehicleTypeCurator</a></td><td class="desc"></td></tr>
|
|
</table>
|
|
</div><!-- directory -->
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|