backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 12:23:13 +08:00
Code Issues Projects Releases Wiki Activity
Files
282f05f7f2934750a8e5386dd22f85268e7b367d
C-Plus-Plus/d3/dfe/horspool_8cpp.html
realstealthninja a7bccf7d01 Documentation for 8b1eab204b
2024-11-04 12:43:05 +00:00

374 lines
27 KiB
HTML
Raw Blame History

<!-- 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.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: strings/horspool.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="../../resize.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">&#160;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.12.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @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&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(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&amp;dn=expat.txt MIT */
$(function(){initNavTree('d3/dfe/horspool_8cpp.html','../../'); initResizable(true); });
/* @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">
<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="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">horspool.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Horspool's algorithm that finds if a string contains a substring (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm</a>)
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;unordered_map&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for horspool.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/ddf/horspool_8cpp__incl.svg" width="306" 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/dfe/horspool_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dcb/namespacestrings.html">strings</a></td></tr>
<tr class="memdesc:df/dcb/namespacestrings"><td class="mdescLeft">&#160;</td><td class="mdescRight">String algorithms. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d02/namespacehorspool.html">horspool</a></td></tr>
<tr class="memdesc:d5/d02/namespacehorspool"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm" target="_blank">Horspool's</a> algorithm. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a1a9c3aa55ccc79d0f47d50c580997336" id="r_a1a9c3aa55ccc79d0f47d50c580997336"><td class="memItemLeft" align="right" valign="top">std::unordered_map&lt; char, int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1a9c3aa55ccc79d0f47d50c580997336">strings::horspool::findShiftTable</a> (const std::string &amp;prototype)</td></tr>
<tr class="separator:a1a9c3aa55ccc79d0f47d50c580997336"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9884bca75ce39c116697ea2574adb37d" id="r_a9884bca75ce39c116697ea2574adb37d"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9884bca75ce39c116697ea2574adb37d">strings::horspool::horspool</a> (const std::string &amp;text, const std::string &amp;prototype)</td></tr>
<tr class="separator:a9884bca75ce39c116697ea2574adb37d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function with test cases for Horspool's algorithm. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main Function that calls test function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Horspool's algorithm that finds if a string contains a substring (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm</a>) </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ckontakis" target="_blank">Harry Kontakis</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d3/dfe/horspool_8cpp_source.html">horspool.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a1a9c3aa55ccc79d0f47d50c580997336" name="a1a9c3aa55ccc79d0f47d50c580997336"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1a9c3aa55ccc79d0f47d50c580997336">&#9670;&#160;</a></span>findShiftTable()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">std::unordered_map&lt; char, int &gt; strings::horspool::findShiftTable </td>
<td>(</td>
<td class="paramtype">const std::string &amp;</td> <td class="paramname"><span class="paramname"><em>prototype</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>A function that finds the shift table of the given prototype string that we need in Horpool's algorithm. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">prototype</td><td>is the substring that we use to find shift table </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Shift Table of Horspool's algorithm </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d3/dfe/horspool_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../d3/dfe/horspool_8cpp_source.html">horspool.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 26</span> {</div>
<div class="line"><span class="lineno"> 27</span> std::unordered_map&lt;char, int&gt;</div>
<div class="line"><span class="lineno"> 28</span> shiftTable; <span class="comment">// A HashMap for shift table that has characters for keys and integers for values</span></div>
<div class="line"><span class="lineno"> 29</span> </div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; prototype.size();</div>
<div class="line"><span class="lineno"> 31</span> i++) { <span class="comment">// Checking all characters of prototype string</span></div>
<div class="line"><span class="lineno"> 32</span> <span class="keywordflow">if</span> (shiftTable.find(prototype[i]) ==</div>
<div class="line"><span class="lineno"> 33</span> shiftTable.end()) { <span class="comment">// If character does not exist in HashMap</span></div>
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">if</span> (i != prototype.size() - 1) {</div>
<div class="line"><span class="lineno"> 35</span> shiftTable.insert(std::make_pair(</div>
<div class="line"><span class="lineno"> 36</span> prototype[i], prototype.size() - i -</div>
<div class="line"><span class="lineno"> 37</span> 1)); <span class="comment">// Insert the character as key and the size of prototype string - index of character - 1 as value</span></div>
<div class="line"><span class="lineno"> 38</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 39</span> shiftTable.insert(std::make_pair(</div>
<div class="line"><span class="lineno"> 40</span> prototype[i],</div>
<div class="line"><span class="lineno"> 41</span> prototype.size())); <span class="comment">// Insert the character as key and the size of prototype string as value</span></div>
<div class="line"><span class="lineno"> 42</span> }</div>
<div class="line"><span class="lineno"> 43</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">if</span> (i != prototype.size() - 1) {</div>
<div class="line"><span class="lineno"> 45</span> shiftTable[prototype[i]] = prototype.size() - i - 1;</div>
<div class="line"><span class="lineno"> 46</span> }</div>
<div class="line"><span class="lineno"> 47</span> }</div>
<div class="line"><span class="lineno"> 48</span> }</div>
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">return</span> shiftTable;</div>
<div class="line"><span class="lineno"> 50</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a9884bca75ce39c116697ea2574adb37d" name="a9884bca75ce39c116697ea2574adb37d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9884bca75ce39c116697ea2574adb37d">&#9670;&#160;</a></span>horspool()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool strings::horspool::horspool </td>
<td>(</td>
<td class="paramtype">const std::string &amp;</td> <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const std::string &amp;</td> <td class="paramname"><span class="paramname"><em>prototype</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>A function that implements Horspool's algorithm. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">text</td><td>is the string that we are searching if there is a substring </td></tr>
<tr><td class="paramname">prototype</td><td>is the substring that we are searching in text </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true if text string contains prototype string </dd>
<dd>
false if text string does not contain prototype string </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d3/dfe/horspool_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d3/dfe/horspool_8cpp_source.html">horspool.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 59</span> {</div>
<div class="line"><span class="lineno"> 60</span> std::unordered_map&lt;char, int&gt; shiftTable = <a class="code hl_function" href="#a1a9c3aa55ccc79d0f47d50c580997336">findShiftTable</a>(</div>
<div class="line"><span class="lineno"> 61</span> prototype); <span class="comment">// Initialise shift table calling findShiftTable function</span></div>
<div class="line"><span class="lineno"> 62</span> </div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordtype">int</span> i = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(</div>
<div class="line"><span class="lineno"> 64</span> prototype.size() -</div>
<div class="line"><span class="lineno"> 65</span> 1); <span class="comment">// Index that we shift in text to find the substring</span></div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">while</span> (i &lt; text.size()) {</div>
<div class="line"><span class="lineno"> 67</span> <span class="keywordtype">int</span> j = i, <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = 0;</div>
<div class="line"><span class="lineno"> 68</span> <span class="keywordtype">bool</span> flag = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 69</span> </div>
<div class="line"><span class="lineno"> 70</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> z = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(prototype.size() - 1); z &gt;= 0 &amp;&amp; flag;</div>
<div class="line"><span class="lineno"> 71</span> z--) { <span class="comment">// Checking if all characters of substring are equal with all characters of string</span></div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">if</span> (text[j] == prototype[z]) {</div>
<div class="line"><span class="lineno"> 73</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++;</div>
<div class="line"><span class="lineno"> 74</span> j--;</div>
<div class="line"><span class="lineno"> 75</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 76</span> flag = <span class="keyword">false</span>; <span class="comment">// If two characters are not equal set flag to false and break from loop</span></div>
<div class="line"><span class="lineno"> 77</span> }</div>
<div class="line"><span class="lineno"> 78</span> }</div>
<div class="line"><span class="lineno"> 79</span> </div>
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">if</span> (k ==</div>
<div class="line"><span class="lineno"> 81</span> prototype.size()) { <span class="comment">// If all characters match then return true</span></div>
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 83</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">if</span> (shiftTable.find(text[i]) != shiftTable.end()) {</div>
<div class="line"><span class="lineno"> 85</span> i += shiftTable[text[i]]; <span class="comment">// If shift table contains the character then shift index as many steps as value</span></div>
<div class="line"><span class="lineno"> 86</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 87</span> i += prototype.size(); <span class="comment">// If character does not exist in shift table then shift index as many steps as size of prototype string</span></div>
<div class="line"><span class="lineno"> 88</span> }</div>
<div class="line"><span class="lineno"> 89</span> }</div>
<div class="line"><span class="lineno"> 90</span> }</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 92</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
<div class="ttc" id="ahorspool_8cpp_html_a1a9c3aa55ccc79d0f47d50c580997336"><div class="ttname"><a href="#a1a9c3aa55ccc79d0f47d50c580997336">strings::horspool::findShiftTable</a></div><div class="ttdeci">std::unordered_map&lt; char, int &gt; findShiftTable(const std::string &amp;prototype)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/horspool_8cpp_source.html#l00026">horspool.cpp:26</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</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 that calls test 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/dfe/horspool_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d3/dfe/horspool_8cpp_source.html">horspool.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 119</span> {</div>
<div class="line"><span class="lineno"> 120</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
<div class="line"><span class="lineno"> 121</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 122</span>}</div>
<div class="ttc" id="ahorspool_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function with test cases for Horspool's algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/horspool_8cpp_source.html#l00100">horspool.cpp:100</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</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">static 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</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Function with test cases for Horspool's algorithm. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d3/dfe/horspool_8cpp_source.html#l00100">100</a> of file <a class="el" href="../../d3/dfe/horspool_8cpp_source.html">horspool.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 100</span> {</div>
<div class="line"><span class="lineno"> 101</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;World&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 102</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot; World&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 103</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;ello&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 104</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;rld&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 105</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello&quot;</span>,<span class="stringliteral">&quot;Helo&quot;</span>) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 106</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++_algorithms&quot;</span>,<span class="stringliteral">&quot;c++_algorithms&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 107</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++_algorithms&quot;</span>,<span class="stringliteral">&quot;c++_&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 108</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello&quot;</span>,<span class="stringliteral">&quot;Hello World&quot;</span>) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 109</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++_algorithms&quot;</span>,<span class="stringliteral">&quot;&quot;</span>) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 110</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++&quot;</span>,<span class="stringliteral">&quot;c&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 111</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;3458934793&quot;</span>,<span class="stringliteral">&quot;4793&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 112</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;3458934793&quot;</span>,<span class="stringliteral">&quot;123&quot;</span>) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 113</span>}</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</a></li><li class="navelem"><a class="el" href="../../d3/dfe/horspool_8cpp.html">horspool.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.12.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink