mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-25 06:12:11 +08:00
Documentation for 502a953e23
This commit is contained in:
realstealthninja
@@ -117,10 +117,12 @@ $(function(){initNavTree('d9/d03/namespacestring__search.html','../../'); initRe
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:aeb2cd81064717aedd62bfb096b1a73d8" id="r_aeb2cd81064717aedd62bfb096b1a73d8"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#aeb2cd81064717aedd62bfb096b1a73d8">brute_force</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &text, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &pattern)</td></tr>
|
||||
<tr class="separator:aeb2cd81064717aedd62bfb096b1a73d8"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a996573527312d5255e1495b879e8a34f" id="r_a996573527312d5255e1495b879e8a34f"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > </td><td class="memItemRight" valign="bottom"><a class="el" href="#a996573527312d5255e1495b879e8a34f">getFailureArray</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &pattern)</td></tr>
|
||||
<tr class="separator:a996573527312d5255e1495b879e8a34f"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a26a58225ce7d3fa9d4c2f5349a65ed93" id="r_a26a58225ce7d3fa9d4c2f5349a65ed93"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#a26a58225ce7d3fa9d4c2f5349a65ed93">kmp</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &pattern, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &text)</td></tr>
|
||||
<tr class="separator:a26a58225ce7d3fa9d4c2f5349a65ed93"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a83c72ff237cdf623e42d4295e0029bf9" id="r_a83c72ff237cdf623e42d4295e0029bf9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > </td><td class="memItemRight" valign="bottom"><a class="el" href="#a83c72ff237cdf623e42d4295e0029bf9">getFailureArray</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &pattern)</td></tr>
|
||||
<tr class="memdesc:a83c72ff237cdf623e42d4295e0029bf9"><td class="mdescLeft"> </td><td class="mdescRight">Generate the partial match table aka failure function for a pattern to search. <br /></td></tr>
|
||||
<tr class="separator:a83c72ff237cdf623e42d4295e0029bf9"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a1e37af2f023495129cb57338c801209e" id="r_a1e37af2f023495129cb57338c801209e"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="#a1e37af2f023495129cb57338c801209e">kmp</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &pattern, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &text)</td></tr>
|
||||
<tr class="memdesc:a1e37af2f023495129cb57338c801209e"><td class="mdescLeft"> </td><td class="mdescRight">KMP algorithm to find a pattern in a text. <br /></td></tr>
|
||||
<tr class="separator:a1e37af2f023495129cb57338c801209e"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a8fb0bc932ba8b582c9f4c71338d050f8" id="r_a8fb0bc932ba8b582c9f4c71338d050f8"><td class="memItemLeft" align="right" valign="top">int64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="#a8fb0bc932ba8b582c9f4c71338d050f8">create_hash</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &s, int n)</td></tr>
|
||||
<tr class="separator:a8fb0bc932ba8b582c9f4c71338d050f8"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aed769d565b705a9b3e0eb1ec74088893" id="r_aed769d565b705a9b3e0eb1ec74088893"><td class="memItemLeft" align="right" valign="top">int64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="#aed769d565b705a9b3e0eb1ec74088893">recalculate_hash</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &s, int old_index, int new_index, int64_t old_hash, int patLength)</td></tr>
|
||||
@@ -132,6 +134,7 @@ Functions</h2></td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>String search algorithms. </p>
|
||||
<p>for assert for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="aeb2cd81064717aedd62bfb096b1a73d8" name="aeb2cd81064717aedd62bfb096b1a73d8"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aeb2cd81064717aedd62bfb096b1a73d8">◆ </a></span>brute_force()</h2>
|
||||
@@ -291,59 +294,59 @@ Here is the call graph for this function:</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a996573527312d5255e1495b879e8a34f" name="a996573527312d5255e1495b879e8a34f"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a996573527312d5255e1495b879e8a34f">◆ </a></span>getFailureArray()</h2>
|
||||
<a id="a83c72ff237cdf623e42d4295e0029bf9" name="a83c72ff237cdf623e42d4295e0029bf9"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a83c72ff237cdf623e42d4295e0029bf9">◆ </a></span>getFailureArray()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > string_search::getFailureArray </td>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > string_search::getFailureArray </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &</td> <td class="paramname"><span class="paramname"><em>pattern</em></span></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Generate the partial match table aka failure function for a pattern to search. </p><dl class="params"><dt>Parameters</dt><dd>
|
||||
|
||||
<p>Generate the partial match table aka failure function for a pattern to search. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramdir">[in]</td><td class="paramname">pattern</td><td>text for which to create the partial match table </td></tr>
|
||||
<tr><td class="paramname">pattern</td><td>text for which to create the partial match table </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>the partial match table as a vector array </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 33</span> {</div>
|
||||
<div class="line"><span class="lineno"> 34</span> <span class="keywordtype">int</span> pattern_length = pattern.<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"> 35</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> failure(pattern_length + 1);</div>
|
||||
<div class="line"><span class="lineno"> 36</span> failure[0] = -1;</div>
|
||||
<div class="line"><span class="lineno"> 37</span> <span class="keywordtype">int</span> j = -1;</div>
|
||||
<div class="line"><span class="lineno"> 38</span> </div>
|
||||
<div class="line"><span class="lineno"> 39</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < pattern_length; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">while</span> (j != -1 && pattern[j] != pattern[i]) {</div>
|
||||
<div class="line"><span class="lineno"> 41</span> j = failure[j];</div>
|
||||
<div class="line"><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><span class="lineno"> 43</span> j++;</div>
|
||||
<div class="line"><span class="lineno"> 44</span> failure[i + 1] = j;</div>
|
||||
<div class="line"><span class="lineno"> 45</span> }</div>
|
||||
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">return</span> failure;</div>
|
||||
<div class="line"><span class="lineno"> 47</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 32</span> {</div>
|
||||
<div class="line"><span class="lineno"> 33</span> <span class="keywordtype">size_t</span> pattern_length = pattern.<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"> 34</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a> failure(pattern_length + 1);</div>
|
||||
<div class="line"><span class="lineno"> 35</span> failure[0] = std::string::npos;</div>
|
||||
<div class="line"><span class="lineno"> 36</span> <span class="keywordtype">size_t</span> j = std::string::npos;</div>
|
||||
<div class="line"><span class="lineno"> 37</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < pattern_length; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 38</span> <span class="keywordflow">while</span> (j != std::string::npos && pattern[j] != pattern[i]) {</div>
|
||||
<div class="line"><span class="lineno"> 39</span> j = failure[j];</div>
|
||||
<div class="line"><span class="lineno"> 40</span> }</div>
|
||||
<div class="line"><span class="lineno"> 41</span> failure[i + 1] = ++j;</div>
|
||||
<div class="line"><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">return</span> failure;</div>
|
||||
<div class="line"><span class="lineno"> 44</span>}</div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d03/namespacestring__search_a996573527312d5255e1495b879e8a34f_cgraph.svg" width="335" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.svg" width="335" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a26a58225ce7d3fa9d4c2f5349a65ed93" name="a26a58225ce7d3fa9d4c2f5349a65ed93"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a26a58225ce7d3fa9d4c2f5349a65ed93">◆ </a></span>kmp()</h2>
|
||||
<a id="a1e37af2f023495129cb57338c801209e" name="a1e37af2f023495129cb57338c801209e"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a1e37af2f023495129cb57338c801209e">◆ </a></span>kmp()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool string_search::kmp </td>
|
||||
<td class="memname">size_t string_search::kmp </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &</td> <td class="paramname"><span class="paramname"><em>pattern</em></span>, </td>
|
||||
</tr>
|
||||
@@ -354,36 +357,42 @@ Here is the call graph for this function:</div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>KMP algorithm to find a pattern in a text </p><dl class="params"><dt>Parameters</dt><dd>
|
||||
|
||||
<p>KMP algorithm to find a pattern in a text. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramdir">[in]</td><td class="paramname">pattern</td><td>string pattern to search </td></tr>
|
||||
<tr><td class="paramdir">[in]</td><td class="paramname">text</td><td>text in which to search </td></tr>
|
||||
<tr><td class="paramname">pattern</td><td>string pattern to search </td></tr>
|
||||
<tr><td class="paramname">text</td><td>text in which to search </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if pattern was found </dd>
|
||||
<dl class="section return"><dt>Returns</dt><dd>the starting index of the pattern if found </dd>
|
||||
<dd>
|
||||
<code>false</code> if pattern was not found </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 56</span> {</div>
|
||||
<div class="line"><span class="lineno"> 57</span> <span class="keywordtype">int</span> text_length = text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(), pattern_length = pattern.<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"> 58</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> failure = <a class="code hl_function" href="#a996573527312d5255e1495b879e8a34f">getFailureArray</a>(pattern);</div>
|
||||
<div class="line"><span class="lineno"> 59</span> </div>
|
||||
<div class="line"><span class="lineno"> 60</span> <span class="keywordtype">int</span> k = 0;</div>
|
||||
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < text_length; j++) {</div>
|
||||
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">while</span> (k != -1 && pattern[k] != text[j]) {</div>
|
||||
<code>std::string::npos</code> if not found </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 53</span> {</div>
|
||||
<div class="line"><span class="lineno"> 54</span> <span class="keywordflow">if</span> (pattern.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">empty</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 56</span> }</div>
|
||||
<div class="line"><span class="lineno"> 57</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a> failure = getFailureArray(pattern);</div>
|
||||
<div class="line"><span class="lineno"> 58</span> <span class="keywordtype">size_t</span> text_length = 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"> 59</span> <span class="keywordtype">size_t</span> pattern_length = pattern.<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"> 60</span> <span class="keywordtype">size_t</span> k = 0;</div>
|
||||
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < text_length; j++) {</div>
|
||||
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">while</span> (k != std::string::npos && pattern[k] != text[j]) {</div>
|
||||
<div class="line"><span class="lineno"> 63</span> k = failure[k];</div>
|
||||
<div class="line"><span class="lineno"> 64</span> }</div>
|
||||
<div class="line"><span class="lineno"> 65</span> k++;</div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">if</span> (k == pattern_length)</div>
|
||||
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">if</span> (++k == pattern_length) {</div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">return</span> j - <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> + 1;</div>
|
||||
<div class="line"><span class="lineno"> 67</span> }</div>
|
||||
<div class="line"><span class="lineno"> 68</span> }</div>
|
||||
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">return</span> std::string::npos;</div>
|
||||
<div class="line"><span class="lineno"> 70</span>}</div>
|
||||
<div class="ttc" id="anamespacestring__search_html_a996573527312d5255e1495b879e8a34f"><div class="ttname"><a href="#a996573527312d5255e1495b879e8a34f">string_search::getFailureArray</a></div><div class="ttdeci">std::vector< int > getFailureArray(const std::string &pattern)</div><div class="ttdef"><b>Definition</b> knuth_morris_pratt.cpp:33</div></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="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">std::string::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.svg" width="515" height="74"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.svg" width="515" height="123"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
|
||||
@@ -0,0 +1,10 @@
|
||||
<map id="string_search::kmp" name="string_search::kmp">
|
||||
<area shape="rect" id="Node000001" title="KMP algorithm to find a pattern in a text." alt="" coords="5,63,138,88"/>
|
||||
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/empty.html#" title=" " alt="" coords="206,5,330,31"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="117,60,206,33,207,38,119,65"/>
|
||||
<area shape="rect" id="Node000003" href="$d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9" title="Generate the partial match table aka failure function for a pattern to search." alt="" coords="186,55,350,96"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="138,73,170,73,170,78,138,78"/>
|
||||
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="398,92,509,118"/>
|
||||
<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="111,86,186,105,288,111,382,109,382,114,288,117,185,110,110,92"/>
|
||||
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="351,86,383,91,382,96,350,91"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
222ec06baa13708407e37b8b58a6c28e
|
||||
@@ -4,8 +4,8 @@
|
||||
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
|
||||
-->
|
||||
<!-- Title: string_search::kmp Pages: 1 -->
|
||||
<svg width="386pt" height="55pt"
|
||||
viewBox="0.00 0.00 386.00 54.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="386pt" height="92pt"
|
||||
viewBox="0.00 0.00 386.00 92.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
||||
|
||||
@@ -17,24 +17,23 @@
|
||||
]]></style>
|
||||
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 50.88)">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 88.25)">
|
||||
<title>string_search::kmp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title=" ">
|
||||
<polygon fill="#999999" stroke="#666666" points="99.25,-19.25 0,-19.25 0,0 99.25,0 99.25,-19.25"/>
|
||||
<text text-anchor="middle" x="49.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::kmp</text>
|
||||
<g id="a_Node000001"><a xlink:title="KMP algorithm to find a pattern in a text.">
|
||||
<polygon fill="#999999" stroke="#666666" points="99.25,-41.25 0,-41.25 0,-22 99.25,-22 99.25,-41.25"/>
|
||||
<text text-anchor="middle" x="49.62" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::kmp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="258.5,-46.88 135.25,-46.88 135.25,-16.38 258.5,-16.38 258.5,-46.88"/>
|
||||
<text text-anchor="start" x="143.25" y="-33.38" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::getFailure</text>
|
||||
<text text-anchor="middle" x="196.88" y="-22.12" font-family="Helvetica,sans-Serif" font-size="10.00">Array</text>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="243.12,-84.25 150.62,-84.25 150.62,-65 243.12,-65 243.12,-84.25"/>
|
||||
<text text-anchor="middle" x="196.88" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::empty</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -42,33 +41,52 @@
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M99.4,-17.01C107.21,-18.2 115.45,-19.44 123.68,-20.69"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="122.94,-24.12 133.35,-22.16 123.99,-17.2 122.94,-24.12"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M84.68,-41.71C104.46,-47.56 129.61,-55.01 150.99,-61.34"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="149.75,-64.62 160.33,-64.1 151.74,-57.91 149.75,-64.62"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<g id="a_Node000003"><a xlink:href="../../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9" target="_top" xlink:title="Generate the partial match table aka failure function for a pattern to search.">
|
||||
<polygon fill="white" stroke="#666666" points="258.5,-46.88 135.25,-46.88 135.25,-16.38 258.5,-16.38 258.5,-46.88"/>
|
||||
<text text-anchor="start" x="143.25" y="-33.38" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::getFailure</text>
|
||||
<text text-anchor="middle" x="196.88" y="-22.12" font-family="Helvetica,sans-Serif" font-size="10.00">Array</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M99.4,-31.62C107.13,-31.62 115.26,-31.62 123.39,-31.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="123.34,-35.13 133.34,-31.63 123.34,-28.13 123.34,-35.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="378,-19.25 294.5,-19.25 294.5,0 378,0 378,-19.25"/>
|
||||
<text text-anchor="middle" x="336.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge3_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M99.4,-8.28C111.14,-8.01 123.64,-7.76 135.25,-7.62 190.02,-6.98 203.73,-6.91 258.5,-7.62 266.38,-7.73 274.72,-7.89 282.88,-8.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="282.63,-11.57 292.71,-8.32 282.8,-4.58 282.63,-11.57"/>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge4_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M78.8,-21.52C95.06,-16.22 116.04,-10.3 135.25,-7.62 184.87,-0.73 242.07,-2.24 282.56,-4.87"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="282.31,-8.36 292.53,-5.57 282.8,-1.38 282.31,-8.36"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3_Node000003_Node000004" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M258.93,-21.85C266.92,-20.57 275.05,-19.27 282.89,-18.01"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-21.49 292.6,-16.46 282.17,-14.58 283.28,-21.49"/>
|
||||
</a>
|
||||
|
Before Width: | Height: | Size: 3.8 KiB After Width: | Height: | Size: 4.8 KiB |
@@ -0,0 +1,85 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
|
||||
-->
|
||||
<!-- Title: string_search::kmp Pages: 1 -->
|
||||
<svg width="386pt" height="92pt"
|
||||
viewBox="0.00 0.00 386.00 92.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 88.25)">
|
||||
<title>string_search::kmp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="KMP algorithm to find a pattern in a text.">
|
||||
<polygon fill="#999999" stroke="#666666" points="99.25,-41.25 0,-41.25 0,-22 99.25,-22 99.25,-41.25"/>
|
||||
<text text-anchor="middle" x="49.62" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::kmp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="243.12,-84.25 150.62,-84.25 150.62,-65 243.12,-65 243.12,-84.25"/>
|
||||
<text text-anchor="middle" x="196.88" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::empty</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M84.68,-41.71C104.46,-47.56 129.61,-55.01 150.99,-61.34"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="149.75,-64.62 160.33,-64.1 151.74,-57.91 149.75,-64.62"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:href="../../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9" target="_top" xlink:title="Generate the partial match table aka failure function for a pattern to search.">
|
||||
<polygon fill="white" stroke="#666666" points="258.5,-46.88 135.25,-46.88 135.25,-16.38 258.5,-16.38 258.5,-46.88"/>
|
||||
<text text-anchor="start" x="143.25" y="-33.38" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::getFailure</text>
|
||||
<text text-anchor="middle" x="196.88" y="-22.12" font-family="Helvetica,sans-Serif" font-size="10.00">Array</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M99.4,-31.62C107.13,-31.62 115.26,-31.62 123.39,-31.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="123.34,-35.13 133.34,-31.63 123.34,-28.13 123.34,-35.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="378,-19.25 294.5,-19.25 294.5,0 378,0 378,-19.25"/>
|
||||
<text text-anchor="middle" x="336.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge4_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M78.8,-21.52C95.06,-16.22 116.04,-10.3 135.25,-7.62 184.87,-0.73 242.07,-2.24 282.56,-4.87"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="282.31,-8.36 292.53,-5.57 282.8,-1.38 282.31,-8.36"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3_Node000003_Node000004" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M258.93,-21.85C266.92,-20.57 275.05,-19.27 282.89,-18.01"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-21.49 292.6,-16.46 282.17,-14.58 283.28,-21.49"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 4.0 KiB |
@@ -1,8 +0,0 @@
|
||||
<map id="string_search::kmp" name="string_search::kmp">
|
||||
<area shape="rect" id="Node000001" title=" " alt="" coords="5,42,138,68"/>
|
||||
<area shape="rect" id="Node000002" href="$d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f" title=" " alt="" coords="186,5,350,46"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,43,170,38,171,43,138,48"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="398,42,509,68"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="138,54,186,55,350,55,382,54,383,60,350,60,186,60,138,59"/>
|
||||
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="351,36,383,41,382,46,350,41"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
4cf29237722466aee5589d8e734c0bd8
|
||||
@@ -1,67 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
|
||||
-->
|
||||
<!-- Title: string_search::kmp Pages: 1 -->
|
||||
<svg width="386pt" height="55pt"
|
||||
viewBox="0.00 0.00 386.00 54.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 50.88)">
|
||||
<title>string_search::kmp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title=" ">
|
||||
<polygon fill="#999999" stroke="#666666" points="99.25,-19.25 0,-19.25 0,0 99.25,0 99.25,-19.25"/>
|
||||
<text text-anchor="middle" x="49.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::kmp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="258.5,-46.88 135.25,-46.88 135.25,-16.38 258.5,-16.38 258.5,-46.88"/>
|
||||
<text text-anchor="start" x="143.25" y="-33.38" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::getFailure</text>
|
||||
<text text-anchor="middle" x="196.88" y="-22.12" font-family="Helvetica,sans-Serif" font-size="10.00">Array</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M99.4,-17.01C107.21,-18.2 115.45,-19.44 123.68,-20.69"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="122.94,-24.12 133.35,-22.16 123.99,-17.2 122.94,-24.12"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="378,-19.25 294.5,-19.25 294.5,0 378,0 378,-19.25"/>
|
||||
<text text-anchor="middle" x="336.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge3_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M99.4,-8.28C111.14,-8.01 123.64,-7.76 135.25,-7.62 190.02,-6.98 203.73,-6.91 258.5,-7.62 266.38,-7.73 274.72,-7.89 282.88,-8.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="282.63,-11.57 292.71,-8.32 282.8,-4.58 282.63,-11.57"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M258.93,-21.85C266.92,-20.57 275.05,-19.27 282.89,-18.01"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-21.49 292.6,-16.46 282.17,-14.58 283.28,-21.49"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 3.1 KiB |
@@ -1,5 +1,5 @@
|
||||
<map id="string_search::getFailureArray" name="string_search::getFailureArray">
|
||||
<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,170,46"/>
|
||||
<area shape="rect" id="Node000001" title="Generate the partial match table aka failure function for a pattern to search." alt="" coords="5,5,170,46"/>
|
||||
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="218,13,329,38"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="170,23,202,23,202,28,170,28"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
aacc61ad292505fe3ad654744089729c
|
||||
@@ -22,7 +22,7 @@
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title=" ">
|
||||
<g id="a_Node000001"><a xlink:title="Generate the partial match table aka failure function for a pattern to search.">
|
||||
<polygon fill="#999999" stroke="#666666" points="123.25,-30.5 0,-30.5 0,0 123.25,0 123.25,-30.5"/>
|
||||
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::getFailure</text>
|
||||
<text text-anchor="middle" x="61.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Array</text>
|
||||
|
Before Width: | Height: | Size: 2.6 KiB After Width: | Height: | Size: 2.7 KiB |
@@ -11,7 +11,7 @@
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title=" ">
|
||||
<g id="a_Node000001"><a xlink:title="Generate the partial match table aka failure function for a pattern to search.">
|
||||
<polygon fill="#999999" stroke="#666666" points="123.25,-30.5 0,-30.5 0,0 123.25,0 123.25,-30.5"/>
|
||||
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::getFailure</text>
|
||||
<text text-anchor="middle" x="61.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Array</text>
|
||||
|
Before Width: | Height: | Size: 1.8 KiB After Width: | Height: | Size: 1.9 KiB |
@@ -1 +0,0 @@
|
||||
b08fb38803642b5804f24dd7eaa948cd
|
||||
@@ -1,9 +1,11 @@
|
||||
<map id="strings/knuth_morris_pratt.cpp" name="strings/knuth_morris_pratt.cpp">
|
||||
<area shape="rect" id="Node000001" title="The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m..." alt="" coords="61,5,200,46"/>
|
||||
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,77,120"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="110,48,68,86,64,82,106,44"/>
|
||||
<area shape="rect" id="Node000003" title=" " alt="" coords="100,94,160,120"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="133,46,133,78,128,78,128,46"/>
|
||||
<area shape="rect" id="Node000004" title=" " alt="" coords="184,94,242,120"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="153,44,191,81,187,85,149,48"/>
|
||||
<area shape="rect" id="Node000001" title="The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m..." alt="" coords="102,5,242,46"/>
|
||||
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,70,120"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="140,49,73,88,70,83,137,44"/>
|
||||
<area shape="rect" id="Node000003" title=" " alt="" coords="94,94,165,120"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="164,48,146,81,141,79,159,45"/>
|
||||
<area shape="rect" id="Node000004" title=" " alt="" coords="190,94,243,120"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="185,45,204,79,200,82,181,48"/>
|
||||
<area shape="rect" id="Node000005" title=" " alt="" coords="268,94,325,120"/>
|
||||
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="204,44,266,83,263,88,201,49"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
ffd255eb2c3864eb7b8df9f423dc3829
|
||||
5c4cdc830a1253716000cdd08d698c5d
|
||||
@@ -4,8 +4,8 @@
|
||||
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
|
||||
-->
|
||||
<!-- Title: strings/knuth_morris_pratt.cpp Pages: 1 -->
|
||||
<svg width="185pt" height="94pt"
|
||||
viewBox="0.00 0.00 185.25 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="248pt" height="94pt"
|
||||
viewBox="0.00 0.00 247.62 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
||||
|
||||
@@ -23,9 +23,9 @@
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m...">
|
||||
<polygon fill="#999999" stroke="#666666" points="146,-85.75 41.5,-85.75 41.5,-55.25 146,-55.25 146,-85.75"/>
|
||||
<text text-anchor="start" x="49.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">strings/knuth_morris</text>
|
||||
<text text-anchor="middle" x="93.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_pratt.cpp</text>
|
||||
<polygon fill="#999999" stroke="#666666" points="177.38,-85.75 72.88,-85.75 72.88,-55.25 177.38,-55.25 177.38,-85.75"/>
|
||||
<text text-anchor="start" x="80.88" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">strings/knuth_morris</text>
|
||||
<text text-anchor="middle" x="125.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_pratt.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -33,8 +33,8 @@
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
|
||||
<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
|
||||
<text text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -42,8 +42,8 @@
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M77.19,-54.95C67.58,-46.5 55.44,-35.83 45.48,-27.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="48.04,-24.67 38.22,-20.7 43.42,-29.93 48.04,-24.67"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M99.9,-54.8C84.52,-45.83 64.92,-34.41 49.51,-25.42"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="51.32,-22.43 40.92,-20.42 47.8,-28.48 51.32,-22.43"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -51,8 +51,8 @@
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="116.38,-19.25 71.12,-19.25 71.12,0 116.38,0 116.38,-19.25"/>
|
||||
<text text-anchor="middle" x="93.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstring</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="119.88,-19.25 66.38,-19.25 66.38,0 119.88,0 119.88,-19.25"/>
|
||||
<text text-anchor="middle" x="93.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -60,8 +60,8 @@
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M93.75,-54.95C93.75,-47.71 93.75,-38.84 93.75,-30.94"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="97.25,-31.21 93.75,-21.21 90.25,-31.21 97.25,-31.21"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M117.21,-54.95C113.09,-47.36 108,-37.99 103.56,-29.82"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="106.63,-28.15 98.78,-21.03 100.48,-31.49 106.63,-28.15"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -69,8 +69,8 @@
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="177.25,-19.25 134.25,-19.25 134.25,0 177.25,0 177.25,-19.25"/>
|
||||
<text text-anchor="middle" x="155.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="178.12,-19.25 138.12,-19.25 138.12,0 178.12,0 178.12,-19.25"/>
|
||||
<text text-anchor="middle" x="158.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">string</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -78,8 +78,26 @@
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M109.08,-54.95C117.79,-46.67 128.75,-36.27 137.85,-27.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.25,-30.17 145.09,-20.74 135.43,-25.09 140.25,-30.17"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M133.28,-54.95C137.58,-47.28 142.91,-37.77 147.52,-29.54"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="150.46,-31.46 152.3,-21.02 144.36,-28.03 150.46,-31.46"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="239.62,-19.25 196.62,-19.25 196.62,0 239.62,0 239.62,-19.25"/>
|
||||
<text text-anchor="middle" x="218.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4_Node000001_Node000005" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M148.11,-54.95C162.14,-46.07 180.03,-34.74 194.22,-25.76"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.93,-28.82 202.51,-20.51 192.19,-22.9 195.93,-28.82"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 4.0 KiB After Width: | Height: | Size: 4.8 KiB |
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
|
||||
-->
|
||||
<!-- Title: strings/knuth_morris_pratt.cpp Pages: 1 -->
|
||||
<svg width="185pt" height="94pt"
|
||||
viewBox="0.00 0.00 185.25 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="248pt" height="94pt"
|
||||
viewBox="0.00 0.00 247.62 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.75)">
|
||||
<title>strings/knuth_morris_pratt.cpp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m...">
|
||||
<polygon fill="#999999" stroke="#666666" points="146,-85.75 41.5,-85.75 41.5,-55.25 146,-55.25 146,-85.75"/>
|
||||
<text text-anchor="start" x="49.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">strings/knuth_morris</text>
|
||||
<text text-anchor="middle" x="93.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_pratt.cpp</text>
|
||||
<polygon fill="#999999" stroke="#666666" points="177.38,-85.75 72.88,-85.75 72.88,-55.25 177.38,-55.25 177.38,-85.75"/>
|
||||
<text text-anchor="start" x="80.88" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">strings/knuth_morris</text>
|
||||
<text text-anchor="middle" x="125.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_pratt.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -22,8 +22,8 @@
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
|
||||
<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
|
||||
<text text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -31,8 +31,8 @@
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M77.19,-54.95C67.58,-46.5 55.44,-35.83 45.48,-27.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="48.04,-24.67 38.22,-20.7 43.42,-29.93 48.04,-24.67"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M99.9,-54.8C84.52,-45.83 64.92,-34.41 49.51,-25.42"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="51.32,-22.43 40.92,-20.42 47.8,-28.48 51.32,-22.43"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -40,8 +40,8 @@
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="116.38,-19.25 71.12,-19.25 71.12,0 116.38,0 116.38,-19.25"/>
|
||||
<text text-anchor="middle" x="93.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstring</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="119.88,-19.25 66.38,-19.25 66.38,0 119.88,0 119.88,-19.25"/>
|
||||
<text text-anchor="middle" x="93.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -49,8 +49,8 @@
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M93.75,-54.95C93.75,-47.71 93.75,-38.84 93.75,-30.94"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="97.25,-31.21 93.75,-21.21 90.25,-31.21 97.25,-31.21"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M117.21,-54.95C113.09,-47.36 108,-37.99 103.56,-29.82"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="106.63,-28.15 98.78,-21.03 100.48,-31.49 106.63,-28.15"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -58,8 +58,8 @@
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="177.25,-19.25 134.25,-19.25 134.25,0 177.25,0 177.25,-19.25"/>
|
||||
<text text-anchor="middle" x="155.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="178.12,-19.25 138.12,-19.25 138.12,0 178.12,0 178.12,-19.25"/>
|
||||
<text text-anchor="middle" x="158.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">string</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -67,8 +67,26 @@
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M109.08,-54.95C117.79,-46.67 128.75,-36.27 137.85,-27.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.25,-30.17 145.09,-20.74 135.43,-25.09 140.25,-30.17"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M133.28,-54.95C137.58,-47.28 142.91,-37.77 147.52,-29.54"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="150.46,-31.46 152.3,-21.02 144.36,-28.03 150.46,-31.46"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="239.62,-19.25 196.62,-19.25 196.62,0 239.62,0 239.62,-19.25"/>
|
||||
<text text-anchor="middle" x="218.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4_Node000001_Node000005" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M148.11,-54.95C162.14,-46.07 180.03,-34.74 194.22,-25.76"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.93,-28.82 202.51,-20.51 192.19,-22.9 195.93,-28.82"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.3 KiB After Width: | Height: | Size: 4.0 KiB |
@@ -113,13 +113,14 @@ $(function(){initNavTree('de/d6a/knuth__morris__pratt_8cpp.html','../../'); init
|
||||
|
||||
<p>The <a href="https://en.wikipedia.org/wiki/Knuth–Morris–Pratt_algorithm" target="_blank">Knuth-Morris-Pratt Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m)
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <iostream></code><br />
|
||||
<code>#include <cstring></code><br />
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <string></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for knuth_morris_pratt.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d69/knuth__morris__pratt_8cpp__incl.svg" width="247" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d69/knuth__morris__pratt_8cpp__incl.svg" width="331" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
</div><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
@@ -130,10 +131,15 @@ Namespaces</h2></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:a996573527312d5255e1495b879e8a34f" id="r_a996573527312d5255e1495b879e8a34f"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f">string_search::getFailureArray</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &pattern)</td></tr>
|
||||
<tr class="separator:a996573527312d5255e1495b879e8a34f"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a26a58225ce7d3fa9d4c2f5349a65ed93" id="r_a26a58225ce7d3fa9d4c2f5349a65ed93"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93">string_search::kmp</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &pattern, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &text)</td></tr>
|
||||
<tr class="separator:a26a58225ce7d3fa9d4c2f5349a65ed93"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a83c72ff237cdf623e42d4295e0029bf9" id="r_a83c72ff237cdf623e42d4295e0029bf9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9">string_search::getFailureArray</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &pattern)</td></tr>
|
||||
<tr class="memdesc:a83c72ff237cdf623e42d4295e0029bf9"><td class="mdescLeft"> </td><td class="mdescRight">Generate the partial match table aka failure function for a pattern to search. <br /></td></tr>
|
||||
<tr class="separator:a83c72ff237cdf623e42d4295e0029bf9"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a1e37af2f023495129cb57338c801209e" id="r_a1e37af2f023495129cb57338c801209e"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e">string_search::kmp</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &pattern, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &text)</td></tr>
|
||||
<tr class="memdesc:a1e37af2f023495129cb57338c801209e"><td class="mdescLeft"> </td><td class="mdescRight">KMP algorithm to find a pattern in a text. <br /></td></tr>
|
||||
<tr class="separator:a1e37af2f023495129cb57338c801209e"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
|
||||
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft"> </td><td class="mdescRight">self-test implementations <br /></td></tr>
|
||||
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2"> </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="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
@@ -141,7 +147,8 @@ Functions</h2></td></tr>
|
||||
<div class="textblock"><p>The <a href="https://en.wikipedia.org/wiki/Knuth–Morris–Pratt_algorithm" target="_blank">Knuth-Morris-Pratt Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) </p>
|
||||
<ol type="1">
|
||||
<li>Preprocess pattern to identify any suffixes that are identical to prefixes. This tells us where to continue from if we get a mismatch between a character in our pattern and the text.</li>
|
||||
<li>Step through the text one character at a time and compare it to a character in the pattern updating our location within the pattern if necessary </li>
|
||||
<li>Step through the text one character at a time and compare it to a character in the pattern updating our location within the pattern if necessary <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Yancey2023" target="_blank">Yancey</a> </dd></dl>
|
||||
</li>
|
||||
</ol>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
@@ -158,36 +165,52 @@ Functions</h2></td></tr>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Main function </p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 76</span> {</div>
|
||||
<div class="line"><span class="lineno"> 77</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text = <span class="stringliteral">"alskfjaldsabc1abc1abc12k23adsfabcabc"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 78</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> pattern = <span class="stringliteral">"abc1abc12l"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 79</span> </div>
|
||||
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">if</span> (kmp(pattern, text) == <span class="keyword">true</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 81</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Found"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 82</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 83</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Not Found"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 84</span> }</div>
|
||||
<div class="line"><span class="lineno"> 85</span> </div>
|
||||
<div class="line"><span class="lineno"> 86</span> text = <span class="stringliteral">"abcabc"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 87</span> pattern = <span class="stringliteral">"bca"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">if</span> (kmp(pattern, text) == <span class="keyword">true</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 89</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Found"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 90</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 91</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Not Found"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 92</span> }</div>
|
||||
<div class="line"><span class="lineno"> 93</span> </div>
|
||||
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 95</span>}</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
|
||||
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 95</span> {</div>
|
||||
<div class="line"><span class="lineno"> 96</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
|
||||
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 98</span>}</div>
|
||||
<div class="ttc" id="aknuth__morris__pratt_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self-test implementations</div><div class="ttdef"><b>Definition</b> knuth_morris_pratt.cpp:79</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">◆ </a></span>tests()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">static void tests </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>self-test implementations </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 79</span> {</div>
|
||||
<div class="line"><span class="lineno"> 80</span> assert(kmp(<span class="stringliteral">"abc1abc12l"</span>, <span class="stringliteral">"alskfjaldsabc1abc1abc12k2"</span>) == std::string::npos);</div>
|
||||
<div class="line"><span class="lineno"> 81</span> assert(kmp(<span class="stringliteral">"bca"</span>, <span class="stringliteral">"abcabc"</span>) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 82</span> assert(kmp(<span class="stringliteral">"World"</span>, <span class="stringliteral">"helloWorld"</span>) == 5);</div>
|
||||
<div class="line"><span class="lineno"> 83</span> assert(kmp(<span class="stringliteral">"c++"</span>, <span class="stringliteral">"his_is_c++"</span>) == 7);</div>
|
||||
<div class="line"><span class="lineno"> 84</span> assert(kmp(<span class="stringliteral">"happy"</span>, <span class="stringliteral">"happy_coding"</span>) == 0);</div>
|
||||
<div class="line"><span class="lineno"> 85</span> assert(kmp(<span class="stringliteral">""</span>, <span class="stringliteral">"pattern is empty"</span>) == 0);</div>
|
||||
<div class="line"><span class="lineno"> 86</span> </div>
|
||||
<div class="line"><span class="lineno"> 87</span> <span class="comment">// this lets the user know that the tests have passed</span></div>
|
||||
<div class="line"><span class="lineno"> 88</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"All KMP algorithm tests have successfully passed!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 89</span>}</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
var knuth__morris__pratt_8cpp =
|
||||
[
|
||||
[ "getFailureArray", "de/d6a/knuth__morris__pratt_8cpp.html#a996573527312d5255e1495b879e8a34f", null ],
|
||||
[ "kmp", "de/d6a/knuth__morris__pratt_8cpp.html#a26a58225ce7d3fa9d4c2f5349a65ed93", null ],
|
||||
[ "main", "de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ]
|
||||
[ "getFailureArray", "de/d6a/knuth__morris__pratt_8cpp.html#a83c72ff237cdf623e42d4295e0029bf9", null ],
|
||||
[ "kmp", "de/d6a/knuth__morris__pratt_8cpp.html#a1e37af2f023495129cb57338c801209e", null ],
|
||||
[ "tests", "de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ]
|
||||
];
|
||||
@@ -1,5 +0,0 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
|
||||
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
fa87532068062fd8189cade55ca11658
|
||||
@@ -1,65 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="135pt" height="27pt"
|
||||
viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
||||
|
||||
<style type="text/css"><![CDATA[
|
||||
.node, .edge {opacity: 0.7;}
|
||||
.node.selected, .edge.selected {opacity: 1;}
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
|
||||
<title>main</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title=" ">
|
||||
<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
|
||||
<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
|
||||
<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
||||
<style type='text/css'>
|
||||
<![CDATA[
|
||||
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
||||
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
||||
]]>
|
||||
</style>
|
||||
<script type="application/ecmascript"><![CDATA[
|
||||
document.addEventListener('DOMContentLoaded', (event) => {
|
||||
highlightEdges();
|
||||
highlightAdjacentNodes();
|
||||
});
|
||||
]]></script>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 2.4 KiB |
@@ -1,39 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="135pt" height="27pt"
|
||||
viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
|
||||
<title>main</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title=" ">
|
||||
<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
|
||||
<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
|
||||
<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 1.6 KiB |
@@ -2618,10 +2618,10 @@
|
||||
<a href="d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84"/>
|
||||
<a href="d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
|
||||
<a href="d9/d03/namespacestring__search.html"/>
|
||||
<a href="d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e"/>
|
||||
<a href="d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9"/>
|
||||
<a href="d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93"/>
|
||||
<a href="d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9"/>
|
||||
<a href="d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8"/>
|
||||
<a href="d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f"/>
|
||||
<a href="d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8"/>
|
||||
<a href="d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd"/>
|
||||
<a href="d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893"/>
|
||||
@@ -3659,9 +3659,9 @@
|
||||
<a href="de/d5b/namespacebacktracking_1_1sudoku__solver.html#ab040a12d7684cd85fb3684f4211ea5ac"/>
|
||||
<a href="de/d5b/namespacebacktracking_1_1sudoku__solver.html#ac911c8bca8556206ff64461b2424866b"/>
|
||||
<a href="de/d6a/knuth__morris__pratt_8cpp.html"/>
|
||||
<a href="de/d6a/knuth__morris__pratt_8cpp.html#a26a58225ce7d3fa9d4c2f5349a65ed93"/>
|
||||
<a href="de/d6a/knuth__morris__pratt_8cpp.html#a996573527312d5255e1495b879e8a34f"/>
|
||||
<a href="de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
|
||||
<a href="de/d6a/knuth__morris__pratt_8cpp.html#a1e37af2f023495129cb57338c801209e"/>
|
||||
<a href="de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"/>
|
||||
<a href="de/d6a/knuth__morris__pratt_8cpp.html#a83c72ff237cdf623e42d4295e0029bf9"/>
|
||||
<a href="de/d6b/namespacerandom__pivot__quick__sort.html"/>
|
||||
<a href="de/d72/geometric__dist_8cpp.html"/>
|
||||
<a href="de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6"/>
|
||||
|
||||
File diff suppressed because one or more lines are too long
@@ -145,7 +145,7 @@ $(function(){initNavTree('globals_func_t.html',''); initResizable(true); });
|
||||
<li>test_longest_common_string_length_for_reversed_inputs() : <a class="el" href="da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe">longest_common_string.cpp</a></li>
|
||||
<li>test_longest_common_string_length_is_symmetric() : <a class="el" href="da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">longest_common_string.cpp</a></li>
|
||||
<li>test_remove() : <a class="el" href="df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">binary_search_tree2.cpp</a></li>
|
||||
<li>tests() : <a class="el" href="d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">armstrong_number.cpp</a>, <a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">dijkstra.cpp</a>, <a class="el" href="d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">approximate_pi.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">fenwick_tree.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a></li>
|
||||
<li>tests() : <a class="el" href="d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">armstrong_number.cpp</a>, <a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">dijkstra.cpp</a>, <a class="el" href="d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">approximate_pi.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">fenwick_tree.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a>, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">knuth_morris_pratt.cpp</a></li>
|
||||
<li>TH() : <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a></li>
|
||||
<li>tolowerRoman() : <a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">decimal_to_roman_numeral.cpp</a></li>
|
||||
<li>toupperRoman() : <a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">decimal_to_roman_numeral.cpp</a></li>
|
||||
|
||||
File diff suppressed because one or more lines are too long
@@ -146,7 +146,7 @@ $(function(){initNavTree('globals_t.html',''); initResizable(true); });
|
||||
<li>test_longest_common_string_length_is_symmetric() : <a class="el" href="da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">longest_common_string.cpp</a></li>
|
||||
<li>test_remove() : <a class="el" href="df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">binary_search_tree2.cpp</a></li>
|
||||
<li>test_set : <a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">brute_force_string_searching.cpp</a></li>
|
||||
<li>tests() : <a class="el" href="d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">armstrong_number.cpp</a>, <a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">dijkstra.cpp</a>, <a class="el" href="d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">approximate_pi.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">fenwick_tree.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a></li>
|
||||
<li>tests() : <a class="el" href="d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">armstrong_number.cpp</a>, <a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">dijkstra.cpp</a>, <a class="el" href="d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">approximate_pi.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">fenwick_tree.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a>, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">knuth_morris_pratt.cpp</a></li>
|
||||
<li>TH() : <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a></li>
|
||||
<li>tolowerRoman() : <a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">decimal_to_roman_numeral.cpp</a></li>
|
||||
<li>toupperRoman() : <a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">decimal_to_roman_numeral.cpp</a></li>
|
||||
|
||||
@@ -176,7 +176,7 @@ $(function(){initNavTree('namespacemembers_func.html',''); initResizable(true);
|
||||
<li>get_shape() : <a class="el" href="d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">machine_learning</a></li>
|
||||
<li>get_union() : <a class="el" href="da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">operations_on_datastructures</a></li>
|
||||
<li>getConnectedComponents() : <a class="el" href="df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph</a></li>
|
||||
<li>getFailureArray() : <a class="el" href="d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f">string_search</a></li>
|
||||
<li>getFailureArray() : <a class="el" href="d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9">string_search</a></li>
|
||||
<li>gnomeSort() : <a class="el" href="d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting</a></li>
|
||||
</ul>
|
||||
|
||||
@@ -214,7 +214,7 @@ $(function(){initNavTree('namespacemembers_func.html',''); initResizable(true);
|
||||
|
||||
<h3><a id="index_k" name="index_k"></a>- k -</h3><ul>
|
||||
<li>kelvin_to_celsius() : <a class="el" href="d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others</a></li>
|
||||
<li>kmp() : <a class="el" href="d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93">string_search</a></li>
|
||||
<li>kmp() : <a class="el" href="d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e">string_search</a></li>
|
||||
<li>kohonen_som() : <a class="el" href="d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576">machine_learning</a></li>
|
||||
<li>kohonen_som_tracer() : <a class="el" href="d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3">machine_learning</a></li>
|
||||
</ul>
|
||||
|
||||
@@ -111,7 +111,7 @@ $(function(){initNavTree('namespacemembers_g.html',''); initResizable(true); });
|
||||
<li>get_shape() : <a class="el" href="d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">machine_learning</a></li>
|
||||
<li>get_union() : <a class="el" href="da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">operations_on_datastructures</a></li>
|
||||
<li>getConnectedComponents() : <a class="el" href="df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph</a></li>
|
||||
<li>getFailureArray() : <a class="el" href="d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f">string_search</a></li>
|
||||
<li>getFailureArray() : <a class="el" href="d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9">string_search</a></li>
|
||||
<li>gnomeSort() : <a class="el" href="d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -108,7 +108,7 @@ $(function(){initNavTree('namespacemembers_k.html',''); initResizable(true); });
|
||||
|
||||
<h3><a id="index_k" name="index_k"></a>- k -</h3><ul>
|
||||
<li>kelvin_to_celsius() : <a class="el" href="d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others</a></li>
|
||||
<li>kmp() : <a class="el" href="d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93">string_search</a></li>
|
||||
<li>kmp() : <a class="el" href="d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e">string_search</a></li>
|
||||
<li>kohonen_som() : <a class="el" href="d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576">machine_learning</a></li>
|
||||
<li>kohonen_som_tracer() : <a class="el" href="d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3">machine_learning</a></li>
|
||||
</ul>
|
||||
|
||||
@@ -162,8 +162,8 @@ var namespaces_dup =
|
||||
[ "brute_force", "d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8", null ],
|
||||
[ "check_if_equal", "d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd", null ],
|
||||
[ "create_hash", "d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8", null ],
|
||||
[ "getFailureArray", "d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f", null ],
|
||||
[ "kmp", "d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93", null ],
|
||||
[ "getFailureArray", "d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9", null ],
|
||||
[ "kmp", "d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e", null ],
|
||||
[ "rabin_karp", "d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9", null ],
|
||||
[ "recalculate_hash", "d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893", null ]
|
||||
] ],
|
||||
|
||||
@@ -35,9 +35,9 @@ var NAVTREEINDEX13 =
|
||||
"de/d4a/class_compare.html":[10,0,24],
|
||||
"de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c":[10,0,24,0],
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html":[11,0,23,3],
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#a26a58225ce7d3fa9d4c2f5349a65ed93":[11,0,23,3,1],
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#a996573527312d5255e1495b879e8a34f":[11,0,23,3,0],
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,3,2],
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#a1e37af2f023495129cb57338c801209e":[11,0,23,3,1],
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,23,3,2],
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#a83c72ff237cdf623e42d4295e0029bf9":[11,0,23,3,0],
|
||||
"de/d6b/namespacerandom__pivot__quick__sort.html":[9,0,94],
|
||||
"de/d72/geometric__dist_8cpp.html":[11,0,19,3],
|
||||
"de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6":[11,0,19,3,3],
|
||||
|
||||
@@ -238,10 +238,10 @@ var NAVTREEINDEX8 =
|
||||
"d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84":[11,0,21,6,0],
|
||||
"d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,6,1],
|
||||
"d9/d03/namespacestring__search.html":[9,0,114],
|
||||
"d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e":[9,0,114,4],
|
||||
"d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9":[9,0,114,5],
|
||||
"d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93":[9,0,114,4],
|
||||
"d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9":[9,0,114,3],
|
||||
"d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8":[9,0,114,2],
|
||||
"d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f":[9,0,114,3],
|
||||
"d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8":[9,0,114,0],
|
||||
"d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd":[9,0,114,1],
|
||||
"d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893":[9,0,114,6],
|
||||
|
||||
@@ -15,7 +15,7 @@ var searchData=
|
||||
['key_5feq_12',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()']]],
|
||||
['kill_5fdependency_13',['kill_dependency',['http://en.cppreference.com/w/cpp/atomic/kill_dependency.html',0,'std']]],
|
||||
['kilo_14',['kilo',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
|
||||
['kmp_15',['kmp',['../d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93',1,'string_search']]],
|
||||
['kmp_15',['kmp',['../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e',1,'string_search']]],
|
||||
['knapsack_16',['Knapsack',['../d7/daf/namespace_knapsack.html',1,'']]],
|
||||
['knight_5ftour_17',['knight_tour',['../d1/db6/namespaceknight__tour.html',1,'']]],
|
||||
['knight_5ftour_2ecpp_18',['knight_tour.cpp',['../d1/d2a/knight__tour_8cpp.html',1,'']]],
|
||||
|
||||
File diff suppressed because one or more lines are too long
@@ -69,7 +69,7 @@ var searchData=
|
||||
['testcase_5f2_66',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]],
|
||||
['testcase_5f3_67',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]],
|
||||
['testcases_68',['TestCases',['../d5/d58/class_test_cases.html',1,'']]],
|
||||
['tests_69',['tests',['../d9/df4/namespacetests.html',1,'tests'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp']]],
|
||||
['tests_69',['tests',['../d9/df4/namespacetests.html',1,'tests'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): knuth_morris_pratt.cpp']]],
|
||||
['text_5fsearch_2ecpp_70',['text_search.cpp',['../dc/db5/text__search_8cpp.html',1,'']]],
|
||||
['tgamma_71',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]],
|
||||
['th_72',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]],
|
||||
|
||||
@@ -87,7 +87,7 @@ var searchData=
|
||||
['getconvexhull_84',['getConvexHull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1',1,'geometry::jarvis::Convexhull']]],
|
||||
['getcount_85',['GetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06',1,'data_structures::tree_234::Node']]],
|
||||
['getenv_86',['getenv',['http://en.cppreference.com/w/cpp/utility/program/getenv.html',0,'std']]],
|
||||
['getfailurearray_87',['getFailureArray',['../d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f',1,'string_search']]],
|
||||
['getfailurearray_87',['getFailureArray',['../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9',1,'string_search']]],
|
||||
['gethits_88',['getHits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933',1,'others::lru_cache::LRUCache']]],
|
||||
['getinordersuccessor_89',['getInorderSuccessor',['../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
|
||||
['getitem_90',['GetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3',1,'data_structures::tree_234::Node']]],
|
||||
|
||||
@@ -52,7 +52,7 @@ var searchData=
|
||||
['testcase_5f1_49',['testCase_1',['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()']]],
|
||||
['testcase_5f2_50',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]],
|
||||
['testcase_5f3_51',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]],
|
||||
['tests_52',['tests',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp']]],
|
||||
['tests_52',['tests',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): knuth_morris_pratt.cpp']]],
|
||||
['tgamma_53',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]],
|
||||
['th_54',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]],
|
||||
['thousands_5fsep_55',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]],
|
||||
|
||||
@@ -74,7 +74,7 @@ var searchData=
|
||||
['getconvexhull_71',['getConvexHull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1',1,'geometry::jarvis::Convexhull']]],
|
||||
['getcount_72',['GetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06',1,'data_structures::tree_234::Node']]],
|
||||
['getenv_73',['getenv',['http://en.cppreference.com/w/cpp/utility/program/getenv.html',0,'std']]],
|
||||
['getfailurearray_74',['getFailureArray',['../d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f',1,'string_search']]],
|
||||
['getfailurearray_74',['getFailureArray',['../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9',1,'string_search']]],
|
||||
['gethits_75',['getHits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933',1,'others::lru_cache::LRUCache']]],
|
||||
['getinordersuccessor_76',['getInorderSuccessor',['../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
|
||||
['getitem_77',['GetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3',1,'data_structures::tree_234::Node']]],
|
||||
|
||||
@@ -6,7 +6,7 @@ var searchData=
|
||||
['key_5fcomp_3',['key_comp',['http://en.cppreference.com/w/cpp/container/multiset/key_comp.html',0,'std::multiset::key_comp()'],['http://en.cppreference.com/w/cpp/container/set/key_comp.html',0,'std::set::key_comp()'],['http://en.cppreference.com/w/cpp/container/map/key_comp.html',0,'std::map::key_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/key_comp.html',0,'std::multimap::key_comp()']]],
|
||||
['key_5feq_4',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()']]],
|
||||
['kill_5fdependency_5',['kill_dependency',['http://en.cppreference.com/w/cpp/atomic/kill_dependency.html',0,'std']]],
|
||||
['kmp_6',['kmp',['../d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93',1,'string_search']]],
|
||||
['kmp_6',['kmp',['../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e',1,'string_search']]],
|
||||
['knn_7',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector< std::vector< double > > &X, std::vector< int > &Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &&)=default']]],
|
||||
['knuth_5fb_8',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b']]],
|
||||
['kohonen_5fsom_9',['kohonen_som',['../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576',1,'machine_learning']]],
|
||||
|
||||
File diff suppressed because one or more lines are too long
Reference in New Issue
Block a user