2020-09-02 09:42:51 +02:00
<!-- HTML header for doxygen 1.8.18 -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
< html xmlns = "http://www.w3.org/1999/xhtml" >
< head >
< meta http-equiv = "Content-Type" content = "text/xhtml;charset=UTF-8" / >
< meta http-equiv = "X-UA-Compatible" content = "IE=9" / >
2020-10-09 12:00:09 +02:00
< meta name = "generator" content = "Doxygen 1.8.20" / >
2020-09-02 09:42:51 +02:00
< meta name = "viewport" content = "width=device-width, initial-scale=1" / >
< title > OR-Tools: timetable_edgefinding.h Source File< / title >
< link href = "tabs.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "jquery.js" > < / script >
< script type = "text/javascript" src = "dynsections.js" > < / script >
< link href = "navtree.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "resize.js" > < / script >
< script type = "text/javascript" src = "navtreedata.js" > < / script >
< script type = "text/javascript" src = "navtree.js" > < / script >
< link href = "search/search.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "search/searchdata.js" > < / script >
< script type = "text/javascript" src = "search/search.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 = "top" > <!-- do not remove this div, it is closed by doxygen! -->
< div id = "titlearea" >
< table cellspacing = "0" cellpadding = "0" >
< tbody >
< tr style = "height: 56px;" >
< td id = "projectlogo" > < img alt = "Logo" src = "orLogo.png" / > < / td >
< td id = "projectalign" style = "padding-left: 0.5em;" >
< div id = "projectname" > OR-Tools
2020-11-18 14:53:30 +01:00
  < span id = "projectnumber" > 8.1< / span >
