560 lines
91 KiB
HTML
560 lines
91 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.9.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: test_util.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>
|
|
<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.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('test__util_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">test_util.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="test__util_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#ifndef PDLP_TEST_UTIL_H_</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#define PDLP_TEST_UTIL_H_</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <sstream></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <type_traits></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> </div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include "Eigen/Core"</span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include "Eigen/SparseCore"</span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include "absl/types/span.h"</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "gmock/gmock.h"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include "gtest/gtest.h"</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="quadratic__program_8h.html">ortools/pdlp/quadratic_program.h</a>"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> </div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research_1_1pdlp.html">operations_research::pdlp</a> {</div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> </div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="comment">// A small LP with all 4 patterns of which lower and upper bounds on the</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="comment">// constraints are finite and similarly for the variables.</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="comment">// min 5.5 x_0 - 2 x_1 - x_2 + x_3 - 14 s.t.</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="comment">// 2 x_0 + x_1 + x_2 + 2 x_3 = 12</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="comment">// x_0 + x_2 <= 7</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="comment">// 4 x_0 >= -4</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="comment">// -1 <= 1.5 x_2 - x_3 <= 1</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="comment">// -infinity <= x_0 <= infinity</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment">// -2 <= x_1 <= infinity</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="comment">// -infinity <= x_2 <= 6</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="comment">// 2.5 <= x_3 <= 3.5</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="comment">// Optimal solutions:</span></div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="comment">// Primal: [-1, 8, 1, 2.5]</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="comment">// Dual: [-2, 0, 2.375, 2.0/3]</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="comment">// Value: -5.5 - 16 -1 + 2.5 - 14 = -34</span></div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ad795f23e2a85f4ae05efa1e2d0e0de4d">TestLp</a>();</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> </div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="comment">// Verifies that the given QuadraticProgram equals TestLp().</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a7fc1d606307ca19921a85a135ba40334">VerifyTestLp</a>(<span class="keyword">const</span> QuadraticProgram& qp, <span class="keywordtype">bool</span> maximize = <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> </div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment">// Returns a small test LP.</span></div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="comment">// The LP:</span></div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="comment">// min 5 x_1 + 2 x_2 + x_3 + x_4 - 14 s.t.</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span><span class="comment">// 2 x_1 + x_2 + x_3 + 2 x_4 = 12</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="comment">// x_1 + x_3 >= 7</span></div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="comment">// x_3 - x_4 >= 1</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span><span class="comment">// 0 <= x_1 <= 2</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span><span class="comment">// 0 <= x_2 <= 4</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="comment">// 0 <= x_3 <= 6</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="comment">// 0 <= x_4 <= 3</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span><span class="comment">// Optimum solutions:</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span><span class="comment">// Primal: x_1 = 1, x_2 = 0, x_3 = 6, x_4 = 2. Value: 5 + 0 + 6 + 2 - 14 = -1.</span></div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span><span class="comment">// Dual: [0.5, 4.0, 0.0] Value: 6 + 28 - 3.5*6 - 14 = -1</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span><span class="comment">// Reduced costs: [0.0, 1.5, -3.5, 0.0]</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a79496743a139659305201925cdcb39fa">TinyLp</a>();</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> </div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span><span class="comment">// Returns a correlation clustering LP.</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span><span class="comment">// This is the LP for minimizing disagreements for correlation clustering for</span></div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span><span class="comment">// the 4-vertex graph</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="comment">// 1 - 3 - 4</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment">// | /</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment">// 2</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment">// In integer solutions x_ij is 1 if i and j are in the same cluster and 0</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span><span class="comment">// otherwise. The 6 variables are in the order</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span><span class="comment">// x_12, x_13, x_14, x_23, x_24, x_34.</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span><span class="comment">// For any distinct i,j,k there's a triangle inequality</span></div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="comment">// (1-x_ik) <= (1-x_ij) + (1-x_jk)</span></div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span><span class="comment">// i.e.</span></div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span><span class="comment">// -x_ij - x_jk + x_ik >= -1.</span></div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="comment">// For brevity we only include 3 out of the 12 possible triangle inequalities:</span></div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment">// two needed in the optimal solution and 1 other.</span></div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="comment">// Optimal solutions:</span></div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span><span class="comment">// Primal: [1, 1, 0, 1, 0, 0]</span></div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span><span class="comment">// Dual: Multiple.</span></div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span><span class="comment">// Value: 1.</span></div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#afdcc70bb8ac56ba4e60990640f5c7816">CorrelationClusteringLp</a>();</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span><span class="comment">// Returns another 4-vertex correlation clustering LP.</span></div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span><span class="comment">// The variables are x_12, x_13, x_14, x_23, x_24, and x_34.</span></div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span><span class="comment">// This time the graph is a star centered at vertex 1.</span></div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span><span class="comment">// Only the three triangle inequalities that are needed are included."""</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="comment">// Optimal solutions:</span></div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span><span class="comment">// Primal: [0.5, 0.5, 0.5, 0.0, 0.0, 0.0]</span></div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span><span class="comment">// Dual: [0.5, 0.5, 0.5]</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span><span class="comment">// Value: 1.5</span></div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a52fe72d70d171944fc5d320e07ba07ac">CorrelationClusteringStarLp</a>();</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> </div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span><span class="comment">// Returns a small test QP.</span></div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span><span class="comment">// min 2 x_0^2 + 0.5 x_1^2 - x_0 - x_1 + 5 s.t.</span></div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span><span class="comment">// x_0 + x_1 <= 1</span></div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span><span class="comment">// 1 <= x_0 <= 2</span></div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span><span class="comment">// -2 <= x_1 <= 4</span></div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span><span class="comment">// Optimal solutions:</span></div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span><span class="comment">// Primal: [1.0, 0.0]</span></div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span><span class="comment">// Dual: [-1.0]</span></div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span><span class="comment">// Reduced costs: [4.0, 0.0]</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span><span class="comment">// Value: 2 - 1 + 5 = 6</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#afaedaf1e3ebe4d6d1a36e3fd1f206de6">TestDiagonalQp1</a>();</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> </div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span><span class="comment">// Returns a small diagonal QP.</span></div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span><span class="comment">// min 0.5 x_0^2 + 0.5 x_1^2 - 3 x_0 - x_1 s.t.</span></div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span><span class="comment">// x_0 - x_1 = 2</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span><span class="comment">// x_0 >= 0</span></div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span><span class="comment">// x_1 >= 0</span></div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span><span class="comment">// Optimal solutions:</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span><span class="comment">// Primal: [3, 1]</span></div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span><span class="comment">// Dual: [0]</span></div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span><span class="comment">// Value: 0</span></div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span><span class="comment">// Reduced costs: [0, 0]</span></div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a1f3fd39922ed044ea5c2408d41122319">TestDiagonalQp2</a>();</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> </div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span><span class="comment">// Returns a small diagonal QP.</span></div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span><span class="comment">// min 0.5 x_1^2 + x_2^2 + x_0 - x_2 s.t.</span></div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span><span class="comment">// x_0 - x_2 = 1</span></div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span><span class="comment">// 2x_0 = 4</span></div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span><span class="comment">// x_0, x_1, x_2 >= 0</span></div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="comment">// Optimal solutions:</span></div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span><span class="comment">// Primal: [2, 0, 1]</span></div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="comment">// Dual: [-1, 1]</span></div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span><span class="comment">// Value: 3</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span><span class="comment">// Reduced costs: [0, 0, 0]</span></div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a6391c53ff0b7259dedf8fe9fcc927c65">TestDiagonalQp3</a>();</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> </div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span><span class="comment">// Returns a small invalid LP.</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span><span class="comment">// min x_0 + x_1 s.t.</span></div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span><span class="comment">// 2.0 <= x_0 - x_1 <= 1.0</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span><span class="comment">// 0.0 <= x_0</span></div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span><span class="comment">// 0.0 <= x_1</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a90ad9eef4ca03500a77b99e9e29a675f">SmallInvalidProblemLp</a>();</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> </div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span><span class="comment">// Returns a small LP that's invalid due to inconsistent variable bounds.</span></div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span><span class="comment">// min x_0 + x_1 s.t.</span></div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span><span class="comment">// x_0 - x_1 <= 1.0</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span><span class="comment">// 2.0 <= x_0 <= 1.0</span></div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span><span class="comment">// 0.0 <= x_1</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#af51b54f37971e2f896bd07a55c191d23">SmallInconsistentVariableBoundsLp</a>();</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> </div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span><span class="comment">// Returns a small test LP with infeasible primal.</span></div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span><span class="comment">// min x_0 + x_1 s.t.</span></div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span><span class="comment">// x_0 - x_1 <= 1.0</span></div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span><span class="comment">// -x_0 + x_1 <= -2.0</span></div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span><span class="comment">// 0.0 <= x_0</span></div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span><span class="comment">// 0.0 <= x_1</span></div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#af2390d8030d8925da948d466b7075d39">SmallPrimalInfeasibleLp</a>();</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> </div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span><span class="comment">// Returns a small test LP with infeasible dual.</span></div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span><span class="comment">// min - x_0 - x_1 s.t.</span></div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span><span class="comment">// x_0 - x_1 <= 1.0</span></div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span><span class="comment">// -x_0 + x_1 <= 2.0</span></div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span><span class="comment">// 0.0 <= x_0</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span><span class="comment">// 0.0 <= x_1</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span><span class="comment">// This is the SmallPrimalInfeasibleLp with the objective vector negated and</span></div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span><span class="comment">// with the second constraint changed to make it feasible.</span></div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a19a6acd7c2329d0b80072538aff8d703">SmallDualInfeasibleLp</a>();</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> </div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span><span class="comment">// Returns a small test LP with infeasible primal and dual.</span></div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span><span class="comment">// min - x_0 - x_1 s.t.</span></div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span><span class="comment">// x_0 - x_1 <= 1.0</span></div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span><span class="comment">// -x_0 + x_1 <= -2.0</span></div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span><span class="comment">// 0.0 <= x_0</span></div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span><span class="comment">// 0.0 <= x_1</span></div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span><span class="comment">// This is just the SmallPrimalInfeasibleLp with the objective vector</span></div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span><span class="comment">// negated.</span></div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#aa80f84de5e654569620d77f42849d0c9">SmallPrimalDualInfeasibleLp</a>();</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> </div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span><span class="comment">// This is a small lp for which optimality conditions are met by x=(0, 0), y=(0,</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span><span class="comment">// 0) if one doesn't check that x satisfies the variable bounds. Analogously,</span></div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span><span class="comment">// the assignment x=(1, 0), y = -(1, 1) also satisfies the optimality conditions</span></div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span><span class="comment">// if one doesn't check dual variable bounds.</span></div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span><span class="comment">// min -4 x_0 s.t.</span></div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span><span class="comment">// x_0 + x_1 <= 2.0</span></div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span><span class="comment">// x_0 + 2x_1 <= 2.0</span></div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span><span class="comment">// 0.5 <= x_0 <= 2.0</span></div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span><span class="comment">// 0.5 <= x_1 <= 2.0</span></div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#adfc8b0cb8540c12d84e14a2176dd857f">SmallInitializationLp</a>();</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> </div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span><span class="comment">// This is a small LP with 2 variables and zero constraints (excluding variable</span></div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span><span class="comment">// bounds), resulting in an empty constraint matrix (zero rows) and empty lower</span></div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span><span class="comment">// and upper constraint bounds.</span></div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span><span class="comment">// min 4 x_0 s.t.</span></div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span><span class="comment">// 0 <= x_0</span></div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span><span class="comment">// x_1 <= 0</span></div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span>QuadraticProgram <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a8d1b6834fa651b584ac83326d6a283b9">LpWithoutConstraints</a>();</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> </div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span><span class="comment">// Verifies that the given QuadraticProgram equals TestQp().</span></div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a3d9ef1342467b3fca8d64835a0d5e383">VerifyTestQp</a>(<span class="keyword">const</span> QuadraticProgram& qp, <span class="keywordtype">bool</span> maximize = <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> </div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span><span class="comment">// Converts a sparse matrix into a dense matrix in the format suitable for</span></div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span><span class="comment">// the matcher EigenArrayEq. Example usage:</span></div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span><span class="comment">// EXPECT_THAT(ToDense(sparse_mat), EigenArrayEq<double>({{1, 1}}));</span></div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span>::Eigen::ArrayXXd <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a28608a48394073aff1febbc4ca485035">ToDense</a>(</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="keyword">const</span> Eigen::SparseMatrix<double, Eigen::ColMajor, int64_t>& sparse_mat);</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> </div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span><span class="comment">// gMock matchers for Eigen.</span></div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> </div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceinternal.html">internal</a> {</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> </div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp_1_1internal.html#a0f94b9991a3fca3fbc21ed7bc15f8d90"> 214</a></span><a class="code hl_function" href="namespaceoperations__research_1_1pdlp_1_1internal.html#a0f94b9991a3fca3fbc21ed7bc15f8d90">MATCHER_P</a>(TupleIsNear, tolerance, <span class="stringliteral">"is near"</span>) {</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keywordflow">return</span> std::abs(std::get<0>(arg) - std::get<1>(arg)) <= tolerance;</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span>}</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> </div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp_1_1internal.html#a330ceb5a4b5a9b6469d0297e98a54818"> 218</a></span><a class="code hl_function" href="namespaceoperations__research_1_1pdlp_1_1internal.html#a330ceb5a4b5a9b6469d0297e98a54818">MATCHER</a>(TupleFloatEq, <span class="stringliteral">"is almost equal to"</span>) {</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> testing::Matcher<float> matcher = testing::FloatEq(std::get<1>(arg));</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="keywordflow">return</span> matcher.Matches(std::get<0>(arg));</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span>}</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> </div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span><span class="comment">// Convert nested Span to a 2D Eigen Array. Spans are implicitly</span></div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span><span class="comment">// constructable from initializer_lists and vectors, so this conversion is used</span></div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span><span class="comment">// in EigenArrayNear and EigenArrayEq to support syntaxes like</span></div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span><span class="comment">// EXPECT_THAT(array2d, EigenArrayNear<int>({{1, 2}, {3, 4}}, tolerance);</span></div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span><span class="comment">// This conversion creates a copy of the slice data, so it is safe to use the</span></div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span><span class="comment">// result even after the original slices vanish.</span></div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span><span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp_1_1internal.html#a6bc15c9fd49355e811d1233291bdd41e"> 230</a></span>Eigen::Array<T, Eigen::Dynamic, Eigen::Dynamic> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp_1_1internal.html#a6bc15c9fd49355e811d1233291bdd41e">EigenArray2DFromNestedSpans</a>(</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> absl::Span<<span class="keyword">const</span> absl::Span<const T>> rows) {</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> Eigen::Array<T, Eigen::Dynamic, Eigen::Dynamic> result(0, rows.size());</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="keywordflow">if</span> (!rows.empty()) {</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> result.resize(rows.size(), rows[0].size());</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> }</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < rows.size(); ++i) {</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(rows[0].size(), rows[i].size());</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> result.row(i) = Eigen::Map<const Eigen::Array<T, Eigen::Dynamic, 1>>(</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> &rows[i][0], rows[i].size());</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> }</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span>}</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> </div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span><span class="comment">// Get a matcher's description as a string. To produce the description for</span></div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span><span class="comment">// EigenEach(inner_matcher), this function is called to get the description of</span></div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span><span class="comment">// inner_matcher.</span></div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span><span class="keyword">template</span> <<span class="keyword">typename</span> LhsType></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp_1_1internal.html#ab2f09223539a1dd1dc474d5df34e6e9f"> 248</a></span>std::string <a class="code hl_function" href="namespaceoperations__research_1_1pdlp_1_1internal.html#ab2f09223539a1dd1dc474d5df34e6e9f">GetMatcherDescriptionAsString</a>(</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="keyword">const</span> testing::Matcher<LhsType>& matcher, <span class="keywordtype">bool</span> negation) {</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> std::stringstream ss;</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keywordflow">if</span> (negation) {</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> matcher.DescribeNegationTo(&ss);</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> matcher.DescribeTo(&ss);</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> }</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="keywordflow">return</span> ss.str();</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span>}</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> </div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span>} <span class="comment">// namespace internal</span></div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> </div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span><span class="comment">// Defines a gMock matcher that tests whether two numeric arrays are</span></div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span><span class="comment">// approximately equal in the sense of maximum absolute difference. The element</span></div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span><span class="comment">// value type may be float, double, or integral types.</span></div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span><span class="comment">// Example:</span></div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span><span class="comment">// vector<double> output = ComputeVector();</span></div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span><span class="comment">// vector<double> expected({-1.5333, sqrt(2), M_PI});</span></div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span><span class="comment">// EXPECT_THAT(output, FloatArrayNear(expected, 1e-3));</span></div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span><span class="keyword">template</span> <<span class="keyword">typename</span> ContainerType></div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span><span class="keyword">decltype</span>(testing::Pointwise(internal::TupleIsNear(0.0), ContainerType()))</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp.html#af8b98468b162a2ac487b17f4cd77d049"> 271</a></span><a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#af8b98468b162a2ac487b17f4cd77d049">FloatArrayNear</a>(<span class="keyword">const</span> ContainerType& container, <span class="keywordtype">double</span> tolerance) {</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="keywordflow">return</span> testing::Pointwise(internal::TupleIsNear(tolerance), container);</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span>}</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> </div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span><span class="comment">// Defines a gMock matcher acting as an elementwise version of FloatEq() for</span></div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span><span class="comment">// arrays of real floating point types. It tests whether two arrays are</span></div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span><span class="comment">// pointwise equal within 4 units in the last place (ULP) in float precision</span></div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span><span class="comment">// [http://en.wikipedia.org/wiki/Unit_in_the_last_place]. Roughly, 4 ULPs is</span></div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span><span class="comment">// 2^-21 times the absolute value, or 0.00005%. Exceptionally, zero matches</span></div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span><span class="comment">// values with magnitude less than 5.6e-45 (2^-147), infinities match infinities</span></div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span><span class="comment">// of the same sign, and NaNs don't match anything.</span></div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span><span class="comment">// Example:</span></div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span><span class="comment">// vector<float> output = ComputeVector();</span></div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span><span class="comment">// vector<float> expected({-1.5333, sqrt(2), M_PI});</span></div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span><span class="comment">// EXPECT_THAT(output, FloatArrayEq(expected));</span></div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span><span class="keyword">template</span> <<span class="keyword">typename</span> ContainerType></div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span><span class="keyword">decltype</span>(testing::Pointwise(internal::TupleFloatEq(), ContainerType()))</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp.html#a5dfb58a7e464f2bdb9ccf754a1e14dc9"> 289</a></span><a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a5dfb58a7e464f2bdb9ccf754a1e14dc9">FloatArrayEq</a>(<span class="keyword">const</span> ContainerType& container) {</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> <span class="keywordflow">return</span> testing::Pointwise(internal::TupleFloatEq(), container);</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span>}</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> </div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span><span class="comment">// Call .eval() on input and convert it to a column major representation.</span></div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span><span class="keyword">template</span> <<span class="keyword">typename</span> EigenType></div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span>Eigen::Array<<span class="keyword">typename</span> EigenType::Scalar, Eigen::Dynamic, Eigen::Dynamic,</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> Eigen::ColMajor></div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp.html#a881657afb86fecbfeb045a820fe1019d"> 297</a></span><a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a881657afb86fecbfeb045a820fe1019d">EvalAsColMajorEigenArray</a>(<span class="keyword">const</span> EigenType& <a class="code hl_function" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>) {</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="keywordflow">return</span> <a class="code hl_function" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>.eval();</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span>}</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> </div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span><span class="comment">// Wrap a column major Eigen Array as a Span.</span></div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span><span class="keyword">template</span> <<span class="keyword">typename</span> Scalar></div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp.html#ae56c77c834cf229f7d6daf8dab51b3e2"> 303</a></span>absl::Span<const Scalar> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ae56c77c834cf229f7d6daf8dab51b3e2">EigenArrayAsSpan</a>(</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <span class="keyword">const</span> Eigen::Array<Scalar, Eigen::Dynamic, Eigen::Dynamic, Eigen::ColMajor>&</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> array) {</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <span class="keywordflow">return</span> absl::Span<const Scalar>(array.data(), array.size());</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span>}</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> </div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span><span class="comment">// Gmock matcher to test whether all elements in an array match expected_array</span></div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span><span class="comment">// within the specified tolerance, and print a detailed error message pointing</span></div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span><span class="comment">// to the first mismatched element if they do not. Essentially an elementwise</span></div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span><span class="comment">// version of testing::DoubleNear for Eigen arrays.</span></div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span><span class="comment">// Example:</span></div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span><span class="comment">// Eigen::ArrayXf expected = ...</span></div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span><span class="comment">// EXPECT_THAT(actual_arrayxf, EigenArrayNear(expected, 1e-5));</span></div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp.html#a540cf8d0d17f8fc006cd238159039b8e"> 317</a></span><a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a540cf8d0d17f8fc006cd238159039b8e">MATCHER_P2</a>(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a3ae16963cfdf1d79ee0a65b6a02de904">EigenArrayNear</a>, expected_array, tolerance,</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> <span class="stringliteral">"array is near "</span> + testing::PrintToString(expected_array) +</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> <span class="stringliteral">" within tolerance "</span> + testing::PrintToString(tolerance)) {</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> <span class="keywordflow">if</span> (arg.rows() != expected_array.rows() ||</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> arg.cols() != expected_array.cols()) {</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> *result_listener << <span class="stringliteral">"where shape ("</span> << expected_array.rows() << <span class="stringliteral">", "</span></div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> << expected_array.cols() << <span class="stringliteral">") doesn't match ("</span></div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> << arg.rows() << <span class="stringliteral">", "</span> << arg.cols() << <span class="stringliteral">")"</span>;</div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> }</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> <span class="comment">// Call .eval() to allow callers to pass in Eigen expressions and possibly</span></div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <span class="comment">// noncontiguous objects, e.g. Eigen::ArrayXf::Zero(10) or Map with a stride.</span></div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <span class="comment">// Arrays are represented in column major order for consistent comparison.</span></div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> <span class="keyword">auto</span> realized_expected_array = <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a881657afb86fecbfeb045a820fe1019d">EvalAsColMajorEigenArray</a>(expected_array);</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> <span class="keyword">auto</span> realized_actual_array = <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a881657afb86fecbfeb045a820fe1019d">EvalAsColMajorEigenArray</a>(arg);</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> <span class="keywordflow">return</span> ExplainMatchResult(</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#af8b98468b162a2ac487b17f4cd77d049">FloatArrayNear</a>(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ae56c77c834cf229f7d6daf8dab51b3e2">EigenArrayAsSpan</a>(realized_expected_array), tolerance),</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ae56c77c834cf229f7d6daf8dab51b3e2">EigenArrayAsSpan</a>(realized_actual_array), result_listener);</div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span>}</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> </div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span><span class="comment">// Gmock matcher to test whether all elements in an array match expected_array</span></div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span><span class="comment">// within 4 units of least precision (ULP) in float precision. Essentially an</span></div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span><span class="comment">// elementwise version of testing::FloatEq for Eigen arrays.</span></div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span><span class="comment">// Example:</span></div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span><span class="comment">// Eigen::ArrayXf expected = ...</span></div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span><span class="comment">// EXPECT_THAT(actual_arrayxf, EigenArrayEq(expected));</span></div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp.html#aa72b1f307b95f80a53bb014998d47e23"> 344</a></span><a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#aa72b1f307b95f80a53bb014998d47e23">MATCHER_P</a>(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a6932b4f981467325cc8e2b50ee7fbd13">EigenArrayEq</a>, expected_array,</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> <span class="stringliteral">"array is almost equal to "</span> +</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> testing::PrintToString(expected_array)) {</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <span class="keywordflow">if</span> (arg.rows() != expected_array.rows() ||</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> arg.cols() != expected_array.cols()) {</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> *result_listener << <span class="stringliteral">"where shape ("</span> << expected_array.rows() << <span class="stringliteral">", "</span></div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> << expected_array.cols() << <span class="stringliteral">") doesn't match ("</span></div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> << arg.rows() << <span class="stringliteral">", "</span> << arg.cols() << <span class="stringliteral">")"</span>;</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> }</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <span class="comment">// Call .eval() to allow callers to pass in Eigen expressions and possibly</span></div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <span class="comment">// noncontiguous objects, e.g. Eigen::ArrayXf::Zero(10) or Map with a stride.</span></div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> <span class="comment">// Arrays are represented in column major order for consistent comparison.</span></div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> <span class="keyword">auto</span> realized_expected_array = <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a881657afb86fecbfeb045a820fe1019d">EvalAsColMajorEigenArray</a>(expected_array);</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="keyword">auto</span> realized_actual_array = <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a881657afb86fecbfeb045a820fe1019d">EvalAsColMajorEigenArray</a>(arg);</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> <span class="keywordflow">return</span> ExplainMatchResult(</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a5dfb58a7e464f2bdb9ccf754a1e14dc9">FloatArrayEq</a>(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ae56c77c834cf229f7d6daf8dab51b3e2">EigenArrayAsSpan</a>(realized_expected_array)),</div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ae56c77c834cf229f7d6daf8dab51b3e2">EigenArrayAsSpan</a>(realized_actual_array), result_listener);</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span>}</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> </div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span><span class="comment">// The next few functions are syntactic sugar for EigenArrayNear and</span></div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span><span class="comment">// EigenArrayEq to allow callers to pass in non-Eigen types that can be</span></div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span><span class="comment">// statically initialized like (nested in the 2D case) initializer_lists, or</span></div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span><span class="comment">// vectors, etc. For example this specialization lets one make calls inlining</span></div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span><span class="comment">// expected_array like:</span></div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span><span class="comment">// EXPECT_THAT(array1d, EigenArrayNear<float>({0.1, 0.2}, tolerance));</span></div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span><span class="comment">// or in the 2D case:</span></div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span><span class="comment">// EXPECT_THAT(array2d, EigenArrayNear<int>({{1, 2}, {3, 4}}, tolerance);</span></div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> </div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span><span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span>EigenArrayNearMatcherP2<Eigen::Array<T, Eigen::Dynamic, 1>, <span class="keywordtype">double</span>></div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp.html#a3ae16963cfdf1d79ee0a65b6a02de904"> 375</a></span><a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a3ae16963cfdf1d79ee0a65b6a02de904">EigenArrayNear</a>(absl::Span<const T> data, <span class="keywordtype">double</span> tolerance) {</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> Eigen::Array<T, Eigen::Dynamic, 1> temp_array =</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> Eigen::Map<const Eigen::Array<T, Eigen::Dynamic, 1>>(&data[0],</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> data.size());</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a3ae16963cfdf1d79ee0a65b6a02de904">EigenArrayNear</a>(temp_array, tolerance);</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span>}</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> </div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span><span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span>EigenArrayNearMatcherP2<Eigen::Array<T, Eigen::Dynamic, Eigen::Dynamic>, <span class="keywordtype">double</span>></div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp.html#aedd5bbb90dc68d8050f554839af6e92b"> 384</a></span><a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a3ae16963cfdf1d79ee0a65b6a02de904">EigenArrayNear</a>(absl::Span<<span class="keyword">const</span> absl::Span<const T>> rows, <span class="keywordtype">double</span> tolerance) {</div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a3ae16963cfdf1d79ee0a65b6a02de904">EigenArrayNear</a>(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp_1_1internal.html#a6bc15c9fd49355e811d1233291bdd41e">internal::EigenArray2DFromNestedSpans</a>(rows), tolerance);</div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span>}</div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> </div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span><span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp.html#a6932b4f981467325cc8e2b50ee7fbd13"> 389</a></span>EigenArrayEqMatcherP<Eigen::Array<T, Eigen::Dynamic, 1>> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a6932b4f981467325cc8e2b50ee7fbd13">EigenArrayEq</a>(</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> absl::Span<const T> data) {</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> Eigen::Array<T, Eigen::Dynamic, 1> temp_array =</div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> Eigen::Map<const Eigen::Array<T, Eigen::Dynamic, 1>>(&data[0],</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> data.size());</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a6932b4f981467325cc8e2b50ee7fbd13">EigenArrayEq</a>(temp_array);</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span>}</div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> </div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span><span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span>EigenArrayEqMatcherP<Eigen::Array<T, Eigen::Dynamic, Eigen::Dynamic>></div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp.html#abf8709cfb37f2f6de3599ac01838f2bd"> 399</a></span><a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a6932b4f981467325cc8e2b50ee7fbd13">EigenArrayEq</a>(absl::Span<<span class="keyword">const</span> absl::Span<const T>> rows) {</div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a6932b4f981467325cc8e2b50ee7fbd13">EigenArrayEq</a>(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp_1_1internal.html#a6bc15c9fd49355e811d1233291bdd41e">internal::EigenArray2DFromNestedSpans</a>(rows));</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span>}</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> </div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span>} <span class="comment">// namespace operations_research::pdlp</span></div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> </div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"><a class="line" href="namespace_eigen.html"> 405</a></span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespace_eigen.html">Eigen</a> {</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span><span class="comment">// Pretty prints an Eigen::Array on a gunit test failures. See</span></div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span><span class="comment">// https://google.github.io/googletest/advanced.html#teaching-googletest-how-to-print-your-values</span></div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span><span class="keyword">template</span> <<span class="keyword">typename</span> Scalar, <span class="keywordtype">int</span> Rows, <span class="keywordtype">int</span> Cols, <span class="keywordtype">int</span> Options, <span class="keywordtype">int</span> MaxRows,</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <span class="keywordtype">int</span> MaxCols></div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"><a class="line" href="namespace_eigen.html#a5f4dd7213ca6b06fd8b9a7186c567c4f"> 410</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="namespace_eigen.html#a5f4dd7213ca6b06fd8b9a7186c567c4f">PrintTo</a>(<span class="keyword">const</span> Array<Scalar, Rows, Cols, Options, MaxRows, MaxCols>& array,</div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> std::ostream* os) {</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> IOFormat format(StreamPrecision, 0, <span class="stringliteral">", "</span>, <span class="stringliteral">",\n"</span>, <span class="stringliteral">"["</span>, <span class="stringliteral">"]"</span>, <span class="stringliteral">"["</span>, <span class="stringliteral">"]"</span>);</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> *os << <span class="stringliteral">"\n"</span> << array.format(format);</div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span>}</div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span>} <span class="comment">// namespace Eigen</span></div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> </div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span><span class="preprocessor">#endif </span><span class="comment">// PDLP_TEST_UTIL_H_</span></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_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#l00703">base/logging.h:703</a></div></div>
|
|
<div class="ttc" id="anamespace_eigen_html"><div class="ttname"><a href="namespace_eigen.html">Eigen</a></div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00405">test_util.h:405</a></div></div>
|
|
<div class="ttc" id="anamespace_eigen_html_a5f4dd7213ca6b06fd8b9a7186c567c4f"><div class="ttname"><a href="namespace_eigen.html#a5f4dd7213ca6b06fd8b9a7186c567c4f">Eigen::PrintTo</a></div><div class="ttdeci">void PrintTo(const Array< Scalar, Rows, Cols, Options, MaxRows, MaxCols > &array, std::ostream *os)</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00410">test_util.h:410</a></div></div>
|
|
<div class="ttc" id="anamespaceinternal_html"><div class="ttname"><a href="namespaceinternal.html">internal</a></div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8h_source.html#l00138">connected_components.h:138</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_1_1internal_html_a0f94b9991a3fca3fbc21ed7bc15f8d90"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp_1_1internal.html#a0f94b9991a3fca3fbc21ed7bc15f8d90">operations_research::pdlp::internal::MATCHER_P</a></div><div class="ttdeci">MATCHER_P(TupleIsNear, tolerance, "is near")</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00214">test_util.h:214</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_1_1internal_html_a330ceb5a4b5a9b6469d0297e98a54818"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp_1_1internal.html#a330ceb5a4b5a9b6469d0297e98a54818">operations_research::pdlp::internal::MATCHER</a></div><div class="ttdeci">MATCHER(TupleFloatEq, "is almost equal to")</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00218">test_util.h:218</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_1_1internal_html_a6bc15c9fd49355e811d1233291bdd41e"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp_1_1internal.html#a6bc15c9fd49355e811d1233291bdd41e">operations_research::pdlp::internal::EigenArray2DFromNestedSpans</a></div><div class="ttdeci">Eigen::Array< T, Eigen::Dynamic, Eigen::Dynamic > EigenArray2DFromNestedSpans(absl::Span< const absl::Span< const T > > rows)</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00230">test_util.h:230</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_1_1internal_html_ab2f09223539a1dd1dc474d5df34e6e9f"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp_1_1internal.html#ab2f09223539a1dd1dc474d5df34e6e9f">operations_research::pdlp::internal::GetMatcherDescriptionAsString</a></div><div class="ttdeci">std::string GetMatcherDescriptionAsString(const testing::Matcher< LhsType > &matcher, bool negation)</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00248">test_util.h:248</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html">operations_research::pdlp</a></div><div class="ttdef"><b>Definition:</b> <a href="iteration__stats_8cc_source.html#l00040">iteration_stats.cc:40</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a19a6acd7c2329d0b80072538aff8d703"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a19a6acd7c2329d0b80072538aff8d703">operations_research::pdlp::SmallDualInfeasibleLp</a></div><div class="ttdeci">QuadraticProgram SmallDualInfeasibleLp()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00232">test_util.cc:232</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a1f3fd39922ed044ea5c2408d41122319"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a1f3fd39922ed044ea5c2408d41122319">operations_research::pdlp::TestDiagonalQp2</a></div><div class="ttdeci">QuadraticProgram TestDiagonalQp2()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00158">test_util.cc:158</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a28608a48394073aff1febbc4ca485035"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a28608a48394073aff1febbc4ca485035">operations_research::pdlp::ToDense</a></div><div class="ttdeci">::Eigen::ArrayXXd ToDense(const Eigen::SparseMatrix< double, Eigen::ColMajor, int64_t > &sparse_mat)</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00284">test_util.cc:284</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a3ae16963cfdf1d79ee0a65b6a02de904"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a3ae16963cfdf1d79ee0a65b6a02de904">operations_research::pdlp::EigenArrayNear</a></div><div class="ttdeci">EigenArrayNearMatcherP2< Eigen::Array< T, Eigen::Dynamic, 1 >, double > EigenArrayNear(absl::Span< const T > data, double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00375">test_util.h:375</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a3d9ef1342467b3fca8d64835a0d5e383"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a3d9ef1342467b3fca8d64835a0d5e383">operations_research::pdlp::VerifyTestQp</a></div><div class="ttdeci">void VerifyTestQp(const QuadraticProgram &qp, bool maximize)</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00269">test_util.cc:269</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a52fe72d70d171944fc5d320e07ba07ac"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a52fe72d70d171944fc5d320e07ba07ac">operations_research::pdlp::CorrelationClusteringStarLp</a></div><div class="ttdeci">QuadraticProgram CorrelationClusteringStarLp()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00107">test_util.cc:107</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a540cf8d0d17f8fc006cd238159039b8e"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a540cf8d0d17f8fc006cd238159039b8e">operations_research::pdlp::MATCHER_P2</a></div><div class="ttdeci">MATCHER_P2(EigenArrayNear, expected_array, tolerance, "array is near "+testing::PrintToString(expected_array)+" within tolerance "+testing::PrintToString(tolerance))</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00317">test_util.h:317</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a5dfb58a7e464f2bdb9ccf754a1e14dc9"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a5dfb58a7e464f2bdb9ccf754a1e14dc9">operations_research::pdlp::FloatArrayEq</a></div><div class="ttdeci">decltype(testing::Pointwise(internal::TupleFloatEq(), ContainerType())) FloatArrayEq(const ContainerType &container)</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00289">test_util.h:289</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a6391c53ff0b7259dedf8fe9fcc927c65"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a6391c53ff0b7259dedf8fe9fcc927c65">operations_research::pdlp::TestDiagonalQp3</a></div><div class="ttdeci">QuadraticProgram TestDiagonalQp3()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00174">test_util.cc:174</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a6932b4f981467325cc8e2b50ee7fbd13"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a6932b4f981467325cc8e2b50ee7fbd13">operations_research::pdlp::EigenArrayEq</a></div><div class="ttdeci">EigenArrayEqMatcherP< Eigen::Array< T, Eigen::Dynamic, 1 > > EigenArrayEq(absl::Span< const T > data)</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00389">test_util.h:389</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a79496743a139659305201925cdcb39fa"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a79496743a139659305201925cdcb39fa">operations_research::pdlp::TinyLp</a></div><div class="ttdeci">QuadraticProgram TinyLp()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00066">test_util.cc:66</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a7fc1d606307ca19921a85a135ba40334"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a7fc1d606307ca19921a85a135ba40334">operations_research::pdlp::VerifyTestLp</a></div><div class="ttdeci">void VerifyTestLp(const QuadraticProgram &qp, bool maximize)</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00048">test_util.cc:48</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a881657afb86fecbfeb045a820fe1019d"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a881657afb86fecbfeb045a820fe1019d">operations_research::pdlp::EvalAsColMajorEigenArray</a></div><div class="ttdeci">Eigen::Array< typename EigenType::Scalar, Eigen::Dynamic, Eigen::Dynamic, Eigen::ColMajor > EvalAsColMajorEigenArray(const EigenType &input)</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00297">test_util.h:297</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a8d1b6834fa651b584ac83326d6a283b9"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a8d1b6834fa651b584ac83326d6a283b9">operations_research::pdlp::LpWithoutConstraints</a></div><div class="ttdeci">QuadraticProgram LpWithoutConstraints()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00261">test_util.cc:261</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a90ad9eef4ca03500a77b99e9e29a675f"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a90ad9eef4ca03500a77b99e9e29a675f">operations_research::pdlp::SmallInvalidProblemLp</a></div><div class="ttdeci">QuadraticProgram SmallInvalidProblemLp()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00190">test_util.cc:190</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_aa72b1f307b95f80a53bb014998d47e23"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#aa72b1f307b95f80a53bb014998d47e23">operations_research::pdlp::MATCHER_P</a></div><div class="ttdeci">MATCHER_P(EigenArrayEq, expected_array, "array is almost equal to "+testing::PrintToString(expected_array))</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00344">test_util.h:344</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_aa80f84de5e654569620d77f42849d0c9"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#aa80f84de5e654569620d77f42849d0c9">operations_research::pdlp::SmallPrimalDualInfeasibleLp</a></div><div class="ttdeci">QuadraticProgram SmallPrimalDualInfeasibleLp()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00239">test_util.cc:239</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_ad795f23e2a85f4ae05efa1e2d0e0de4d"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#ad795f23e2a85f4ae05efa1e2d0e0de4d">operations_research::pdlp::TestLp</a></div><div class="ttdeci">QuadraticProgram TestLp()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00032">test_util.cc:32</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_adfc8b0cb8540c12d84e14a2176dd857f"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#adfc8b0cb8540c12d84e14a2176dd857f">operations_research::pdlp::SmallInitializationLp</a></div><div class="ttdeci">QuadraticProgram SmallInitializationLp()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00245">test_util.cc:245</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_ae56c77c834cf229f7d6daf8dab51b3e2"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#ae56c77c834cf229f7d6daf8dab51b3e2">operations_research::pdlp::EigenArrayAsSpan</a></div><div class="ttdeci">absl::Span< const Scalar > EigenArrayAsSpan(const Eigen::Array< Scalar, Eigen::Dynamic, Eigen::Dynamic, Eigen::ColMajor > &array)</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00303">test_util.h:303</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_af2390d8030d8925da948d466b7075d39"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#af2390d8030d8925da948d466b7075d39">operations_research::pdlp::SmallPrimalInfeasibleLp</a></div><div class="ttdeci">QuadraticProgram SmallPrimalInfeasibleLp()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00216">test_util.cc:216</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_af51b54f37971e2f896bd07a55c191d23"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#af51b54f37971e2f896bd07a55c191d23">operations_research::pdlp::SmallInconsistentVariableBoundsLp</a></div><div class="ttdeci">QuadraticProgram SmallInconsistentVariableBoundsLp()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00203">test_util.cc:203</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_af8b98468b162a2ac487b17f4cd77d049"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#af8b98468b162a2ac487b17f4cd77d049">operations_research::pdlp::FloatArrayNear</a></div><div class="ttdeci">decltype(testing::Pointwise(internal::TupleIsNear(0.0), ContainerType())) FloatArrayNear(const ContainerType &container, double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8h_source.html#l00271">test_util.h:271</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_afaedaf1e3ebe4d6d1a36e3fd1f206de6"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#afaedaf1e3ebe4d6d1a36e3fd1f206de6">operations_research::pdlp::TestDiagonalQp1</a></div><div class="ttdeci">QuadraticProgram TestDiagonalQp1()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00142">test_util.cc:142</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_afdcc70bb8ac56ba4e60990640f5c7816"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#afdcc70bb8ac56ba4e60990640f5c7816">operations_research::pdlp::CorrelationClusteringLp</a></div><div class="ttdeci">QuadraticProgram CorrelationClusteringLp()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00086">test_util.cc:86</a></div></div>
|
|
<div class="ttc" id="aparser_8yy_8cc_html_a5a634cf4429798b1c921a81de8250051"><div class="ttname"><a href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a></div><div class="ttdeci">static int input(yyscan_t yyscanner)</div></div>
|
|
<div class="ttc" id="aquadratic__program_8h_html"><div class="ttname"><a href="quadratic__program_8h.html">quadratic_program.h</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_7cc48880791e3dd695dbfc2349101d28.html">pdlp</a></li><li class="navelem"><a class="el" href="test__util_8h.html">test_util.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.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|