138 lines
47 KiB
HTML
138 lines
47 KiB
HTML
<!-- 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.8.15"/>
|
|
<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>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</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
|
|
 <span id="projectnumber">9.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('adjustable__priority__queue_8h_source.html','');});
|
|
/* @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 name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#ifndef OR_TOOLS_BASE_ADJUSTABLE_PRIORITY_QUEUE_H_</span></div><div class="line"><a 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 name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <stddef.h></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <functional></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <list></span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="basictypes_8h.html">ortools/base/basictypes.h</a>"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> Comparator></div><div class="line"><a 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" href="class_lower_priority_than.html">LowerPriorityThan</a> {</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keyword">public</span>:</div><div class="line"><a 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" href="class_lower_priority_than.html#aaf52c30ff76c4de1dd9e347c1fdb023e">LowerPriorityThan</a>(Comparator* compare) : compare_(compare) {}</div><div class="line"><a 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" href="class_lower_priority_than.html#a5c850fe8c2e849c38b2316d0b04ac64e">operator()</a>(T* <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, T* <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (*compare_)(*<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, *<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>); }</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  Comparator* compare_;</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> };</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> Comp = std::less<T> ></div><div class="line"><a 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" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a> {</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="comment">// The objects references 'c' and 'm' are not required to be alive for the</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// lifetime of this object.</span></div><div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a1b5aac314749f1999e7c1b78da268877"> 42</a></span>  <a class="code" href="class_adjustable_priority_queue.html#a1b5aac314749f1999e7c1b78da268877">AdjustablePriorityQueue</a>() {}</div><div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a742bb30d772bef615843b04c073a56c6"> 43</a></span>  <a class="code" href="class_adjustable_priority_queue.html#a742bb30d772bef615843b04c073a56c6">AdjustablePriorityQueue</a>(<span class="keyword">const</span> Comp& c) : c_(c) {}</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <a class="code" href="class_adjustable_priority_queue.html#a1b5aac314749f1999e7c1b78da268877">AdjustablePriorityQueue</a>(<span class="keyword">const</span> <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a>&) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a>& <a class="code" href="class_adjustable_priority_queue.html#a2027e040afd5cf197a7ebe39c86a5d1a">operator=</a>(<span class="keyword">const</span> <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a>&) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <a class="code" href="class_adjustable_priority_queue.html#a1b5aac314749f1999e7c1b78da268877">AdjustablePriorityQueue</a>(<a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a>& <a class="code" href="class_adjustable_priority_queue.html#a2027e040afd5cf197a7ebe39c86a5d1a">operator=</a>(<a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div><div class="line"><a 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" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">Add</a>(T* val) {</div><div class="line"><a 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 name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// vector<T>::resize(), but maybe T is not default-constructible.</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  elems_.push_back(val);</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  AdjustUpwards(elems_.size() - 1);</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a 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" href="class_adjustable_priority_queue.html#a36647f60b5f27624275724445403ea1d">Remove</a>(T* val) {</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordtype">int</span> end = elems_.size() - 1;</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordtype">int</span> i = val->GetHeapIndex();</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">if</span> (i == end) {</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  elems_.pop_back();</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  elems_[i] = elems_[end];</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  elems_[i]->SetHeapIndex(i);</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  elems_.pop_back();</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <a class="code" href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">NoteChangedPriority</a>(elems_[i]);</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  }</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a 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" 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 name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordtype">int</span> i = val->GetHeapIndex();</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">return</span> (i >= 0 && i < elems_.size() && elems_[i] == val);</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  }</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </div><div class="line"><a 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" href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">NoteChangedPriority</a>(T* val) {</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <a class="code" href="class_lower_priority_than.html">LowerPriorityThan<T, Comp></a> lower_priority(&c_);</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordtype">int</span> i = val->GetHeapIndex();</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordtype">int</span> parent = (i - 1) / 2;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">if</span> (lower_priority(elems_[parent], val)) {</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  AdjustUpwards(i);</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  AdjustDownwards(i);</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div><div class="line"><a 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 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 name="l00086"></a><span class="lineno"> 86</span> </div><div class="line"><a name="l00087"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a8e7578f2135632c4d0ce66fd5936231e"> 87</a></span>  T* <a class="code" href="class_adjustable_priority_queue.html#a8e7578f2135632c4d0ce66fd5936231e">Top</a>() { <span class="keywordflow">return</span> elems_[0]; }</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div><div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a3026a9dbbe6ffea38a85e05df3286c82"> 89</a></span>  <span class="keyword">const</span> T* <a class="code" href="class_adjustable_priority_queue.html#a3026a9dbbe6ffea38a85e05df3286c82">Top</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> elems_[0]; }</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div><div class="line"><a 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" href="class_adjustable_priority_queue.html#aa301a6d8eec6b169f74ecf679eeca69c">AllTop</a>(std::vector<T*>* topvec) {</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  topvec->clear();</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span> (<a class="code" href="class_adjustable_priority_queue.html#a24926108b770033792d015cb86aeffb3">Size</a>() == 0) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  std::list<int> need_to_check_children;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  need_to_check_children.push_back(0);</div><div class="line"><a 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 name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// there's an element < top</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">while</span> (!need_to_check_children.empty()) {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordtype">int</span> ind = need_to_check_children.front();</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  need_to_check_children.pop_front();</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  topvec->push_back(elems_[ind]);</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordtype">int</span> leftchild = 1 + 2 * ind;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">if</span> (leftchild < <a class="code" href="class_adjustable_priority_queue.html#a24926108b770033792d015cb86aeffb3">Size</a>()) {</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">if</span> (!<a class="code" href="class_lower_priority_than.html">LowerPriorityThan<T, Comp></a>(&c_)(elems_[leftchild], elems_[ind])) {</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  need_to_check_children.push_back(leftchild);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordtype">int</span> rightchild = leftchild + 1;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">if</span> (rightchild < <a class="code" href="class_adjustable_priority_queue.html#a24926108b770033792d015cb86aeffb3">Size</a>() &&</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  !<a class="code" href="class_lower_priority_than.html">LowerPriorityThan<T, Comp></a>(&c_)(elems_[rightchild], elems_[ind])) {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  need_to_check_children.push_back(rightchild);</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  }</div><div class="line"><a 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 name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a 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" href="class_adjustable_priority_queue.html#a701a584ce72cccbcce9cb0656b6c898b">Pop</a>() { <a class="code" href="class_adjustable_priority_queue.html#a36647f60b5f27624275724445403ea1d">Remove</a>(<a class="code" href="class_adjustable_priority_queue.html#a8e7578f2135632c4d0ce66fd5936231e">Top</a>()); }</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a 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" 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 name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a 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 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" 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 name="l00123"></a><span class="lineno"> 123</span> </div><div class="line"><a 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 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" href="class_adjustable_priority_queue.html#a6b6b3e4f8f4a0d9b43e28ac622ca1e2b">SetCapacity</a>(<span class="keywordtype">size_t</span> c) { elems_.reserve(c); }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a 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" 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 name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a 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" href="class_adjustable_priority_queue.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>() { elems_.clear(); }</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">// CHECKs that the heap is actually a heap (each "parent" of >=</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="comment">// priority than its child).</span></div><div class="line"><a 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" href="class_adjustable_priority_queue.html#a0e2767a8e16637ccbcf3a04fa6761fe9">CheckValid</a>() {</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < elems_.size(); ++i) {</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordtype">int</span> left_child = 1 + 2 * i;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">if</span> (left_child < elems_.size()) {</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  !(<a class="code" href="class_lower_priority_than.html">LowerPriorityThan<T, Comp></a>(&c_))(elems_[i], elems_[left_child]));</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  }</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordtype">int</span> right_child = left_child + 1;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (right_child < elems_.size()) {</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  !(<a class="code" href="class_lower_priority_than.html">LowerPriorityThan<T, Comp></a>(&c_))(elems_[i], elems_[right_child]));</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  }</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a 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 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 name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// program.</span></div><div class="line"><a name="l00151"></a><span class="lineno"><a class="line" href="class_adjustable_priority_queue.html#a3851da81ad9a9c858fc40be1f3f7baf2"> 151</a></span>  <span class="keyword">const</span> std::vector<T*>* <a class="code" href="class_adjustable_priority_queue.html#a3851da81ad9a9c858fc40be1f3f7baf2">Raw</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> &elems_; }</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">private</span>:</div><div class="line"><a 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 name="l00155"></a><span class="lineno"> 155</span>  T* <span class="keyword">const</span> t = elems_[i];</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">while</span> (i > 0) {</div><div class="line"><a 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 name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">if</span> (!c_(*elems_[parent], *t)) {</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  elems_[i] = elems_[parent];</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  elems_[i]->SetHeapIndex(i);</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  i = parent;</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  elems_[i] = t;</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  t->SetHeapIndex(i);</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  }</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div><div class="line"><a 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 name="l00170"></a><span class="lineno"> 170</span>  T* <span class="keyword">const</span> t = elems_[i];</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div><div class="line"><a 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 name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">if</span> (left_child >= elems_.size()) {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  }</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> right_child = left_child + 1;</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> next_i = (right_child < elems_.size() &&</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  c_(*elems_[left_child], *elems_[right_child]))</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  ? right_child</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  : left_child;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">if</span> (!c_(*t, *elems_[next_i])) {</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  }</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  elems_[i] = elems_[next_i];</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  elems_[i]->SetHeapIndex(i);</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  i = next_i;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  }</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  elems_[i] = t;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  t->SetHeapIndex(i);</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  }</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> </div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  Comp c_;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  std::vector<T*> elems_;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> };</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="preprocessor">#endif // OR_TOOLS_BASE_ADJUSTABLE_PRIORITY_QUEUE_H_</span></div><div class="ttc" id="base_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#l00491">base/logging.h:491</a></div></div>
|
|
<div class="ttc" id="class_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="class_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="class_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="class_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< T * > *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="constraint__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="macros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="class_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="class_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="class_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="class_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="class_adjustable_priority_queue_html_a3026a9dbbe6ffea38a85e05df3286c82"><div class="ttname"><a href="class_adjustable_priority_queue.html#a3026a9dbbe6ffea38a85e05df3286c82">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="class_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="class_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="class_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 &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="base_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="class_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="class_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="class_adjustable_priority_queue_html_a8e7578f2135632c4d0ce66fd5936231e"><div class="ttname"><a href="class_adjustable_priority_queue.html#a8e7578f2135632c4d0ce66fd5936231e">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="class_adjustable_priority_queue_html_a3851da81ad9a9c858fc40be1f3f7baf2"><div class="ttname"><a href="class_adjustable_priority_queue.html#a3851da81ad9a9c858fc40be1f3f7baf2">AdjustablePriorityQueue::Raw</a></div><div class="ttdeci">const std::vector< T * > * 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="class_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="class_adjustable_priority_queue_html_a2027e040afd5cf197a7ebe39c86a5d1a"><div class="ttname"><a href="class_adjustable_priority_queue.html#a2027e040afd5cf197a7ebe39c86a5d1a">AdjustablePriorityQueue::operator=</a></div><div class="ttdeci">AdjustablePriorityQueue & operator=(const AdjustablePriorityQueue &)=delete</div></div>
|
|
<div class="ttc" id="class_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="class_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="class_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="basictypes_8h_html"><div class="ttname"><a href="basictypes_8h.html">basictypes.h</a></div></div>
|
|
<div class="ttc" id="class_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="constraint__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><!-- 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.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|