128 lines
33 KiB
HTML
128 lines
33 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_permutation.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.2</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__permutation_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_permutation.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="dynamic__permutation_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__permutation_8h.html">ortools/algorithms/dynamic_permutation.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> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include "<a class="code" href="sparse__permutation_8h.html">ortools/algorithms/sparse_permutation.h</a>"</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div><div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#a460f2957b84beed593ad470bf7c7cd0d"> 22</a></span> <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a460f2957b84beed593ad470bf7c7cd0d">DynamicPermutation::DynamicPermutation</a>(<span class="keywordtype">int</span> n)</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  : image_(n, -1), ancestor_(n, -1), tmp_mask_(n, false) {</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a24926108b770033792d015cb86aeffb3">Size</a>(); ++i) image_[i] = ancestor_[i] = i;</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> </div><div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#aeb46445d022e7bc495f212704791824a"> 27</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#aeb46445d022e7bc495f212704791824a">DynamicPermutation::AddMappings</a>(<span class="keyword">const</span> std::vector<int>& src,</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keyword">const</span> std::vector<int>& dst) {</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(src.size(), dst.size());</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  mapping_src_size_stack_.push_back(mapping_src_stack_.size());</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  mapping_src_stack_.reserve(mapping_src_stack_.size() + src.size());</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < src.size(); ++i) {</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> s = src[i];</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> d = dst[i];</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(s, <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96">ImageOf</a>(s)); <span class="comment">// No prior image of s.</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(d, ancestor_[d]); <span class="comment">// No prior ancestor of d.</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  ancestor_[d] = <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a5696c0cdd05c22a3fceab054e260660b">RootOf</a>(s);</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  image_[s] = d;</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keywordflow">if</span> (image_[d] == d) loose_ends_.insert(d);</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  loose_ends_.erase(s); <span class="comment">// Also takes care of the corner case s == d.</span></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>  <span class="comment">// Remember the sources for the undo stack.</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  mapping_src_stack_.push_back(s);</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"> 48</span> </div><div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#ae8f61c84a06024a7d6343902f44e7e59"> 49</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#ae8f61c84a06024a7d6343902f44e7e59">DynamicPermutation::UndoLastMappings</a>(</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  std::vector<int>* undone_mapping_src) {</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(undone_mapping_src != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  undone_mapping_src->clear();</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">if</span> (mapping_src_size_stack_.empty()) <span class="keywordflow">return</span>; <span class="comment">// Nothing to undo.</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_mappings_before = mapping_src_size_stack_.back();</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  mapping_src_size_stack_.pop_back();</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_mappings_now = mapping_src_stack_.size();</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(num_mappings_now, num_mappings_before);</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// Dump the undone mappings.</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  undone_mapping_src->reserve(num_mappings_now - num_mappings_before);</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  undone_mapping_src->insert(undone_mapping_src->begin(),</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  mapping_src_stack_.begin() + num_mappings_before,</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  mapping_src_stack_.end());</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">// Note(user): the mappings should be undone in reverse order, because the</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// code that keeps "tails" up to date depends on it.</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_mappings_now - 1; i >= num_mappings_before; --i) {</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> s = mapping_src_stack_[i];</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> d = <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96">ImageOf</a>(s);</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="keywordflow">if</span> (ancestor_[s] != s) loose_ends_.insert(s);</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  loose_ends_.erase(d);</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  ancestor_[d] = d;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  image_[s] = s;</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>  mapping_src_stack_.resize(num_mappings_before); <span class="comment">// Shrink.</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> }</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> </div><div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#a372de693ad40b3f42839c8ec6ac845f4"> 78</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a372de693ad40b3f42839c8ec6ac845f4">DynamicPermutation::Reset</a>() {</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : mapping_src_stack_) {</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> dst = image_[i];</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  ancestor_[dst] = dst;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  image_[i] = i;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  mapping_src_stack_.clear();</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  mapping_src_size_stack_.clear();</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  loose_ends_.clear();</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> }</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div><div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#a4829347e4722a1281369b9a251280fcc"> 89</a></span> std::unique_ptr<SparsePermutation> <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a4829347e4722a1281369b9a251280fcc">DynamicPermutation::CreateSparsePermutation</a>()<span class="keyword"></span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="keyword"> const </span>{</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  std::unique_ptr<SparsePermutation> sparse_perm(<span class="keyword">new</span> <a class="code" href="classoperations__research_1_1_sparse_permutation.html">SparsePermutation</a>(<a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a24926108b770033792d015cb86aeffb3">Size</a>()));</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordtype">int</span> num_identity_singletons = 0;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> x : mapping_src_stack_) {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">if</span> (tmp_mask_[x]) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// Deal with the special case of a trivial x->x cycle, which we do *not*</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// want to add to the sparse permutation.</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96">ImageOf</a>(x) == x) {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(x, <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a5696c0cdd05c22a3fceab054e260660b">RootOf</a>(x));</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  ++num_identity_singletons;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">continue</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="keyword">const</span> <span class="keywordtype">int</span> root = <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a5696c0cdd05c22a3fceab054e260660b">RootOf</a>(x);</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = root;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  sparse_perm->AddToCurrentCycle(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  tmp_mask_[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] = <span class="keyword">true</span>;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96">ImageOf</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>));</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96">ImageOf</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> == root) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  }</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  sparse_perm->CloseCurrentCycle();</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="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> x : mapping_src_stack_) tmp_mask_[x] = <span class="keyword">false</span>;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(mapping_src_stack_.size(),</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  sparse_perm->Support().size() + num_identity_singletons);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">return</span> sparse_perm;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> }</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_dynamic_permutation.html#a764be64f3029f8b8e23511061d8de355"> 119</a></span> std::string <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a764be64f3029f8b8e23511061d8de355">DynamicPermutation::DebugString</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// That's wasteful, but we don't care, DebugString() may be slow.</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_dynamic_permutation.html#a4829347e4722a1281369b9a251280fcc">CreateSparsePermutation</a>()->DebugString();</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> </div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="classoperations__research_1_1_dynamic_permutation_html_a5696c0cdd05c22a3fceab054e260660b"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#a5696c0cdd05c22a3fceab054e260660b">operations_research::DynamicPermutation::RootOf</a></div><div class="ttdeci">int RootOf(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8h_source.html#l00121">dynamic_permutation.h:121</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html">operations_research::SparsePermutation</a></div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00027">sparse_permutation.h:27</a></div></div>
|
|
<div class="ttc" id="constraint__solver_8cc_html_a395f613555f398dd389670bb4c2a4599"><div class="ttname"><a href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a></div><div class="ttdeci">Block * next</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00678">constraint_solver.cc:678</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_permutation_html_aeb46445d022e7bc495f212704791824a"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#aeb46445d022e7bc495f212704791824a">operations_research::DynamicPermutation::AddMappings</a></div><div class="ttdeci">void AddMappings(const std::vector< int > &src, const std::vector< int > &dst)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8cc_source.html#l00027">dynamic_permutation.cc:27</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00891">base/logging.h:891</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#l00894">base/logging.h:894</a></div></div>
|
|
<div class="ttc" id="dynamic__permutation_8h_html"><div class="ttname"><a href="dynamic__permutation_8h.html">dynamic_permutation.h</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#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_permutation_html_ae8f61c84a06024a7d6343902f44e7e59"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#ae8f61c84a06024a7d6343902f44e7e59">operations_research::DynamicPermutation::UndoLastMappings</a></div><div class="ttdeci">void UndoLastMappings(std::vector< int > *undone_mapping_src)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8cc_source.html#l00049">dynamic_permutation.cc:49</a></div></div>
|
|
<div class="ttc" id="sparse__permutation_8h_html"><div class="ttname"><a href="sparse__permutation_8h.html">sparse_permutation.h</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#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_permutation_html_a1976819faa164a8d10a66200dc2c3a96"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96">operations_research::DynamicPermutation::ImageOf</a></div><div class="ttdeci">int ImageOf(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8h_source.html#l00114">dynamic_permutation.h:114</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_permutation_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#a764be64f3029f8b8e23511061d8de355">operations_research::DynamicPermutation::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8cc_source.html#l00119">dynamic_permutation.cc:119</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="classoperations__research_1_1_dynamic_permutation_html_a4829347e4722a1281369b9a251280fcc"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#a4829347e4722a1281369b9a251280fcc">operations_research::DynamicPermutation::CreateSparsePermutation</a></div><div class="ttdeci">std::unique_ptr< SparsePermutation > CreateSparsePermutation() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8cc_source.html#l00089">dynamic_permutation.cc:89</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_permutation_html_a460f2957b84beed593ad470bf7c7cd0d"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#a460f2957b84beed593ad470bf7c7cd0d">operations_research::DynamicPermutation::DynamicPermutation</a></div><div class="ttdeci">DynamicPermutation(int n)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8cc_source.html#l00022">dynamic_permutation.cc:22</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_permutation_html_a24926108b770033792d015cb86aeffb3"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#a24926108b770033792d015cb86aeffb3">operations_research::DynamicPermutation::Size</a></div><div class="ttdeci">int Size() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8h_source.html#l00038">dynamic_permutation.h:38</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_dynamic_permutation_html_a372de693ad40b3f42839c8ec6ac845f4"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#a372de693ad40b3f42839c8ec6ac845f4">operations_research::DynamicPermutation::Reset</a></div><div class="ttdeci">void Reset()</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8cc_source.html#l00078">dynamic_permutation.cc:78</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__permutation_8cc.html">dynamic_permutation.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>
|