132 lines
45 KiB
HTML
132 lines
45 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: integer_pq.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('integer__pq_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">integer_pq.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="integer__pq_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="comment">// This file contains and adjustable priority queue templated by an Element</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// class that must:</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// - Be efficiently copiable and storable in a std::vector<Element>.</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// - Be comparable via the templated Compare class. Top() will returns</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// the element with the largest priority (like std::priority_queue).</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// - Implements the "int Index() const" function that must returns an integer</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// that uniquely identify this particular element. Ideally this index must</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// be dense in [0, max_num_elements).</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">//</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#ifndef OR_TOOLS_UTIL_INTEGER_PQ_H_</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#define OR_TOOLS_UTIL_INTEGER_PQ_H_</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</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="comment">// Classic asjustable priority queue implementation. It behaves exactly the same</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// as AdjustablePriorityQueue regarding identical elements, but it uses less</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// memory and is in general slightly faster.</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Element, <span class="keyword">class</span> Compare = std::less<Element>></div><div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html"> 37</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_integer_priority_queue.html">IntegerPriorityQueue</a> {</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="comment">// Starts with an empty queue and reserve space for n elements.</span></div><div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#aef67f01d938975f9fb63d2b9716ce031"> 40</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#aef67f01d938975f9fb63d2b9716ce031">IntegerPriorityQueue</a>(<span class="keywordtype">int</span> n = 0, Compare comp = Compare())</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  : size_(0), less_(comp) {</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a21cecbc35e3da9931f94afa3229354dc">Reserve</a>(n);</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  }</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// Increases the space reservation to n elements indices in [0, n). All</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// elements passed to the other functions must have an Index() smaller than</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">// this n.</span></div><div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#a21cecbc35e3da9931f94afa3229354dc"> 48</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a21cecbc35e3da9931f94afa3229354dc">Reserve</a>(<span class="keywordtype">int</span> n) {</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// The heap_ starts at 1 for faster left/right child indices computation.</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// This also allow us to use position 0 for element not in the queue.</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  heap_.resize(n + 1);</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  position_.resize(n, 0);</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  }</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>  <span class="comment">// Returns the number of elements currently present.</span></div><div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#a24926108b770033792d015cb86aeffb3"> 56</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a24926108b770033792d015cb86aeffb3">Size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> size_; }</div><div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#a8e12342fc420701fbffd97025421575a"> 57</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a8e12342fc420701fbffd97025421575a">IsEmpty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> size_ == 0; }</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// Removes all elements from the queue.</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// TODO(user): we could make this sparse if it is needed.</span></div><div class="line"><a name="l00061"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#aa71d36872f416feaa853788a7a7a7ef8"> 61</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>() {</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  size_ = 0;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  position_.assign(position_.size(), 0);</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  }</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">// Returns true if the element with given index is currently in the queue.</span></div><div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#a06fe50b32a75c0a071b68ebbacb8f681"> 67</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a06fe50b32a75c0a071b68ebbacb8f681">Contains</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> position_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] != 0; }</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">// Adds the given element to the queue and set its priority.</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">// Preconditions: Contains(element) must be false.</span></div><div class="line"><a name="l00071"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#a260b134ff6e3aa564e8ba1f879aea3d9"> 71</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a260b134ff6e3aa564e8ba1f879aea3d9">Add</a>(Element element) {</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!<a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a06fe50b32a75c0a071b68ebbacb8f681">Contains</a>(element.Index()));</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  SetAndIncreasePriority(++size_, element);</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> </div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// Top() returns the top element and Pop() remove it from the queue.</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// Preconditions: IsEmpty() must be false.</span></div><div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#a8f1cb7a5e2de2945a3dcecd15a09a0a4"> 78</a></span>  Element <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a8f1cb7a5e2de2945a3dcecd15a09a0a4">Top</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> heap_[1]; }</div><div class="line"><a name="l00079"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#a701a584ce72cccbcce9cb0656b6c898b"> 79</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a701a584ce72cccbcce9cb0656b6c898b">Pop</a>() {</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!<a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a8e12342fc420701fbffd97025421575a">IsEmpty</a>());</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  position_[<a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a8f1cb7a5e2de2945a3dcecd15a09a0a4">Top</a>().Index()] = 0;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_size = size_--;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">if</span> (old_size > 1) SetAndDecreasePriority(1, heap_[old_size]);</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// Removes the element with given index from the queue.</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// Preconditions: Contains(index) must be true.</span></div><div class="line"><a name="l00088"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#a50af808bf213e4cb397f5f458af96cb5"> 88</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a50af808bf213e4cb397f5f458af96cb5">Remove</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a06fe50b32a75c0a071b68ebbacb8f681">Contains</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>));</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> to_replace = position_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  position_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = 0;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_size = size_--;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span> (to_replace == old_size) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">const</span> Element element = heap_[old_size];</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (less_(element, heap_[to_replace])) {</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  SetAndDecreasePriority(to_replace, element);</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  SetAndIncreasePriority(to_replace, element);</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  }</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// Change the priority of the given element and adjust the queue.</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">//</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// Preconditions: Contains(element) must be true.</span></div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#a115ac0fc2fcd2f50cf756b94a329fb3c"> 105</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a115ac0fc2fcd2f50cf756b94a329fb3c">ChangePriority</a>(Element element) {</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a06fe50b32a75c0a071b68ebbacb8f681">Contains</a>(element.Index()));</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> i = position_[element.Index()];</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">if</span> (i > 1 && less_(heap_[i >> 1], element)) {</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  SetAndIncreasePriority(i, element);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  SetAndDecreasePriority(i, element);</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">// Optimized version of ChangePriority() when we know the direction.</span></div><div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#a476176e5749d53acadc6d3ef6a3b5e61"> 116</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a476176e5749d53acadc6d3ef6a3b5e61">IncreasePriority</a>(Element element) {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  SetAndIncreasePriority(position_[element.Index()], element);</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="classoperations__research_1_1_integer_priority_queue.html#ada9fbc26f4158e32295782c2cee8d62d"> 119</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#ada9fbc26f4158e32295782c2cee8d62d">DecreasePriority</a>(Element element) {</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  SetAndDecreasePriority(position_[element.Index()], element);</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  }</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">// Returns the element with given index.</span></div><div class="line"><a name="l00124"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#a5687a1c992a159e714037bf6ccfa7f4a"> 124</a></span>  Element <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a5687a1c992a159e714037bf6ccfa7f4a">GetElement</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> heap_[position_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]]; }</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// For i in [0, Size()) returns an element currently in the queue.</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// This can be used to get a random element from the queue for instance.</span></div><div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_integer_priority_queue.html#a0881dd4925133cfdf55468935ba384a4"> 128</a></span>  Element <a class="code" href="classoperations__research_1_1_integer_priority_queue.html#a0881dd4925133cfdf55468935ba384a4">QueueElement</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> heap_[1 + i]; }</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">// Puts the given element at heap index i.</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_set.html">Set</a>(<span class="keywordtype">int</span> i, Element element) {</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  heap_[i] = element;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  position_[element.Index()] = i;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// Puts the given element at heap index i and update the heap knowing that the</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// element has a priority <= than the priority of the element currently at</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// this position.</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordtype">void</span> SetAndDecreasePriority(<span class="keywordtype">int</span> i, <span class="keyword">const</span> Element element) {</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = size_;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> left = i * 2;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> right = left + 1;</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">if</span> (right > size) {</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">if</span> (left > size) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">const</span> Element left_element = heap_[left];</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">if</span> (!less_(element, left_element)) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  Set(i, left_element);</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  i = left;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">break</span>;</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">const</span> Element left_element = heap_[left];</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">const</span> Element right_element = heap_[right];</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">if</span> (less_(left_element, right_element)) {</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (!less_(element, right_element)) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  Set(i, right_element);</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  i = right;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">if</span> (!less_(element, left_element)) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  Set(i, left_element);</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  i = left;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</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>  Set(i, element);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  }</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>  <span class="comment">// Puts the given element at heap index i and update the heap knowing that the</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// element has a priority >= than the priority of the element currently at</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// this position.</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordtype">void</span> SetAndIncreasePriority(<span class="keywordtype">int</span> i, <span class="keyword">const</span> Element element) {</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">while</span> (i > 1) {</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> parent = i >> 1;</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">const</span> Element parent_element = heap_[parent];</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span> (!less_(parent_element, element)) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  Set(i, parent_element);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  i = parent;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  Set(i, element);</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  }</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordtype">int</span> size_;</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  Compare less_;</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  std::vector<Element> heap_;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  std::vector<int> position_;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> };</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> } <span class="comment">// namespace operations_research</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="preprocessor">#endif // OR_TOOLS_UTIL_INTEGER_PQ_H_</span></div><div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_aef67f01d938975f9fb63d2b9716ce031"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#aef67f01d938975f9fb63d2b9716ce031">operations_research::IntegerPriorityQueue::IntegerPriorityQueue</a></div><div class="ttdeci">IntegerPriorityQueue(int n=0, Compare comp=Compare())</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00040">integer_pq.h:40</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_a50af808bf213e4cb397f5f458af96cb5"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#a50af808bf213e4cb397f5f458af96cb5">operations_research::IntegerPriorityQueue::Remove</a></div><div class="ttdeci">void Remove(int index)</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00088">integer_pq.h:88</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_a0881dd4925133cfdf55468935ba384a4"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#a0881dd4925133cfdf55468935ba384a4">operations_research::IntegerPriorityQueue::QueueElement</a></div><div class="ttdeci">Element QueueElement(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00128">integer_pq.h:128</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_a21cecbc35e3da9931f94afa3229354dc"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#a21cecbc35e3da9931f94afa3229354dc">operations_research::IntegerPriorityQueue::Reserve</a></div><div class="ttdeci">void Reserve(int n)</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00048">integer_pq.h:48</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html">operations_research::IntegerPriorityQueue</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00037">integer_pq.h:37</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="classoperations__research_1_1_integer_priority_queue_html_a06fe50b32a75c0a071b68ebbacb8f681"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#a06fe50b32a75c0a071b68ebbacb8f681">operations_research::IntegerPriorityQueue::Contains</a></div><div class="ttdeci">bool Contains(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00067">integer_pq.h:67</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_ada9fbc26f4158e32295782c2cee8d62d"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#ada9fbc26f4158e32295782c2cee8d62d">operations_research::IntegerPriorityQueue::DecreasePriority</a></div><div class="ttdeci">void DecreasePriority(Element element)</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00119">integer_pq.h:119</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::IntegerPriorityQueue::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00061">integer_pq.h:61</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_a260b134ff6e3aa564e8ba1f879aea3d9"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#a260b134ff6e3aa564e8ba1f879aea3d9">operations_research::IntegerPriorityQueue::Add</a></div><div class="ttdeci">void Add(Element element)</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00071">integer_pq.h:71</a></div></div>
|
|
<div class="ttc" id="pack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_a8f1cb7a5e2de2945a3dcecd15a09a0a4"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#a8f1cb7a5e2de2945a3dcecd15a09a0a4">operations_research::IntegerPriorityQueue::Top</a></div><div class="ttdeci">Element Top() const</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00078">integer_pq.h:78</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_set_html"><div class="ttname"><a href="classoperations__research_1_1_set.html">operations_research::Set</a></div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00128">hamiltonian_path.h:128</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_a24926108b770033792d015cb86aeffb3"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#a24926108b770033792d015cb86aeffb3">operations_research::IntegerPriorityQueue::Size</a></div><div class="ttdeci">int Size() const</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00056">integer_pq.h:56</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_a476176e5749d53acadc6d3ef6a3b5e61"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#a476176e5749d53acadc6d3ef6a3b5e61">operations_research::IntegerPriorityQueue::IncreasePriority</a></div><div class="ttdeci">void IncreasePriority(Element element)</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00116">integer_pq.h:116</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_a115ac0fc2fcd2f50cf756b94a329fb3c"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#a115ac0fc2fcd2f50cf756b94a329fb3c">operations_research::IntegerPriorityQueue::ChangePriority</a></div><div class="ttdeci">void ChangePriority(Element element)</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00105">integer_pq.h:105</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_a701a584ce72cccbcce9cb0656b6c898b"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#a701a584ce72cccbcce9cb0656b6c898b">operations_research::IntegerPriorityQueue::Pop</a></div><div class="ttdeci">void Pop()</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00079">integer_pq.h:79</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_a8e12342fc420701fbffd97025421575a"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#a8e12342fc420701fbffd97025421575a">operations_research::IntegerPriorityQueue::IsEmpty</a></div><div class="ttdeci">bool IsEmpty() const</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00057">integer_pq.h:57</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_integer_priority_queue_html_a5687a1c992a159e714037bf6ccfa7f4a"><div class="ttname"><a href="classoperations__research_1_1_integer_priority_queue.html#a5687a1c992a159e714037bf6ccfa7f4a">operations_research::IntegerPriorityQueue::GetElement</a></div><div class="ttdeci">Element GetElement(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="integer__pq_8h_source.html#l00124">integer_pq.h:124</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
</div><!-- 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_a3328a0ea67a2aaa160c2783ffbaa5dc.html">util</a></li><li class="navelem"><a class="el" href="integer__pq_8h.html">integer_pq.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>
|