141 lines
68 KiB
HTML
141 lines
68 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: dynamic_partition.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<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('dynamic__partition_8cc_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">dynamic_partition.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="dynamic__partition_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <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">#include "<a class="code" href="dynamic__partition_8h.html">ortools/algorithms/dynamic_partition.h</a>"</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <cstdint></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 "absl/strings/str_format.h"</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "absl/strings/str_join.h"</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="murmur_8h.html">ortools/base/murmur.h</a>"</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="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="keyword">namespace </span>{</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> uint64_t FprintOfInt32(<span class="keywordtype">int</span> i) {</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceutil__hash.html#aefdb33a41f3439b534ff91f3140c5594">util_hash::MurmurHash64</a>(reinterpret_cast<const char*>(&i),</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> }</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_partition.html#ac86affffe0db21281ab1db3b23bbebc8"> 32</a></span> <a class="code" href="classoperations__research_1_1_dynamic_partition.html#ac86affffe0db21281ab1db3b23bbebc8">DynamicPartition::DynamicPartition</a>(<span class="keywordtype">int</span> num_elements) {</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(num_elements, 0);</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  element_.assign(num_elements, -1);</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  index_of_.assign(num_elements, -1);</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_elements; ++i) {</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  element_[i] = i;</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  index_of_[i] = i;</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  }</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  part_of_.assign(num_elements, 0);</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  uint64_t fprint = 0;</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_elements; ++i) fprint ^= FprintOfInt32(i);</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  part_.push_back(Part(<span class="comment">/*start_index=*/</span>0, <span class="comment">/*end_index=*/</span>num_elements,</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">/*parent_part=*/</span>0,</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">/*fprint=*/</span>fprint));</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> }</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_partition.html#a283c8e838eafb240eb24283ab4288254"> 48</a></span> <a class="code" href="classoperations__research_1_1_dynamic_partition.html#ac86affffe0db21281ab1db3b23bbebc8">DynamicPartition::DynamicPartition</a>(</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">const</span> std::vector<int>& initial_part_of_element) {</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">if</span> (initial_part_of_element.empty()) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  part_of_ = initial_part_of_element;</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> n = part_of_.size();</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_parts = 1 + *std::max_element(part_of_.begin(), part_of_.end());</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, *std::min_element(part_of_.begin(), part_of_.end()));</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  part_.resize(num_parts);</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> </div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// Compute the part fingerprints.</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; ++i) part_[part_of_[i]].fprint ^= FprintOfInt32(i);</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// Compute the actual start indices of each part, knowing that we'll sort</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// them as they were given implicitly in "initial_part_of_element".</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// The code looks a bit weird to do it in-place, with no additional memory.</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p = 0; p < num_parts; ++p) {</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  part_[p].end_index = 0; <span class="comment">// Temporarily utilized as size_of_part.</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  part_[p].parent_part = p;</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  }</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> p : part_of_) ++part_[p].end_index; <span class="comment">// size_of_part</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordtype">int</span> sum_part_sizes = 0;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p = 0; p < num_parts; ++p) {</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  part_[p].start_index = sum_part_sizes;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  sum_part_sizes += part_[p].end_index; <span class="comment">// size of part.</span></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"> 74</span>  <span class="comment">// Now that we have the correct start indices, we set the end indices to the</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">// start indices, and incrementally add all elements to their part, adjusting</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// the end indices as we go.</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">for</span> (Part& part : part_) part.end_index = part.start_index;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  element_.assign(n, -1);</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  index_of_.assign(n, -1);</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> element = 0; element < n; ++element) {</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  Part* <span class="keyword">const</span> part = &part_[part_of_[element]];</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  element_[part->end_index] = element;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  index_of_[element] = part->end_index;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  ++part->end_index;</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> </div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// Verify that we did it right.</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// TODO(user): either remove this or factor it out if it can be used</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">// elsewhere.</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, part_[0].start_index);</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code" href="classoperations__research_1_1_dynamic_partition.html#a84daba977c20d7a54c86ef77e8986267">NumElements</a>(), part_[<a class="code" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>() - 1].end_index);</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p = 1; p < <a class="code" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>(); ++p) {</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(part_[p - 1].end_index, part_[p].start_index);</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  }</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> }</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_partition.html#a32f3aa9643111b05108d1120e48c1e13"> 97</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_dynamic_partition.html#a32f3aa9643111b05108d1120e48c1e13">DynamicPartition::Refine</a>(<span class="keyword">const</span> std::vector<int>& distinguished_subset) {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// tmp_counter_of_part_[i] will contain the number of</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// elements in distinguished_subset that were part of part #i.</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  tmp_counter_of_part_.resize(<a class="code" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>(), 0);</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// We remember the Parts that were actually affected.</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  tmp_affected_parts_.clear();</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> element : distinguished_subset) {</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(element, 0);</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(element, <a class="code" href="classoperations__research_1_1_dynamic_partition.html#a84daba977c20d7a54c86ef77e8986267">NumElements</a>());</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> part = part_of_[element];</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_distinguished_elements_in_part = ++tmp_counter_of_part_[part];</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// Is this the first time that we touch this element's part?</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">if</span> (num_distinguished_elements_in_part == 1) {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// TODO(user): optimize the common singleton case.</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  tmp_affected_parts_.push_back(part);</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>  <span class="comment">// Move the element to the end of its current Part.</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_index = index_of_[element];</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_index =</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  part_[part].end_index - num_distinguished_elements_in_part;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(new_index, old_index)</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  << <span class="stringliteral">"Duplicate element given to Refine(): "</span> << element;</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="comment">// Perform the swap, keeping index_of_ up to date.</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  index_of_[element] = new_index;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  index_of_[element_[new_index]] = old_index;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(element_[old_index], element_[new_index]);</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> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// Sort affected parts. This is important to behave as advertised in the .h.</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// TODO(user): automatically switch to an O(N) sort when it's faster</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// than this one, which is O(K log K) with K = tmp_affected_parts_.size().</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  std::sort(tmp_affected_parts_.begin(), tmp_affected_parts_.end());</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="comment">// Iterate on each affected part and split it, or keep it intact if all</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">// of its elements were distinguished.</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> part : tmp_affected_parts_) {</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> start_index = part_[part].start_index;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> end_index = part_[part].end_index;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> split_index = end_index - tmp_counter_of_part_[part];</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  tmp_counter_of_part_[part] = 0; <span class="comment">// Clean up after us.</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(split_index, start_index);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(split_index, end_index);</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="comment">// Do nothing if all elements were distinguished.</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (split_index == start_index) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> </div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// Compute the fingerprint of the new part.</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  uint64_t new_fprint = 0;</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = split_index; i < end_index; ++i) {</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  new_fprint ^= FprintOfInt32(element_[i]);</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> </div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_part = <a class="code" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>();</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">// Perform the split.</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  part_[part].end_index = split_index;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  part_[part].fprint ^= new_fprint;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  part_.push_back(Part(<span class="comment">/*start_index*/</span> split_index, <span class="comment">/*end_index*/</span> end_index,</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">/*parent_part*/</span> part, new_fprint));</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> element : <a class="code" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">ElementsInPart</a>(new_part)) {</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  part_of_[element] = new_part;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  }</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</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> </div><div class="line"><a name="l00162"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_partition.html#a59a35941a5a6eb3747faddb449a49e2a"> 162</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_dynamic_partition.html#a59a35941a5a6eb3747faddb449a49e2a">DynamicPartition::UndoRefineUntilNumPartsEqual</a>(<span class="keywordtype">int</span> original_num_parts) {</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>(), original_num_parts);</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(original_num_parts, 1);</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">while</span> (<a class="code" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>() > original_num_parts) {</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> part_index = <a class="code" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>() - 1;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">const</span> Part& part = part_[part_index];</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> parent_part_index = part.parent_part;</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(parent_part_index, part_index) << <span class="stringliteral">"UndoRefineUntilNumPartsEqual()"</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="stringliteral">" called with "</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="stringliteral">"'original_num_parts' too low"</span>;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> </div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// Update the part contents: actually merge "part" onto its parent.</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> element : <a class="code" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">ElementsInPart</a>(part_index)) {</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  part_of_[element] = parent_part_index;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  }</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  Part* <span class="keyword">const</span> parent_part = &part_[parent_part_index];</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(part.start_index, parent_part->end_index);</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  parent_part->end_index = part.end_index;</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  parent_part->fprint ^= part.fprint;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  part_.pop_back();</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</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> </div><div class="line"><a name="l00185"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_partition.html#ad07c56b1579801daaf3a9a750d26e792"> 185</a></span> std::string <a class="code" href="classoperations__research_1_1_dynamic_partition.html#ad07c56b1579801daaf3a9a750d26e792">DynamicPartition::DebugString</a>(<a class="code" href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199">DebugStringSorting</a> sorting)<span class="keyword"> const </span>{</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (sorting != <a class="code" href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199aa3c9e40c9ce46fe6b0a9352db7240b6f">SORT_LEXICOGRAPHICALLY</a> && sorting != <a class="code" href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306">SORT_BY_PART</a>) {</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"Unsupported sorting: %d"</span>, sorting);</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  std::vector<std::vector<int>> parts;</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>(); ++i) {</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <a class="code" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html">IterablePart</a> iterable_part = <a class="code" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">ElementsInPart</a>(i);</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  parts.emplace_back(iterable_part.<a class="code" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a8497b34029ee966694083aa34c9022b5">begin</a>(), iterable_part.<a class="code" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a152bd708ae8b28ef466f2a3fc7540ae9">end</a>());</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  std::sort(parts.back().begin(), parts.back().end());</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>  <span class="keywordflow">if</span> (sorting == <a class="code" href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199aa3c9e40c9ce46fe6b0a9352db7240b6f">SORT_LEXICOGRAPHICALLY</a>) {</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  std::sort(parts.begin(), parts.end());</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  }</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  std::string out;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::vector<int>& part : parts) {</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">if</span> (!out.empty()) out += <span class="stringliteral">" | "</span>;</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  out += absl::StrJoin(part, <span class="stringliteral">" "</span>);</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">return</span> out;</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> }</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> </div><div class="line"><a name="l00206"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_merging_partition.html#a50eca19efa71a0b70de25f9ad4a2a6f8"> 206</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_merging_partition.html#a50eca19efa71a0b70de25f9ad4a2a6f8">MergingPartition::Reset</a>(<span class="keywordtype">int</span> num_nodes) {</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(num_nodes, 0);</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  part_size_.assign(num_nodes, 1);</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  parent_.assign(num_nodes, -1);</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_nodes; ++i) parent_[i] = i;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  tmp_part_bit_.assign(num_nodes, <span class="keyword">false</span>);</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> }</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> </div><div class="line"><a name="l00214"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_merging_partition.html#a612bd8d97219124a8d6fbac721bcdbc6"> 214</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_merging_partition.html#a612bd8d97219124a8d6fbac721bcdbc6">MergingPartition::MergePartsOf</a>(<span class="keywordtype">int</span> node1, <span class="keywordtype">int</span> node2) {</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(node1, 0);</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(node2, 0);</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(node1, <a class="code" href="classoperations__research_1_1_merging_partition.html#af7b62ca470d8de1c1dde577b04671fa7">NumNodes</a>());</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(node2, <a class="code" href="classoperations__research_1_1_merging_partition.html#af7b62ca470d8de1c1dde577b04671fa7">NumNodes</a>());</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordtype">int</span> root1 = <a class="code" href="classoperations__research_1_1_merging_partition.html#ae3df79e84e453454062c2c3789b7828e">GetRoot</a>(node1);</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordtype">int</span> root2 = <a class="code" href="classoperations__research_1_1_merging_partition.html#ae3df79e84e453454062c2c3789b7828e">GetRoot</a>(node2);</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">if</span> (root1 == root2) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordtype">int</span> s1 = part_size_[root1];</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordtype">int</span> s2 = part_size_[root2];</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">// Attach the smaller part to the larger one. Break ties by root index.</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">if</span> (s1 < s2 || (s1 == s2 && root1 > root2)) {</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(root1, root2);</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(s1, s2);</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  }</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// Update the part size. Don't change part_size_[root2]: it won't be used</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// again by further merges.</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  part_size_[root1] += part_size_[root2];</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  SetParentAlongPathToRoot(node1, root1);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  SetParentAlongPathToRoot(node2, root1);</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">return</span> root2;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> </div><div class="line"><a name="l00238"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_merging_partition.html#ac64dbed5d9196b941f3f53862f77309d"> 238</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_merging_partition.html#ac64dbed5d9196b941f3f53862f77309d">MergingPartition::GetRootAndCompressPath</a>(<span class="keywordtype">int</span> node) {</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(node, 0);</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(node, <a class="code" href="classoperations__research_1_1_merging_partition.html#af7b62ca470d8de1c1dde577b04671fa7">NumNodes</a>());</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> root = <a class="code" href="classoperations__research_1_1_merging_partition.html#ae3df79e84e453454062c2c3789b7828e">GetRoot</a>(node);</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  SetParentAlongPathToRoot(node, root);</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">return</span> root;</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> }</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> </div><div class="line"><a name="l00246"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_merging_partition.html#a80761f181b521aa284b7e687776b9fde"> 246</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_merging_partition.html#a80761f181b521aa284b7e687776b9fde">MergingPartition::KeepOnlyOneNodePerPart</a>(std::vector<int>* <a class="code" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordtype">int</span> num_nodes_kept = 0;</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : *<a class="code" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a> = <a class="code" href="classoperations__research_1_1_merging_partition.html#ac64dbed5d9196b941f3f53862f77309d">GetRootAndCompressPath</a>(node);</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">if</span> (!tmp_part_bit_[<a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>]) {</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  tmp_part_bit_[<a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>] = <span class="keyword">true</span>;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  (*nodes)[num_nodes_kept++] = node;</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <a class="code" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->resize(num_nodes_kept);</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> </div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">// Clean up the tmp_part_bit_ vector. Since we've already compressed the</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="comment">// paths (if backtracking was enabled), no need to do it again.</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : *<a class="code" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) tmp_part_bit_[<a class="code" href="classoperations__research_1_1_merging_partition.html#ae3df79e84e453454062c2c3789b7828e">GetRoot</a>(node)] = <span class="keyword">false</span>;</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> }</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> </div><div class="line"><a name="l00262"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_merging_partition.html#a62cb833403d7861c5badb4de3389e06e"> 262</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_merging_partition.html#a62cb833403d7861c5badb4de3389e06e">MergingPartition::FillEquivalenceClasses</a>(</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  std::vector<int>* node_equivalence_classes) {</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  node_equivalence_classes->assign(<a class="code" href="classoperations__research_1_1_merging_partition.html#af7b62ca470d8de1c1dde577b04671fa7">NumNodes</a>(), -1);</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordtype">int</span> num_roots = 0;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code" href="classoperations__research_1_1_merging_partition.html#af7b62ca470d8de1c1dde577b04671fa7">NumNodes</a>(); ++node) {</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> root = <a class="code" href="classoperations__research_1_1_merging_partition.html#ac64dbed5d9196b941f3f53862f77309d">GetRootAndCompressPath</a>(node);</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">if</span> ((*node_equivalence_classes)[root] < 0) {</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  (*node_equivalence_classes)[root] = num_roots;</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  ++num_roots;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  (*node_equivalence_classes)[node] = (*node_equivalence_classes)[root];</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  }</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">return</span> num_roots;</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> }</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> </div><div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_merging_partition.html#a6097c48821f010becb9a6910f4c39288"> 277</a></span> std::string <a class="code" href="classoperations__research_1_1_merging_partition.html#a6097c48821f010becb9a6910f4c39288">MergingPartition::DebugString</a>() {</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  std::vector<std::vector<int>> sorted_parts(<a class="code" href="classoperations__research_1_1_merging_partition.html#af7b62ca470d8de1c1dde577b04671fa7">NumNodes</a>());</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="classoperations__research_1_1_merging_partition.html#af7b62ca470d8de1c1dde577b04671fa7">NumNodes</a>(); ++i) {</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  sorted_parts[<a class="code" href="classoperations__research_1_1_merging_partition.html#ac64dbed5d9196b941f3f53862f77309d">GetRootAndCompressPath</a>(i)].push_back(i);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">for</span> (std::vector<int>& part : sorted_parts)</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  std::sort(part.begin(), part.end());</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  std::sort(sorted_parts.begin(), sorted_parts.end());</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">// Note: typically, a lot of elements of "sorted_parts" will be empty,</span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="comment">// but these won't be visible in the string that we construct below.</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  std::string out;</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::vector<int>& part : sorted_parts) {</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">if</span> (!out.empty()) out += <span class="stringliteral">" | "</span>;</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  out += absl::StrJoin(part, <span class="stringliteral">" "</span>);</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">return</span> out;</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> }</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> </div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="namespaceutil__hash_html_aefdb33a41f3439b534ff91f3140c5594"><div class="ttname"><a href="namespaceutil__hash.html#aefdb33a41f3439b534ff91f3140c5594">util_hash::MurmurHash64</a></div><div class="ttdeci">uint64_t MurmurHash64(const char *buf, const size_t len)</div><div class="ttdef"><b>Definition:</b> <a href="murmur_8h_source.html#l00023">murmur.h:23</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306">operations_research::DynamicPartition::SORT_BY_PART</a></div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00123">dynamic_partition.h:123</a></div></div>
|
|
<div class="ttc" id="murmur_8h_html"><div class="ttname"><a href="murmur_8h.html">murmur.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a32f3aa9643111b05108d1120e48c1e13"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a32f3aa9643111b05108d1120e48c1e13">operations_research::DynamicPartition::Refine</a></div><div class="ttdeci">void Refine(const std::vector< int > &distinguished_subset)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00097">dynamic_partition.cc:97</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a5d89f8571b04ded41d29edffdb479199"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199">operations_research::DynamicPartition::DebugStringSorting</a></div><div class="ttdeci">DebugStringSorting</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00118">dynamic_partition.h:118</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00263">id_map.h:263</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_ae91b7d9b6c4f0675b9ad3f38e5761853"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">operations_research::DynamicPartition::NumParts</a></div><div class="ttdeci">const int NumParts() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00062">dynamic_partition.h:62</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_ac64dbed5d9196b941f3f53862f77309d"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#ac64dbed5d9196b941f3f53862f77309d">operations_research::MergingPartition::GetRootAndCompressPath</a></div><div class="ttdeci">int GetRootAndCompressPath(int node)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00238">dynamic_partition.cc:238</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a50eca19efa71a0b70de25f9ad4a2a6f8"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a50eca19efa71a0b70de25f9ad4a2a6f8">operations_research::MergingPartition::Reset</a></div><div class="ttdeci">void Reset(int num_nodes)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00206">dynamic_partition.cc:206</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html">operations_research::DynamicPartition::IterablePart</a></div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00184">dynamic_partition.h:184</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_af7b62ca470d8de1c1dde577b04671fa7"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#af7b62ca470d8de1c1dde577b04671fa7">operations_research::MergingPartition::NumNodes</a></div><div class="ttdeci">int NumNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00211">dynamic_partition.h:211</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_ae3df79e84e453454062c2c3789b7828e"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#ae3df79e84e453454062c2c3789b7828e">operations_research::MergingPartition::GetRoot</a></div><div class="ttdeci">int GetRoot(int node) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00315">dynamic_partition.h:315</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_a8497b34029ee966694083aa34c9022b5"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a8497b34029ee966694083aa34c9022b5">operations_research::DynamicPartition::IterablePart::begin</a></div><div class="ttdeci">std::vector< int >::const_iterator begin() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00185">dynamic_partition.h:185</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a5d89f8571b04ded41d29edffdb479199aa3c9e40c9ce46fe6b0a9352db7240b6f"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199aa3c9e40c9ce46fe6b0a9352db7240b6f">operations_research::DynamicPartition::SORT_LEXICOGRAPHICALLY</a></div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00121">dynamic_partition.h:121</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_a152bd708ae8b28ef466f2a3fc7540ae9"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a152bd708ae8b28ef466f2a3fc7540ae9">operations_research::DynamicPartition::IterablePart::end</a></div><div class="ttdeci">std::vector< int >::const_iterator end() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00186">dynamic_partition.h:186</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a11ea4d0620bbdca30b7d9b8a23f8cdd8"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">operations_research::DynamicPartition::ElementsInPart</a></div><div class="ttdeci">IterablePart ElementsInPart(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00277">dynamic_partition.h:277</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a6097c48821f010becb9a6910f4c39288"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a6097c48821f010becb9a6910f4c39288">operations_research::MergingPartition::DebugString</a></div><div class="ttdeci">std::string DebugString()</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00277">dynamic_partition.cc:277</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a59a35941a5a6eb3747faddb449a49e2a"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a59a35941a5a6eb3747faddb449a49e2a">operations_research::DynamicPartition::UndoRefineUntilNumPartsEqual</a></div><div class="ttdeci">void UndoRefineUntilNumPartsEqual(int original_num_parts)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00162">dynamic_partition.cc:162</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_ac86affffe0db21281ab1db3b23bbebc8"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#ac86affffe0db21281ab1db3b23bbebc8">operations_research::DynamicPartition::DynamicPartition</a></div><div class="ttdeci">DynamicPartition(int num_elements)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00032">dynamic_partition.cc:32</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_ad07c56b1579801daaf3a9a750d26e792"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#ad07c56b1579801daaf3a9a750d26e792">operations_research::DynamicPartition::DebugString</a></div><div class="ttdeci">std::string DebugString(DebugStringSorting sorting) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00185">dynamic_partition.cc:185</a></div></div>
|
|
<div class="ttc" id="preprocessor_8cc_html_abcdbe46fb8451a69d42c17abdb920021"><div class="ttname"><a href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a></div><div class="ttdeci">ColIndex representative</div><div class="ttdef"><b>Definition:</b> <a href="preprocessor_8cc_source.html#l00465">preprocessor.cc:465</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00886">base/logging.h:886</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a62cb833403d7861c5badb4de3389e06e"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a62cb833403d7861c5badb4de3389e06e">operations_research::MergingPartition::FillEquivalenceClasses</a></div><div class="ttdeci">int FillEquivalenceClasses(std::vector< int > *node_equivalence_classes)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00262">dynamic_partition.cc:262</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="dynamic__partition_8h_html"><div class="ttname"><a href="dynamic__partition_8h.html">dynamic_partition.h</a></div></div>
|
|
<div class="ttc" id="routing__search_8cc_html_a6b7983ccd32c86cbbc3d4d9cda4cac17"><div class="ttname"><a href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a></div><div class="ttdeci">int nodes</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03686">routing_search.cc:3686</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a84daba977c20d7a54c86ef77e8986267"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a84daba977c20d7a54c86ef77e8986267">operations_research::DynamicPartition::NumElements</a></div><div class="ttdeci">int NumElements() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00061">dynamic_partition.h:61</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a80761f181b521aa284b7e687776b9fde"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a80761f181b521aa284b7e687776b9fde">operations_research::MergingPartition::KeepOnlyOneNodePerPart</a></div><div class="ttdeci">void KeepOnlyOneNodePerPart(std::vector< int > *nodes)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00246">dynamic_partition.cc:246</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a612bd8d97219124a8d6fbac721bcdbc6"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a612bd8d97219124a8d6fbac721bcdbc6">operations_research::MergingPartition::MergePartsOf</a></div><div class="ttdeci">int MergePartsOf(int node1, int node2)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00214">dynamic_partition.cc:214</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</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_80dda7a75b0dfcf996988638a63eb03a.html">algorithms</a></li><li class="navelem"><a class="el" href="dynamic__partition_8cc.html">dynamic_partition.cc</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>
|