130 lines
52 KiB
HTML
130 lines
52 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: monoid_operation_tree.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('monoid__operation__tree_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">monoid_operation_tree.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="monoid__operation__tree_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_UTIL_MONOID_OPERATION_TREE_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_UTIL_MONOID_OPERATION_TREE_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 <algorithm></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <string></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 "absl/strings/str_format.h"</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</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="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></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="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</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> <span class="comment">// A monoid is an algebraic structure consisting of a set S with an associative</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// binary operation * :S x S -> S that has an identity element.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// Associative means a*(b*c) = (a*b)*c for all a,b,c in S.</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// An identity element is an element e in S such that for all a in S,</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// e*a = a*e = a.</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// See http://en.wikipedia.org/wiki/Monoid for more details.</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">//</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// A MonoidOperationTree is a data structure that maintains a product</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// a_1 * a_2 * ... * a_n for a given (fixed) n, and that supports the</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// following functions:</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// - Setting the k-th operand to a given value in O(log n) calls to the *</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// operation</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// - Querying the result in O(1)</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">//</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// Note that the monoid is not required to be commutative.</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">//</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// The parameter class T represents an element of the set S.</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// It must:</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// * Have a public no-argument constructor producing the identity element.</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// * Have a = operator method that sets its value to the given one.</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// * Have a Compute(const T& left, const T& right) method that sets its value</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// to the result of the binary operation for the two given operands.</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// * Have a string DebugString() const method.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">//</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// Possible use cases are:</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// * Maintain a sum or a product of doubles, with a guarantee that the queried</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// result is independent of the order of past numerical issues</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// * Maintain a product of identically sized square matrices, which is an</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// example of use with non-commutative operations.</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_monoid_operation_tree.html"> 56</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_monoid_operation_tree.html">MonoidOperationTree</a> {</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// Constructs a MonoidOperationTree able to store 'size' operands.</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#a0fb378f55e6079d952ab9c6a05978128">MonoidOperationTree</a>(<span class="keywordtype">int</span> size);</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">// Returns the root of the tree, containing the result of the operation.</span></div><div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_monoid_operation_tree.html#a6a3c29fc6c3f2041a72f1508d4ceef24"> 62</a></span>  <span class="keyword">const</span> T& <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#a6a3c29fc6c3f2041a72f1508d4ceef24">result</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> *result_; }</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// Resets the argument of given index.</span></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_monoid_operation_tree.html#a534e86b564fc527dbf29391168d95b8b">Reset</a>(<span class="keywordtype">int</span> argument_index);</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">// Sets the argument of given index.</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#a1ab7556805300c52a917a810ea129aba">Set</a>(<span class="keywordtype">int</span> argument_index, <span class="keyword">const</span> T& argument);</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">// Resets all arguments.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// Returns the leaf node corresponding to the given argument index.</span></div><div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_monoid_operation_tree.html#a7cb097f373c762c9c733b78096fc2716"> 74</a></span>  <span class="keyword">const</span> T& <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#a7cb097f373c762c9c733b78096fc2716">GetOperand</a>(<span class="keywordtype">int</span> argument_index)<span class="keyword"> const </span>{</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">return</span> nodes_[PositionOfLeaf(argument_index)];</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"> 78</span>  <span class="comment">// Dive down a branch of the operation tree, and then come back up.</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">template</span> <<span class="keyword">class</span> Diver></div><div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_monoid_operation_tree.html#ab58118bc9ef4f6097c27895a3cf57ed9"> 80</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#ab58118bc9ef4f6097c27895a3cf57ed9">DiveInTree</a>(Diver* <span class="keyword">const</span> diver)<span class="keyword"> const </span>{</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#ab58118bc9ef4f6097c27895a3cf57ed9">DiveInTree</a>(0, diver);</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"> 84</span>  std::string <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// Computes the index of the first leaf for the given size.</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">static</span> <span class="keywordtype">int</span> ComputeLeafOffset(<span class="keywordtype">int</span> size);</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// Computes the total number of nodes we need to store non-leaf nodes and</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// leaf nodes.</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">static</span> <span class="keywordtype">int</span> ComputeNumberOfNodes(<span class="keywordtype">int</span> leaf_offset);</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// Computes the whole path from the node of given position up to the root,</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// excluding the bottom node.</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordtype">void</span> ComputeAbove(<span class="keywordtype">int</span> position);</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>  <span class="comment">// Computes the node of given position, and no other.</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordtype">void</span> Compute(<span class="keywordtype">int</span> position);</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// Returns the position of the leaf node of given index.</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordtype">int</span> PositionOfLeaf(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> leaf_offset_ + <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</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"> 104</span>  <span class="comment">// Returns true if the node of given position is a leaf.</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordtype">bool</span> IsLeaf(<span class="keywordtype">int</span> position)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> position >= leaf_offset_; }</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// Returns the index of the argument stored in the node of given position.</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordtype">int</span> ArgumentIndexOfLeafPosition(<span class="keywordtype">int</span> position)<span class="keyword"> const </span>{</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsLeaf(position));</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">return</span> position - leaf_offset_;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }</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="keyword">template</span> <<span class="keyword">class</span> Diver></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#ab58118bc9ef4f6097c27895a3cf57ed9">DiveInTree</a>(<span class="keywordtype">int</span> position, Diver* diver) <span class="keyword">const</span>;</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>  <span class="keyword">static</span> <span class="keywordtype">int</span> father(<span class="keywordtype">int</span> pos) { <span class="keywordflow">return</span> (pos - 1) >> 1; }</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">static</span> <span class="keywordtype">int</span> left(<span class="keywordtype">int</span> pos) { <span class="keywordflow">return</span> (pos << 1) + 1; }</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">static</span> <span class="keywordtype">int</span> right(<span class="keywordtype">int</span> pos) { <span class="keywordflow">return</span> (pos + 1) << 1; }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// The number of arguments that can be stored in this tree. That is, the</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="comment">// number of used leaves. (There may be unused leaves, too)</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size_;</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">// The index of the first leaf.</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> leaf_offset_;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// Number of nodes, both non-leaves and leaves.</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes_;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">// All the nodes, both non-leaves and leaves.</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  std::vector<T> nodes_;</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="comment">// A pointer to the root node</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  T <span class="keyword">const</span>* result_;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#a0fb378f55e6079d952ab9c6a05978128">MonoidOperationTree</a>);</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> };</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// --------------------------------------------------------------------- //</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// Implementation</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment">// --------------------------------------------------------------------- //</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> </div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="keywordtype">int</span> MonoidOperationTree<T>::ComputeLeafOffset(<span class="keywordtype">int</span> size) {</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordtype">int</span> smallest_pow_two_not_less_than_size = 1;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">while</span> (smallest_pow_two_not_less_than_size < size) {</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  smallest_pow_two_not_less_than_size <<= 1;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">return</span> <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(1, smallest_pow_two_not_less_than_size - 1);</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> }</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="keywordtype">int</span> MonoidOperationTree<T>::ComputeNumberOfNodes(<span class="keywordtype">int</span> leaf_offset) {</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// leaf_offset should be a power of 2 minus 1.</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, (leaf_offset) & (leaf_offset + 1));</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_leaves = leaf_offset + 1;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = leaf_offset + num_leaves;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(num_nodes, 3); <span class="comment">// We need at least the root and its 2 children</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">return</span> num_nodes;</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> }</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> </div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00163"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_monoid_operation_tree.html#a0fb378f55e6079d952ab9c6a05978128"> 163</a></span> <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#a0fb378f55e6079d952ab9c6a05978128">MonoidOperationTree<T>::MonoidOperationTree</a>(<span class="keywordtype">int</span> size)</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  : size_(size),</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  leaf_offset_(ComputeLeafOffset(size)),</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  num_nodes_(ComputeNumberOfNodes(leaf_offset_)),</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  nodes_(num_nodes_, T()),</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  result_(&(nodes_[0])) {}</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00171"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_monoid_operation_tree.html#aa71d36872f416feaa853788a7a7a7ef8"> 171</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#aa71d36872f416feaa853788a7a7a7ef8">MonoidOperationTree<T>::Clear</a>() {</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = nodes_.size();</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  nodes_.assign(size, T());</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> }</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> </div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00177"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_monoid_operation_tree.html#a534e86b564fc527dbf29391168d95b8b"> 177</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#a534e86b564fc527dbf29391168d95b8b">MonoidOperationTree<T>::Reset</a>(<span class="keywordtype">int</span> argument_index) {</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="code" href="classoperations__research_1_1_set.html">Set</a>(argument_index, T());</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> }</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00182"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_monoid_operation_tree.html#a1ab7556805300c52a917a810ea129aba"> 182</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#a1ab7556805300c52a917a810ea129aba">MonoidOperationTree<T>::Set</a>(<span class="keywordtype">int</span> argument_index, <span class="keyword">const</span> T& argument) {</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(argument_index, size_);</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> position = leaf_offset_ + argument_index;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  nodes_[position] = argument;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  ComputeAbove(position);</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> }</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> </div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html">MonoidOperationTree<T>::ComputeAbove</a>(<span class="keywordtype">int</span> position) {</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordtype">int</span> pos = father(position);</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">while</span> (pos > 0) {</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  Compute(pos);</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  pos = father(pos);</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  Compute(0);</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> }</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> </div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="keywordtype">void</span> MonoidOperationTree<T>::Compute(<span class="keywordtype">int</span> position) {</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">const</span> T& left_child = nodes_[left(position)];</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keyword">const</span> T& <a class="code" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a> = nodes_[right(position)];</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  nodes_[position].Compute(left_child, <a class="code" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a>);</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> }</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> </div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00207"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_monoid_operation_tree.html#a764be64f3029f8b8e23511061d8de355"> 207</a></span> std::string <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#a764be64f3029f8b8e23511061d8de355">MonoidOperationTree<T>::DebugString</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  std::string out;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordtype">int</span> layer = 0;</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_nodes_; ++i) {</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> (((i + 1) & i) == 0) {</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// New layer</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  absl::StrAppendFormat(&out, <span class="stringliteral">"-------------- Layer %d ---------------\n"</span>,</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  layer);</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  ++layer;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  absl::StrAppendFormat(&out, <span class="stringliteral">"Position %d: %s\n"</span>, i,</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  nodes_[i].DebugString());</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  }</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">return</span> out;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> }</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="keyword">template</span> <<span class="keyword">class</span> Diver></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_monoid_operation_tree.html#ab58118bc9ef4f6097c27895a3cf57ed9">MonoidOperationTree<T>::DiveInTree</a>(<span class="keywordtype">int</span> position, Diver* diver)<span class="keyword"> const </span>{</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">// Are we at a leaf?</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">if</span> (IsLeaf(position)) {</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = ArgumentIndexOfLeafPosition(position);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">const</span> T& argument = nodes_[position];</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  diver->OnArgumentReached(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, argument);</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keyword">const</span> T& current = nodes_[position];</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keyword">const</span> T& left_child = nodes_[left(position)];</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">const</span> T& <a class="code" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a> = nodes_[right(position)];</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">if</span> (diver->ChooseGoLeft(current, left_child, <a class="code" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a>)) {</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="comment">// Go left</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  DiveInTree(left(position), diver);</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="comment">// Come back up</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  diver->OnComeBackFromLeft(current, left_child, <a class="code" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a>);</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// Go right</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  DiveInTree(right(position), diver);</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="comment">// Come back up</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  diver->OnComeBackFromRight(current, left_child, <a class="code" href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a>);</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  }</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  }</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> }</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> </div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> } <span class="comment">// namespace operations_research</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="preprocessor">#endif // OR_TOOLS_UTIL_MONOID_OPERATION_TREE_H_</span></div><div class="ttc" id="classoperations__research_1_1_monoid_operation_tree_html_a7cb097f373c762c9c733b78096fc2716"><div class="ttname"><a href="classoperations__research_1_1_monoid_operation_tree.html#a7cb097f373c762c9c733b78096fc2716">operations_research::MonoidOperationTree::GetOperand</a></div><div class="ttdeci">const T & GetOperand(int argument_index) const</div><div class="ttdef"><b>Definition:</b> <a href="monoid__operation__tree_8h_source.html#l00074">monoid_operation_tree.h:74</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_monoid_operation_tree_html_ab58118bc9ef4f6097c27895a3cf57ed9"><div class="ttname"><a href="classoperations__research_1_1_monoid_operation_tree.html#ab58118bc9ef4f6097c27895a3cf57ed9">operations_research::MonoidOperationTree::DiveInTree</a></div><div class="ttdeci">void DiveInTree(Diver *const diver) const</div><div class="ttdef"><b>Definition:</b> <a href="monoid__operation__tree_8h_source.html#l00080">monoid_operation_tree.h:80</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_monoid_operation_tree_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1_monoid_operation_tree.html#a764be64f3029f8b8e23511061d8de355">operations_research::MonoidOperationTree::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="monoid__operation__tree_8h_source.html#l00207">monoid_operation_tree.h:207</a></div></div>
|
|
<div class="ttc" id="arc__flow__builder_8cc_html_a37a60bd8e1de6871a556b2822884edea"><div class="ttname"><a href="arc__flow__builder_8cc.html#a37a60bd8e1de6871a556b2822884edea">right_child</a></div><div class="ttdeci">int right_child</div><div class="ttdef"><b>Definition:</b> <a href="arc__flow__builder_8cc_source.html#l00064">arc_flow_builder.cc:64</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a4bd2e815ca2f702a4b6aa744b1ff3b82"><div class="ttname"><a href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a></div><div class="ttdeci">#define CHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00705">base/logging.h:705</a></div></div>
|
|
<div class="ttc" id="macros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_monoid_operation_tree_html"><div class="ttname"><a href="classoperations__research_1_1_monoid_operation_tree.html">operations_research::MonoidOperationTree</a></div><div class="ttdef"><b>Definition:</b> <a href="monoid__operation__tree_8h_source.html#l00056">monoid_operation_tree.h:56</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="pack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_set_html"><div class="ttname"><a href="classoperations__research_1_1_set.html">operations_research::Set</a></div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00128">hamiltonian_path.h:128</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="classoperations__research_1_1_monoid_operation_tree_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1_monoid_operation_tree.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::MonoidOperationTree::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="monoid__operation__tree_8h_source.html#l00171">monoid_operation_tree.h:171</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="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="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_monoid_operation_tree_html_a534e86b564fc527dbf29391168d95b8b"><div class="ttname"><a href="classoperations__research_1_1_monoid_operation_tree.html#a534e86b564fc527dbf29391168d95b8b">operations_research::MonoidOperationTree::Reset</a></div><div class="ttdeci">void Reset(int argument_index)</div><div class="ttdef"><b>Definition:</b> <a href="monoid__operation__tree_8h_source.html#l00177">monoid_operation_tree.h:177</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_monoid_operation_tree_html_a0fb378f55e6079d952ab9c6a05978128"><div class="ttname"><a href="classoperations__research_1_1_monoid_operation_tree.html#a0fb378f55e6079d952ab9c6a05978128">operations_research::MonoidOperationTree::MonoidOperationTree</a></div><div class="ttdeci">MonoidOperationTree(int size)</div><div class="ttdef"><b>Definition:</b> <a href="monoid__operation__tree_8h_source.html#l00163">monoid_operation_tree.h:163</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_monoid_operation_tree_html_a6a3c29fc6c3f2041a72f1508d4ceef24"><div class="ttname"><a href="classoperations__research_1_1_monoid_operation_tree.html#a6a3c29fc6c3f2041a72f1508d4ceef24">operations_research::MonoidOperationTree::result</a></div><div class="ttdeci">const T & result() const</div><div class="ttdef"><b>Definition:</b> <a href="monoid__operation__tree_8h_source.html#l00062">monoid_operation_tree.h:62</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_monoid_operation_tree_html_a1ab7556805300c52a917a810ea129aba"><div class="ttname"><a href="classoperations__research_1_1_monoid_operation_tree.html#a1ab7556805300c52a917a810ea129aba">operations_research::MonoidOperationTree::Set</a></div><div class="ttdeci">void Set(int argument_index, const T &argument)</div><div class="ttdef"><b>Definition:</b> <a href="monoid__operation__tree_8h_source.html#l00182">monoid_operation_tree.h:182</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_a3328a0ea67a2aaa160c2783ffbaa5dc.html">util</a></li><li class="navelem"><a class="el" href="monoid__operation__tree_8h.html">monoid_operation_tree.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>
|