137 lines
42 KiB
HTML
137 lines
42 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: sparse_permutation.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.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('sparse__permutation_8h_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">sparse_permutation.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="sparse__permutation_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#ifndef OR_TOOLS_ALGORITHMS_SPARSE_PERMUTATION_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_ALGORITHMS_SPARSE_PERMUTATION_H_</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <string></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></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="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// A compact representation for permutations of {0..N-1} that displaces few</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// elements: it needs only O(K) memory for a permutation that displaces</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">// K elements.</span></div><div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_permutation.html"> 27</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_sparse_permutation.html">SparsePermutation</a> {</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_permutation.html#a1d5b283f6fa63b162d0dd2b58333ca19"> 29</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a1d5b283f6fa63b162d0dd2b58333ca19">SparsePermutation</a>(<span class="keywordtype">int</span> size) : size_(size) {} <span class="comment">// Identity.</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="comment">// TODO(user): complete the reader API.</span></div><div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_permutation.html#a24926108b770033792d015cb86aeffb3"> 32</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a24926108b770033792d015cb86aeffb3">Size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> size_; }</div><div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33"> 33</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">NumCycles</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> cycle_ends_.size(); }</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="comment">// Returns the "support" of this permutation; that is, the set of elements</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="comment">// displaced by it.</span></div><div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_permutation.html#ab601acb5aed920b1e61210d497462976"> 37</a></span>  <span class="keyword">const</span> std::vector<int>& <a class="code" href="classoperations__research_1_1_sparse_permutation.html#ab601acb5aed920b1e61210d497462976">Support</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> cycles_; }</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="comment">// The permutation has NumCycles() cycles numbered 0 .. NumCycles()-1.</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="comment">// To iterate over cycle #i of the permutation, do this:</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// for (const int e : permutation.Cycle(i)) { ...</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keyword">struct </span>Iterator;</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  Iterator <a class="code" href="classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64">Cycle</a>(<span class="keywordtype">int</span> i) <span class="keyword">const</span>;</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// This is useful for iterating over the pair {element, image}</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// of a permutation:</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">//</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// for (int c = 0; c < perm.NumCycles(); ++c) {</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// int element = LastElementInCycle(c);</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// for (int image : perm.Cycle(c)) {</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// // The pair is (element, image).</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="comment">// ...</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="comment">// element = image;</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// }</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// }</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">//</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// TODO(user): Provide a full iterator for this? Note that we have more</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// information with the loop above. Not sure it is needed though.</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a68c2934475b5f68d6d6b9b2fdfb9955d">LastElementInCycle</a>(<span class="keywordtype">int</span> i) <span class="keyword">const</span>;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> </div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// To add a cycle to the permutation, repeatedly call AddToCurrentCycle()</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// with the cycle's orbit, then call CloseCurrentCycle();</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">// This shouldn't be called on trivial cycles (of length 1).</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a540c5f44963a3f25d264f41b643e0f57">AddToCurrentCycle</a>(<span class="keywordtype">int</span> x);</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a709f5ccee8651229a29a54b3c9e14681">CloseCurrentCycle</a>();</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="comment">// Removes the cycles with given indices from the permutation. This</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">// works in O(K) for a permutation displacing K elements.</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a9add43490c45e4334099bb15b6e6eab0">RemoveCycles</a>(<span class="keyword">const</span> std::vector<int>& cycle_indices);</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// Output all non-identity cycles of the permutation, sorted</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// lexicographically (each cycle is described starting by its smallest</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// element; and all cycles are sorted lexicographically against each other).</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// This isn't efficient; use for debugging only.</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">// Example: "(1 4 3) (5 9) (6 8 7)".</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  std::string <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>() <span class="keyword">const</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"> 78</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size_;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  std::vector<int> cycles_;</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  std::vector<int> cycle_ends_;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> };</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> </div><div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_permutation.html#a540c5f44963a3f25d264f41b643e0f57"> 84</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a540c5f44963a3f25d264f41b643e0f57">SparsePermutation::AddToCurrentCycle</a>(<span class="keywordtype">int</span> x) {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(x, 0);</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(x, size_);</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  cycles_.push_back(x);</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> }</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_permutation.html#a709f5ccee8651229a29a54b3c9e14681"> 90</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a709f5ccee8651229a29a54b3c9e14681">SparsePermutation::CloseCurrentCycle</a>() {</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">if</span> (cycle_ends_.empty()) {</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(cycles_.size(), 2);</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(cycles_.size(), cycle_ends_.back() + 2);</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>  cycle_ends_.push_back(cycles_.size());</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> }</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html"> 99</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html">SparsePermutation::Iterator</a> {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// These typedefs allow this iterator to be used within testing::ElementsAre.</span></div><div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a1183625e61d46f8e98a980720c684146"> 101</a></span>  <span class="keyword">typedef</span> <span class="keywordtype">int</span> <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a1183625e61d46f8e98a980720c684146">value_type</a>;</div><div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a5a85aaf56880f04a078dc182410090df"> 102</a></span>  <span class="keyword">typedef</span> std::vector<int>::const_iterator <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a5a85aaf56880f04a078dc182410090df">const_iterator</a>;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div><div class="line"><a name="l00104"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a1f703720e1f5d97a0386c2dfe803c763"> 104</a></span>  <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a1f703720e1f5d97a0386c2dfe803c763">Iterator</a>() {}</div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a45e7d9be5295e365dc2f6e1f46f969e1"> 105</a></span>  <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a45e7d9be5295e365dc2f6e1f46f969e1">Iterator</a>(<span class="keyword">const</span> std::vector<int>::const_iterator& <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">const</span> std::vector<int>::const_iterator& e)</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  : <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a90184cfdf1a6d1e0e22c93105954a44e">begin_</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>), <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a57fece117afab3e8dd6d54a015c783f6">end_</a>(e) {}</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a8497b34029ee966694083aa34c9022b5"> 109</a></span>  std::vector<int>::const_iterator <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a8497b34029ee966694083aa34c9022b5">begin</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a90184cfdf1a6d1e0e22c93105954a44e">begin_</a>; }</div><div class="line"><a name="l00110"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a152bd708ae8b28ef466f2a3fc7540ae9"> 110</a></span>  std::vector<int>::const_iterator <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a152bd708ae8b28ef466f2a3fc7540ae9">end</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a57fece117afab3e8dd6d54a015c783f6">end_</a>; }</div><div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a90184cfdf1a6d1e0e22c93105954a44e"> 111</a></span>  <span class="keyword">const</span> std::vector<int>::const_iterator <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a90184cfdf1a6d1e0e22c93105954a44e">begin_</a>;</div><div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a57fece117afab3e8dd6d54a015c783f6"> 112</a></span>  <span class="keyword">const</span> std::vector<int>::const_iterator <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a57fece117afab3e8dd6d54a015c783f6">end_</a>;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#af9593d4a5ff4274efaf429cb4f9e57cc"> 114</a></span>  <span class="keywordtype">int</span> <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a57fece117afab3e8dd6d54a015c783f6">end_</a> - <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a90184cfdf1a6d1e0e22c93105954a44e">begin_</a>; }</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> };</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64"> 117</a></span> <span class="keyword">inline</span> <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html">SparsePermutation::Iterator</a> <a class="code" href="classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64">SparsePermutation::Cycle</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const </span>{</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(i, 0);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(i, <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">NumCycles</a>());</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html">Iterator</a>(cycles_.begin() + (i == 0 ? 0 : cycle_ends_[i - 1]),</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  cycles_.begin() + cycle_ends_[i]);</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"><a class="line" href="classoperations__research_1_1_sparse_permutation.html#a68c2934475b5f68d6d6b9b2fdfb9955d"> 124</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a68c2934475b5f68d6d6b9b2fdfb9955d">SparsePermutation::LastElementInCycle</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const </span>{</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(i, 0);</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(i, cycle_ends_.size());</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(cycle_ends_[i], i == 0 ? 0 : cycle_ends_[i - 1]);</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">return</span> cycles_[cycle_ends_[i] - 1];</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> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> } <span class="comment">// namespace operations_research</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> </div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor">#endif // OR_TOOLS_ALGORITHMS_SPARSE_PERMUTATION_H_</span></div><div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_a1d5b283f6fa63b162d0dd2b58333ca19"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a1d5b283f6fa63b162d0dd2b58333ca19">operations_research::SparsePermutation::SparsePermutation</a></div><div class="ttdeci">SparsePermutation(int size)</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00029">sparse_permutation.h:29</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_a709f5ccee8651229a29a54b3c9e14681"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a709f5ccee8651229a29a54b3c9e14681">operations_research::SparsePermutation::CloseCurrentCycle</a></div><div class="ttdeci">void CloseCurrentCycle()</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00090">sparse_permutation.h:90</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a1183625e61d46f8e98a980720c684146"><div class="ttname"><a href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a1183625e61d46f8e98a980720c684146">operations_research::SparsePermutation::Iterator::value_type</a></div><div class="ttdeci">int value_type</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00101">sparse_permutation.h:101</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a45e7d9be5295e365dc2f6e1f46f969e1"><div class="ttname"><a href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a45e7d9be5295e365dc2f6e1f46f969e1">operations_research::SparsePermutation::Iterator::Iterator</a></div><div class="ttdeci">Iterator(const std::vector< int >::const_iterator &b, const std::vector< int >::const_iterator &e)</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00105">sparse_permutation.h:105</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_a24926108b770033792d015cb86aeffb3"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a24926108b770033792d015cb86aeffb3">operations_research::SparsePermutation::Size</a></div><div class="ttdeci">int Size() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00032">sparse_permutation.h:32</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00895">base/logging.h:895</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_a9add43490c45e4334099bb15b6e6eab0"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a9add43490c45e4334099bb15b6e6eab0">operations_research::SparsePermutation::RemoveCycles</a></div><div class="ttdeci">void RemoveCycles(const std::vector< int > &cycle_indices)</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8cc_source.html#l00023">sparse_permutation.cc:23</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_a540c5f44963a3f25d264f41b643e0f57"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a540c5f44963a3f25d264f41b643e0f57">operations_research::SparsePermutation::AddToCurrentCycle</a></div><div class="ttdeci">void AddToCurrentCycle(int x)</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00084">sparse_permutation.h:84</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_af567b4e287e268eb9ecee908f63e5b64"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64">operations_research::SparsePermutation::Cycle</a></div><div class="ttdeci">Iterator Cycle(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00117">sparse_permutation.h:117</a></div></div>
|
|
<div class="ttc" id="constraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a8497b34029ee966694083aa34c9022b5"><div class="ttname"><a href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a8497b34029ee966694083aa34c9022b5">operations_research::SparsePermutation::Iterator::begin</a></div><div class="ttdeci">std::vector< int >::const_iterator begin() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00109">sparse_permutation.h:109</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a152bd708ae8b28ef466f2a3fc7540ae9"><div class="ttname"><a href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a152bd708ae8b28ef466f2a3fc7540ae9">operations_research::SparsePermutation::Iterator::end</a></div><div class="ttdeci">std::vector< int >::const_iterator end() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00110">sparse_permutation.h:110</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_a68c2934475b5f68d6d6b9b2fdfb9955d"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a68c2934475b5f68d6d6b9b2fdfb9955d">operations_research::SparsePermutation::LastElementInCycle</a></div><div class="ttdeci">int LastElementInCycle(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00124">sparse_permutation.h:124</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a90184cfdf1a6d1e0e22c93105954a44e"><div class="ttname"><a href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a90184cfdf1a6d1e0e22c93105954a44e">operations_research::SparsePermutation::Iterator::begin_</a></div><div class="ttdeci">const std::vector< int >::const_iterator begin_</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00111">sparse_permutation.h:111</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="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_af9593d4a5ff4274efaf429cb4f9e57cc"><div class="ttname"><a href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#af9593d4a5ff4274efaf429cb4f9e57cc">operations_research::SparsePermutation::Iterator::size</a></div><div class="ttdeci">int size() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00114">sparse_permutation.h:114</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a764be64f3029f8b8e23511061d8de355">operations_research::SparsePermutation::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8cc_source.html#l00052">sparse_permutation.cc:52</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a1f703720e1f5d97a0386c2dfe803c763"><div class="ttname"><a href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a1f703720e1f5d97a0386c2dfe803c763">operations_research::SparsePermutation::Iterator::Iterator</a></div><div class="ttdeci">Iterator()</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00104">sparse_permutation.h:104</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="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a57fece117afab3e8dd6d54a015c783f6"><div class="ttname"><a href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a57fece117afab3e8dd6d54a015c783f6">operations_research::SparsePermutation::Iterator::end_</a></div><div class="ttdeci">const std::vector< int >::const_iterator end_</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00112">sparse_permutation.h:112</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a5a85aaf56880f04a078dc182410090df"><div class="ttname"><a href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a5a85aaf56880f04a078dc182410090df">operations_research::SparsePermutation::Iterator::const_iterator</a></div><div class="ttdeci">std::vector< int >::const_iterator const_iterator</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00102">sparse_permutation.h:102</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_sparse_permutation_html_ab601acb5aed920b1e61210d497462976"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#ab601acb5aed920b1e61210d497462976">operations_research::SparsePermutation::Support</a></div><div class="ttdeci">const std::vector< int > & Support() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00037">sparse_permutation.h:37</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html"><div class="ttname"><a href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html">operations_research::SparsePermutation::Iterator</a></div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00099">sparse_permutation.h:99</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_a8c5fc5af6e649a82d169f61e4dab5e33"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">operations_research::SparsePermutation::NumCycles</a></div><div class="ttdeci">int NumCycles() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00033">sparse_permutation.h:33</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#l00893">base/logging.h:893</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="sparse__permutation_8h.html">sparse_permutation.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|