mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-24 10:33:10 +08:00
158 lines
10 KiB
HTML
158 lines
10 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++: strings Directory 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('dir_73a3cc5065b223eb41b02873c0e19f0e.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">strings Directory Reference</div></div>
|
||
</div><!--header-->
|
||
<div class="contents">
|
||
<table class="memberdecls">
|
||
<tr class="heading"><td colspan="2"><h2 id="header-files" class="groupheader"><a id="files" name="files"></a>
|
||
Files</h2></td></tr>
|
||
<tr class="memitem:boyer_5Fmoore_2Ecpp" id="r_boyer_5Fmoore_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/db2/boyer__moore_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/db2/boyer__moore_8cpp.html">boyer_moore.cpp</a></td></tr>
|
||
<tr class="memdesc:d3/db2/boyer__moore_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">The <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer–Moore</a> algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible. <br /></td></tr>
|
||
<tr class="memitem:brute_5Fforce_5Fstring_5Fsearching_2Ecpp" id="r_brute_5Fforce_5Fstring_5Fsearching_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/d7d/brute__force__string__searching_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html">brute_force_string_searching.cpp</a></td></tr>
|
||
<tr class="memdesc:d3/d7d/brute__force__string__searching_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">String pattern search - brute force. <br /></td></tr>
|
||
<tr class="memitem:duval_2Ecpp" id="r_duval_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="db/d09/duval_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="db/d09/duval_8cpp.html">duval.cpp</a></td></tr>
|
||
<tr class="memdesc:db/d09/duval_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Lyndon_word" target="_blank">Duval's algorithm</a>. <br /></td></tr>
|
||
<tr class="memitem:horspool_2Ecpp" id="r_horspool_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/dfe/horspool_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dfe/horspool_8cpp.html">horspool.cpp</a></td></tr>
|
||
<tr class="memdesc:d3/dfe/horspool_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Horspool's algorithm that finds if a string contains a substring (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm</a>) <br /></td></tr>
|
||
<tr class="memitem:knuth_5Fmorris_5Fpratt_2Ecpp" id="r_knuth_5Fmorris_5Fpratt_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="de/d6a/knuth__morris__pratt_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html">knuth_morris_pratt.cpp</a></td></tr>
|
||
<tr class="memdesc:de/d6a/knuth__morris__pratt_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">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) <br /></td></tr>
|
||
<tr class="memitem:manacher_5Falgorithm_2Ecpp" id="r_manacher_5Falgorithm_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/d39/manacher__algorithm_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d39/manacher__algorithm_8cpp.html">manacher_algorithm.cpp</a></td></tr>
|
||
<tr class="memdesc:d3/d39/manacher__algorithm_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> <br /></td></tr>
|
||
<tr class="memitem:rabin_5Fkarp_2Ecpp" id="r_rabin_5Fkarp_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d6/dce/rabin__karp_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d6/dce/rabin__karp_8cpp.html">rabin_karp.cpp</a></td></tr>
|
||
<tr class="memdesc:d6/dce/rabin__karp_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">The <a href="https://en.wikipedia.org/wiki/Rabin–Karp_algorithm" target="_blank">Rabin-Karp Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) <br /></td></tr>
|
||
<tr class="memitem:z_5Ffunction_2Ecpp" id="r_z_5Ffunction_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/d80/z__function_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d80/z__function_8cpp.html">z_function.cpp</a></td></tr>
|
||
<tr class="memdesc:d3/d80/z__function_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">The <a href="https://cp-algorithms.com/string/z-function.html" target="_blank">Z function</a> for finding occurences of a pattern within a piece of text with time and space complexity O(n + m) <br /></td></tr>
|
||
</table>
|
||
</div><!-- contents -->
|
||
</div><!-- doc-content -->
|
||
<div id="page-nav" class="page-nav-panel">
|
||
<div id="page-nav-resize-handle"></div>
|
||
<div id="page-nav-tree">
|
||
<div id="page-nav-contents">
|
||
</div><!-- page-nav-contents -->
|
||
</div><!-- page-nav-tree -->
|
||
</div><!-- page-nav -->
|
||
</div><!-- container -->
|
||
<!-- start footer part -->
|
||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||
<ul>
|
||
<li class="navelem"><a href="dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</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>
|