mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 04:18:34 +08:00
327 lines
24 KiB
HTML
327 lines
24 KiB
HTML
<!-- HTML header for doxygen 1.12.0-->
|
|
<!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" lang="en-US">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
|
<meta name="generator" content="Doxygen 1.14.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>TheAlgorithms/C++: search/saddleback_search.cpp File Reference</title>
|
|
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
|
<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>
|
|
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
|
<script type="text/javascript">
|
|
DoxygenAwesomeDarkModeToggle.init()
|
|
</script>
|
|
<script type="text/javascript" src="../../clipboard.js"></script>
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
<script type="text/javascript" src="../../cookie.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>
|
|
<script type="text/javascript">
|
|
window.MathJax = {
|
|
options: {
|
|
ignoreHtmlClass: 'tex2jax_ignore',
|
|
processHtmlClass: 'tex2jax_process'
|
|
},
|
|
loader: {
|
|
load: ['[tex]/ams']
|
|
},
|
|
tex: {
|
|
macros: {},
|
|
packages: ['base','configmacros','ams']
|
|
}
|
|
};
|
|
</script>
|
|
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="../../doxygen-awesome.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 id="projectrow">
|
|
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
|
<td id="projectalign">
|
|
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">All the algorithms implemented in C++</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.14.0 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
</script>
|
|
<script type="text/javascript">
|
|
$(function() { codefold.init(); });
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
</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">
|
|
$(function(){initNavTree('d3/d22/saddleback__search_8cpp.html','../../',''); });
|
|
</script>
|
|
<div id="container">
|
|
<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">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">saddleback_search.cpp File Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p>Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> for 2D arrays.
|
|
<a href="#details">More...</a></p>
|
|
<div class="textblock"><code>#include <cassert></code><br />
|
|
<code>#include <cstdint></code><br />
|
|
<code>#include <iostream></code><br />
|
|
<code>#include <vector></code><br />
|
|
</div><div class="textblock"><div class="dynheader">
|
|
Include dependency graph for saddleback_search.cpp:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../de/d4c/saddleback__search_8cpp__incl.svg" width="336" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
|
</div>
|
|
</div>
|
|
<p><a href="../../d3/d22/saddleback__search_8cpp_source.html">Go to the source code of this file.</a></p>
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
|
|
Namespaces</h2></td></tr>
|
|
<tr class="memitem:search" id="r_search"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dca/namespacesearch.html">search</a></td></tr>
|
|
<tr class="memdesc:d9/dca/namespacesearch"><td class="mdescLeft"> </td><td class="mdescRight">for std::assert <br /></td></tr>
|
|
<tr class="memitem:saddleback" id="r_saddleback"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dda/namespacesaddleback.html">saddleback</a></td></tr>
|
|
<tr class="memdesc:d0/dda/namespacesaddleback"><td class="mdescLeft"> </td><td class="mdescRight">Function for implementing <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a>. <br /></td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:ad1e0ca34797d88490747c08eca70a2e6" id="r_ad1e0ca34797d88490747c08eca70a2e6"><td class="memItemLeft" align="right" valign="top">std::pair< uint32_t, uint32_t > </td><td class="memItemRight" valign="bottom"><a class="el" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a> (std::vector< std::vector< int32_t > > <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, int32_t element)</td></tr>
|
|
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
|
|
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft"> </td><td class="mdescRight">Test implementations. <br /></td></tr>
|
|
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
|
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <br /></td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p>Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> for 2D arrays. </p>
|
|
<p>Saddleback Algorithm is an algorithm that searches 2D array in linear time, i.e, O(m + n), where m is number of rows and n is number of columns of 2D array. Also, each row and column of the matrix should be sorted beforehand for this algorithm to work.</p>
|
|
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/HashirGJ8842" target="_blank">Hashir Niazi</a> </dd></dl>
|
|
|
|
<p class="definition">Definition in file <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html">saddleback_search.cpp</a>.</p>
|
|
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
|
|
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int main </td>
|
|
<td>(</td>
|
|
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Main function. </p>
|
|
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html">saddleback_search.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 112</span> {</div>
|
|
<div class="line"><span class="lineno"> 113</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
|
|
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><span class="lineno"> 115</span>}</div>
|
|
<div class="ttc" id="asaddleback__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d22/saddleback__search_8cpp_source.html#l00078">saddleback_search.cpp:78</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ad1e0ca34797d88490747c08eca70a2e6" name="ad1e0ca34797d88490747c08eca70a2e6"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ad1e0ca34797d88490747c08eca70a2e6">◆ </a></span>saddleback()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">std::pair< uint32_t, uint32_t > search::saddleback::saddleback </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< std::vector< int32_t > ></td> <td class="paramname"><span class="paramname"><em>matrix</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int32_t</td> <td class="paramname"><span class="paramname"><em>element</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>This function implements <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a>, on a sorted 2D array, and finds the location of the element needed to search </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">matrix</td><td>2D matrix which is sorted on the basis of rows and columns </td></tr>
|
|
<tr><td class="paramname">element</td><td>element to be searched </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>An std::pair of with row and column populated within it, if the element is present. </dd>
|
|
<dd>
|
|
An std::pair with (0, 0), if the element is not present. </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html">saddleback_search.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 40</span> {</div>
|
|
<div class="line"><span class="lineno"> 41</span> uint32_t left_index = 0;</div>
|
|
<div class="line"><span class="lineno"> 42</span> uint32_t right_index = <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>[0].size() - 1; <span class="comment">// Start from top right corner</span></div>
|
|
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">while</span> (left_index <</div>
|
|
<div class="line"><span class="lineno"> 44</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>.size()) { <span class="comment">// Exit once the value of indexes get out of range.</span></div>
|
|
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">if</span> (element ==</div>
|
|
<div class="line"><span class="lineno"> 46</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>[left_index]</div>
|
|
<div class="line"><span class="lineno"> 47</span> [right_index]) { <span class="comment">// If value on this position of matrix is</span></div>
|
|
<div class="line"><span class="lineno"> 48</span> <span class="comment">// equal to element, return (row, column).</span></div>
|
|
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">return</span> std::make_pair(left_index + 1, right_index + 1);</div>
|
|
<div class="line"><span class="lineno"> 50</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (element ></div>
|
|
<div class="line"><span class="lineno"> 51</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>[left_index]</div>
|
|
<div class="line"><span class="lineno"> 52</span> [right_index]) { <span class="comment">// Else if value on this position of</span></div>
|
|
<div class="line"><span class="lineno"> 53</span> <span class="comment">// matrix is less than the element,</span></div>
|
|
<div class="line"><span class="lineno"> 54</span> <span class="comment">// move left.</span></div>
|
|
<div class="line"><span class="lineno"> 55</span> ++left_index;</div>
|
|
<div class="line"><span class="lineno"> 56</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (element <</div>
|
|
<div class="line"><span class="lineno"> 57</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>[left_index]</div>
|
|
<div class="line"><span class="lineno"> 58</span> [right_index]) { <span class="comment">// Else if value on this position of</span></div>
|
|
<div class="line"><span class="lineno"> 59</span> <span class="comment">// matrix is greater than the</span></div>
|
|
<div class="line"><span class="lineno"> 60</span> <span class="comment">// element, move down.</span></div>
|
|
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">if</span> (!right_index)</div>
|
|
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">else</span></div>
|
|
<div class="line"><span class="lineno"> 64</span> --right_index;</div>
|
|
<div class="line"><span class="lineno"> 65</span> }</div>
|
|
<div class="line"><span class="lineno"> 66</span> }</div>
|
|
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> std::make_pair(</div>
|
|
<div class="line"><span class="lineno"> 68</span> 0, 0); <span class="comment">// If the program reaches here, that means one of the index</span></div>
|
|
<div class="line"><span class="lineno"> 69</span> <span class="comment">// went out of index, hence no element present.</span></div>
|
|
<div class="line"><span class="lineno"> 70</span>}</div>
|
|
<div class="ttc" id="alu__decomposition_8h_html_ac029b636b353cefbb18b2fcc71e427e4"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a></div><div class="ttdeci">std::vector< std::valarray< T > > matrix</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00019">lu_decomposition.h:19</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">◆ </a></span>test()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void test </td>
|
|
<td>(</td>
|
|
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Test implementations. </p>
|
|
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html">saddleback_search.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 78</span> {</div>
|
|
<div class="line"><span class="lineno"> 79</span> std::vector<std::vector<int32_t>> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a> = {{1, 10, 100, 1000, 10000},</div>
|
|
<div class="line"><span class="lineno"> 80</span> {2, 20, 200, 2000, 20000},</div>
|
|
<div class="line"><span class="lineno"> 81</span> {3, 30, 300, 3000, 30000},</div>
|
|
<div class="line"><span class="lineno"> 82</span> {4, 40, 400, 4000, 40000},</div>
|
|
<div class="line"><span class="lineno"> 83</span> {5, 50, 500, 5000, 50000}};</div>
|
|
<div class="line"><span class="lineno"> 84</span> </div>
|
|
<div class="line"><span class="lineno"> 85</span> std::pair<uint32_t, uint32_t> not_found = std::make_pair(0, 0);</div>
|
|
<div class="line"><span class="lineno"> 86</span> std::pair<uint32_t, uint32_t> test_answer;</div>
|
|
<div class="line"><span class="lineno"> 87</span> <span class="comment">// Test 1</span></div>
|
|
<div class="line"><span class="lineno"> 88</span> std::pair<uint32_t, uint32_t> answer1 =</div>
|
|
<div class="line"><span class="lineno"> 89</span> <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 123);</div>
|
|
<div class="line"><span class="lineno"> 90</span> assert(not_found == answer1);</div>
|
|
<div class="line"><span class="lineno"> 91</span> <span class="comment">// Test 2</span></div>
|
|
<div class="line"><span class="lineno"> 92</span> answer1 = <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 0);</div>
|
|
<div class="line"><span class="lineno"> 93</span> assert(not_found == answer1);</div>
|
|
<div class="line"><span class="lineno"> 94</span> <span class="comment">// Test 3</span></div>
|
|
<div class="line"><span class="lineno"> 95</span> answer1 = <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 1);</div>
|
|
<div class="line"><span class="lineno"> 96</span> test_answer = std::make_pair(1, 1);</div>
|
|
<div class="line"><span class="lineno"> 97</span> assert(test_answer == answer1);</div>
|
|
<div class="line"><span class="lineno"> 98</span> <span class="comment">// Test 4</span></div>
|
|
<div class="line"><span class="lineno"> 99</span> answer1 = <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 50000);</div>
|
|
<div class="line"><span class="lineno"> 100</span> test_answer = std::make_pair(5, 5);</div>
|
|
<div class="line"><span class="lineno"> 101</span> assert(test_answer == answer1);</div>
|
|
<div class="line"><span class="lineno"> 102</span> <span class="comment">// Test 5</span></div>
|
|
<div class="line"><span class="lineno"> 103</span> answer1 = <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 300);</div>
|
|
<div class="line"><span class="lineno"> 104</span> test_answer = std::make_pair(3, 3);</div>
|
|
<div class="line"><span class="lineno"> 105</span> assert(test_answer == answer1);</div>
|
|
<div class="line"><span class="lineno"> 106</span>}</div>
|
|
<div class="ttc" id="asaddleback__search_8cpp_html_ad1e0ca34797d88490747c08eca70a2e6"><div class="ttname"><a href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a></div><div class="ttdeci">std::pair< uint32_t, uint32_t > saddleback(std::vector< std::vector< int32_t > > matrix, int32_t element)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d22/saddleback__search_8cpp_source.html#l00039">saddleback_search.cpp:39</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div id="page-nav" class="page-nav-panel">
|
|
<div id="page-nav-resize-handle"></div>
|
|
<div id="page-nav-tree">
|
|
<div id="page-nav-contents">
|
|
</div><!-- page-nav-contents -->
|
|
</div><!-- page-nav-tree -->
|
|
</div><!-- page-nav -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a href="../../d3/d22/saddleback__search_8cpp.html">saddleback_search.cpp</a></li>
|
|
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|