242 lines
15 KiB
HTML
242 lines
15 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<title>OR-Tools</title>
|
|
<meta http-equiv="Content-Type" content="text/html;"/>
|
|
<meta charset="utf-8"/>
|
|
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
|
|
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
</head>
|
|
<body>
|
|
<div id="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">OR-Tools 7.2</span>
|
|
</div>
|
|
</div>
|
|
<link rel="icon" href="https://developers.google.com/optimization/images/orLogo.png">
|
|
<div id="content">
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>Main Page</span></a></li>
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
|
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li><a href="files.html"><span>Files</span></a></li>
|
|
</ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div 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('classoperations__research_1_1DisjunctivePropagator.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<div class="header">
|
|
<div class="summary">
|
|
<a href="#nested-classes">Classes</a> |
|
|
<a href="#pub-methods">Public Member Functions</a> |
|
|
<a href="classoperations__research_1_1DisjunctivePropagator-members.html">List of all members</a> </div>
|
|
<div class="headertitle">
|
|
<div class="title">operations_research::DisjunctivePropagator Class Reference</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p>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. </p>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="routing_8h_source.html#l01685">1685</a> of file <a class="el" href="routing_8h_source.html">routing.h</a>.</p>
|
|
</div><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
|
|
Classes</h2></td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a></td></tr>
|
|
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">A structure to hold tasks described by their features. <a href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html#details">More...</a><br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
|
|
Public Member Functions</h2></td></tr>
|
|
<tr class="memitem:a4bca695f28fc3739d74ac6ca2c93221b"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#a4bca695f28fc3739d74ac6ca2c93221b">Propagate</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="memdesc:a4bca695f28fc3739d74ac6ca2c93221b"><td class="mdescLeft"> </td><td class="mdescRight">Computes new bounds for all tasks, returns false if infeasible. <a href="#a4bca695f28fc3739d74ac6ca2c93221b">More...</a><br /></td></tr>
|
|
<tr class="separator:a4bca695f28fc3739d74ac6ca2c93221b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a10aa87697d8041fa4a1083dc648750f7"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#a10aa87697d8041fa4a1083dc648750f7">Precedences</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="memdesc:a10aa87697d8041fa4a1083dc648750f7"><td class="mdescLeft"> </td><td class="mdescRight">Propagates the deductions from the chain of precedences, if there is one. <a href="#a10aa87697d8041fa4a1083dc648750f7">More...</a><br /></td></tr>
|
|
<tr class="separator:a10aa87697d8041fa4a1083dc648750f7"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ac392b9ff00285a5ef98286c35dd7aab3"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#ac392b9ff00285a5ef98286c35dd7aab3">MirrorTasks</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="memdesc:ac392b9ff00285a5ef98286c35dd7aab3"><td class="mdescLeft"> </td><td class="mdescRight">Transforms the problem with a time symmetry centered in 0. <a href="#ac392b9ff00285a5ef98286c35dd7aab3">More...</a><br /></td></tr>
|
|
<tr class="separator:ac392b9ff00285a5ef98286c35dd7aab3"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aee4e422de7210b61627750d3937df615"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#aee4e422de7210b61627750d3937df615">EdgeFinding</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="memdesc:aee4e422de7210b61627750d3937df615"><td class="mdescLeft"> </td><td class="mdescRight">Does edge-finding deductions on all tasks. <a href="#aee4e422de7210b61627750d3937df615">More...</a><br /></td></tr>
|
|
<tr class="separator:aee4e422de7210b61627750d3937df615"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a2ecf539942f15611e7cafe1fb3a757fe"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#a2ecf539942f15611e7cafe1fb3a757fe">DetectablePrecedencesWithChain</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="memdesc:a2ecf539942f15611e7cafe1fb3a757fe"><td class="mdescLeft"> </td><td class="mdescRight">Does detectable precedences deductions on tasks in the chain precedence, taking the time windows of nonchain tasks into account. <a href="#a2ecf539942f15611e7cafe1fb3a757fe">More...</a><br /></td></tr>
|
|
<tr class="separator:a2ecf539942f15611e7cafe1fb3a757fe"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a8229b22f70a1667de00db67f10f9b1e8"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#a8229b22f70a1667de00db67f10f9b1e8">ForbiddenIntervals</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="memdesc:a8229b22f70a1667de00db67f10f9b1e8"><td class="mdescLeft"> </td><td class="mdescRight"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html" title="A structure to hold tasks described by their features.">Tasks</a> might have holes in their domain, this enforces such holes. <a href="#a8229b22f70a1667de00db67f10f9b1e8">More...</a><br /></td></tr>
|
|
<tr class="separator:a8229b22f70a1667de00db67f10f9b1e8"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a86de3b4833fec686a2d02a3b221fcd7b"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#a86de3b4833fec686a2d02a3b221fcd7b">DistanceDuration</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="separator:a86de3b4833fec686a2d02a3b221fcd7b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
<h2 class="groupheader">Member Function Documentation</h2>
|
|
<a id="a2ecf539942f15611e7cafe1fb3a757fe"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a2ecf539942f15611e7cafe1fb3a757fe">◆ </a></span>DetectablePrecedencesWithChain()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool operations_research::DisjunctivePropagator::DetectablePrecedencesWithChain </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Does detectable precedences deductions on tasks in the chain precedence, taking the time windows of nonchain tasks into account. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a86de3b4833fec686a2d02a3b221fcd7b"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a86de3b4833fec686a2d02a3b221fcd7b">◆ </a></span>DistanceDuration()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool operations_research::DisjunctivePropagator::DistanceDuration </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
</div>
|
|
</div>
|
|
<a id="aee4e422de7210b61627750d3937df615"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aee4e422de7210b61627750d3937df615">◆ </a></span>EdgeFinding()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool operations_research::DisjunctivePropagator::EdgeFinding </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Does edge-finding deductions on all tasks. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a8229b22f70a1667de00db67f10f9b1e8"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a8229b22f70a1667de00db67f10f9b1e8">◆ </a></span>ForbiddenIntervals()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool operations_research::DisjunctivePropagator::ForbiddenIntervals </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html" title="A structure to hold tasks described by their features.">Tasks</a> might have holes in their domain, this enforces such holes. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="ac392b9ff00285a5ef98286c35dd7aab3"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ac392b9ff00285a5ef98286c35dd7aab3">◆ </a></span>MirrorTasks()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool operations_research::DisjunctivePropagator::MirrorTasks </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Transforms the problem with a time symmetry centered in 0. </p>
|
|
<p>Returns true for convenience. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a10aa87697d8041fa4a1083dc648750f7"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a10aa87697d8041fa4a1083dc648750f7">◆ </a></span>Precedences()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool operations_research::DisjunctivePropagator::Precedences </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Propagates the deductions from the chain of precedences, if there is one. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a4bca695f28fc3739d74ac6ca2c93221b"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a4bca695f28fc3739d74ac6ca2c93221b">◆ </a></span>Propagate()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool operations_research::DisjunctivePropagator::Propagate </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Computes new bounds for all tasks, returns false if infeasible. </p>
|
|
<p>This does not compute a fixed point, so recalling it may filter more. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<hr/>The documentation for this class was generated from the following file:<ul>
|
|
<li><a class="el" href="routing_8h_source.html">routing.h</a></li>
|
|
</ul>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|