always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
75381287362bb54b32a1dc746a29be34f05bd221
ortools-clone/docs/cpp/adjustable__priority__queue_8h_source.html
Mizux Seiha 3b81c981c2 Update doc
2022-03-04 00:19:15 +01:00

335 lines
52 KiB
HTML
Raw Blame History

<!-- 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"/>
<meta name="generator" content="Doxygen 1.9.3"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: adjustable_priority_queue.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
&#160;<span id="projectnumber">9.3</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.3 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
/* @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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('adjustable__priority__queue_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">adjustable_priority_queue.h</div></div>
</div><!--header-->
<div class="contents">
<a href="adjustable__priority__queue_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div>
<div class="line"><a id="l00003" 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 id="l00004" 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 id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
<div class="line"><a id="l00006" 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 id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
<div class="line"><a id="l00008" 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 id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div>
<div class="line"><a id="l00010" 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 id="l00011" 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 id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#ifndef OR_TOOLS_BASE_ADJUSTABLE_PRIORITY_QUEUE_H_</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#define OR_TOOLS_BASE_ADJUSTABLE_PRIORITY_QUEUE_H_</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include &lt;stddef.h&gt;</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include &lt;functional&gt;</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include &lt;list&gt;</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> </div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include &quot;<a class="code" href="basictypes_8h.html">ortools/base/basictypes.h</a>&quot;</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><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 id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include &quot;<a class="code" href="macros_8h.html">ortools/base/macros.h</a>&quot;</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> </div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> Comparator&gt;</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="class_lower_priority_than.html"> 28</a></span><span class="keyword">class </span><a class="code hl_class" href="class_lower_priority_than.html">LowerPriorityThan</a> {</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="class_lower_priority_than.html#aaf52c30ff76c4de1dd9e347c1fdb023e"> 30</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="class_lower_priority_than.html#aaf52c30ff76c4de1dd9e347c1fdb023e">LowerPriorityThan</a>(Comparator* compare) : compare_(compare) {}</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="class_lower_priority_than.html#a5c850fe8c2e849c38b2316d0b04ac64e"> 31</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="class_lower_priority_than.html#a5c850fe8c2e849c38b2316d0b04ac64e">operator()</a>(T* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, T* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (*compare_)(*<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, *<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>); }</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> </div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> Comparator* compare_;</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span>};</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> </div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> Comp = std::less&lt;T&gt; &gt;</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html"> 38</a></span><span class="keyword">class </span><a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a> {</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// The objects references &#39;c&#39; and &#39;m&#39; are not required to be alive for the</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// lifetime of this object.</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a1b5aac314749f1999e7c1b78da268877"> 42</a></span> <a class="code hl_function" href="class_adjustable_priority_queue.html#a1b5aac314749f1999e7c1b78da268877">AdjustablePriorityQueue</a>() {}</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a742bb30d772bef615843b04c073a56c6"> 43</a></span> <a class="code hl_function" href="class_adjustable_priority_queue.html#a742bb30d772bef615843b04c073a56c6">AdjustablePriorityQueue</a>(<span class="keyword">const</span> Comp&amp; c) : c_(c) {}</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#aa57f0050c4d693919745d9a80e314473"> 44</a></span> <a class="code hl_function" href="class_adjustable_priority_queue.html#aa57f0050c4d693919745d9a80e314473">AdjustablePriorityQueue</a>(<span class="keyword">const</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a>&amp;) = <span class="keyword">delete</span>;</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a543b94701e57bcdf7c61476764cdb814"> 45</a></span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a>&amp; <a class="code hl_function" href="class_adjustable_priority_queue.html#a543b94701e57bcdf7c61476764cdb814">operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a>&amp;) = <span class="keyword">delete</span>;</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#acc9bddd1670d1451777f0835bfc6ea76"> 46</a></span> <a class="code hl_function" href="class_adjustable_priority_queue.html#acc9bddd1670d1451777f0835bfc6ea76">AdjustablePriorityQueue</a>(<a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a>&amp;&amp;) = <span class="keywordflow">default</span>;</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#ad3cd8512620148fe196dc2e4593d7b3a"> 47</a></span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a>&amp; <a class="code hl_function" href="class_adjustable_priority_queue.html#ad3cd8512620148fe196dc2e4593d7b3a">operator=</a>(<a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a>&amp;&amp;) = <span class="keywordflow">default</span>;</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> </div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f"> 49</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">Add</a>(T* val) {</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// Extend the size of the vector by one. We could just use</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// vector&lt;T&gt;::resize(), but maybe T is not default-constructible.</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> elems_.push_back(val);</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> AdjustUpwards(elems_.size() - 1);</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> }</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> </div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a36647f60b5f27624275724445403ea1d"> 56</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#a36647f60b5f27624275724445403ea1d">Remove</a>(T* val) {</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = elems_.size() - 1;</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keywordtype">int</span> i = val-&gt;GetHeapIndex();</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">if</span> (i == <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>) {</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> elems_.pop_back();</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> }</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> elems_[i] = elems_[<a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>];</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> elems_[i]-&gt;SetHeapIndex(i);</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> elems_.pop_back();</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">NoteChangedPriority</a>(elems_[i]);</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> }</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c"> 69</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(<span class="keyword">const</span> T* val)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordtype">int</span> i = val-&gt;GetHeapIndex();</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordflow">return</span> (i &gt;= 0 &amp;&amp; i &lt; elems_.size() &amp;&amp; elems_[i] == val);</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> }</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> </div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3"> 74</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">NoteChangedPriority</a>(T* val) {</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <a class="code hl_class" href="class_lower_priority_than.html">LowerPriorityThan&lt;T, Comp&gt;</a> lower_priority(&amp;c_);</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordtype">int</span> i = val-&gt;GetHeapIndex();</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordtype">int</span> parent = (i - 1) / 2;</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordflow">if</span> (lower_priority(elems_[parent], val)) {</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> AdjustUpwards(i);</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> AdjustDownwards(i);</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> }</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> }</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// If val ever changes its priority, you need to call this function</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// to notify the pq so it can move it in the heap accordingly.</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> </div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a503e1bfef34fc7acf03340ddd74b5872"> 87</a></span> T* <a class="code hl_function" href="class_adjustable_priority_queue.html#a503e1bfef34fc7acf03340ddd74b5872">Top</a>() { <span class="keywordflow">return</span> elems_[0]; }</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> </div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a97a27617c191bae734401e44c6cda63b"> 89</a></span> <span class="keyword">const</span> T* <a class="code hl_function" href="class_adjustable_priority_queue.html#a97a27617c191bae734401e44c6cda63b">Top</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> elems_[0]; }</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> </div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#aa301a6d8eec6b169f74ecf679eeca69c"> 91</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#aa301a6d8eec6b169f74ecf679eeca69c">AllTop</a>(std::vector&lt;T*&gt;* topvec) {</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> topvec-&gt;clear();</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="class_adjustable_priority_queue.html#a24926108b770033792d015cb86aeffb3">Size</a>() == 0) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> std::list&lt;int&gt; need_to_check_children;</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> need_to_check_children.push_back(0);</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// Implements breadth-first search down tree, stopping whenever</span></div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// there&#39;s an element &lt; top</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keywordflow">while</span> (!need_to_check_children.empty()) {</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordtype">int</span> ind = need_to_check_children.front();</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> need_to_check_children.pop_front();</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> topvec-&gt;push_back(elems_[ind]);</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordtype">int</span> leftchild = 1 + 2 * ind;</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keywordflow">if</span> (leftchild &lt; <a class="code hl_function" href="class_adjustable_priority_queue.html#a24926108b770033792d015cb86aeffb3">Size</a>()) {</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="class_lower_priority_than.html">LowerPriorityThan&lt;T, Comp&gt;</a>(&amp;c_)(elems_[leftchild], elems_[ind])) {</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> need_to_check_children.push_back(leftchild);</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> }</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keywordtype">int</span> rightchild = leftchild + 1;</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">if</span> (rightchild &lt; <a class="code hl_function" href="class_adjustable_priority_queue.html#a24926108b770033792d015cb86aeffb3">Size</a>() &amp;&amp;</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> !<a class="code hl_class" href="class_lower_priority_than.html">LowerPriorityThan&lt;T, Comp&gt;</a>(&amp;c_)(elems_[rightchild], elems_[ind])) {</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> need_to_check_children.push_back(rightchild);</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> }</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> }</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> }</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> }</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// If there are ties for the top, this returns all of them.</span></div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a701a584ce72cccbcce9cb0656b6c898b"> 117</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#a701a584ce72cccbcce9cb0656b6c898b">Pop</a>() { <a class="code hl_function" href="class_adjustable_priority_queue.html#a36647f60b5f27624275724445403ea1d">Remove</a>(<a class="code hl_function" href="class_adjustable_priority_queue.html#a503e1bfef34fc7acf03340ddd74b5872">Top</a>()); }</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> </div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a24926108b770033792d015cb86aeffb3"> 119</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#a24926108b770033792d015cb86aeffb3">Size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> elems_.size(); }</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> </div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// Returns the number of elements for which storage has been allocated.</span></div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#ae37167b9b5134bd482bc4e21d77b3f4b"> 122</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#ae37167b9b5134bd482bc4e21d77b3f4b">Capacity</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> elems_.capacity(); }</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> </div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// Allocates storage for a given number of elements.</span></div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a6b6b3e4f8f4a0d9b43e28ac622ca1e2b"> 125</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#a6b6b3e4f8f4a0d9b43e28ac622ca1e2b">SetCapacity</a>(<span class="keywordtype">size_t</span> c) { elems_.reserve(c); }</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> </div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a8e12342fc420701fbffd97025421575a"> 127</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#a8e12342fc420701fbffd97025421575a">IsEmpty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> elems_.empty(); }</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> </div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#aa71d36872f416feaa853788a7a7a7ef8"> 129</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>() { elems_.clear(); }</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> </div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// CHECKs that the heap is actually a heap (each &quot;parent&quot; of &gt;=</span></div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="comment">// priority than its child).</span></div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a0e2767a8e16637ccbcf3a04fa6761fe9"> 133</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="class_adjustable_priority_queue.html#a0e2767a8e16637ccbcf3a04fa6761fe9">CheckValid</a>() {</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; elems_.size(); ++i) {</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="keywordtype">int</span> left_child = 1 + 2 * i;</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">if</span> (left_child &lt; elems_.size()) {</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> !(<a class="code hl_class" href="class_lower_priority_than.html">LowerPriorityThan&lt;T, Comp&gt;</a>(&amp;c_))(elems_[i], elems_[left_child]));</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> }</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a> = left_child + 1;</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a> &lt; elems_.size()) {</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> !(<a class="code hl_class" href="class_lower_priority_than.html">LowerPriorityThan&lt;T, Comp&gt;</a>(&amp;c_))(elems_[i], elems_[<a class="code hl_variable" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a>]));</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> }</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> }</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> }</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> </div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// This is for debugging, e.g. the caller can use it to</span></div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// examine the heap for rationality w.r.t. other parts of the</span></div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// program.</span></div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a490e921eadeae7db0606158656c85188"> 151</a></span> <span class="keyword">const</span> std::vector&lt;T*&gt;* <a class="code hl_function" href="class_adjustable_priority_queue.html#a490e921eadeae7db0606158656c85188">Raw</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> &amp;elems_; }</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> </div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordtype">void</span> AdjustUpwards(<span class="keywordtype">int</span> i) {</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> T* <span class="keyword">const</span> t = elems_[i];</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keywordflow">while</span> (i &gt; 0) {</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keyword">const</span> <span class="keywordtype">int</span> parent = (i - 1) / 2;</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keywordflow">if</span> (!c_(*elems_[parent], *t)) {</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> }</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> elems_[i] = elems_[parent];</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> elems_[i]-&gt;SetHeapIndex(i);</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> i = parent;</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> }</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> elems_[i] = t;</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> t-&gt;SetHeapIndex(i);</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> }</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> </div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keywordtype">void</span> AdjustDownwards(<span class="keywordtype">int</span> i) {</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> T* <span class="keyword">const</span> t = elems_[i];</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keyword">const</span> <span class="keywordtype">int</span> left_child = 1 + 2 * i;</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keywordflow">if</span> (left_child &gt;= elems_.size()) {</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> }</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a> = left_child + 1;</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keyword">const</span> <span class="keywordtype">int</span> next_i = (<a class="code hl_variable" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a> &lt; elems_.size() &amp;&amp;</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> c_(*elems_[left_child], *elems_[<a class="code hl_variable" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a>]))</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> ? <a class="code hl_variable" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a></div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> : left_child;</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keywordflow">if</span> (!c_(*t, *elems_[next_i])) {</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> }</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> elems_[i] = elems_[next_i];</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> elems_[i]-&gt;SetHeapIndex(i);</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> i = next_i;</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> }</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> elems_[i] = t;</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> t-&gt;SetHeapIndex(i);</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> }</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> </div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> Comp c_;</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> std::vector&lt;T*&gt; elems_;</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span>};</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> </div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_BASE_ADJUSTABLE_PRIORITY_QUEUE_H_</span></div>
<div class="ttc" id="aarc__flow__builder_8cc_html_a37a60bd8e1de6871a556b2822884edea"><div class="ttname"><a href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a></div><div class="ttdeci">int right_child</div><div class="ttdef"><b>Definition:</b> <a href="arc__flow__builder_8cc_source.html#l00064">arc_flow_builder.cc:64</a></div></div>
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
<div class="ttc" id="abasictypes_8h_html"><div class="ttname"><a href="basictypes_8h.html">basictypes.h</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html"><div class="ttname"><a href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a></div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00038">adjustable_priority_queue.h:38</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a0e2767a8e16637ccbcf3a04fa6761fe9"><div class="ttname"><a href="class_adjustable_priority_queue.html#a0e2767a8e16637ccbcf3a04fa6761fe9">AdjustablePriorityQueue::CheckValid</a></div><div class="ttdeci">void CheckValid()</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00133">adjustable_priority_queue.h:133</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a1b5aac314749f1999e7c1b78da268877"><div class="ttname"><a href="class_adjustable_priority_queue.html#a1b5aac314749f1999e7c1b78da268877">AdjustablePriorityQueue::AdjustablePriorityQueue</a></div><div class="ttdeci">AdjustablePriorityQueue()</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00042">adjustable_priority_queue.h:42</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a24926108b770033792d015cb86aeffb3"><div class="ttname"><a href="class_adjustable_priority_queue.html#a24926108b770033792d015cb86aeffb3">AdjustablePriorityQueue::Size</a></div><div class="ttdeci">int Size() const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00119">adjustable_priority_queue.h:119</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a36647f60b5f27624275724445403ea1d"><div class="ttname"><a href="class_adjustable_priority_queue.html#a36647f60b5f27624275724445403ea1d">AdjustablePriorityQueue::Remove</a></div><div class="ttdeci">void Remove(T *val)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00056">adjustable_priority_queue.h:56</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a490e921eadeae7db0606158656c85188"><div class="ttname"><a href="class_adjustable_priority_queue.html#a490e921eadeae7db0606158656c85188">AdjustablePriorityQueue::Raw</a></div><div class="ttdeci">const std::vector&lt; T * &gt; * Raw() const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00151">adjustable_priority_queue.h:151</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a503e1bfef34fc7acf03340ddd74b5872"><div class="ttname"><a href="class_adjustable_priority_queue.html#a503e1bfef34fc7acf03340ddd74b5872">AdjustablePriorityQueue::Top</a></div><div class="ttdeci">T * Top()</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00087">adjustable_priority_queue.h:87</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a506169056c5f470fabdf77aa1934a5a3"><div class="ttname"><a href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">AdjustablePriorityQueue::NoteChangedPriority</a></div><div class="ttdeci">void NoteChangedPriority(T *val)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00074">adjustable_priority_queue.h:74</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a543b94701e57bcdf7c61476764cdb814"><div class="ttname"><a href="class_adjustable_priority_queue.html#a543b94701e57bcdf7c61476764cdb814">AdjustablePriorityQueue::operator=</a></div><div class="ttdeci">AdjustablePriorityQueue &amp; operator=(const AdjustablePriorityQueue &amp;)=delete</div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a6b6b3e4f8f4a0d9b43e28ac622ca1e2b"><div class="ttname"><a href="class_adjustable_priority_queue.html#a6b6b3e4f8f4a0d9b43e28ac622ca1e2b">AdjustablePriorityQueue::SetCapacity</a></div><div class="ttdeci">void SetCapacity(size_t c)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00125">adjustable_priority_queue.h:125</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a701a584ce72cccbcce9cb0656b6c898b"><div class="ttname"><a href="class_adjustable_priority_queue.html#a701a584ce72cccbcce9cb0656b6c898b">AdjustablePriorityQueue::Pop</a></div><div class="ttdeci">void Pop()</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00117">adjustable_priority_queue.h:117</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a742bb30d772bef615843b04c073a56c6"><div class="ttname"><a href="class_adjustable_priority_queue.html#a742bb30d772bef615843b04c073a56c6">AdjustablePriorityQueue::AdjustablePriorityQueue</a></div><div class="ttdeci">AdjustablePriorityQueue(const Comp &amp;c)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00043">adjustable_priority_queue.h:43</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a7d1005d75f40525f91a2acb84348bc3c"><div class="ttname"><a href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">AdjustablePriorityQueue::Contains</a></div><div class="ttdeci">bool Contains(const T *val) const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00069">adjustable_priority_queue.h:69</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a8e12342fc420701fbffd97025421575a"><div class="ttname"><a href="class_adjustable_priority_queue.html#a8e12342fc420701fbffd97025421575a">AdjustablePriorityQueue::IsEmpty</a></div><div class="ttdeci">bool IsEmpty() const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00127">adjustable_priority_queue.h:127</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_a97a27617c191bae734401e44c6cda63b"><div class="ttname"><a href="class_adjustable_priority_queue.html#a97a27617c191bae734401e44c6cda63b">AdjustablePriorityQueue::Top</a></div><div class="ttdeci">const T * Top() const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00089">adjustable_priority_queue.h:89</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_aa301a6d8eec6b169f74ecf679eeca69c"><div class="ttname"><a href="class_adjustable_priority_queue.html#aa301a6d8eec6b169f74ecf679eeca69c">AdjustablePriorityQueue::AllTop</a></div><div class="ttdeci">void AllTop(std::vector&lt; T * &gt; *topvec)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00091">adjustable_priority_queue.h:91</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_aa57f0050c4d693919745d9a80e314473"><div class="ttname"><a href="class_adjustable_priority_queue.html#aa57f0050c4d693919745d9a80e314473">AdjustablePriorityQueue::AdjustablePriorityQueue</a></div><div class="ttdeci">AdjustablePriorityQueue(const AdjustablePriorityQueue &amp;)=delete</div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="class_adjustable_priority_queue.html#aa71d36872f416feaa853788a7a7a7ef8">AdjustablePriorityQueue::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00129">adjustable_priority_queue.h:129</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_ac312fa979ea8afd5deabd6b581b3bb1f"><div class="ttname"><a href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">AdjustablePriorityQueue::Add</a></div><div class="ttdeci">void Add(T *val)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00049">adjustable_priority_queue.h:49</a></div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_acc9bddd1670d1451777f0835bfc6ea76"><div class="ttname"><a href="class_adjustable_priority_queue.html#acc9bddd1670d1451777f0835bfc6ea76">AdjustablePriorityQueue::AdjustablePriorityQueue</a></div><div class="ttdeci">AdjustablePriorityQueue(AdjustablePriorityQueue &amp;&amp;)=default</div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_ad3cd8512620148fe196dc2e4593d7b3a"><div class="ttname"><a href="class_adjustable_priority_queue.html#ad3cd8512620148fe196dc2e4593d7b3a">AdjustablePriorityQueue::operator=</a></div><div class="ttdeci">AdjustablePriorityQueue &amp; operator=(AdjustablePriorityQueue &amp;&amp;)=default</div></div>
<div class="ttc" id="aclass_adjustable_priority_queue_html_ae37167b9b5134bd482bc4e21d77b3f4b"><div class="ttname"><a href="class_adjustable_priority_queue.html#ae37167b9b5134bd482bc4e21d77b3f4b">AdjustablePriorityQueue::Capacity</a></div><div class="ttdeci">int Capacity() const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00122">adjustable_priority_queue.h:122</a></div></div>
<div class="ttc" id="aclass_lower_priority_than_html"><div class="ttname"><a href="class_lower_priority_than.html">LowerPriorityThan</a></div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00028">adjustable_priority_queue.h:28</a></div></div>
<div class="ttc" id="aclass_lower_priority_than_html_a5c850fe8c2e849c38b2316d0b04ac64e"><div class="ttname"><a href="class_lower_priority_than.html#a5c850fe8c2e849c38b2316d0b04ac64e">LowerPriorityThan::operator()</a></div><div class="ttdeci">bool operator()(T *a, T *b) const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00031">adjustable_priority_queue.h:31</a></div></div>
<div class="ttc" id="aclass_lower_priority_than_html_aaf52c30ff76c4de1dd9e347c1fdb023e"><div class="ttname"><a href="class_lower_priority_than.html#aaf52c30ff76c4de1dd9e347c1fdb023e">LowerPriorityThan::LowerPriorityThan</a></div><div class="ttdeci">LowerPriorityThan(Comparator *compare)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00030">adjustable_priority_queue.h:30</a></div></div>
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
<div class="ttc" id="aconstraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a></div><div class="ttdeci">int64_t a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00046">constraint_solver/table.cc:46</a></div></div>
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
<div class="ttc" id="asparse__submatrix_8cc_html_a4d53eac2ef2732c28fa9fb663e0c19a7"><div class="ttname"><a href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a></div><div class="ttdeci">std::optional&lt; int64_t &gt; end</div><div class="ttdef"><b>Definition:</b> <a href="sparse__submatrix_8cc_source.html#l00036">sparse_submatrix.cc:36</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- 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_8f9dc966244f4c6e9b2fa0dee1e4ef1a.html">base</a></li><li class="navelem"><a class="el" href="adjustable__priority__queue_8h.html">adjustable_priority_queue.h</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink