mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-31 01:02:46 +08:00
517 lines
34 KiB
HTML
517 lines
34 KiB
HTML
<!-- HTML header for doxygen 1.12.0-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
|
<meta name="generator" content="Doxygen 1.14.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>TheAlgorithms/C++: string_search Namespace Reference</title>
|
|
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../jquery.js"></script>
|
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
|
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
|
<script type="text/javascript">
|
|
DoxygenAwesomeDarkModeToggle.init()
|
|
</script>
|
|
<script type="text/javascript" src="../../clipboard.js"></script>
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
<script type="text/javascript" src="../../cookie.js"></script>
|
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
|
<script type="text/javascript" src="../../search/search.js"></script>
|
|
<script type="text/javascript">
|
|
window.MathJax = {
|
|
options: {
|
|
ignoreHtmlClass: 'tex2jax_ignore',
|
|
processHtmlClass: 'tex2jax_process'
|
|
},
|
|
loader: {
|
|
load: ['[tex]/ams']
|
|
},
|
|
tex: {
|
|
macros: {},
|
|
packages: ['base','configmacros','ams']
|
|
}
|
|
};
|
|
</script>
|
|
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr id="projectrow">
|
|
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
|
<td id="projectalign">
|
|
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">All the algorithms implemented in C++</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.14.0 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
</script>
|
|
<script type="text/javascript">
|
|
$(function() { codefold.init(); });
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
$(function(){initNavTree('d9/d03/namespacestring__search.html','../../',''); });
|
|
</script>
|
|
<div id="container">
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">string_search Namespace Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p>String search algorithms.
|
|
<a href="#details">More...</a></p>
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem: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 std::string &text, const std::string &pattern)</td></tr>
|
|
<tr class="memitem:a83c72ff237cdf623e42d4295e0029bf9" id="r_a83c72ff237cdf623e42d4295e0029bf9"><td class="memItemLeft" align="right" valign="top">std::vector< size_t > </td><td class="memItemRight" valign="bottom"><a class="el" href="#a83c72ff237cdf623e42d4295e0029bf9">getFailureArray</a> (const std::string &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="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 std::string &pattern, const std::string &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="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 std::string &s, int n)</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 std::string &s, int old_index, int new_index, int64_t old_hash, int patLength)</td></tr>
|
|
<tr class="memitem:aebe07cea289a13142503d98be7df11fd" id="r_aebe07cea289a13142503d98be7df11fd"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#aebe07cea289a13142503d98be7df11fd">check_if_equal</a> (const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2)</td></tr>
|
|
<tr class="memitem:a21c673d56cbf67b1d2ee4d869185b7d9" id="r_a21c673d56cbf67b1d2ee4d869185b7d9"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#a21c673d56cbf67b1d2ee4d869185b7d9">rabin_karp</a> (const std::string &str, const std::string &pat)</td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p>String search algorithms. </p>
|
|
<p>for assert for IO operations for std::string for std::vector </p>
|
|
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
|
|
<a id="aeb2cd81064717aedd62bfb096b1a73d8" name="aeb2cd81064717aedd62bfb096b1a73d8"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aeb2cd81064717aedd62bfb096b1a73d8">◆ </a></span>brute_force()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int string_search::brute_force </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::string &</td> <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const std::string &</td> <td class="paramname"><span class="paramname"><em>pattern</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Find a pattern in a string by comparing the pattern to every substring. </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">text</td><td>Any string that might contain the pattern. </td></tr>
|
|
<tr><td class="paramname">pattern</td><td>String that we are searching for. </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>Index where the pattern starts in the text </dd>
|
|
<dd>
|
|
-1 if the pattern was not found. </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d3/d7d/brute__force__string__searching_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d3/d7d/brute__force__string__searching_8cpp_source.html">brute_force_string_searching.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 21</span> {</div>
|
|
<div class="line"><span class="lineno"> 22</span> <span class="keywordtype">size_t</span> pat_l = pattern.length();</div>
|
|
<div class="line"><span class="lineno"> 23</span> <span class="keywordtype">size_t</span> txt_l = text.length();</div>
|
|
<div class="line"><span class="lineno"> 24</span> <span class="keywordtype">int</span> index = -1;</div>
|
|
<div class="line"><span class="lineno"> 25</span> <span class="keywordflow">if</span> (pat_l <= txt_l) {</div>
|
|
<div class="line"><span class="lineno"> 26</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < txt_l - pat_l + 1; i++) {</div>
|
|
<div class="line"><span class="lineno"> 27</span> std::string s = text.substr(i, pat_l);</div>
|
|
<div class="line"><span class="lineno"> 28</span> <span class="keywordflow">if</span> (s == pattern) {</div>
|
|
<div class="line"><span class="lineno"> 29</span> index = i;</div>
|
|
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><span class="lineno"> 31</span> }</div>
|
|
<div class="line"><span class="lineno"> 32</span> }</div>
|
|
<div class="line"><span class="lineno"> 33</span> }</div>
|
|
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">return</span> index;</div>
|
|
<div class="line"><span class="lineno"> 35</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="aebe07cea289a13142503d98be7df11fd" name="aebe07cea289a13142503d98be7df11fd"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aebe07cea289a13142503d98be7df11fd">◆ </a></span>check_if_equal()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool string_search::check_if_equal </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::string &</td> <td class="paramname"><span class="paramname"><em>str1</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const std::string &</td> <td class="paramname"><span class="paramname"><em>str2</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>start1</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>end1</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>start2</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>end2</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>compare if two sub-strings are equal </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">str1</td><td>string pattern to search </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">str2</td><td>text in which to search </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">start1,end1</td><td>start and end indices for substring in str1 </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">start2,end2</td><td>start and end indices for substring in str2 </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd><span class="tt">true</span> if pattern was found </dd>
|
|
<dd>
|
|
<span class="tt">false</span> if pattern was not found </dd></dl>
|
|
<dl class="section note"><dt>Note</dt><dd>can this be replaced by std::string::compare? </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html">rabin_karp.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 61</span> {</div>
|
|
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">if</span> (end1 - start1 != end2 - start2) {</div>
|
|
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><span class="lineno"> 64</span> }</div>
|
|
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">while</span> (start1 <= end1 && start2 <= end2) {</div>
|
|
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">if</span> (str1[start1] != str2[start2]) {</div>
|
|
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><span class="lineno"> 68</span> }</div>
|
|
<div class="line"><span class="lineno"> 69</span> start1++;</div>
|
|
<div class="line"><span class="lineno"> 70</span> start2++;</div>
|
|
<div class="line"><span class="lineno"> 71</span> }</div>
|
|
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><span class="lineno"> 73</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a8fb0bc932ba8b582c9f4c71338d050f8" name="a8fb0bc932ba8b582c9f4c71338d050f8"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a8fb0bc932ba8b582c9f4c71338d050f8">◆ </a></span>create_hash()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int64_t string_search::create_hash </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::string &</td> <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>n</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>convert a string to an intger - called as hashing function </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">s</td><td>source of string to hash </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>length of substring to hash </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>hash integer </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html">rabin_karp.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 25</span> {</div>
|
|
<div class="line"><span class="lineno"> 26</span> int64_t result = 0;</div>
|
|
<div class="line"><span class="lineno"> 27</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; ++i) {</div>
|
|
<div class="line"><span class="lineno"> 28</span> result += (int64_t)(s[i] * (int64_t)pow(<a class="code hl_define" href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">PRIME</a>, i));</div>
|
|
<div class="line"><span class="lineno"> 29</span> }</div>
|
|
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><span class="lineno"> 31</span>}</div>
|
|
<div class="ttc" id="arabin__karp_8cpp_html_ac4add2a227a10511e0128d63952030e8"><div class="ttname"><a href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">PRIME</a></div><div class="ttdeci">#define PRIME</div><div class="ttdoc">Prime modulus for hash functions.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dce/rabin__karp_8cpp_source.html#l00016">rabin_karp.cpp:16</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<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">std::vector< size_t > string_search::getFailureArray </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::string &</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>
|
|
<table class="params">
|
|
<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>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html">knuth_morris_pratt.cpp</a>.</p>
|
|
<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.size();</div>
|
|
<div class="line"><span class="lineno"> 34</span> std::vector<size_t> 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><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<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">size_t string_search::kmp </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::string &</td> <td class="paramname"><span class="paramname"><em>pattern</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const std::string &</td> <td class="paramname"><span class="paramname"><em>text</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>KMP algorithm to find a pattern in a text. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<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>the starting index of the pattern if found </dd>
|
|
<dd>
|
|
<span class="tt">std::string::npos</span> if not found </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html">knuth_morris_pratt.cpp</a>.</p>
|
|
<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.empty()) {</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> std::vector<size_t> failure = <a class="code hl_function" href="#a83c72ff237cdf623e42d4295e0029bf9">getFailureArray</a>(pattern);</div>
|
|
<div class="line"><span class="lineno"> 58</span> <span class="keywordtype">size_t</span> text_length = text.size();</div>
|
|
<div class="line"><span class="lineno"> 59</span> <span class="keywordtype">size_t</span> pattern_length = pattern.size();</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> <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> std::string::npos;</div>
|
|
<div class="line"><span class="lineno"> 70</span>}</div>
|
|
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
|
|
<div class="ttc" id="anamespacestring__search_html_a83c72ff237cdf623e42d4295e0029bf9"><div class="ttname"><a href="#a83c72ff237cdf623e42d4295e0029bf9">string_search::getFailureArray</a></div><div class="ttdeci">std::vector< size_t > getFailureArray(const std::string &pattern)</div><div class="ttdoc">Generate the partial match table aka failure function for a pattern to search.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d6a/knuth__morris__pratt_8cpp_source.html#l00032">knuth_morris_pratt.cpp:32</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a21c673d56cbf67b1d2ee4d869185b7d9" name="a21c673d56cbf67b1d2ee4d869185b7d9"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a21c673d56cbf67b1d2ee4d869185b7d9">◆ </a></span>rabin_karp()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int string_search::rabin_karp </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::string &</td> <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const std::string &</td> <td class="paramname"><span class="paramname"><em>pat</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Perform string pattern search using Rabin-Karp algorithm </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">str</td><td>string to search in </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">pat</td><td>pattern to search for </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>index of first occurrence of pattern </dd>
|
|
<dd>
|
|
-1 if pattern not found </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html#l00083">83</a> of file <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html">rabin_karp.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 83</span> {</div>
|
|
<div class="line"><span class="lineno"> 84</span> int64_t pat_hash = <a class="code hl_function" href="#a8fb0bc932ba8b582c9f4c71338d050f8">create_hash</a>(pat, pat.size());</div>
|
|
<div class="line"><span class="lineno"> 85</span> int64_t str_hash = <a class="code hl_function" href="#a8fb0bc932ba8b582c9f4c71338d050f8">create_hash</a>(str, pat.size());</div>
|
|
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= str.size() - pat.size(); ++i) {</div>
|
|
<div class="line"><span class="lineno"> 87</span> <span class="keywordflow">if</span> (pat_hash == str_hash &&</div>
|
|
<div class="line"><span class="lineno"> 88</span> <a class="code hl_function" href="#aebe07cea289a13142503d98be7df11fd">check_if_equal</a>(str, pat, i, i + pat.size() - 1, 0,</div>
|
|
<div class="line"><span class="lineno"> 89</span> pat.size() - 1)) {</div>
|
|
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">return</span> i;</div>
|
|
<div class="line"><span class="lineno"> 91</span> }</div>
|
|
<div class="line"><span class="lineno"> 92</span> <span class="keywordflow">if</span> (i < str.size() - pat.size()) {</div>
|
|
<div class="line"><span class="lineno"> 93</span> str_hash =</div>
|
|
<div class="line"><span class="lineno"> 94</span> <a class="code hl_function" href="#aed769d565b705a9b3e0eb1ec74088893">recalculate_hash</a>(str, i, i + pat.size(), str_hash, pat.size());</div>
|
|
<div class="line"><span class="lineno"> 95</span> }</div>
|
|
<div class="line"><span class="lineno"> 96</span> }</div>
|
|
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">return</span> -1; <span class="comment">// return -1 if given pattern not found</span></div>
|
|
<div class="line"><span class="lineno"> 98</span>}</div>
|
|
<div class="ttc" id="anamespacestring__search_html_a8fb0bc932ba8b582c9f4c71338d050f8"><div class="ttname"><a href="#a8fb0bc932ba8b582c9f4c71338d050f8">string_search::create_hash</a></div><div class="ttdeci">int64_t create_hash(const std::string &s, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dce/rabin__karp_8cpp_source.html#l00025">rabin_karp.cpp:25</a></div></div>
|
|
<div class="ttc" id="anamespacestring__search_html_aebe07cea289a13142503d98be7df11fd"><div class="ttname"><a href="#aebe07cea289a13142503d98be7df11fd">string_search::check_if_equal</a></div><div class="ttdeci">bool check_if_equal(const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dce/rabin__karp_8cpp_source.html#l00060">rabin_karp.cpp:60</a></div></div>
|
|
<div class="ttc" id="anamespacestring__search_html_aed769d565b705a9b3e0eb1ec74088893"><div class="ttname"><a href="#aed769d565b705a9b3e0eb1ec74088893">string_search::recalculate_hash</a></div><div class="ttdeci">int64_t recalculate_hash(const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dce/rabin__karp_8cpp_source.html#l00042">rabin_karp.cpp:42</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="aed769d565b705a9b3e0eb1ec74088893" name="aed769d565b705a9b3e0eb1ec74088893"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aed769d565b705a9b3e0eb1ec74088893">◆ </a></span>recalculate_hash()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int64_t string_search::recalculate_hash </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::string &</td> <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>old_index</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>new_index</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>old_hash</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>patLength</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>re-hash a string using known existing hash </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">s</td><td>source of string to hash </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">old_index</td><td>previous index of string </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">new_index</td><td>new index of string </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">old_hash</td><td>previous hash of substring </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">patLength</td><td>length of substring to hash </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>new hash integer </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html">rabin_karp.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 43</span> {</div>
|
|
<div class="line"><span class="lineno"> 44</span> int64_t new_hash = old_hash - s[old_index];</div>
|
|
<div class="line"><span class="lineno"> 45</span> new_hash /= <a class="code hl_define" href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">PRIME</a>;</div>
|
|
<div class="line"><span class="lineno"> 46</span> new_hash += (int64_t)(s[new_index] * (int64_t)pow(<a class="code hl_define" href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">PRIME</a>, patLength - 1));</div>
|
|
<div class="line"><span class="lineno"> 47</span> <span class="keywordflow">return</span> new_hash;</div>
|
|
<div class="line"><span class="lineno"> 48</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div id="page-nav" class="page-nav-panel">
|
|
<div id="page-nav-resize-handle"></div>
|
|
<div id="page-nav-tree">
|
|
<div id="page-nav-contents">
|
|
</div><!-- page-nav-contents -->
|
|
</div><!-- page-nav-tree -->
|
|
</div><!-- page-nav -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a href="../../d9/d03/namespacestring__search.html">string_search</a></li>
|
|
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|