2020-09-02 09:42:51 +02:00
< / div >
< / td >
< / tr >
< / tbody >
< / table >
< / div >
<!-- end header part -->
2020-10-09 12:00:09 +02:00
<!-- Generated by Doxygen 1.8.20 -->
2020-09-02 09:42:51 +02:00
< 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('timetable__edgefinding_8h_source.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" > timetable_edgefinding.h< / div > < / div >
< / div > <!-- header -->
< div class = "contents" >
< a href = "timetable__edgefinding_8h.html" > Go to the documentation of this file.< / a > < div class = "fragment" > < div class = "line" > < a name = "l00001" > < / a > < span class = "lineno" > 1< / span >   < span class = "comment" > // Copyright 2010-2018 Google LLC< / span > < / div >
< div class = "line" > < a name = "l00002" > < / a > < span class = "lineno" > 2< / span >   < span class = "comment" > // Licensed under the Apache License, Version 2.0 (the " License" );< / span > < / div >
< div class = "line" > < a name = "l00003" > < / a > < span class = "lineno" > 3< / span >   < span class = "comment" > // you may not use this file except in compliance with the License.< / span > < / div >
< div class = "line" > < a name = "l00004" > < / a > < span class = "lineno" > 4< / span >   < span class = "comment" > // You may obtain a copy of the License at< / span > < / div >
< div class = "line" > < a name = "l00005" > < / a > < span class = "lineno" > 5< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00006" > < / a > < span class = "lineno" > 6< / span >   < span class = "comment" > // http://www.apache.org/licenses/LICENSE-2.0< / span > < / div >
< div class = "line" > < a name = "l00007" > < / a > < span class = "lineno" > 7< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00008" > < / a > < span class = "lineno" > 8< / span >   < span class = "comment" > // Unless required by applicable law or agreed to in writing, software< / span > < / div >
< div class = "line" > < a name = "l00009" > < / a > < span class = "lineno" > 9< / span >   < span class = "comment" > // distributed under the License is distributed on an " AS IS" BASIS,< / span > < / div >
< div class = "line" > < a name = "l00010" > < / a > < span class = "lineno" > 10< / span >   < span class = "comment" > // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.< / span > < / div >
< div class = "line" > < a name = "l00011" > < / a > < span class = "lineno" > 11< / span >   < span class = "comment" > // See the License for the specific language governing permissions and< / span > < / div >
< div class = "line" > < a name = "l00012" > < / a > < span class = "lineno" > 12< / span >   < span class = "comment" > // limitations under the License.< / span > < / div >
< div class = "line" > < a name = "l00013" > < / a > < span class = "lineno" > 13< / span >   < / div >
< div class = "line" > < a name = "l00014" > < / a > < span class = "lineno" > 14< / span >   < span class = "preprocessor" > #ifndef OR_TOOLS_SAT_TIMETABLE_EDGEFINDING_H_< / span > < / div >
< div class = "line" > < a name = "l00015" > < / a > < span class = "lineno" > 15< / span >   < span class = "preprocessor" > #define OR_TOOLS_SAT_TIMETABLE_EDGEFINDING_H_< / span > < / div >
< div class = "line" > < a name = "l00016" > < / a > < span class = "lineno" > 16< / span >   < / div >
< div class = "line" > < a name = "l00017" > < / a > < span class = "lineno" > 17< / span >   < span class = "preprocessor" > #include < vector> < / span > < / div >
< div class = "line" > < a name = "l00018" > < / a > < span class = "lineno" > 18< / span >   < / div >
< div class = "line" > < a name = "l00019" > < / a > < span class = "lineno" > 19< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "int__type_8h.html" > ortools/base/int_type.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00020" > < / a > < span class = "lineno" > 20< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "macros_8h.html" > ortools/base/macros.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00021" > < / a > < span class = "lineno" > 21< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "integer_8h.html" > ortools/sat/integer.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00022" > < / a > < span class = "lineno" > 22< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "intervals_8h.html" > ortools/sat/intervals.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00023" > < / a > < span class = "lineno" > 23< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "sat__base_8h.html" > ortools/sat/sat_base.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00024" > < / a > < span class = "lineno" > 24< / span >   < / div >
< div class = "line" > < a name = "l00025" > < / a > < span class = "lineno" > 25< / span >   < span class = "keyword" > namespace < / span > < a class = "code" href = "namespaceoperations__research.html" > operations_research< / a > {< / div >
< div class = "line" > < a name = "l00026" > < / a > < span class = "lineno" > 26< / span >   < span class = "keyword" > namespace < / span > sat {< / div >
< div class = "line" > < a name = "l00027" > < / a > < span class = "lineno" > 27< / span >   < / div >
< div class = "line" > < a name = "l00028" > < / a > < span class = "lineno" > 28< / span >   < span class = "comment" > // TimeTableEdgeFinding implements the timetable edge finding filtering rule< / span > < / div >
< div class = "line" > < a name = "l00029" > < / a > < span class = "lineno" > 29< / span >   < span class = "comment" > // presented in Vilim Petr, " Timetable edge finding filtering algorithm for< / span > < / div >
< div class = "line" > < a name = "l00030" > < / a > < span class = "lineno" > 30< / span >   < span class = "comment" > // discrete cumulative resources" , CPAIOR 2011,< / span > < / div >
< div class = "line" > < a name = "l00031" > < / a > < span class = "lineno" > 31< / span >   < span class = "comment" > // http://vilim.eu/petr/cpaior2011.pdf.< / span > < / div >
< div class = "line" > < a name = "l00032" > < / a > < span class = "lineno" > 32< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00033" > < / a > < span class = "lineno" > 33< / span >   < span class = "comment" > // This propagator runs in O(n^2) where n is the number of tasks. It increases< / span > < / div >
< div class = "line" > < a name = "l00034" > < / a > < span class = "lineno" > 34< / span >   < span class = "comment" > // both the start times and decreases the ending times of the tasks.< / span > < / div >
< div class = "line" > < a name = "l00035" > < / a > < span class = "lineno" > 35< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00036" > < / a > < span class = "lineno" > 36< / span >   < span class = "comment" > // Note that this propagator does not ensure that the cumulative constraint< / span > < / div >
< div class = "line" > < a name = "l00037" > < / a > < span class = "lineno" > 37< / span >   < span class = "comment" > // holds. It should thus always be used with at least a timetable propagator.< / span > < / div >
< div class = "line" > < a name = "l00038" > < / a > < span class = "lineno" > 38< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00039" > < / a > < span class = "lineno" > 39< / span >   < span class = "comment" > // ALOGRITHM:< / span > < / div >
< div class = "line" > < a name = "l00040" > < / a > < span class = "lineno" > 40< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00041" > < / a > < span class = "lineno" > 41< / span >   < span class = "comment" > // The algorithm relies on free tasks. A free task is basically a task without< / span > < / div >
< div class = "line" > < a name = "l00042" > < / a > < span class = "lineno" > 42< / span >   < span class = "comment" > // its mandatory part. For instance:< / span > < / div >
< div class = "line" > < a name = "l00043" > < / a > < span class = "lineno" > 43< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00044" > < / a > < span class = "lineno" > 44< / span >   < span class = "comment" > // s_min s_max e_min e_max< / span > < / div >
< div class = "line" > < a name = "l00045" > < / a > < span class = "lineno" > 45< / span >   < span class = "comment" > // v v v v< / span > < / div >
< div class = "line" > < a name = "l00046" > < / a > < span class = "lineno" > 46< / span >   < span class = "comment" > // task: =============================< / span > < / div >
< div class = "line" > < a name = "l00047" > < / a > < span class = "lineno" > 47< / span >   < span class = "comment" > // ^ ^ ^< / span > < / div >
< div class = "line" > < a name = "l00048" > < / a > < span class = "lineno" > 48< / span >   < span class = "comment" > // | free part | Mandatory part |< / span > < / div >
< div class = "line" > < a name = "l00049" > < / a > < span class = "lineno" > 49< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00050" > < / a > < span class = "lineno" > 50< / span >   < span class = "comment" > // Obviously, the free part of a task that has no mandatory part is equal to the< / span > < / div >
< div class = "line" > < a name = "l00051" > < / a > < span class = "lineno" > 51< / span >   < span class = "comment" > // task itself. Also, a free part cannot have a mandatory part by definition. A< / span > < / div >
< div class = "line" > < a name = "l00052" > < / a > < span class = "lineno" > 52< / span >   < span class = "comment" > // fixed task thus have no free part.< / span > < / div >
< div class = "line" > < a name = "l00053" > < / a > < span class = "lineno" > 53< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00054" > < / a > < span class = "lineno" > 54< / span >   < span class = "comment" > // The idea of the algorithm is to use free and mandatory parts separately to< / span > < / div >
< div class = "line" > < a name = "l00055" > < / a > < span class = "lineno" > 55< / span >   < span class = "comment" > // have a better estimation of the energy contained in a task interval.< / span > < / div >
< div class = "line" > < a name = "l00056" > < / a > < span class = "lineno" > 56< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00057" > < / a > < span class = "lineno" > 57< / span >   < span class = "comment" > // If the sum of the energy of all the free parts and mandatory subparts< / span > < / div >
< div class = "line" > < a name = "l00058" > < / a > < span class = "lineno" > 58< / span >   < span class = "comment" > // contained in a task interval exceeds the amount of energy available, then the< / span > < / div >
< div class = "line" > < a name = "l00059" > < / a > < span class = "lineno" > 59< / span >   < span class = "comment" > // problem is unfeasible. A task thus cannot be scheduled at its minimum start< / span > < / div >
< div class = "line" > < a name = "l00060" > < / a > < span class = "lineno" > 60< / span >   < span class = "comment" > // time if this would cause an overload in one of the task intervals.< / span > < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00061" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_time_table_edge_finding.html" > 61< / a > < / span >   < span class = "keyword" > class < / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_time_table_edge_finding.html" > TimeTableEdgeFinding< / a > : < span class = "keyword" > public< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_propagator_interface.html" > PropagatorInterface< / a > {< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00062" > < / a > < span class = "lineno" > 62< / span >   < span class = "keyword" > public< / span > :< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00063" > < / a > < span class = "lineno" > 63< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a79c007a4dcb11e92cfa7de9149d81f6f" > TimeTableEdgeFinding< / a > (< span class = "keyword" > const< / span > std::vector< AffineExpression> & demands,< / div >
< div class = "line" > < a name = "l00064" > < / a > < span class = "lineno" > 64< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_affine_expression.html" > AffineExpression< / a > < a class = "code" href = "routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf" > capacity< / a > ,< / div >
< div class = "line" > < a name = "l00065" > < / a > < span class = "lineno" > 65< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html" > SchedulingConstraintHelper< / a > * helper,< / div >
< div class = "line" > < a name = "l00066" > < / a > < span class = "lineno" > 66< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html" > IntegerTrail< / a > * integer_trail);< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00067" > < / a > < span class = "lineno" > 67< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00068" > < / a > < span class = "lineno" > 68< / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_time_table_edge_finding.html#ac1fe9b1f2b978c4283e42f12e586eb1e" > Propagate< / a > () < span class = "keyword" > final< / span > ;< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00069" > < / a > < span class = "lineno" > 69< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00070" > < / a > < span class = "lineno" > 70< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a6ee8ed57254aec3ae99d399bae5b3736" > RegisterWith< / a > (< a class = "code" href = "classoperations__research_1_1sat_1_1_generic_literal_watcher.html" > GenericLiteralWatcher< / a > * watcher);< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00071" > < / a > < span class = "lineno" > 71< / span >   < / div >
< div class = "line" > < a name = "l00072" > < / a > < span class = "lineno" > 72< / span >   < span class = "keyword" > private< / span > :< / div >
< div class = "line" > < a name = "l00073" > < / a > < span class = "lineno" > 73< / span >   < span class = "comment" > // Build the timetable and fills the mandatory_energy_before_start_min_ and< / span > < / div >
< div class = "line" > < a name = "l00074" > < / a > < span class = "lineno" > 74< / span >   < span class = "comment" > // mandatory_energy_before_end_max_.< / span > < / div >
< div class = "line" > < a name = "l00075" > < / a > < span class = "lineno" > 75< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00076" > < / a > < span class = "lineno" > 76< / span >   < span class = "comment" > // TODO(user): Share the profile building code with TimeTablingPerTask ! we do< / span > < / div >
< div class = "line" > < a name = "l00077" > < / a > < span class = "lineno" > 77< / span >   < span class = "comment" > // not really need the mandatory_energy_before_* vectors and can recompute the< / span > < / div >
< div class = "line" > < a name = "l00078" > < / a > < span class = "lineno" > 78< / span >   < span class = "comment" > // profile integral in a window efficiently during TimeTableEdgeFindingPass().< / span > < / div >
< div class = "line" > < a name = "l00079" > < / a > < span class = "lineno" > 79< / span >   < span class = "keywordtype" > void< / span > BuildTimeTable();< / div >
< div class = "line" > < a name = "l00080" > < / a > < span class = "lineno" > 80< / span >   < / div >
< div class = "line" > < a name = "l00081" > < / a > < span class = "lineno" > 81< / span >   < span class = "comment" > // Performs a single pass of the Timetable Edge Finding filtering rule to< / span > < / div >
< div class = "line" > < a name = "l00082" > < / a > < span class = "lineno" > 82< / span >   < span class = "comment" > // updates the start time of the tasks. This same function can be used to< / span > < / div >
< div class = "line" > < a name = "l00083" > < / a > < span class = "lineno" > 83< / span >   < span class = "comment" > // update the end times by calling the SwitchToMirrorProblem method first.< / span > < / div >
< div class = "line" > < a name = "l00084" > < / a > < span class = "lineno" > 84< / span >   < span class = "keywordtype" > bool< / span > TimeTableEdgeFindingPass();< / div >
< div class = "line" > < a name = "l00085" > < / a > < span class = "lineno" > 85< / span >   < / div >
< div class = "line" > < a name = "l00086" > < / a > < span class = "lineno" > 86< / span >   < span class = "comment" > // Increases the start min of task_index with the proper explanation.< / span > < / div >
< div class = "line" > < a name = "l00087" > < / a > < span class = "lineno" > 87< / span >   < span class = "keywordtype" > bool< / span > IncreaseStartMin(IntegerValue begin, IntegerValue end, < span class = "keywordtype" > int< / span > task_index,< / div >
< div class = "line" > < a name = "l00088" > < / a > < span class = "lineno" > 88< / span >   IntegerValue new_start);< / div >
< div class = "line" > < a name = "l00089" > < / a > < span class = "lineno" > 89< / span >   < / div >
< div class = "line" > < a name = "l00090" > < / a > < span class = "lineno" > 90< / span >   IntegerValue DemandMin(< span class = "keywordtype" > int< / span > task_index)< span class = "keyword" > const < / span > {< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00091" > < / a > < span class = "lineno" > 91< / span >   < span class = "keywordflow" > return< / span > integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > LowerBound< / a > (demands_[task_index]);< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00092" > < / a > < span class = "lineno" > 92< / span >   }< / div >
< div class = "line" > < a name = "l00093" > < / a > < span class = "lineno" > 93< / span >   < / div >
< div class = "line" > < a name = "l00094" > < / a > < span class = "lineno" > 94< / span >   IntegerValue CapacityMax()< span class = "keyword" > const < / span > {< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00095" > < / a > < span class = "lineno" > 95< / span >   < span class = "keywordflow" > return< / span > integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac" > UpperBound< / a > (capacity_);< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00096" > < / a > < span class = "lineno" > 96< / span >   }< / div >
< div class = "line" > < a name = "l00097" > < / a > < span class = "lineno" > 97< / span >   < / div >
< div class = "line" > < a name = "l00098" > < / a > < span class = "lineno" > 98< / span >   < span class = "comment" > // Number of tasks.< / span > < / div >
< div class = "line" > < a name = "l00099" > < / a > < span class = "lineno" > 99< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_tasks_;< / div >
< div class = "line" > < a name = "l00100" > < / a > < span class = "lineno" > 100< / span >   < / div >
< div class = "line" > < a name = "l00101" > < / a > < span class = "lineno" > 101< / span >   < span class = "comment" > // IntervalVariable and IntegerVariable of each tasks that must be considered< / span > < / div >
< div class = "line" > < a name = "l00102" > < / a > < span class = "lineno" > 102< / span >   < span class = "comment" > // in this constraint.< / span > < / div >
< div class = "line" > < a name = "l00103" > < / a > < span class = "lineno" > 103< / span >   std::vector< AffineExpression> demands_;< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00104" > < / a > < span class = "lineno" > 104< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_affine_expression.html" > AffineExpression< / a > capacity_;< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00105" > < / a > < span class = "lineno" > 105< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00106" > < / a > < span class = "lineno" > 106< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html" > SchedulingConstraintHelper< / a > * helper_;< / div >
< div class = "line" > < a name = "l00107" > < / a > < span class = "lineno" > 107< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html" > IntegerTrail< / a > * integer_trail_;< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00108" > < / a > < span class = "lineno" > 108< / span >   < / div >
< div class = "line" > < a name = "l00109" > < / a > < span class = "lineno" > 109< / span >   < span class = "comment" > // Start (resp. end) of the compulsory parts used to build the profile.< / span > < / div >
< div class = "line" > < a name = "l00110" > < / a > < span class = "lineno" > 110< / span >   std::vector< TaskTime> scp_;< / div >
< div class = "line" > < a name = "l00111" > < / a > < span class = "lineno" > 111< / span >   std::vector< TaskTime> ecp_;< / div >
< div class = "line" > < a name = "l00112" > < / a > < span class = "lineno" > 112< / span >   < / div >
< div class = "line" > < a name = "l00113" > < / a > < span class = "lineno" > 113< / span >   < span class = "comment" > // Sizes and energy of the free parts. One is just the other times the< / span > < / div >
< div class = "line" > < a name = "l00114" > < / a > < span class = "lineno" > 114< / span >   < span class = "comment" > // minimum demand.< / span > < / div >
< div class = "line" > < a name = "l00115" > < / a > < span class = "lineno" > 115< / span >   std::vector< IntegerValue> size_free_;< / div >
< div class = "line" > < a name = "l00116" > < / a > < span class = "lineno" > 116< / span >   std::vector< IntegerValue> energy_free_;< / div >
< div class = "line" > < a name = "l00117" > < / a > < span class = "lineno" > 117< / span >   < / div >
< div class = "line" > < a name = "l00118" > < / a > < span class = "lineno" > 118< / span >   < span class = "comment" > // Energy contained in the time table before the start min (resp. end max)< / span > < / div >
< div class = "line" > < a name = "l00119" > < / a > < span class = "lineno" > 119< / span >   < span class = "comment" > // of each task.< / span > < / div >
< div class = "line" > < a name = "l00120" > < / a > < span class = "lineno" > 120< / span >   std::vector< IntegerValue> mandatory_energy_before_start_min_;< / div >
< div class = "line" > < a name = "l00121" > < / a > < span class = "lineno" > 121< / span >   std::vector< IntegerValue> mandatory_energy_before_end_max_;< / div >
< div class = "line" > < a name = "l00122" > < / a > < span class = "lineno" > 122< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00123" > < / a > < span class = "lineno" > 123< / span >   DISALLOW_COPY_AND_ASSIGN(< a class = "code" href = "classoperations__research_1_1sat_1_1_time_table_edge_finding.html" > TimeTableEdgeFinding< / a > );< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00124" > < / a > < span class = "lineno" > 124< / span >   };< / div >
< div class = "line" > < a name = "l00125" > < / a > < span class = "lineno" > 125< / span >   < / div >
< div class = "line" > < a name = "l00126" > < / a > < span class = "lineno" > 126< / span >   } < span class = "comment" > // namespace sat< / span > < / div >
< div class = "line" > < a name = "l00127" > < / a > < span class = "lineno" > 127< / span >   } < span class = "comment" > // namespace operations_research< / span > < / div >
< div class = "line" > < a name = "l00128" > < / a > < span class = "lineno" > 128< / span >   < / div >
< div class = "line" > < a name = "l00129" > < / a > < span class = "lineno" > 129< / span >   < span class = "preprocessor" > #endif // OR_TOOLS_SAT_TIMETABLE_EDGEFINDING_H_< / span > < / div >
< / div > <!-- fragment --> < / div > <!-- contents -->
< / div > <!-- doc - content -->
2020-11-18 14:53:30 +01:00
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_affine_expression_html" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_affine_expression.html" > operations_research::sat::AffineExpression< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l00205" > integer.h:205< / a > < / div > < / div >
2020-12-07 17:47:46 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_trail_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_trail.html" > operations_research::sat::IntegerTrail< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l00533" > integer.h:533< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_propagator_interface_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_propagator_interface.html" > operations_research::sat::PropagatorInterface< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01043" > integer.h:1043< / a > < / div > < / div >
2020-09-02 09:42:51 +02:00
< div class = "ttc" id = "amacros_8h_html" > < div class = "ttname" > < a href = "macros_8h.html" > macros.h< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_html" > < div class = "ttname" > < a href = "namespaceoperations__research.html" > operations_research< / a > < / div > < div class = "ttdoc" > The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "dense__doubly__linked__list_8h_source.html#l00021" > dense_doubly_linked_list.h:21< / a > < / div > < / div >
< div class = "ttc" id = "asat__base_8h_html" > < div class = "ttname" > < a href = "sat__base_8h.html" > sat_base.h< / a > < / div > < / div >
2020-12-07 17:47:46 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_generic_literal_watcher.html" > operations_research::sat::GenericLiteralWatcher< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01091" > integer.h:1091< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html" > operations_research::sat::SchedulingConstraintHelper< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "intervals_8h_source.html#l00171" > intervals.h:172< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_trail_html_a8b6d5a25e6ad3d28a85b1924471e2cac" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac" > operations_research::sat::IntegerTrail::UpperBound< / a > < / div > < div class = "ttdeci" > IntegerValue UpperBound(IntegerVariable i) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01287" > integer.h:1287< / a > < / div > < / div >
2020-09-02 09:42:51 +02:00
< div class = "ttc" id = "aint__type_8h_html" > < div class = "ttname" > < a href = "int__type_8h.html" > int_type.h< / a > < / div > < / div >
< div class = "ttc" id = "aintervals_8h_html" > < div class = "ttname" > < a href = "intervals_8h.html" > intervals.h< / a > < / div > < / div >
2020-10-09 12:00:09 +02:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_time_table_edge_finding_html_a79c007a4dcb11e92cfa7de9149d81f6f" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a79c007a4dcb11e92cfa7de9149d81f6f" > operations_research::sat::TimeTableEdgeFinding::TimeTableEdgeFinding< / a > < / div > < div class = "ttdeci" > TimeTableEdgeFinding(const std::vector< AffineExpression > & demands, AffineExpression capacity, SchedulingConstraintHelper *helper, IntegerTrail *integer_trail)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "timetable__edgefinding_8cc_source.html#l00030" > timetable_edgefinding.cc:30< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_time_table_edge_finding_html_a6ee8ed57254aec3ae99d399bae5b3736" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a6ee8ed57254aec3ae99d399bae5b3736" > operations_research::sat::TimeTableEdgeFinding::RegisterWith< / a > < / div > < div class = "ttdeci" > void RegisterWith(GenericLiteralWatcher *watcher)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "timetable__edgefinding_8cc_source.html#l00047" > timetable_edgefinding.cc:47< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_time_table_edge_finding_html_ac1fe9b1f2b978c4283e42f12e586eb1e" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_time_table_edge_finding.html#ac1fe9b1f2b978c4283e42f12e586eb1e" > operations_research::sat::TimeTableEdgeFinding::Propagate< / a > < / div > < div class = "ttdeci" > bool Propagate() final< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "timetable__edgefinding_8cc_source.html#l00056" > timetable_edgefinding.cc:56< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_time_table_edge_finding_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_time_table_edge_finding.html" > operations_research::sat::TimeTableEdgeFinding< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "timetable__edgefinding_8h_source.html#l00061" > timetable_edgefinding.h:61< / a > < / div > < / div >
2020-09-02 09:42:51 +02:00
< div class = "ttc" id = "arouting__flow_8cc_html_adf3be22c64f10c0783c0cf277e857adf" > < div class = "ttname" > < a href = "routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf" > capacity< / a > < / div > < div class = "ttdeci" > int64 capacity< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "routing__flow_8cc_source.html#l00129" > routing_flow.cc:129< / a > < / div > < / div >
2020-12-07 17:47:46 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > operations_research::sat::IntegerTrail::LowerBound< / a > < / div > < div class = "ttdeci" > IntegerValue LowerBound(IntegerVariable i) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01283" > integer.h:1283< / a > < / div > < / div >
2020-09-02 09:42:51 +02:00
< div class = "ttc" id = "ainteger_8h_html" > < div class = "ttname" > < a href = "integer_8h.html" > integer.h< / a > < / div > < / div >
<!-- HTML footer for doxygen 1.8.18 -->
<!-- start footer part -->
< div id = "nav-path" class = "navpath" > <!-- id is needed for treeview function! -->
< ul >
< li class = "navelem" > < a class = "el" href = "dir_a7cc1eeded8f693d0da6c729bc88c45a.html" > ortools< / a > < / li > < li class = "navelem" > < a class = "el" href = "dir_dddac007a45022d9da6ea1dee012c3b9.html" > sat< / a > < / li > < li class = "navelem" > < a class = "el" href = "timetable__edgefinding_8h.html" > timetable_edgefinding.h< / a > < / li >
< li class = "footer" > Generated by
< a href = "http://www.doxygen.org/index.html" >
2020-10-09 12:00:09 +02:00
< img class = "footer" src = "doxygen.png" alt = "doxygen" / > < / a > 1.8.20 < / li >
2020-09-02 09:42:51 +02:00
< / ul >
< / div >
< / body >
< / html >
