Files
ortools-clone/docs/cpp/count__cst_8cc_source.html

167 lines
211 KiB
HTML
Raw Normal View History

2020-09-01 16:00:33 +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"/>
2022-01-16 18:02:36 +01:00
<meta name="generator" content="Doxygen 1.8.15"/>
2020-09-01 16:00:33 +02:00
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: count_cst.cc 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>
2022-01-16 18:02:36 +01:00
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
2020-09-01 16:00:33 +02:00
<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
2021-12-14 13:41:01 +01:00
&#160;<span id="projectnumber">9.2</span>
2020-09-01 16:00:33 +02:00
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
2022-01-16 18:02:36 +01:00
<!-- Generated by Doxygen 1.8.15 -->
2020-09-01 16:00:33 +02:00
<script type="text/javascript">
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
2020-09-01 16:00:33 +02:00
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
2020-09-01 16:00:33 +02:00
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
2022-01-16 18:02:36 +01:00
/* @license-end */</script>
2020-09-01 16:00:33 +02:00
<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">
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('count__cst_8cc_source.html','');});
2020-09-01 16:00:33 +02:00
/* @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">
2022-01-16 18:02:36 +01:00
<div class="headertitle">
<div class="title">count_cst.cc</div> </div>
2020-09-01 16:00:33 +02:00
</div><!--header-->
<div class="contents">
2022-01-16 18:02:36 +01:00
<a href="count__cst_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<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>&#160;<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>&#160;<span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<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>&#160;<span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<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>&#160;<span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<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>&#160;<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>&#160;<span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="comment">// Count constraints</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="preprocessor">#include &lt;algorithm&gt;</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="preprocessor">#include &lt;cstdint&gt;</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="preprocessor">#include &lt;limits&gt;</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="preprocessor">#include &lt;string&gt;</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="preprocessor">#include &quot;absl/strings/str_format.h&quot;</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="preprocessor">#include &quot;absl/strings/str_join.h&quot;</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>&quot;</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>&quot;</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160;<span
<div class="ttc" id="classoperations__research_1_1_solver_html_a068546fafd21de918946e45778117900"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a068546fafd21de918946e45778117900">operations_research::Solver::MakeCount</a></div><div class="ttdeci">Constraint * MakeCount(const std::vector&lt; IntVar * &gt; &amp;vars, int64_t value, int64_t max_count)</div><div class="ttdoc">|{i | vars[i] == value}| == max_count</div><div class="ttdef"><b>Definition:</b> <a href="count__cst_8cc_source.html#l00032">count_cst.cc:32</a></div></div>
<div class="ttc" id="classoperations__research_1_1_solver_html_aecc1416849d286531c1820b42d2292fc"><div class="ttname"><a href="classoperations__research_1_1_solver.html#aecc1416849d286531c1820b42d2292fc">operations_research::Solver::MakeIsEqualCstVar</a></div><div class="ttdeci">IntVar * MakeIsEqualCstVar(IntExpr *const var, int64_t value)</div><div class="ttdoc">status var of (var == value)</div><div class="ttdef"><b>Definition:</b> <a href="expr__cst_8cc_source.html#l00462">expr_cst.cc:462</a></div></div>
<div class="ttc" id="alldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
<div class="ttc" id="classoperations__research_1_1_int_var_html_a6e33a313eaf507bae0eb7068455a5bdc"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#a6e33a313eaf507bae0eb7068455a5bdc">operations_research::IntVar::WhenBound</a></div><div class="ttdeci">virtual void WhenBound(Demon *d)=0</div><div class="ttdoc">This method attaches a demon that will be awakened when the variable is bound.</div></div>
<div class="ttc" id="base_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00706">base/logging.h:706</a></div></div>
<div class="ttc" id="constraint__solver_2table_8cc_html_a9ea6e0a7e183dca3a31ee9e998d8b4df"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9ea6e0a7e183dca3a31ee9e998d8b4df">holes_</a></div><div class="ttdeci">std::vector&lt; IntVarIterator * &gt; holes_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00228">constraint_solver/table.cc:228</a></div></div>
<div class="ttc" id="constraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a5f9d5cd2badcf4361bfebd07c9cb63d8"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a5f9d5cd2badcf4361bfebd07c9cb63d8">operations_research::ModelVisitor::kMaxArgument</a></div><div class="ttdeci">static const char kMaxArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03505">constraint_solver.h:3505</a></div></div>
<div class="ttc" id="classoperations__research_1_1_int_var_html_a0723abf37f7a5a8a604fd1bcd96a7be0"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#a0723abf37f7a5a8a604fd1bcd96a7be0">operations_research::IntVar::Contains</a></div><div class="ttdeci">virtual bool Contains(int64_t v) const =0</div><div class="ttdoc">This method returns whether the value 'v' is in the domain of the variable.</div></div>
<div class="ttc" id="classoperations__research_1_1_int_var_html_a3173e28151b3e04888127961cacc42b1"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#a3173e28151b3e04888127961cacc42b1">operations_research::IntVar::OldMax</a></div><div class="ttdeci">virtual int64_t OldMax() const =0</div><div class="ttdoc">Returns the previous max.</div></div>
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a9e79e034e1f9f83142df7fd82d3654cf"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a9e79e034e1f9f83142df7fd82d3654cf">operations_research::ModelVisitor::kCountArgument</a></div><div class="ttdeci">static const char kCountArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03482">constraint_solver.h:3482</a></div></div>
<div class="ttc" id="constraint__solveri_8h_html"><div class="ttname"><a href="constraint__solveri_8h.html">constraint_solveri.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1_int_expr_html_a62b340f6d1dde6a36560bd88a382ada7"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">operations_research::IntExpr::Min</a></div><div class="ttdeci">virtual int64_t Min() const =0</div></div>
<div class="ttc" id="classoperations__research_1_1_constraint_html"><div class="ttname"><a href="classoperations__research_1_1_constraint.html">operations_research::Constraint</a></div><div class="ttdoc">A constraint is the main modeling object.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03626">constraint_solver.h:3626</a></div></div>
<div class="ttc" id="classoperations__research_1_1_rev_bit_matrix_html_a35395dc664c7939e68c29390a8591e1c"><div class="ttname"><a href="classoperations__research_1_1_rev_bit_matrix.html#a35395dc664c7939e68c29390a8591e1c">operations_research::RevBitMatrix::IsSet</a></div><div class="ttdeci">bool IsSet(int64_t row, int64_t column) const</div><div class="ttdoc">Returns whether the 'column' bit in the 'row' row is set.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00467">constraint_solveri.h:467</a></div></div>
<div class="ttc" id="classoperations__research_1_1_solver_html_a1cf098b98c67b72f37ca012e69aec6ce"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a1cf098b98c67b72f37ca012e69aec6ce">operations_research::Solver::MakeSumEquality</a></div><div class="ttdeci">Constraint * MakeSumEquality(const std::vector&lt; IntVar * &gt; &amp;vars, int64_t cst)</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l03451">expr_array.cc:3451</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_adf2aea6c68fe502389c9264b971b2f85"><div class="ttname"><a href="namespaceoperations__research.html#adf2aea6c68fe502389c9264b971b2f85">operations_research::IsArrayInRange</a></div><div class="ttdeci">bool IsArrayInRange(const std::vector&lt; IntVar * &gt; &amp;vars, T range_min, T range_max)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02936">constraint_solveri.h:2936</a></div></div>
<div class="ttc" id="classoperations__research_1_1_rev_bit_matrix_html_ab1f7d7749ed4799119614efc507ebc64"><div class="ttname"><a href="classoperations__research_1_1_rev_bit_matrix.html#ab1f7d7749ed4799119614efc507ebc64">operations_research::RevBitMatrix::SetToOne</a></div><div class="ttdeci">void SetToOne(Solver *const solver, int64_t row, int64_t column)</div><div class="ttdoc">Sets the 'column' bit in the 'row' row.</div><div class="ttdef"><b>Definition:</b> <a href="utilities_8cc_source.html#l00170">utilities.cc:170</a></div></div>
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_abb3d61b9415a99cbceff4c56c9ccab99"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#abb3d61b9415a99cbceff4c56c9ccab99">operations_research::ModelVisitor::kDistribute</a></div><div class="ttdeci">static const char kDistribute[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03394">constraint_solver.h:3394</a></div></div>
<div class="ttc" id="classoperations__research_1_1_rev_html_affc0b3b0a5efa3efc9d0d86344d4a29f"><div class="ttname"><a href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">operations_research::Rev::Value</a></div><div class="ttdeci">const T &amp; Value() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03781">constraint_solver.h:3781</a></div></div>
<div class="ttc" id="integral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1_int_expr_html_a1d04569b37cb7fe6ed0956ab71e08bc9"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">operations_research::IntExpr::Bound</a></div><div class="ttdeci">virtual bool Bound() const</div><div class="ttdoc">Returns true if the min and the max of the expression are equal.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03904">constraint_solver.h:3904</a></div></div>
<div class="ttc" id="classoperations__research_1_1_solver_html_af563b9a4a5d95d2552b0d5f43a679e98"><div class="ttname"><a href="classoperations__research_1_1_solver.html#af563b9a4a5d95d2552b0d5f43a679e98">operations_research::Solver::MakeAtMost</a></div><div class="ttdeci">Constraint * MakeAtMost(std::vector&lt; IntVar * &gt; vars, int64_t value, int64_t max_count)</div><div class="ttdoc">|{i | vars[i] == value}| &lt;= max_count</div><div class="ttdef"><b>Definition:</b> <a href="count__cst_8cc_source.html#l00956">count_cst.cc:956</a></div></div>
<div class="ttc" id="alldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_abeac98dfd5ab1335f6d21a8d71bdfd51"><div class="ttname"><a href="namespaceoperations__research.html#abeac98dfd5ab1335f6d21a8d71bdfd51">operations_research::ToInt64Vector</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; ToInt64Vector(const std::vector&lt; int &gt; &amp;input)</div><div class="ttdef"><b>Definition:</b> <a href="utilities_8cc_source.html#l00828">utilities.cc:828</a></div></div>
<div class="ttc" id="classoperations__research_1_1_solver_html_ac145423b7d355bcd75d627871ca95e86"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ac145423b7d355bcd75d627871ca95e86">operations_research::Solver::MakeAllDifferent</a></div><div class="ttdeci">Constraint * MakeAllDifferent(const std::vector&lt; IntVar * &gt; &amp;vars)</div><div class="ttdoc">All variables are pairwise different.</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00692">alldiff_cst.cc:692</a></div></div>
<div class="ttc" id="classoperations__research_1_1_rev_bit_matrix_html_a0bbb89e6f783ea950b5bd38049428b4c"><div class="ttname"><a href="classoperations__research_1_1_rev_bit_matrix.html#a0bbb89e6f783ea950b5bd38049428b4c">operations_research::RevBitMatrix::SetToZero</a></div><div class="ttdeci">void SetToZero(Solver *const solver, int64_t row, int64_t column)</div><div class="ttdoc">Erases the 'column' bit in the 'row' row.</div><div class="ttdef"><b>Definition:</b> <a href="utilities_8cc_source.html#l00178">utilities.cc:178</a></div></div>
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a1a1c411b20f73c324361e8eff94f12bd"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a1a1c411b20f73c324361e8eff94f12bd">operations_research::ModelVisitor::kMinArgument</a></div><div class="ttdeci">static const char kMinArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03507">constraint_solver.h:3507</a></div></div>
<div class="ttc" id="pack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_aafac7375c23337f25821aa6f86ca627c"><div class="ttname"><a href="namespaceoperations__research.html#aafac7375c23337f25821aa6f86ca627c">operations_research::IsIncreasingContiguous</a></div><div class="ttdeci">bool IsIncreasingContiguous(const std::vector&lt; T &gt; &amp;values)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02916">constraint_solveri.h:2916</a></div></div>
<div class="ttc" id="classoperations__research_1_1_int_var_html"><div class="ttname"><a href="classoperations__research_1_1_int_var.html">operations_research::IntVar</a></div><div class="ttdoc">The class IntVar is a subset of IntExpr.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04040">constraint_solver.h:4040</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_ae3e4f71c4c79e0b4ec00c4e715a7c298"><div class="ttname"><a href="namespaceoperations__research.html#ae3e4f71c4c79e0b4ec00c4e715a7c298">operations_research::AreAllOnes</a></div><div class="ttdeci">bool AreAllOnes(const std::vector&lt; T &gt; &amp;values)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02866">constraint_solveri.h:2866</a></div></div>
<div class="ttc" id="base_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
<div class="ttc" id="classoperations__research_1_1_numerical_rev_html_ac8beef1ef5cd6ce8bdfb3f48016ff72b"><div class="ttname"><a href="classoperations__research_1_1_numerical_rev.html#ac8beef1ef5cd6ce8bdfb3f48016ff72b">operations_research::NumericalRev::Incr</a></div><div class="ttdeci">void Incr(Solver *const s)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03808">constraint_solver.h:3808</a></div></div>
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_aa9175e7f7c9d2598d26293435ecd89ce"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">operations_research::ModelVisitor::kVarsArgument</a></div><div class="ttdeci">static const char kVarsArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03535">constraint_solver.h:3535</a></div></div>
<div class="ttc" id="alldiff__cst_8cc_html_a151248525a9e07eb3e6e60ea1c4995eb"><div class="ttname"><a href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a></div><div class="ttdeci">const std::vector&lt; IntVar * &gt; vars_</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00044">alldiff_cst.cc:44</a></div></div>
<div class="ttc" id="classoperations__research_1_1_solver_html_ab741cb25dd32d1cbe02fbfb36337d9bb"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">operations_research::Solver::RevAlloc</a></div><div class="ttdeci">T * RevAlloc(T *object)</div><div class="ttdoc">Registers the given object as being reversible.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00791">constraint_solver.h:791</a></div></div>
<div class="ttc" id="base_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_adc9534f3f00f5aa6046609988d38967b"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#adc9534f3f00f5aa6046609988d38967b">operations_research::ModelVisitor::kValuesArgument</a></div><div class="ttdeci">static const char kValuesArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03533">constraint_solver.h:3533</a></div></div>
<div class="ttc" id="classoperations__research_1_1_int_var_html_af3a292044fe0483a2b2f7b65f94a7dc2"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#af3a292044fe0483a2b2f7b65f94a7dc2">operations_research::IntVar::OldMin</a></div><div class="ttdeci">virtual int64_t OldMin() const =0</div><div class="ttdoc">Returns the previous min.</div></div>
<div class="ttc" id="classoperations__research_1_1_solver_html"><div class="ttname"><a href="classoperations__research_1_1_solver.html">operations_research::Solver</a></div><div class="ttdoc">Solver Class.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00245">constraint_solver.h:245</a></div></div>
<div class="ttc" id="classoperations__research_1_1_solver_html_a783604b36be84a0f63754d0fe5597291"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a783604b36be84a0f63754d0fe5597291">operations_research::Solver::MakeTrueConstraint</a></div><div class="ttdeci">Constraint * MakeTrueConstraint()</div><div class="ttdoc">This constraint always succeeds.</div><div class="ttdef"><b>Definition:</b> <a href="constraints_8cc_source.html#l00518">constraints.cc:518</a></div></div>
<div class="ttc" id="classoperations__research_1_1_int_var_html_ab36f6f122cb3e8554b160ba67608b1c0"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#ab36f6f122cb3e8554b160ba67608b1c0">operations_research::IntVar::WhenDomain</a></div><div class="ttdeci">virtual void WhenDomain(Demon *d)=0</div><div class="ttdoc">This method attaches a demon that will watch any domain modification of the domain of the variable.</div></div>
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a3be2b279891dcba6132ab267f322a223"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a3be2b279891dcba6132ab267f322a223">operations_research::ModelVisitor::kAtMost</a></div><div class="ttdeci">static const char kAtMost[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03382">constraint_solver.h:3382</a></div></div>
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</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="namespaceoperations__research_html_a9be76edcbd5ccb982d92c8d90421a73c"><div class="ttname"><a href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">operations_research::JoinDebugStringPtr</a></div><div class="ttdeci">std::string JoinDebugStringPtr(const std::vector&lt; T &gt; &amp;v, const std::string &amp;separator)</div><div class="ttdef"><b>Definition:</b> <a href="string__array_8h_source.html#l00045">string_array.h:45</a></div></div>
<div class="ttc" id="string__array_8h_html"><div class="ttname"><a href="string__array_8h.html">string_array.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a7899dfe8b41c6b2b13546d921114f8d2"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a7899dfe8b41c6b2b13546d921114f8d2">operations_research::ModelVisitor::kValueArgument</a></div><div class="ttdeci">static const char kValueArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03532">constraint_solver.h:3532</a></div></div>
<div class="ttc" id="expr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_acc06c9c2780c1d54d0e03f2e29e44667"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#acc06c9c2780c1d54d0e03f2e29e44667">operations_research::ModelVisitor::kCardsArgument</a></div><div class="ttdeci">static const char kCardsArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03480">constraint_solver.h:3480</a></div></div>
<div class="ttc" id="demon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_a4fb750da00c784e5ffd1763fd3ce88f7"><div class="ttname"><a href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">operations_research::MakeConstraintDemon1</a></div><div class="ttdeci">Demon * MakeConstraintDemon1(Solver *const s, T *const ct, void(T::*method)(P), const std::string &amp;name, P param1)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00560">constraint_solveri.h:560</a></div></div>
<div class="ttc" id="classoperations__research_1_1_solver_html_a6b46626f38ab21a3120112a7c76fb076"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a6b46626f38ab21a3120112a7c76fb076">operations_research::Solver::MakeDistribute</a></div><div class="ttdeci">Constraint * MakeDistribute(const std::vector&lt; IntVar * &gt; &amp;vars, const std::vector&lt; int64_t &gt; &amp;values, const std::vector&lt; IntVar * &gt; &amp;cards)</div><div class="ttdoc">Aggregated version of count: |{i | v[i] == values[j]}| == cards[j].</div><div class="ttdef"><b>Definition:</b> <a href="count__cst_8cc_source.html#l00965">count_cst.cc:965</a></div></div>
<div class="ttc" id="classoperations__research_1_1_solver_html_ac957f0efc6de9135512f60f80ba36083"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ac957f0efc6de9135512f60f80ba36083">operations_research::Solver::MakeSum</a></div><div class="ttdeci">IntExpr * MakeSum(IntExpr *const left, IntExpr *const right)</div><div class="ttdoc">left + right.</div><div class="ttdef"><b>Definition:</b> <a href="expressions_8cc_source.html#l06564">expressions.cc:6564</a></div></div>
<div class="ttc" id="base_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00703">base/logging.h:703</a></div></div>
<div class="ttc" id="classoperations__research_1_1_int_expr_html_ac84c250d67f30c89e845cd460eeaaad8"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#ac84c250d67f30c89e845cd460eeaaad8">operations_research::IntExpr::Max</a></div><div class="ttdeci">virtual int64_t Max() const =0</div></div>
2021-01-26 11:28:50 +01:00
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
2020-09-01 16:00:33 +02:00
<!-- 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_afbb39f66221aac28bbdefd1dca2b2b0.html">constraint_solver</a></li><li class="navelem"><a class="el" href="count__cst_8cc.html">count_cst.cc</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
2022-01-16 18:02:36 +01:00
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
2020-09-01 16:00:33 +02:00
</ul>
</div>
</body>
</html>