546 lines
100 KiB
HTML
546 lines
100 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: matchers.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('matchers_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">matchers.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="matchers_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="comment">// Matchers for MathOpt types, specifically SolveResult and nested fields.</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment">// The matchers defined here are useful for writing unit tests checking that the</span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment">// result of Solve(), absl::StatusOr<SolveResult>, meets expectations. We give</span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="comment">// some examples below. All code is assumed with the following setup:</span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="comment">// namespace operations_research::math_opt {</span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="comment">// using ::testing::status::IsOkAndHolds;</span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="comment">// Model model;</span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="comment">// const Variable x = model.AddContinuousVariable(0.0, 1.0);</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="comment">// const Variable y = model.AddContinuousVariable(0.0, 1.0);</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="comment">// const LinearConstraint c = model.AddLinearConstraint(x + y <= 1);</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="comment">// model.Maximize(2*x + y);</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="comment">// Example 1.a: result is OK, optimal, and objective value approximately 42.</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="comment">// EXPECT_THAT(Solve(model, SOLVER_TYPE_GLOP), IsOkAndHolds(IsOptimal(42)));</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="comment">// Example 1.b: equivalent to 1.a.</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="comment">// ASSERT_OK_AND_ASSIGN(const SolveResult result,</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="comment">// Solve(model, SOLVER_TYPE_GLOP));</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="comment">// EXPECT_THAT(result, IsOptimal(42));</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="comment">// Example 2: result is OK, optimal, and best solution is x=1, y=0.</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="comment">// ASSERT_OK_AND_ASSIGN(const SolveResult result,</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="comment">// Solve(model, SOLVER_TYPE_GLOP));</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment">// ASSERT_THAT(result, IsOptimal());</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="comment">// EXPECT_THAT(result.variable_value(), IsNear({{x, 1}, {y, 0}});</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="comment">// Note: the second ASSERT ensures that if the solution is not optimal, then</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="comment">// result.variable_value() will not run (the function will crash if the solver</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="comment">// didn't find a solution). Further, MathOpt guarantees there is a solution</span></div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="comment">// when the termination reason is optimal.</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="comment">// Example 3: result is OK, check the solution without specifying termination.</span></div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="comment">// ASSERT_OK_AND_ASSIGN(const SolveResult result,</span></div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="comment">// Solve(model, SOLVER_TYPE_GLOP));</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="comment">// EXPECT_THAT(result, HasBestSolution({{x, 1}, {y, 0}}));</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="comment">// Example 4: multiple possible termination reason, primal ray optional:</span></div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment">// ASSERT_OK_AND_ASSIGN(const SolveResult result,</span></div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="comment">// Solve(model, SOLVER_TYPE_GLOP));</span></div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="comment">// ASSERT_THAT(result, TerminatesWithOneOf(</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span><span class="comment">// TerminationReason::kUnbounded,</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="comment">// TerminationReason::kInfeasibleOrUnbounded));</span></div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="comment">// if(!result.primal_rays.empty()) {</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span><span class="comment">// EXPECT_THAT(result.primal_rays[0], PrimalRayIsNear({{x, 1,}, {y, 0}}));</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span><span class="comment">// }</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="comment">// Tips on writing good tests:</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span><span class="comment">// * Use ASSERT_OK_AND_ASSIGN(const SolveResult result, Solve(...)) to ensure</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span><span class="comment">// the test terminates immediately if Solve() does not return OK.</span></div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span><span class="comment">// * If you ASSERT_THAT(result, IsOptimal()), you can assume that you have a</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span><span class="comment">// feasible primal solution afterwards. Otherwise, make no assumptions on</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span><span class="comment">// the contents of result (e.g. do not assume result contains a primal ray</span></div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span><span class="comment">// just because the termination reason was UNBOUNDED).</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span><span class="comment">// * For problems that are infeasible, the termination reasons INFEASIBLE and</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span><span class="comment">// DUAL_INFEASIBLE are both possible. Likewise, for unbounded problems, you</span></div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span><span class="comment">// can get both UNBOUNDED and DUAL_INFEASIBLE. See TerminatesWithOneOf()</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="comment">// below to make assertions in this case. Note also that some solvers have</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment">// solver specific parameters to ensure that DUAL_INFEASIBLE will not be</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment">// returned (e.g. for Gurobi, use DualReductions or InfUnbdInfo).</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment">// * The objective value and variable values should always be compared up to</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span><span class="comment">// a tolerance, even if your decision variables are integer. The matchers</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span><span class="comment">// defined have a configurable tolerance with default value 1e-5.</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span><span class="comment">// * Primal and dual rays are unique only up to a constant scaling. The</span></div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="comment">// matchers provided rescale both expected and actual before comparing.</span></div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span><span class="comment">// * Take care on problems with multiple optimal solutions. Do not rely on a</span></div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span><span class="comment">// particular solution being returned in your test, as the test will break</span></div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="comment">// when we upgrade the solver.</span></div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment">// This file also defines functions to let gunit print various MathOpt types.</span></div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span><span class="comment">// To see the error messages these matchers generate, run</span></div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span><span class="comment">// blaze test experimental/users/rander/math_opt:matchers_error_messages</span></div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span><span class="comment">// which is a fork of matchers_test.cc where the assertions are all negated</span></div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span><span class="comment">// (note that every test should fail).</span></div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span><span class="preprocessor">#ifndef OR_TOOLS_MATH_OPT_CPP_MATCHERS_H_</span></div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span><span class="preprocessor">#define OR_TOOLS_MATH_OPT_CPP_MATCHERS_H_</span></div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> </div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span><span class="preprocessor">#include <optional></span></div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span><span class="preprocessor">#include <sstream></span></div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> </div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span><span class="preprocessor">#include "gtest/gtest.h"</span></div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span><span class="preprocessor">#include "<a class="code" href="math__opt_2cpp_2linear__constraint_8h.html">ortools/math_opt/cpp/linear_constraint.h</a>"</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span><span class="preprocessor">#include "<a class="code" href="math__opt_8h.html">ortools/math_opt/cpp/math_opt.h</a>"</span></div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span><span class="preprocessor">#include "<a class="code" href="variable__and__expressions_8h.html">ortools/math_opt/cpp/variable_and_expressions.h</a>"</span></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="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research_1_1math__opt.html">math_opt</a> {</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> </div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170"> 106</a></span><span class="keyword">constexpr</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a> = 1e-5;</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> </div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span><span class="comment">// Matchers for IdMap<Variable,double> and IdMap<LinearConstraint, double></span></div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span><span class="comment"></span> </div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span><span class="comment">// Checks that the maps have identical keys and values within tolerance.</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span>testing::Matcher<VariableMap<double>> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#ae14b89d8e50d6c412c1c01a923f1f833">IsNear</a>(</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">VariableMap<double></a> expected, <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</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">// Checks that the keys of actual are a subset of the keys of expected, and that</span></div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span><span class="comment">// for all shared keys, the values are within tolerance.</span></div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span>testing::Matcher<VariableMap<double>> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a85552ac583ef762e916ebce19803a123">IsNearlySubsetOf</a>(</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">VariableMap<double></a> expected, <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> </div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span><span class="comment">// Checks that the maps have identical keys and values within tolerance.</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span>testing::Matcher<LinearConstraintMap<double>> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#ae14b89d8e50d6c412c1c01a923f1f833">IsNear</a>(</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">LinearConstraintMap<double></a> expected,</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> </div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span><span class="comment">// Checks that the keys of actual are a subset of the keys of expected, and that</span></div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span><span class="comment">// for all shared keys, the values are within tolerance.</span></div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span>testing::Matcher<LinearConstraintMap<double>> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a85552ac583ef762e916ebce19803a123">IsNearlySubsetOf</a>(</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">LinearConstraintMap<double></a> expected,</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> </div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="comment">// Matchers for solutions</span></div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="comment"></span> </div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span><span class="comment">// Options for IsNear(Solution).</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html"> 137</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html">SolutionMatcherOptions</a> {</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html#a97eab6d709b80585fe9e8a54b1e3da27"> 138</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html#a97eab6d709b80585fe9e8a54b1e3da27">tolerance</a> = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>;</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html#ab25d6fff64fc61666b1691e23f5d07b1"> 139</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html#ab25d6fff64fc61666b1691e23f5d07b1">check_primal</a> = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html#ac15e0a9a954abb0892d7ab369b245f75"> 140</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html#ac15e0a9a954abb0892d7ab369b245f75">check_dual</a> = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html#afc637bcbceea5647ce8f349e109cb979"> 141</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html#afc637bcbceea5647ce8f349e109cb979">check_basis</a> = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span>};</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> </div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span>testing::Matcher<Solution> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#ae14b89d8e50d6c412c1c01a923f1f833">IsNear</a>(<a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solution.html">Solution</a> expected,</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html">SolutionMatcherOptions</a> options = {});</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">// Checks variables match and variable/objective values are within tolerance and</span></div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span><span class="comment">// feasibility statuses are identical.</span></div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span>testing::Matcher<PrimalSolution> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#ae14b89d8e50d6c412c1c01a923f1f833">IsNear</a>(</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> PrimalSolution expected, <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> </div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span><span class="comment">// Checks dual variables, reduced costs and objective are within tolerance and</span></div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span><span class="comment">// feasibility statuses are identical.</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span>testing::Matcher<DualSolution> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#ae14b89d8e50d6c412c1c01a923f1f833">IsNear</a>(</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> DualSolution expected, <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> </div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span>testing::Matcher<Basis> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#ae8a3cf61141697e05dc0c102ee61f035">BasisIs</a>(<span class="keyword">const</span> Basis& expected);</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> </div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span><span class="comment">// Matchers for a Rays</span></div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span><span class="comment"></span> </div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span><span class="comment">// Checks variables match and that after rescaling, variable values are within</span></div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span><span class="comment">// tolerance.</span></div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span>testing::Matcher<PrimalRay> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#ae14b89d8e50d6c412c1c01a923f1f833">IsNear</a>(PrimalRay expected,</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> </div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span><span class="comment">// Checks variables match and that after rescaling, variable values are within</span></div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span><span class="comment">// tolerance.</span></div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span>testing::Matcher<PrimalRay> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#aedb3386047b267e7d49072deff41667d">PrimalRayIsNear</a>(</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> VariableMap<double> expected_var_values,</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> </div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span><span class="comment">// Checks that dual variables and reduced costs are defined for the same</span></div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span><span class="comment">// set of Variables/LinearConstraints, and that their rescaled values are within</span></div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span><span class="comment">// tolerance.</span></div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span>testing::Matcher<DualRay> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#ae14b89d8e50d6c412c1c01a923f1f833">IsNear</a>(DualRay expected,</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> </div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span><span class="comment">// Matchers for a SolveResult</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span><span class="comment"></span> </div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span><span class="comment">// Checks the following:</span></div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span><span class="comment">// * The termination reason is optimal.</span></div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span><span class="comment">// * If expected_objective contains a value, there is at least one feasible</span></div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span><span class="comment">// solution and that solution has an objective value within tolerance of</span></div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span><span class="comment">// expected_objective.</span></div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a10ff37e352764ce2dc62e1bf09ba9d85">IsOptimal</a>(</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> std::optional<double> expected_objective = std::nullopt,</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</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>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a64defe6e679e5b83c35c9f260756e0b7">IsOptimalWithSolution</a>(</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="keywordtype">double</span> expected_objective, VariableMap<double> expected_variable_values,</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> </div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#aa7ddd6de5890a5f3d0f02ed36fb08b10">IsOptimalWithDualSolution</a>(</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="keywordtype">double</span> expected_objective, LinearConstraintMap<double> expected_dual_values,</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> VariableMap<double> expected_reduced_costs,</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> </div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span><span class="comment">// Checks the following:</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span><span class="comment">// * The result has the expected termination reason.</span></div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#ac83daba180fbf2300d15cf1a2486d156">TerminatesWith</a>(<a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194">TerminationReason</a> expected);</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> </div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span><span class="comment">// Checks that the result has one of the allowed termination reasons.</span></div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a68952e6afc192b91b30e2fc5b8a7c442">TerminatesWithOneOf</a>(</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="keyword">const</span> std::vector<TerminationReason>& allowed);</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">// Checks the following:</span></div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span><span class="comment">// * The result has termination reason kFeasible or kNoSolutionFound.</span></div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span><span class="comment">// * The limit is expected, or is kUndetermined if allow_limit_undetermined.</span></div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a99358f906300d21a83e905da11576ed9">TerminatesWithLimit</a>(</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0">Limit</a> expected, <span class="keywordtype">bool</span> allow_limit_undetermined = <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> </div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span><span class="comment">// Checks the following:</span></div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span><span class="comment">// * The result has termination reason kFeasible.</span></div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span><span class="comment">// * The limit is expected, or is kUndetermined if allow_limit_undetermined.</span></div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a80a179b77f04b618d5db29e4d806ab10">TerminatesWithReasonFeasible</a>(</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0">Limit</a> expected, <span class="keywordtype">bool</span> allow_limit_undetermined = <span class="keyword">false</span>);</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><span class="comment">// Checks the following:</span></div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span><span class="comment">// * The result has termination reason kNoSolutionFound.</span></div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span><span class="comment">// * The limit is expected, or is kUndetermined if allow_limit_undetermined.</span></div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a0d8a3b04a6faf760b10689b238d58c14">TerminatesWithReasonNoSolutionFound</a>(</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0">Limit</a> expected, <span class="keywordtype">bool</span> allow_limit_undetermined = <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> </div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span><span class="comment">// SolveResult has a primal solution matching expected within tolerance.</span></div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a0864c72de8e6c988de2f22f800a8877b">HasSolution</a>(</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> PrimalSolution expected, <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> </div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span><span class="comment">// SolveResult has a dual solution matching expected within</span></div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span><span class="comment">// tolerance.</span></div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a06debf261498b3feecaa6e8ff1ad1d4e">HasDualSolution</a>(</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> DualSolution expected, <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> </div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span><span class="comment">// Actual SolveResult contains a primal ray that matches expected within</span></div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span><span class="comment">// tolerance.</span></div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#acd4bc5ae58e5255389a9c2524d1075f3">HasPrimalRay</a>(</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> PrimalRay expected, <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> </div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span><span class="comment">// Actual SolveResult contains a primal ray with variable values equivalent to</span></div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span><span class="comment">// (under L_inf scaling) expected_vars up to tolerance.</span></div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#acd4bc5ae58e5255389a9c2524d1075f3">HasPrimalRay</a>(</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> VariableMap<double> expected_vars,</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> </div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span><span class="comment">// Actual SolveResult contains a dual ray that matches expected within</span></div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span><span class="comment">// tolerance.</span></div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#aa749cf8b42b52a7f51fddbbb4a6be66c">HasDualRay</a>(</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> DualRay expected, <span class="keywordtype">double</span> tolerance = <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">kMatcherDefaultTolerance</a>);</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> </div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span><span class="comment">// Configures SolveResult matcher IsConsistentWith() below.</span></div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html"> 254</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html">SolveResultMatcherOptions</a> {</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#a97eab6d709b80585fe9e8a54b1e3da27"> 255</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#a97eab6d709b80585fe9e8a54b1e3da27">tolerance</a> = 1e-5;</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#a694be1052fd514461beac338988e4e1e"> 256</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#a694be1052fd514461beac338988e4e1e">first_solution_only</a> = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#ac15e0a9a954abb0892d7ab369b245f75"> 257</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#ac15e0a9a954abb0892d7ab369b245f75">check_dual</a> = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#a9331eee845f026ba2b3233308704d60d"> 258</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#a9331eee845f026ba2b3233308704d60d">check_rays</a> = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> </div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// If the expected result has termination reason kInfeasible, kUnbounded, or</span></div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="comment">// kDualInfeasasible, the primal solution, dual solution, and basis are</span></div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <span class="comment">// ignored unless check_solutions_if_inf_or_unbounded is true.</span></div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="comment">// TODO(b/201099290): this is perhaps not a good default. Gurobi as</span></div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="comment">// implemented is returning primal solutions for both unbounded and</span></div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="comment">// infeasible problems. We need to add unit tests that inspect this value</span></div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="comment">// and turn them on one solver at a time with a new parameter on</span></div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="comment">// SimpleLpTestParameters.</span></div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#ad50a36d43085f7e8061e0a9ef343e930"> 269</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#ad50a36d43085f7e8061e0a9ef343e930">check_solutions_if_inf_or_unbounded</a> = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#afc637bcbceea5647ce8f349e109cb979"> 270</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#afc637bcbceea5647ce8f349e109cb979">check_basis</a> = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> </div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="comment">// In linear programming, the following outcomes are all possible</span></div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="comment">// Primal LP | Dual LP | Possible MathOpt Termination Reasons</span></div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="comment">// -----------------------------------------------------------------</span></div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="comment">// 1. Infeasible | Unbounded | kInfeasible</span></div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="comment">// 2. Optimal | Optimal | kOptimal</span></div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="comment">// 3. Unbounded | Infeasible | kUnbounded, kInfeasibleOrUnbounded</span></div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="comment">// 4. Infeasible | Infeasible | kInfeasible, kInfeasibleOrUnbounded</span></div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <span class="comment">// (Above "Optimal" means that an optimal solution exists. This is a statement</span></div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="comment">// about the existence of optimal solutions and certificates of</span></div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="comment">// infeasibility/unboundedness, not about the outcome of applying any</span></div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="comment">// particular algorithm.)</span></div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="comment">// When writing your unit test, you can typically tell which case of 1-4 you</span></div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="comment">// are in, but in cases 3-4 you do not know which termination reason will be</span></div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="comment">// returned. In some situations, it may not be clear if you are in case 1 or</span></div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="comment">// case 4 as well.</span></div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="comment">// When inf_or_unb_soft_match=false, the matcher must exactly specify the</span></div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="comment">// status returned by the solver. For cases 3-4, this is implementation</span></div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="comment">// dependent and we do not recommend this. When</span></div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="comment">// inf_or_unb_soft_match=true:</span></div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="comment">// * kInfeasible can also match kInfeasibleOrUnbounded</span></div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <span class="comment">// * kUnbounded can also match kInfeasibleOrUnbounded</span></div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="comment">// * kInfeasibleOrUnbounded can also match kInfeasible and kUnbounded.</span></div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="comment">// For case 2, inf_or_unb_soft_match has no effect.</span></div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="comment">// To build the strongest possible matcher (accepting the minimal set of</span></div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="comment">// termination reasons):</span></div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <span class="comment">// * If you know you are in case 1, se inf_or_unb_soft_match=false</span></div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> <span class="comment">// (soft_match=true over-matches)</span></div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <span class="comment">// * For case 3, use inf_or_unb_soft_match=false and</span></div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <span class="comment">// termination_reason=kUnbounded (kInfeasibleOrUnbounded over-matches).</span></div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <span class="comment">// * For case 4 (or if you are unsure of case 1 vs case 4), use</span></div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="comment">// inf_or_unb_soft_match=true and</span></div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> <span class="comment">// termination_reason=kInfeasible (kInfeasibleOrUnbounded over-matches).</span></div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="comment">// * If you cannot tell if you are in case 3 or case 4, use</span></div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <span class="comment">// inf_or_unb_soft_match=true and termination reason</span></div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="comment">// kInfeasibleOrUnbounded.</span></div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="comment">// If the above is too complicated, always setting</span></div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <span class="comment">// inf_or_unb_soft_match=true and using any of the expected MathOpt</span></div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> <span class="comment">// termination reasons from the above table will give a matcher that is</span></div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="comment">// slightly too lenient.</span></div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#a7f70351beed6f2a8faa016ef057daa61"> 317</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#a7f70351beed6f2a8faa016ef057daa61">inf_or_unb_soft_match</a> = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span>};</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> </div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span><span class="comment">// Tests that two SolveResults are equivalent. Basic use:</span></div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span><span class="comment">// SolveResult expected;</span></div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span><span class="comment">// // Fill in expected...</span></div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span><span class="comment">// ASSERT_OK_AND_ASSIGN(SolveResult actual, Solve(model, solver_type));</span></div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span><span class="comment">// EXPECT_THAT(actual, IsConsistentWith(expected));</span></div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span><span class="comment">// Equivalence is defined as follows:</span></div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span><span class="comment">// * The termination reasons are the same.</span></div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span><span class="comment">// - For infeasible and unbounded problems, see</span></div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span><span class="comment">// options.inf_or_unb_soft_match.</span></div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span><span class="comment">// * The solve stats are ignored.</span></div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span><span class="comment">// * For both primal and dual solutions, either expected and actual are</span></div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span><span class="comment">// both empty, or their first entries satisfy IsNear() at options.tolerance.</span></div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span><span class="comment">// - Not checked if options.check_solutions_if_inf_or_unbounded and the</span></div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span><span class="comment">// problem is infeasible or unbounded (default).</span></div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span><span class="comment">// - If options.first_solution_only is false, check the entire list of</span></div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span><span class="comment">// solutions matches in the same order.</span></div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span><span class="comment">// - Dual solution is not checked if options.check_dual=false</span></div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span><span class="comment">// * For both the primal and dual rays, either expected and actual are both</span></div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span><span class="comment">// empty, or any ray in expected IsNear() any ray in actual (which is up</span></div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span><span class="comment">// to a rescaling) at options.tolerance.</span></div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span><span class="comment">// - Not checked if options.check_rays=false</span></div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span><span class="comment">// - If options.first_solution_only is false, check the entire list of</span></div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span><span class="comment">// solutions matches in the same order.</span></div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span><span class="comment">// * The basis is not checked by default. If enabled, checked with BasisIs().</span></div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span><span class="comment">// - Enable with options.check_basis</span></div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span><span class="comment">// This function is symmetric in that:</span></div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span><span class="comment">// EXPECT_THAT(actual, IsConsistentWith(expected));</span></div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span><span class="comment">// EXPECT_THAT(expected, IsConsistentWith(actual));</span></div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span><span class="comment">// agree on matching, they only differ in strings produced. Per gmock</span></div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span><span class="comment">// conventions, prefer the former.</span></div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span><span class="comment">// For problems with either primal or dual infeasibility, see</span></div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span><span class="comment">// SolveResultMatcherOptions::inf_or_unb_soft_match for guidance on how to</span></div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span><span class="comment">// best set the termination reason and inf_or_unb_soft_match.</span></div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span>testing::Matcher<SolveResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a697496dd056995c7725bca4a35ceb638">IsConsistentWith</a>(</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solve_result.html">SolveResult</a>& expected, <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html">SolveResultMatcherOptions</a>& options = {});</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> </div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span><span class="comment">// Rarely used</span></div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span><span class="comment"></span> </div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span><span class="comment">// Actual UpdateResult.did_update is true.</span></div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span>testing::Matcher<IncrementalSolver::UpdateResult> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a4dac51f12535f758604372b7bb19b68e">DidUpdate</a>();</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> </div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span><span class="comment">// Implementation details</span></div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span><span class="comment"></span> </div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span><span class="comment">// TODO(b/200835670): use the << operator on Termination instead once it</span></div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span><span class="comment">// supports quoting/escaping on termination.detail.</span></div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a1126ef509ade3c9de8e4c663b6b701da">PrintTo</a>(<span class="keyword">const</span> Termination& termination, std::ostream* os);</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a1126ef509ade3c9de8e4c663b6b701da">PrintTo</a>(<span class="keyword">const</span> PrimalSolution& primal_solution, std::ostream* os);</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a1126ef509ade3c9de8e4c663b6b701da">PrintTo</a>(<span class="keyword">const</span> DualSolution& dual_solution, std::ostream* os);</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a1126ef509ade3c9de8e4c663b6b701da">PrintTo</a>(<span class="keyword">const</span> PrimalRay& primal_ray, std::ostream* os);</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a1126ef509ade3c9de8e4c663b6b701da">PrintTo</a>(<span class="keyword">const</span> DualRay& dual_ray, std::ostream* os);</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a1126ef509ade3c9de8e4c663b6b701da">PrintTo</a>(<span class="keyword">const</span> Basis& basis, std::ostream* os);</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a1126ef509ade3c9de8e4c663b6b701da">PrintTo</a>(<span class="keyword">const</span> Solution& solution, std::ostream* os);</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a1126ef509ade3c9de8e4c663b6b701da">PrintTo</a>(<span class="keyword">const</span> SolveResult& result, std::ostream* os);</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="comment">// We do not want to rely on ::testing::internal::ContainerPrinter because we</span></div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span><span class="comment">// want to sort the keys.</span></div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span><span class="keyword">template</span> <<span class="keyword">typename</span> K, <span class="keyword">typename</span> V></div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a3738a0261866d60889c614bdd616f1fc"> 385</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a1126ef509ade3c9de8e4c663b6b701da">PrintTo</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">IdMap<K, V></a>& id_map, std::ostream* <span class="keyword">const</span> os) {</div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> <span class="keyword">constexpr</span> <span class="keywordtype">int</span> kMaxPrint = 10;</div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <span class="keywordtype">int</span> num_added = 0;</div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> *os << <span class="stringliteral">"{"</span>;</div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> K k : id_map.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_map.html#a32c71b1e0da0f6dda942729e686ff021">SortedKeys</a>()) {</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <span class="keywordflow">if</span> (num_added > 0) {</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> *os << <span class="stringliteral">", "</span>;</div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> }</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> <span class="keywordflow">if</span> (num_added >= kMaxPrint) {</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> *os << <span class="stringliteral">"...(size="</span> << id_map.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_map.html#a60304b65bf89363bcc3165d3cde67f86">size</a>() << <span class="stringliteral">")"</span>;</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <span class="keywordflow">break</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> *os << <span class="stringliteral">"{"</span> << k << <span class="stringliteral">", "</span> << ::testing::PrintToString(id_map.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_map.html#ab2a3f17d02b118e3876034e67fdef6d3">at</a>(k)) << <span class="stringliteral">"}"</span>;</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> ++num_added;</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> }</div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> *os << <span class="stringliteral">"}"</span>;</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 math_opt</span></div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> </div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_MATH_OPT_CPP_MATCHERS_H_</span></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_map_html"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_map.html">operations_research::math_opt::IdMap</a></div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00053">id_map.h:53</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_map_html_a32c71b1e0da0f6dda942729e686ff021"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_map.html#a32c71b1e0da0f6dda942729e686ff021">operations_research::math_opt::IdMap::SortedKeys</a></div><div class="ttdeci">std::vector< K > SortedKeys() const</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00579">id_map.h:579</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_map_html_a60304b65bf89363bcc3165d3cde67f86"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_map.html#a60304b65bf89363bcc3165d3cde67f86">operations_research::math_opt::IdMap::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00152">id_map.h:152</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_map_html_ab2a3f17d02b118e3876034e67fdef6d3"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_map.html#ab2a3f17d02b118e3876034e67fdef6d3">operations_research::math_opt::IdMap::at</a></div><div class="ttdeci">const V & at(const K &k) const</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00480">id_map.h:480</a></div></div>
|
|
<div class="ttc" id="amath__opt_2cpp_2linear__constraint_8h_html"><div class="ttname"><a href="math__opt_2cpp_2linear__constraint_8h.html">linear_constraint.h</a></div></div>
|
|
<div class="ttc" id="amath__opt_8h_html"><div class="ttname"><a href="math__opt_8h.html">math_opt.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html">operations_research::math_opt</a></div><div class="ttdef"><b>Definition:</b> <a href="arrow__operator__proxy_8h_source.html#l00020">arrow_operator_proxy.h:20</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a06debf261498b3feecaa6e8ff1ad1d4e"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a06debf261498b3feecaa6e8ff1ad1d4e">operations_research::math_opt::HasDualSolution</a></div><div class="ttdeci">Matcher< SolveResult > HasDualSolution(DualSolution expected, const double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00612">matchers.cc:612</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a0864c72de8e6c988de2f22f800a8877b"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a0864c72de8e6c988de2f22f800a8877b">operations_research::math_opt::HasSolution</a></div><div class="ttdeci">Matcher< SolveResult > HasSolution(PrimalSolution expected, const double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00604">matchers.cc:604</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a0d8a3b04a6faf760b10689b238d58c14"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a0d8a3b04a6faf760b10689b238d58c14">operations_research::math_opt::TerminatesWithReasonNoSolutionFound</a></div><div class="ttdeci">testing::Matcher< SolveResult > TerminatesWithReasonNoSolutionFound(const Limit expected, const bool allow_limit_undetermined)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00517">matchers.cc:517</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a10ff37e352764ce2dc62e1bf09ba9d85"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a10ff37e352764ce2dc62e1bf09ba9d85">operations_research::math_opt::IsOptimal</a></div><div class="ttdeci">Matcher< SolveResult > IsOptimal(const std::optional< double > expected_objective, const double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00559">matchers.cc:559</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a1126ef509ade3c9de8e4c663b6b701da"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a1126ef509ade3c9de8e4c663b6b701da">operations_research::math_opt::PrintTo</a></div><div class="ttdeci">void PrintTo(const Termination &termination, std::ostream *os)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00078">matchers.cc:78</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a44f88ad144a5dc6e11c57cda996c4170"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a44f88ad144a5dc6e11c57cda996c4170">operations_research::math_opt::kMatcherDefaultTolerance</a></div><div class="ttdeci">constexpr double kMatcherDefaultTolerance</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00106">matchers.h:106</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a4dac51f12535f758604372b7bb19b68e"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a4dac51f12535f758604372b7bb19b68e">operations_research::math_opt::DidUpdate</a></div><div class="ttdeci">Matcher< IncrementalSolver::UpdateResult > DidUpdate()</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00751">matchers.cc:751</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0">operations_research::math_opt::Limit</a></div><div class="ttdeci">Limit</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00200">solve_result.h:200</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a64defe6e679e5b83c35c9f260756e0b7"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a64defe6e679e5b83c35c9f260756e0b7">operations_research::math_opt::IsOptimalWithSolution</a></div><div class="ttdeci">Matcher< SolveResult > IsOptimalWithSolution(const double expected_objective, const VariableMap< double > expected_variable_values, const double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00576">matchers.cc:576</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a68952e6afc192b91b30e2fc5b8a7c442"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a68952e6afc192b91b30e2fc5b8a7c442">operations_research::math_opt::TerminatesWithOneOf</a></div><div class="ttdeci">Matcher< SolveResult > TerminatesWithOneOf(const std::vector< TerminationReason > &allowed)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00475">matchers.cc:475</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a697496dd056995c7725bca4a35ceb638"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a697496dd056995c7725bca4a35ceb638">operations_research::math_opt::IsConsistentWith</a></div><div class="ttdeci">Matcher< SolveResult > IsConsistentWith(const SolveResult &expected, const SolveResultMatcherOptions &options)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00723">matchers.cc:723</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a80a179b77f04b618d5db29e4d806ab10"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a80a179b77f04b618d5db29e4d806ab10">operations_research::math_opt::TerminatesWithReasonFeasible</a></div><div class="ttdeci">testing::Matcher< SolveResult > TerminatesWithReasonFeasible(const Limit expected, const bool allow_limit_undetermined)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00509">matchers.cc:509</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a85552ac583ef762e916ebce19803a123"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a85552ac583ef762e916ebce19803a123">operations_research::math_opt::IsNearlySubsetOf</a></div><div class="ttdeci">Matcher< VariableMap< double > > IsNearlySubsetOf(VariableMap< double > expected, double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00208">matchers.cc:208</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a99358f906300d21a83e905da11576ed9"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a99358f906300d21a83e905da11576ed9">operations_research::math_opt::TerminatesWithLimit</a></div><div class="ttdeci">testing::Matcher< SolveResult > TerminatesWithLimit(const Limit expected, const bool allow_limit_undetermined)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00500">matchers.cc:500</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_aa749cf8b42b52a7f51fddbbb4a6be66c"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#aa749cf8b42b52a7f51fddbbb4a6be66c">operations_research::math_opt::HasDualRay</a></div><div class="ttdeci">Matcher< SolveResult > HasDualRay(DualRay expected, const double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00632">matchers.cc:632</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_aa7ddd6de5890a5f3d0f02ed36fb08b10"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#aa7ddd6de5890a5f3d0f02ed36fb08b10">operations_research::math_opt::IsOptimalWithDualSolution</a></div><div class="ttdeci">Matcher< SolveResult > IsOptimalWithDualSolution(const double expected_objective, const LinearConstraintMap< double > expected_dual_values, const VariableMap< double > expected_reduced_costs, const double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00589">matchers.cc:589</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ac83daba180fbf2300d15cf1a2486d156"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ac83daba180fbf2300d15cf1a2486d156">operations_research::math_opt::TerminatesWith</a></div><div class="ttdeci">Matcher< SolveResult > TerminatesWith(const TerminationReason expected)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00481">matchers.cc:481</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_acd4bc5ae58e5255389a9c2524d1075f3"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#acd4bc5ae58e5255389a9c2524d1075f3">operations_research::math_opt::HasPrimalRay</a></div><div class="ttdeci">Matcher< SolveResult > HasPrimalRay(PrimalRay expected, const double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00620">matchers.cc:620</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad02e69a0531469b463df907c7b2ad194"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194">operations_research::math_opt::TerminationReason</a></div><div class="ttdeci">TerminationReason</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00150">solve_result.h:150</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ae14b89d8e50d6c412c1c01a923f1f833"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ae14b89d8e50d6c412c1c01a923f1f833">operations_research::math_opt::IsNear</a></div><div class="ttdeci">Matcher< VariableMap< double > > IsNear(VariableMap< double > expected, const double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00214">matchers.cc:214</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ae8a3cf61141697e05dc0c102ee61f035"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ae8a3cf61141697e05dc0c102ee61f035">operations_research::math_opt::BasisIs</a></div><div class="ttdeci">Matcher< Basis > BasisIs(const Basis &expected)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00323">matchers.cc:323</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_aedb3386047b267e7d49072deff41667d"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#aedb3386047b267e7d49072deff41667d">operations_research::math_opt::PrimalRayIsNear</a></div><div class="ttdeci">Matcher< PrimalRay > PrimalRayIsNear(VariableMap< double > expected_var_values, const double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8cc_source.html#l00410">matchers.cc:410</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solution_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solution.html">operations_research::math_opt::Solution</a></div><div class="ttdef"><b>Definition:</b> <a href="solution_8h_source.html#l00220">solution.h:220</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solution_matcher_options_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html">operations_research::math_opt::SolutionMatcherOptions</a></div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00137">matchers.h:137</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solution_matcher_options_html_a97eab6d709b80585fe9e8a54b1e3da27"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html#a97eab6d709b80585fe9e8a54b1e3da27">operations_research::math_opt::SolutionMatcherOptions::tolerance</a></div><div class="ttdeci">double tolerance</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00138">matchers.h:138</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solution_matcher_options_html_ab25d6fff64fc61666b1691e23f5d07b1"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html#ab25d6fff64fc61666b1691e23f5d07b1">operations_research::math_opt::SolutionMatcherOptions::check_primal</a></div><div class="ttdeci">bool check_primal</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00139">matchers.h:139</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solution_matcher_options_html_ac15e0a9a954abb0892d7ab369b245f75"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html#ac15e0a9a954abb0892d7ab369b245f75">operations_research::math_opt::SolutionMatcherOptions::check_dual</a></div><div class="ttdeci">bool check_dual</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00140">matchers.h:140</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solution_matcher_options_html_afc637bcbceea5647ce8f349e109cb979"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solution_matcher_options.html#afc637bcbceea5647ce8f349e109cb979">operations_research::math_opt::SolutionMatcherOptions::check_basis</a></div><div class="ttdeci">bool check_basis</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00141">matchers.h:141</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html">operations_research::math_opt::SolveResult</a></div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00295">solve_result.h:295</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_matcher_options_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html">operations_research::math_opt::SolveResultMatcherOptions</a></div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00254">matchers.h:254</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_matcher_options_html_a694be1052fd514461beac338988e4e1e"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#a694be1052fd514461beac338988e4e1e">operations_research::math_opt::SolveResultMatcherOptions::first_solution_only</a></div><div class="ttdeci">bool first_solution_only</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00256">matchers.h:256</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_matcher_options_html_a7f70351beed6f2a8faa016ef057daa61"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#a7f70351beed6f2a8faa016ef057daa61">operations_research::math_opt::SolveResultMatcherOptions::inf_or_unb_soft_match</a></div><div class="ttdeci">bool inf_or_unb_soft_match</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00317">matchers.h:317</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_matcher_options_html_a9331eee845f026ba2b3233308704d60d"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#a9331eee845f026ba2b3233308704d60d">operations_research::math_opt::SolveResultMatcherOptions::check_rays</a></div><div class="ttdeci">bool check_rays</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00258">matchers.h:258</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_matcher_options_html_a97eab6d709b80585fe9e8a54b1e3da27"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#a97eab6d709b80585fe9e8a54b1e3da27">operations_research::math_opt::SolveResultMatcherOptions::tolerance</a></div><div class="ttdeci">double tolerance</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00255">matchers.h:255</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_matcher_options_html_ac15e0a9a954abb0892d7ab369b245f75"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#ac15e0a9a954abb0892d7ab369b245f75">operations_research::math_opt::SolveResultMatcherOptions::check_dual</a></div><div class="ttdeci">bool check_dual</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00257">matchers.h:257</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_matcher_options_html_ad50a36d43085f7e8061e0a9ef343e930"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#ad50a36d43085f7e8061e0a9ef343e930">operations_research::math_opt::SolveResultMatcherOptions::check_solutions_if_inf_or_unbounded</a></div><div class="ttdeci">bool check_solutions_if_inf_or_unbounded</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00269">matchers.h:269</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_matcher_options_html_afc637bcbceea5647ce8f349e109cb979"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result_matcher_options.html#afc637bcbceea5647ce8f349e109cb979">operations_research::math_opt::SolveResultMatcherOptions::check_basis</a></div><div class="ttdeci">bool check_basis</div><div class="ttdef"><b>Definition:</b> <a href="matchers_8h_source.html#l00270">matchers.h:270</a></div></div>
|
|
<div class="ttc" id="avariable__and__expressions_8h_html"><div class="ttname"><a href="variable__and__expressions_8h.html">variable_and_expressions.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_1defc00030ff81d309105e053121082f.html">math_opt</a></li><li class="navelem"><a class="el" href="dir_dd5645fbbabcdccb47d1d6db92f0f35b.html">cpp</a></li><li class="navelem"><a class="el" href="matchers_8h.html">matchers.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>
|