124 lines
23 KiB
HTML
124 lines
23 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: math_opt_proto_utils.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('math__opt__proto__utils_8cc_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">math_opt_proto_utils.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="math__opt__proto__utils_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="math__opt__proto__utils_8h.html">ortools/math_opt/core/math_opt_proto_utils.h</a>"</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <stdint.h></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <functional></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</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="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "ortools/math_opt/callback.pb.h"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="sparse__vector__view_8h.html">ortools/math_opt/core/sparse_vector_view.h</a>"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "ortools/math_opt/sparse_containers.pb.h"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span>math_opt {</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div><div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#af649365c28596912460bb9375e377b63"> 31</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1math__opt.html#af649365c28596912460bb9375e377b63">RemoveSparseDoubleVectorZeros</a>(SparseDoubleVectorProto& sparse_vector) {</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(sparse_vector.ids_size(), sparse_vector.values_size());</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="comment">// Keep track of the next index that has not yet been used for a non zero</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">// value.</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = 0;</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> [<span class="keywordtype">id</span>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>] : <a class="code" href="namespaceoperations__research_1_1math__opt.html#ac17be684f3a6337b38f287c0a1e8c691">MakeView</a>(sparse_vector)) {</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="comment">// Se use `!(== 0.0)` here so that we keep NaN values for which both `v ==</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="comment">// 0` and `v != 0` returns false.</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">if</span> (!(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == 0.0)) {</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  sparse_vector.set_ids(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <span class="keywordtype">id</span>);</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  sparse_vector.set_values(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  ++<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  }</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  }</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// At the end of the iteration, `next` contains the index of the first unused</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// index. This means it contains the number of used elements.</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  sparse_vector.mutable_ids()->Truncate(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  sparse_vector.mutable_values()->Truncate(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> }</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> </div><div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate.html#a4b629c158cb9a96810d39b72b3a2a587"> 51</a></span> <a class="code" href="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate.html#a4b629c158cb9a96810d39b72b3a2a587">SparseVectorFilterPredicate::SparseVectorFilterPredicate</a>(</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">const</span> SparseVectorFilterProto& filter)</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  : filter_(filter) {</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// We only do this test in non-optimized builds.</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a> && filter_.filter_by_ids()) {</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// Checks that input filtered_ids are strictly increasing.</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// That is: for all i, ids(i) < ids(i+1).</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// Hence here we fail if there exists i such that ids(i) >= ids(i+1).</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& ids = filter_.filtered_ids();</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(std::adjacent_find(ids.begin(), ids.end(),</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  std::greater_equal<int64_t>()) == ids.end())</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  << <span class="stringliteral">"The input filter.filtered_ids must be strictly increasing."</span>;</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> }</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#af457f60ebac293554106c3ee3898607e"> 66</a></span> absl::flat_hash_set<CallbackEventProto> <a class="code" href="namespaceoperations__research_1_1math__opt.html#af457f60ebac293554106c3ee3898607e">EventSet</a>(</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keyword">const</span> CallbackRegistrationProto& callback_registration) {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">// Here we don't use for-range loop since for repeated enum fields, the type</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">// used in C++ is RepeatedField<int>. Using the generated getter instead</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">// guarantees type safety.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  absl::flat_hash_set<CallbackEventProto> events;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < callback_registration.request_registration_size(); ++i) {</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  events.emplace(callback_registration.request_registration(i));</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">return</span> events;</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">// namespace math_opt</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="base_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_ac17be684f3a6337b38f287c0a1e8c691"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ac17be684f3a6337b38f287c0a1e8c691">operations_research::math_opt::MakeView</a></div><div class="ttdeci">SparseVectorView< T > MakeView(absl::Span< const int64_t > ids, const Collection &values)</div><div class="ttdef"><b>Definition:</b> <a href="sparse__vector__view_8h_source.html#l00140">sparse_vector_view.h:140</a></div></div>
|
|
<div class="ttc" id="macros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate_html_a4b629c158cb9a96810d39b72b3a2a587"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate.html#a4b629c158cb9a96810d39b72b3a2a587">operations_research::math_opt::SparseVectorFilterPredicate::SparseVectorFilterPredicate</a></div><div class="ttdeci">SparseVectorFilterPredicate(const SparseVectorFilterProto &filter)</div><div class="ttdef"><b>Definition:</b> <a href="math__opt__proto__utils_8cc_source.html#l00051">math_opt_proto_utils.cc:51</a></div></div>
|
|
<div class="ttc" id="integral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="constraint__solver_8cc_html_a395f613555f398dd389670bb4c2a4599"><div class="ttname"><a href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a></div><div class="ttdeci">Block * next</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00678">constraint_solver.cc:678</a></div></div>
|
|
<div class="ttc" id="sparse__vector__view_8h_html"><div class="ttname"><a href="sparse__vector__view_8h.html">sparse_vector_view.h</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_af457f60ebac293554106c3ee3898607e"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#af457f60ebac293554106c3ee3898607e">operations_research::math_opt::EventSet</a></div><div class="ttdeci">absl::flat_hash_set< CallbackEventProto > EventSet(const CallbackRegistrationProto &callback_registration)</div><div class="ttdef"><b>Definition:</b> <a href="math__opt__proto__utils_8cc_source.html#l00066">math_opt_proto_utils.cc:66</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="math__opt__proto__utils_8h_html"><div class="ttname"><a href="math__opt__proto__utils_8h.html">math_opt_proto_utils.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_af649365c28596912460bb9375e377b63"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#af649365c28596912460bb9375e377b63">operations_research::math_opt::RemoveSparseDoubleVectorZeros</a></div><div class="ttdeci">void RemoveSparseDoubleVectorZeros(SparseDoubleVectorProto &sparse_vector)</div><div class="ttdef"><b>Definition:</b> <a href="math__opt__proto__utils_8cc_source.html#l00031">math_opt_proto_utils.cc:31</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="demon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</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_1defc00030ff81d309105e053121082f.html">math_opt</a></li><li class="navelem"><a class="el" href="dir_d5b95ec3710e8b09bb3a6564ed5074d8.html">core</a></li><li class="navelem"><a class="el" href="math__opt__proto__utils_8cc.html">math_opt_proto_utils.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|