mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-31 09:13:16 +08:00
Documentation for 53a6c16730
This commit is contained in:
github-actions
@@ -3,7 +3,7 @@
|
||||
<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.9.2"/>
|
||||
<meta name="generator" content="Doxygen 1.9.3"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: strings/horspool.cpp File Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
@@ -30,8 +30,8 @@ MathJax.Hub.Config({
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr style="height: 56px;">
|
||||
<td id="projectalign" style="padding-left: 0.5em;">
|
||||
<tr id="projectrow">
|
||||
<td id="projectalign">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.2 -->
|
||||
<!-- 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');
|
||||
@@ -157,31 +157,31 @@ Functions</h2></td></tr>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>Shift Table of Horspool's algorithm </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> {</div>
|
||||
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map<char, int></a></div>
|
||||
<div class="line"><a id="l00028" name="l00028"></a><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"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> </div>
|
||||
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
|
||||
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> i++) { <span class="comment">// Checking all characters of prototype string</span></div>
|
||||
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keywordflow">if</span> (shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(prototype[i]) ==</div>
|
||||
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) { <span class="comment">// If character does not exist in HashMap</span></div>
|
||||
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keywordflow">if</span> (i != prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1) {</div>
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">insert</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> prototype[i], prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - i -</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><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"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">insert</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
||||
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> prototype[i],</div>
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>())); <span class="comment">// Insert the character as key and the size of prototype string as value</span></div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordflow">if</span> (i != prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1) {</div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> shiftTable[prototype[i]] = prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/size.html">size</a>() - i - 1;</div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> }</div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> }</div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> }</div>
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordflow">return</span> shiftTable;</div>
|
||||
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 26</span> {</div>
|
||||
<div class="line"><span class="lineno"> 27</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map<char, int></a></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 < prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</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.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(prototype[i]) ==</div>
|
||||
<div class="line"><span class="lineno"> 33</span> shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) { <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.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1) {</div>
|
||||
<div class="line"><span class="lineno"> 35</span> shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">insert</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
||||
<div class="line"><span class="lineno"> 36</span> prototype[i], prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 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.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">insert</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
||||
<div class="line"><span class="lineno"> 40</span> prototype[i],</div>
|
||||
<div class="line"><span class="lineno"> 41</span> prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>())); <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.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1) {</div>
|
||||
<div class="line"><span class="lineno"> 45</span> shiftTable[prototype[i]] = prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/size.html">size</a>() - 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 class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">std::unordered_map::end</a></div><div class="ttdeci">T end(T... args)</div></div>
|
||||
<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">std::unordered_map::find</a></div><div class="ttdeci">T find(T... args)</div></div>
|
||||
<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">std::unordered_map::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
|
||||
@@ -232,40 +232,40 @@ Here is the call graph for this function:</div>
|
||||
<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>
|
||||
<div class="fragment"><div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> {</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map<char, int></a> shiftTable = <a class="code hl_function" href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336">findShiftTable</a>(</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> prototype); <span class="comment">// Initialise shift table calling findShiftTable function</span></div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> </div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">int</span> i = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() -</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> 1); <span class="comment">// Index that we shift in text to find the substring</span></div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">while</span> (i < text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) {</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><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"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordtype">bool</span> flag = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> </div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> z = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1); z >= 0 && flag;</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><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"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">if</span> (text[j] == prototype[z]) {</div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><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"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> j--;</div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00076" name="l00076"></a><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"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
|
||||
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> }</div>
|
||||
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> </div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">if</span> (k ==</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) { <span class="comment">// If all characters match then return true</span></div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">if</span> (shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(text[i]) != shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) {</div>
|
||||
<div class="line"><a id="l00085" name="l00085"></a><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"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> i += prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); <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"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> }</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 59</span> {</div>
|
||||
<div class="line"><span class="lineno"> 60</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map<char, int></a> shiftTable = <a class="code hl_function" href="../../d3/dfe/horspool_8cpp.html#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<</span><span class="keywordtype">int</span><span class="keyword">></span>(</div>
|
||||
<div class="line"><span class="lineno"> 64</span> prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() -</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 < text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) {</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<</span><span class="keywordtype">int</span><span class="keyword">></span>(prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1); z >= 0 && 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.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) { <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.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(text[i]) != shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) {</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.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); <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> composite_simpson_rule.cpp:117</div></div>
|
||||
<div class="ttc" id="ahorspool_8cpp_html_a1a9c3aa55ccc79d0f47d50c580997336"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336">strings::horspool::findShiftTable</a></div><div class="ttdeci">std::unordered_map< char, int > findShiftTable(const std::string &prototype)</div><div class="ttdef"><b>Definition:</b> horspool.cpp:26</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
@@ -295,10 +295,10 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Main Function that calls test function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> {</div>
|
||||
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <a class="code hl_function" href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
|
||||
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span>}</div>
|
||||
<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="../../d3/dfe/horspool_8cpp.html#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="../../d3/dfe/horspool_8cpp.html#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> horspool.cpp:100</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -334,20 +334,20 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Function with test cases for Horspool's algorithm. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> {</div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> assert(strings::horspool::horspool(<span class="stringliteral">"Hello World"</span>,<span class="stringliteral">"World"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> assert(strings::horspool::horspool(<span class="stringliteral">"Hello World"</span>,<span class="stringliteral">" World"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> assert(strings::horspool::horspool(<span class="stringliteral">"Hello World"</span>,<span class="stringliteral">"ello"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> assert(strings::horspool::horspool(<span class="stringliteral">"Hello World"</span>,<span class="stringliteral">"rld"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> assert(strings::horspool::horspool(<span class="stringliteral">"Hello"</span>,<span class="stringliteral">"Helo"</span>) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> assert(strings::horspool::horspool(<span class="stringliteral">"c++_algorithms"</span>,<span class="stringliteral">"c++_algorithms"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> assert(strings::horspool::horspool(<span class="stringliteral">"c++_algorithms"</span>,<span class="stringliteral">"c++_"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> assert(strings::horspool::horspool(<span class="stringliteral">"Hello"</span>,<span class="stringliteral">"Hello World"</span>) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> assert(strings::horspool::horspool(<span class="stringliteral">"c++_algorithms"</span>,<span class="stringliteral">""</span>) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> assert(strings::horspool::horspool(<span class="stringliteral">"c++"</span>,<span class="stringliteral">"c"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> assert(strings::horspool::horspool(<span class="stringliteral">"3458934793"</span>,<span class="stringliteral">"4793"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> assert(strings::horspool::horspool(<span class="stringliteral">"3458934793"</span>,<span class="stringliteral">"123"</span>) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span>}</div>
|
||||
<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">"Hello World"</span>,<span class="stringliteral">"World"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 102</span> assert(strings::horspool::horspool(<span class="stringliteral">"Hello World"</span>,<span class="stringliteral">" World"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 103</span> assert(strings::horspool::horspool(<span class="stringliteral">"Hello World"</span>,<span class="stringliteral">"ello"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 104</span> assert(strings::horspool::horspool(<span class="stringliteral">"Hello World"</span>,<span class="stringliteral">"rld"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 105</span> assert(strings::horspool::horspool(<span class="stringliteral">"Hello"</span>,<span class="stringliteral">"Helo"</span>) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 106</span> assert(strings::horspool::horspool(<span class="stringliteral">"c++_algorithms"</span>,<span class="stringliteral">"c++_algorithms"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 107</span> assert(strings::horspool::horspool(<span class="stringliteral">"c++_algorithms"</span>,<span class="stringliteral">"c++_"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 108</span> assert(strings::horspool::horspool(<span class="stringliteral">"Hello"</span>,<span class="stringliteral">"Hello World"</span>) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 109</span> assert(strings::horspool::horspool(<span class="stringliteral">"c++_algorithms"</span>,<span class="stringliteral">""</span>) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 110</span> assert(strings::horspool::horspool(<span class="stringliteral">"c++"</span>,<span class="stringliteral">"c"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 111</span> assert(strings::horspool::horspool(<span class="stringliteral">"3458934793"</span>,<span class="stringliteral">"4793"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 112</span> assert(strings::horspool::horspool(<span class="stringliteral">"3458934793"</span>,<span class="stringliteral">"123"</span>) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 113</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -357,7 +357,7 @@ Here is the call graph for this function:</div>
|
||||
<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.9.2 </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.9.3 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
|
||||
Reference in New Issue
Block a user