242 lines
33 KiB
HTML
242 lines
33 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<title>OR-Tools</title>
|
|
<meta http-equiv="Content-Type" content="text/html;"/>
|
|
<meta charset="utf-8"/>
|
|
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.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="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">Google OR-Tools 9.2</span>
|
|
</div>
|
|
</div>
|
|
<div id="content" style="width: 100%; overflow: hidden;">
|
|
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
|
|
<h2>C++ Reference</h2>
|
|
<ul>
|
|
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
|
|
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
|
|
<li><a href="../cpp_graph/annotated.html">Graph</a></li>
|
|
<li><a href="../cpp_routing/annotated.html">Routing</a></li>
|
|
<li><a href="../cpp_linear/annotated.html">Linear solver</a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="content">
|
|
<div align="center">
|
|
<h1 style="color: #145A32;">C++ Reference: Algorithms</h1>
|
|
</div>
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('dynamic__permutation_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">dynamic_permutation.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="dynamic__permutation_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#ifndef OR_TOOLS_ALGORITHMS_DYNAMIC_PERMUTATION_H_</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#define OR_TOOLS_ALGORITHMS_DYNAMIC_PERMUTATION_H_</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <set></span> <span class="comment">// TODO(user): remove when no longer used.</span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span> </div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include "ortools/base/logging.h"</span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> </div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> </div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="keyword">class </span>SparsePermutation;</div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> </div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="comment">// Maintains a 'partial' permutation of [0..n-1] onto itself, with a dynamic</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="comment">// API allowing it to be built incrementally, and allowing some backtracking.</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="comment">// This is tuned for a specific usage by ./find_graph_symmetries.cc.</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="comment">// RAM usage: as of 2014-04, this class needs less than:</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="comment">// 32.125 * (n + 2 * support_size) bytes.</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html"> 33</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_dynamic_permutation.html">DynamicPermutation</a> {</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// Upon construction, every element i in [0..n-1] maps to itself.</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#a460f2957b84beed593ad470bf7c7cd0d"> 36</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a460f2957b84beed593ad470bf7c7cd0d">DynamicPermutation</a>(<span class="keywordtype">int</span> n);</div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> </div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#a24926108b770033792d015cb86aeffb3"> 38</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a24926108b770033792d015cb86aeffb3">Size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> image_.size(); } <span class="comment">// Return the original "n".</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> </div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// Declares a set of mappings for this permutation: src[i] will map to dst[i].</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// Requirements that are DCHECKed:</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// - "src" and "dst" must have the same size.</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// - For all i, src[i] must not already be mapped to something.</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// - For all i, dst[i] must not already be the image of something.</span></div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// Complexity: amortized O(src.size()).</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#aeb46445d022e7bc495f212704791824a"> 47</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#aeb46445d022e7bc495f212704791824a">AddMappings</a>(<span class="keyword">const</span> std::vector<int>& src, <span class="keyword">const</span> std::vector<int>& dst);</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> </div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// Undoes the last AddMappings() operation, and fills the "undone_mapping_src"</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// vector with the src of that last operation. This works like an undo stack.</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// For example, applying the sequence (Add, Add, Add, Undo, Add, Undo, Undo)</span></div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// has exactly the same effect as applying the first Add() alone.</span></div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// If you call this too may times (i.e. there is nothing left to undo), it is</span></div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// simply a no-op.</span></div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// Complexity: same as the AddMappings() operation being undone.</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#ae8f61c84a06024a7d6343902f44e7e59"> 57</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#ae8f61c84a06024a7d6343902f44e7e59">UndoLastMappings</a>(std::vector<int>* undone_mapping_src);</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// Makes the permutation back to the identity (i.e. like right after</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// construction).</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// Complexity: O(support size).</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#a372de693ad40b3f42839c8ec6ac845f4"> 62</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a372de693ad40b3f42839c8ec6ac845f4">Reset</a>();</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> </div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96">ImageOf</a>(<span class="keywordtype">int</span> i) <span class="keyword">const</span>; <span class="comment">// Complexity: one vector lookup.</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> </div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// Returns the union of all "src" ever given to AddMappings().</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#afc48707ddd63d0978b9cfcd17c704694"> 67</a></span> <span class="keyword">const</span> std::vector<int>& <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#afc48707ddd63d0978b9cfcd17c704694">AllMappingsSrc</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> mapping_src_stack_; }</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// While the permutation is partially being built, the orbit of elements will</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// either form unclosed paths, or closed cycles. In the former case,</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="comment">// RootOf(i) returns the start of the path where i lies. If i is on a cycle,</span></div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// RootOf(i) will return some element of its cycle (meaning that if i maps to</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// itself, RootOf(i) = i).</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// Complexity: O(log(orbit size)) in average, assuming that the mappings are</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// added in a random order. O(orbit size) in the worst case.</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a5696c0cdd05c22a3fceab054e260660b">RootOf</a>(<span class="keywordtype">int</span> i) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> </div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// The exhaustive set of the 'loose end' of the incomplete cycles</span></div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// (e.g., paths) built so far.</span></div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// TODO(user): use a faster underlying container like SparseBitSet, and</span></div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// tweak this API accordingly.</span></div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#af782dbc8f8882512bc387cdf0ce0e190"> 83</a></span> <span class="keyword">const</span> std::set<int>& <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#af782dbc8f8882512bc387cdf0ce0e190">LooseEnds</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> loose_ends_; }</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> </div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// Creates a SparsePermutation representing the current permutation.</span></div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// Requirements: the permutation must only have cycles.</span></div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// Complexity: O(support size).</span></div>
|
|
<div class="line"><a id="l00089" 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 hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a4829347e4722a1281369b9a251280fcc">CreateSparsePermutation</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> </div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#a764be64f3029f8b8e23511061d8de355"> 91</a></span> std::string <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> </div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> std::vector<int> image_;</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// ancestor_[i] isn't exactly RootOf(i): it might itself have an ancestor, and</span></div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// so on.</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> std::vector<int> ancestor_;</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> </div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// The concatenation of all "src" ever given to AddMappings(), and their</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// sizes, to implement the undo stack. Note that "mapping_src_stack_" contains</span></div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// exactly the support of the permutation.</span></div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> std::vector<int> mapping_src_stack_;</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> std::vector<int> mapping_src_size_stack_;</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> </div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// See the homonymous accessor, above.</span></div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> std::set<int> loose_ends_;</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> </div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// Used transiently by CreateSparsePermutation(). Its resting state is:</span></div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// size=Size(), all elements are false.</span></div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keyword">mutable</span> std::vector<bool> tmp_mask_;</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span>};</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> </div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span><span class="comment">// Forced-inline for the speed.</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96"> 114</a></span><span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96">DynamicPermutation::ImageOf</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> DCHECK_GE(i, 0);</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> DCHECK_LT(i, <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">return</span> image_[i];</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span>}</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> </div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span><span class="comment">// Forced-inline for the speed.</span></div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dynamic_permutation.html#a5696c0cdd05c22a3fceab054e260660b"> 121</a></span><span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a5696c0cdd05c22a3fceab054e260660b">DynamicPermutation::RootOf</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> DCHECK_GE(i, 0);</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> DCHECK_LT(i, <a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keyword">const</span> <span class="keywordtype">int</span> j = ancestor_[i];</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">if</span> (j == i) <span class="keywordflow">return</span> i;</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> i = j;</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> }</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span>}</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> </div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> </div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_ALGORITHMS_DYNAMIC_PERMUTATION_H_</span></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_permutation_html"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html">operations_research::DynamicPermutation</a></div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8h_source.html#l00033">dynamic_permutation.h:33</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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="aclassoperations__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="aclassoperations__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>
|
|
<div class="ttc" id="aclassoperations__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>
|
|
<div class="ttc" id="aclassoperations__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>
|
|
<div class="ttc" id="aclassoperations__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="aclassoperations__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>
|
|
<div class="ttc" id="aclassoperations__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>
|
|
<div class="ttc" id="aclassoperations__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>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_permutation_html_af782dbc8f8882512bc387cdf0ce0e190"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#af782dbc8f8882512bc387cdf0ce0e190">operations_research::DynamicPermutation::LooseEnds</a></div><div class="ttdeci">const std::set< int > & LooseEnds() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8h_source.html#l00083">dynamic_permutation.h:83</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_permutation_html_afc48707ddd63d0978b9cfcd17c704694"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#afc48707ddd63d0978b9cfcd17c704694">operations_research::DynamicPermutation::AllMappingsSrc</a></div><div class="ttdeci">const std::vector< int > & AllMappingsSrc() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8h_source.html#l00067">dynamic_permutation.h:67</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|