<ahref="dynamic__permutation_8h.html">Go to the documentation of this file.</a><divclass="fragment"><divclass="line"><aname="l00001"></a><spanclass="lineno"> 1</span> <spanclass="comment">// Copyright 2010-2018 Google LLC</span></div><divclass="line"><aname="l00002"></a><spanclass="lineno"> 2</span> <spanclass="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><divclass="line"><aname="l00003"></a><spanclass="lineno"> 3</span> <spanclass="comment">// you may not use this file except in compliance with the License.</span></div><divclass="line"><aname="l00004"></a><spanclass="lineno"> 4</span> <spanclass="comment">// You may obtain a copy of the License at</span></div><divclass="line"><aname="l00005"></a><spanclass="lineno"> 5</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00006"></a><spanclass="lineno"> 6</span> <spanclass="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><divclass="line"><aname="l00007"></a><spanclass="lineno"> 7</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00008"></a><spanclass="lineno"> 8</span> <spanclass="comment">// Unless required by applicable law or agreed to in writing, software</span></div><divclass="line"><aname="l00009"></a><spanclass="lineno"> 9</span> <spanclass="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><divclass="line"><aname="l00010"></a><spanclass="lineno"> 10</span> <spanclass="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><divclass="line"><aname="l00011"></a><spanclass="lineno"> 11</span> <spanclass="comment">// See the License for the specific language governing permissions and</span></div><divclass="line"><aname="l00012"></a><spanclass="lineno"> 12</span> <spanclass="comment">// limitations under the License.</span></div><divclass="line"><aname="l00013"></a><spanclass="lineno"> 13</span> </div><divclass="line"><aname="l00014"></a><spanclass="lineno"> 14</span> <spanclass="preprocessor">#ifndef OR_TOOLS_ALGORITHMS_DYNAMIC_PERMUTATION_H_</span></div><divclass="line"><aname="l00015"></a><spanclass="lineno"> 15</span> <spanclass="preprocessor">#define OR_TOOLS_ALGORITHMS_DYNAMIC_PERMUTATION_H_</span></div><divclass="line"><aname="l00016"></a><spanclass="lineno"> 16</span> </div><divclass="line"><aname="l00017"></a><spanclass="lineno"> 17</span> <spanclass="preprocessor">#include <memory></span></div><divclass="line"><aname="l00018"></a><spanclass="lineno"> 18</span> <spanclass="preprocessor">#include <set></span><spanclass="comment">// TODO(user): remove when no longer used.</span></div><divclass="line"><aname="l00019"></a><spanclass="lineno"> 19</span> <spanclass="preprocessor">#include <vector></span></div><divclass="line"><aname="l00020"></a><spanclass="lineno"> 20</span> </div><divclass="line"><aname="l00021"></a><spanclass="lineno"> 21</span> <spanclass="preprocessor">#include "ortools/base/logging.h"</span></div><divclass="line"><aname="l00022"></a><spanclass="lineno"> 22</span> </div><divclass="line"><aname="l00023"></a><spanclass="lineno"> 23</span> <spanclass="keyword">namespace </span><aclass="code"href="namespaceoperations__research.html">operations_research</a> {</div><divclass="line"><aname="l00024"></a><spanclass="lineno"> 24</span> </div><divclass="line"><aname="l00025"></a><spanclass="lineno"> 25</span> <spanclass="keyword">class </span>SparsePermutation;</div><divclass="line"><aname="l00026"></a><spanclass="lineno"> 26</span> </div><divclass="line"><aname="l00027"></a><spanclass="lineno"> 27</span> <spanclass="comment">// Maintains a 'partial' permutation of [0..n-1] onto itself, with a dynamic</span></div><divc
<divclass="ttc"id="classoperations__research_1_1DynamicPermutation_html"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPermutation.html">operations_research::DynamicPermutation</a></div><divclass="ttdoc">Maintains a 'partial' permutation of [0..n-1] onto itself, with a dynamic API allowing it to be built...</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__permutation_8h_source.html#l00033">dynamic_permutation.h:33</a></div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPermutation_html_afc0264e56e82c46a27db9b57ed58cd45"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPermutation.html#afc0264e56e82c46a27db9b57ed58cd45">operations_research::DynamicPermutation::CreateSparsePermutation</a></div><divclass="ttdeci">std::unique_ptr< SparsePermutation > CreateSparsePermutation() const</div><divclass="ttdoc">Creates a SparsePermutation representing the current permutation.</div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPermutation_html_a439e971c48da03d73621df8149c27167"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPermutation.html#a439e971c48da03d73621df8149c27167">operations_research::DynamicPermutation::Reset</a></div><divclass="ttdeci">void Reset()</div><divclass="ttdoc">Makes the permutation back to the identity (i.e.</div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPermutation_html_a455f2fd63b17930ebb1d9a72f642ebd9"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPermutation.html#a455f2fd63b17930ebb1d9a72f642ebd9">operations_research::DynamicPermutation::ImageOf</a></div><divclass="ttdeci">int ImageOf(int i) const</div><divclass="ttdoc">Forced-inline for the speed.</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__permutation_8h_source.html#l00114">dynamic_permutation.h:114</a></div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPermutation_html_af1058ff0d3ae20f6f313a82e12febbbf"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPermutation.html#af1058ff0d3ae20f6f313a82e12febbbf">operations_research::DynamicPermutation::AddMappings</a></div><divclass="ttdeci">void AddMappings(const std::vector< int >&src, const std::vector< int >&dst)</div><divclass="ttdoc">Declares a set of mappings for this permutation: src[i] will map to dst[i].</div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPermutation_html_a5743ffc1c6fb22b0c4d63ce242135cbe"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPermutation.html#a5743ffc1c6fb22b0c4d63ce242135cbe">operations_research::DynamicPermutation::DynamicPermutation</a></div><divclass="ttdeci">DynamicPermutation(int n)</div><divclass="ttdoc">Upon construction, every element i in [0..n-1] maps to itself.</div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPermutation_html_a26a6e9c551114feee802a46a49cf2b4a"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPermutation.html#a26a6e9c551114feee802a46a49cf2b4a">operations_research::DynamicPermutation::RootOf</a></div><divclass="ttdeci">int RootOf(int i) const</div><divclass="ttdoc">While the permutation is partially being built, the orbit of elements will either form unclosed paths...</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__permutation_8h_source.html#l00121">dynamic_permutation.h:121</a></div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPermutation_html_a5493ce64ddd5b10144e57a0e630c1657"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPermutation.html#a5493ce64ddd5b10144e57a0e630c1657">operations_research::DynamicPermutation::UndoLastMappings</a></div><divclass="ttdeci">void UndoLastMappings(std::vector< int > *undone_mapping_src)</div><divclass="ttdoc">Undoes the last AddMappings() operation, and fills the "undone_mapping_src" vector with the src of th...</div></div>
<divclass="ttc"id="namespaceoperations__research_html"><divclass="ttname"><ahref="namespaceoperations__research.html">operations_research</a></div><divclass="ttdoc">Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in c...</div><divclass="ttdef"><b>Definition:</b><ahref="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPermutation_html_acf9308c2eb8d7c1d5b5e3193c672f36d"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPermutation.html#acf9308c2eb8d7c1d5b5e3193c672f36d">operations_research::DynamicPermutation::LooseEnds</a></div><divclass="ttdeci">const std::set< int >& LooseEnds() const</div><divclass="ttdoc">The exhaustive set of the 'loose end' of the incomplete cycles (e.g., paths) built so far.</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__permutation_8h_source.html#l00083">dynamic_permutation.h:83</a></div></div>
