mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-05-11 11:07:27 +08:00
Documentation for 60050d7b1b
This commit is contained in:
github-actions
@@ -266,6 +266,7 @@ Functions</h2></td></tr>
|
||||
<div class="ttc" id="avector__important__functions_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> vector_important_functions.cpp:11</div></div>
|
||||
<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="anamespacesorting_html_aa26de383227859210f14dcf12201a079"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079">sorting::merge</a></div><div class="ttdeci">void merge(Iterator, Iterator, const Iterator, char[])</div><div class="ttdoc">merges 2 sorted adjacent segments into a larger sorted segment</div><div class="ttdef"><b>Definition:</b> non_recursive_merge_sort.cpp:57</div></div>
|
||||
<div class="ttc" id="anamespacestrings_html"><div class="ttname"><a href="../../df/dcb/namespacestrings.html">strings</a></div><div class="ttdoc">Algorithms with strings.</div></div>
|
||||
<div class="ttc" id="anamespacesorting_html_aedfb88e2d6fff1871f038221fe5870fe"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#aedfb88e2d6fff1871f038221fe5870fe">sorting::shuffle</a></div><div class="ttdeci">std::array< T, N > shuffle(std::array< T, N > arr)</div><div class="ttdef"><b>Definition:</b> bogo_sort.cpp:36</div></div>
|
||||
<div class="ttc" id="alinear__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> linear_search.cpp:27</div></div>
|
||||
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a9f1cb54ed09fde931bf3220d75ee4c57"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">range_queries::heavy_light_decomposition::HLD::update</a></div><div class="ttdeci">void update(int node, X val)</div><div class="ttdoc">This function updates the value at node with val.</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:475</div></div>
|
||||
@@ -377,6 +378,7 @@ Functions</h2></td></tr>
|
||||
<div class="ttc" id="amedian__search_8cpp_html_a868847218f694e78bf433a0ff7648bae"><div class="ttname"><a href="../../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a></div><div class="ttdeci">int median_of_medians(const std::vector< int > &A, const int &idx)</div><div class="ttdef"><b>Definition:</b> median_search.cpp:62</div></div>
|
||||
<div class="ttc" id="aceil_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/ceil.html">std::ceil</a></div><div class="ttdeci">T ceil(T... args)</div></div>
|
||||
<div class="ttc" id="asmallest__circle_8cpp_html_a0b0676df8e4da7a08c7ccaecea344903"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">circle</a></div><div class="ttdeci">double circle(const std::vector< Point > &P)</div><div class="ttdef"><b>Definition:</b> smallest_circle.cpp:87</div></div>
|
||||
<div class="ttc" id="ahorspool_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function with test cases for Horspool's algorithm.</div><div class="ttdef"><b>Definition:</b> horspool.cpp:100</div></div>
|
||||
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector< bool > &is_prime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:44</div></div>
|
||||
<div class="ttc" id="asuccessive__approximation_8cpp_html_a79c1d08919ff7780a5d7723172602389"><div class="ttname"><a href="../../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389">eq</a></div><div class="ttdeci">static float eq(float y)</div><div class="ttdef"><b>Definition:</b> successive_approximation.cpp:12</div></div>
|
||||
<div class="ttc" id="aquick__sort__3_8cpp_html_a07e5c62de28aeddea986890ce7ac1bda"><div class="ttname"><a href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a></div><div class="ttdeci">static void test_int()</div><div class="ttdef"><b>Definition:</b> quick_sort_3.cpp:138</div></div>
|
||||
@@ -410,6 +412,7 @@ Functions</h2></td></tr>
|
||||
<div class="ttc" id="apigeonhole__sort_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition:</b> pigeonhole_sort.cpp:109</div></div>
|
||||
<div class="ttc" id="ahash__search_8cpp_html_ad0831425f1389166a9518f422d0c6ec5"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5">create_list</a></div><div class="ttdeci">void create_list(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:55</div></div>
|
||||
<div class="ttc" id="apoisson__dist_8cpp_html_a63ffd347e75d5ed7a518cbcfbfeec71a"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a">fact</a></div><div class="ttdeci">double fact(double x)</div><div class="ttdef"><b>Definition:</b> poisson_dist.cpp:30</div></div>
|
||||
<div class="ttc" id="ahorspool_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main Function that calls test function.</div><div class="ttdef"><b>Definition:</b> horspool.cpp:119</div></div>
|
||||
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_ad3b942be27a1b0fe3cff6cb6edf01294"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294">range_queries::heavy_light_decomposition::SG::set_sret_init</a></div><div class="ttdeci">void set_sret_init(X new_sret_init)</div><div class="ttdoc">Set the initialization for the query data type, based on requirement.</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:329</div></div>
|
||||
<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
|
||||
<div class="ttc" id="afast__integer__input_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> fast_integer_input.cpp:39</div></div>
|
||||
@@ -417,6 +420,7 @@ Functions</h2></td></tr>
|
||||
<div class="ttc" id="agetline_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a></div><div class="ttdeci">T getline(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
|
||||
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">range_queries::heavy_light_decomposition::SG</a></div><div class="ttdoc">Segment Tree, to store heavy chains.</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:254</div></div>
|
||||
<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">std::unordered_map::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
|
||||
<div class="ttc" id="aheavy__light__decomposition_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:634</div></div>
|
||||
<div class="ttc" id="anamespacemedian__search_html"><div class="ttname"><a href="../../da/dd4/namespacemedian__search.html">median_search</a></div><div class="ttdoc">Functions for Median search algorithm.</div></div>
|
||||
<div class="ttc" id="aaddition__rule_8cpp_html_a4adfd055c758546456d440ee9133555d"><div class="ttname"><a href="../../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d">addition_rule_independent</a></div><div class="ttdeci">double addition_rule_independent(double A, double B)</div><div class="ttdef"><b>Definition:</b> addition_rule.cpp:14</div></div>
|
||||
@@ -452,6 +456,7 @@ Functions</h2></td></tr>
|
||||
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_aa339c31ec74cd86a4842a8b09653d460"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460">range_queries::heavy_light_decomposition::Tree::dfs_size</a></div><div class="ttdeci">void dfs_size(int u, int p=-1)</div><div class="ttdoc">Utility function to compute sub-tree sizes.</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:101</div></div>
|
||||
<div class="ttc" id="ainterpolation__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/dd7/interpolation__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> interpolation_search.cpp:37</div></div>
|
||||
<div class="ttc" id="astring__fibonacci_8cpp_html_a28052eee05d43c2ebc5147c52bd50c35"><div class="ttname"><a href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35">add</a></div><div class="ttdeci">std::string add(std::string a, std::string b)</div><div class="ttdef"><b>Definition:</b> string_fibonacci.cpp:24</div></div>
|
||||
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
|
||||
<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
|
||||
<div class="ttc" id="aaddition__rule_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> addition_rule.cpp:30</div></div>
|
||||
<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a214743638eff1336f835310049aef979"><div class="ttname"><a href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a></div><div class="ttdeci">std::string toupperRoman(int n)</div><div class="ttdef"><b>Definition:</b> decimal_to_roman_numeral.cpp:58</div></div>
|
||||
@@ -479,12 +484,14 @@ Functions</h2></td></tr>
|
||||
<div class="ttc" id="agroup__sorting_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> merge_sort.cpp:102</div></div>
|
||||
<div class="ttc" id="aparanthesis__matching_8cpp_html_a6d25c7dfbfeb52c3cb9d1b56ab49b664"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664">pop</a></div><div class="ttdeci">char pop()</div><div class="ttdoc">pop a byte out of stack variable</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:29</div></div>
|
||||
<div class="ttc" id="ainterpolation__search2_8cpp_html_aa3ec659ec8394d186c761df81ad1f629"><div class="ttname"><a href="../../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629">InterpolationSearch</a></div><div class="ttdeci">int InterpolationSearch(int A[], int n, int x)</div><div class="ttdef"><b>Definition:</b> interpolation_search2.cpp:15</div></div>
|
||||
<div class="ttc" id="anamespacehorspool_html"><div class="ttname"><a href="../../d5/d02/namespacehorspool.html">horspool</a></div><div class="ttdoc">Functions for Horspool's algorithm.</div></div>
|
||||
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
|
||||
<div class="ttc" id="apoisson__dist_8cpp_html_ad0aa718023ce802dd5899f0e03a7ac71"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71">poisson_expected</a></div><div class="ttdeci">double poisson_expected(double rate, double time)</div><div class="ttdef"><b>Definition:</b> poisson_dist.cpp:25</div></div>
|
||||
<div class="ttc" id="apoisson__dist_8cpp_html_a69a136b32707bdc7950fb9057b5fa1e1"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1">poisson_x_successes</a></div><div class="ttdeci">double poisson_x_successes(double expected, double x)</div><div class="ttdef"><b>Definition:</b> poisson_dist.cpp:46</div></div>
|
||||
<div class="ttc" id="arabin__karp_8cpp_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="../../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdef"><b>Definition:</b> rabin_karp.cpp:105</div></div>
|
||||
<div class="ttc" id="arandom_shuffle_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html">std::random_shuffle</a></div><div class="ttdeci">T random_shuffle(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacesorting_html_a50b66a1c652291b9a346ec7342967178"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a50b66a1c652291b9a346ec7342967178">sorting::quickSort</a></div><div class="ttdeci">void quickSort(int arr[], int low, int high)</div><div class="ttdef"><b>Definition:</b> quick_sort.cpp:63</div></div>
|
||||
<div class="ttc" id="aunordered_map_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="anumeric_limits_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a></div></div>
|
||||
<div class="ttc" id="adata_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/data.html">std::array::data</a></div><div class="ttdeci">T data(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacestring__search_html_aa422aab133d4ed5e5d6022a7f701271f"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#aa422aab133d4ed5e5d6022a7f701271f">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>
|
||||
@@ -496,6 +503,7 @@ Functions</h2></td></tr>
|
||||
<div class="ttc" id="acomb__sort_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> comb_sort.cpp:73</div></div>
|
||||
<div class="ttc" id="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition:</b> list_array.cpp:8</div></div>
|
||||
<div class="ttc" id="amemset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/memset.html">std::memset</a></div><div class="ttdeci">T memset(T... args)</div></div>
|
||||
<div class="ttc" id="ahorspool_8cpp_html_ad352e3be28a6d9f2d1b2f32ce9c729b9"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#ad352e3be28a6d9f2d1b2f32ce9c729b9">strings::horspool::findShiftTable</a></div><div class="ttdeci">std::unordered_map< char, int > findShiftTable(const std::string &prototype)</div><div class="ttdef"><b>Definition:</b> horspool.cpp:26</div></div>
|
||||
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a0efd0b9c564092f443ca97030d866ef1"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">range_queries::heavy_light_decomposition::Tree::t_depth</a></div><div class="ttdeci">std::vector< int > t_depth</div><div class="ttdoc">a vector to store the depth of a node,</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:88</div></div>
|
||||
<div class="ttc" id="abinomial__dist_8cpp_html_acd4dd4558031e4c5d045c801f73d8861"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861">binomial_variance</a></div><div class="ttdeci">double binomial_variance(double n, double p)</div><div class="ttdef"><b>Definition:</b> binomial_dist.cpp:29</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector< std::valarray< T >> &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div>
|
||||
|
||||
364
d3/dfe/horspool_8cpp.html
Normal file
364
d3/dfe/horspool_8cpp.html
Normal file
@@ -0,0 +1,364 @@
|
||||
<!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">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.20"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: strings/horspool.cpp File Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.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/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<link href="../../doxygen.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 style="height: 56px;">
|
||||
<td id="projectalign" style="padding-left: 0.5em;">
|
||||
<div id="projectname">Algorithms_in_C++
|
||||
 <span id="projectnumber">1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.8.20 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @license-end */
|
||||
</script>
|
||||
<script type="text/javascript" src="../../menudata.js"></script>
|
||||
<script type="text/javascript" src="../../menu.js"></script>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d3/dfe/horspool_8cpp.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
<!-- window showing the filter options -->
|
||||
<div id="MSearchSelectWindow"
|
||||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||||
</div>
|
||||
|
||||
<!-- iframe showing the search results (closed by default) -->
|
||||
<div id="MSearchResultsWindow">
|
||||
<iframe src="javascript:void(0)" frameborder="0"
|
||||
name="MSearchResults" id="MSearchResults">
|
||||
</iframe>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="summary">
|
||||
<a href="#namespaces">Namespaces</a> |
|
||||
<a href="#func-members">Functions</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">horspool.cpp File Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Horspool's algorithm that finds if a string contains a substring (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm</a>)
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <iostream></code><br />
|
||||
<code>#include <unordered_map></code><br />
|
||||
<code>#include <cassert></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for horspool.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/ddf/horspool_8cpp__incl.svg" width="308" height="112"><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 name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:df/dcb/namespacestrings"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dcb/namespacestrings.html">strings</a></td></tr>
|
||||
<tr class="memdesc:df/dcb/namespacestrings"><td class="mdescLeft"> </td><td class="mdescRight">Algorithms with strings. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d5/d02/namespacehorspool"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d02/namespacehorspool.html">horspool</a></td></tr>
|
||||
<tr class="memdesc:d5/d02/namespacehorspool"><td class="mdescLeft"> </td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">Horspool's</a> algorithm. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:ad352e3be28a6d9f2d1b2f32ce9c729b9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>< char, int > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/dfe/horspool_8cpp.html#ad352e3be28a6d9f2d1b2f32ce9c729b9">strings::horspool::findShiftTable</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &prototype)</td></tr>
|
||||
<tr class="separator:ad352e3be28a6d9f2d1b2f32ce9c729b9"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a9884bca75ce39c116697ea2574adb37d"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/dfe/horspool_8cpp.html#a9884bca75ce39c116697ea2574adb37d">strings::horspool::horspool</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> &prototype)</td></tr>
|
||||
<tr class="separator:a9884bca75ce39c116697ea2574adb37d"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
|
||||
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft"> </td><td class="mdescRight">Function with test cases for Horspool's algorithm. <a href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
|
||||
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main Function that calls test function. <a href="../../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
|
||||
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Horspool's algorithm that finds if a string contains a substring (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm</a>) </p>
|
||||
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ckontakis">Harry Kontakis</a> </dd></dl>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="ad352e3be28a6d9f2d1b2f32ce9c729b9"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ad352e3be28a6d9f2d1b2f32ce9c729b9">◆ </a></span>findShiftTable()</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/unordered_map.html">std::unordered_map</a><char, int> strings::horspool::findShiftTable </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"><em>prototype</em></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>A function that finds the shift table of the given prototype string that we need in Horpool's algorithm. </p><dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">prototype</td><td>is the substring that we use to find shift table </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>Shift Table of Horspool's algorithm </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  {</div>
|
||||
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map<char, int></a></div>
|
||||
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  shiftTable; <span class="comment">// A HashMap for shift table that has characters for keys and integers for values</span></div>
|
||||
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  </div>
|
||||
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < prototype.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
|
||||
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  i++) { <span class="comment">// Checking all characters of prototype string</span></div>
|
||||
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keywordflow">if</span> (shiftTable.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(prototype[i]) ==</div>
|
||||
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  shiftTable.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) { <span class="comment">// If character does not exist in HashMap</span></div>
|
||||
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">if</span> (i != prototype.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1) {</div>
|
||||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  shiftTable.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">insert</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
||||
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  prototype[i], prototype.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - i -</div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  1)); <span class="comment">// Insert the character as key and the size of prototype string - index of character - 1 as value</span></div>
|
||||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  shiftTable.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">insert</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
||||
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  prototype[i],</div>
|
||||
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  prototype.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>())); <span class="comment">// Insert the character as key and the size of prototype string as value</span></div>
|
||||
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  }</div>
|
||||
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">if</span> (i != prototype.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1) {</div>
|
||||
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  shiftTable[prototype[i]] = prototype.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/size.html">size</a>() - i - 1;</div>
|
||||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  }</div>
|
||||
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  }</div>
|
||||
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  }</div>
|
||||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">return</span> shiftTable;</div>
|
||||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> }</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="../../d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.svg" width="352" height="338"><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="a9884bca75ce39c116697ea2574adb37d"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a9884bca75ce39c116697ea2574adb37d">◆ </a></span>horspool()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool strings::horspool::horspool </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> & </td>
|
||||
<td class="paramname"><em>text</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></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"><em>prototype</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>A function that implements Horspool's algorithm. </p><dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">text</td><td>is the string that we are searching if there is a substring </td></tr>
|
||||
<tr><td class="paramname">prototype</td><td>is the substring that we are searching in text </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>true if text string contains prototype string </dd>
|
||||
<dd>
|
||||
false if text string does not contain prototype string </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  {</div>
|
||||
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map<char, int></a> shiftTable = <a class="code" href="../../d3/dfe/horspool_8cpp.html#ad352e3be28a6d9f2d1b2f32ce9c729b9">findShiftTable</a>(</div>
|
||||
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  prototype); <span class="comment">// Initialise shift table calling findShiftTable function</span></div>
|
||||
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  </div>
|
||||
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordtype">int</span> i = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(</div>
|
||||
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  prototype.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() -</div>
|
||||
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  1); <span class="comment">// Index that we shift in text to find the substring</span></div>
|
||||
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">while</span> (i < text.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) {</div>
|
||||
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordtype">int</span> j = i, k = 0;</div>
|
||||
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordtype">bool</span> flag = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  </div>
|
||||
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> z = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(prototype.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1); z >= 0 && flag;</div>
|
||||
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  z--) { <span class="comment">// Checking if all characters of substring are equal with all characters of string</span></div>
|
||||
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">if</span> (text[j] == prototype[z]) {</div>
|
||||
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  k++;</div>
|
||||
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  j--;</div>
|
||||
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  flag = <span class="keyword">false</span>; <span class="comment">// If two characters are not equal set flag to false and break from loop</span></div>
|
||||
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div>
|
||||
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  }</div>
|
||||
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  </div>
|
||||
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (k ==</div>
|
||||
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  prototype.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) { <span class="comment">// If all characters match then return true</span></div>
|
||||
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">if</span> (shiftTable.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(text[i]) != shiftTable.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) {</div>
|
||||
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  i += shiftTable[text[i]]; <span class="comment">// If shift table contains the character then shift index as many steps as value</span></div>
|
||||
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  i += prototype.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); <span class="comment">// If character does not exist in shift table then shift index as many steps as size of prototype string</span></div>
|
||||
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div>
|
||||
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div>
|
||||
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div>
|
||||
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> }</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="../../d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.svg" width="527" height="338"><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="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">int main </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">void </td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Main Function that calls test function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  {</div>
|
||||
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <a class="code" href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
|
||||
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> }</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="../../d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="154" height="38"><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="aa8dca7b867074164d5f45b0f3851269d"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">◆ </a></span>test()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">static void test </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">static</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Function with test cases for Horspool's algorithm. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  {</div>
|
||||
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  assert(strings::horspool::horspool(<span class="stringliteral">"Hello World"</span>,<span class="stringliteral">"World"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  assert(strings::horspool::horspool(<span class="stringliteral">"Hello World"</span>,<span class="stringliteral">" World"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  assert(strings::horspool::horspool(<span class="stringliteral">"Hello World"</span>,<span class="stringliteral">"ello"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  assert(strings::horspool::horspool(<span class="stringliteral">"Hello World"</span>,<span class="stringliteral">"rld"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  assert(strings::horspool::horspool(<span class="stringliteral">"Hello"</span>,<span class="stringliteral">"Helo"</span>) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  assert(strings::horspool::horspool(<span class="stringliteral">"c++_algorithms"</span>,<span class="stringliteral">"c++_algorithms"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  assert(strings::horspool::horspool(<span class="stringliteral">"c++_algorithms"</span>,<span class="stringliteral">"c++_"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  assert(strings::horspool::horspool(<span class="stringliteral">"Hello"</span>,<span class="stringliteral">"Hello World"</span>) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  assert(strings::horspool::horspool(<span class="stringliteral">"c++_algorithms"</span>,<span class="stringliteral">""</span>) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  assert(strings::horspool::horspool(<span class="stringliteral">"c++"</span>,<span class="stringliteral">"c"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  assert(strings::horspool::horspool(<span class="stringliteral">"3458934793"</span>,<span class="stringliteral">"4793"</span>) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  assert(strings::horspool::horspool(<span class="stringliteral">"3458934793"</span>,<span class="stringliteral">"123"</span>) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">std::unordered_map::find</a></div><div class="ttdeci">T find(T... args)</div></div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
<div class="ttc" id="ahorspool_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function with test cases for Horspool's algorithm.</div><div class="ttdef"><b>Definition:</b> horspool.cpp:100</div></div>
|
||||
<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">std::unordered_map::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
|
||||
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
|
||||
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">std::unordered_map::end</a></div><div class="ttdeci">T end(T... args)</div></div>
|
||||
<div class="ttc" id="aunordered_map_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="ahorspool_8cpp_html_ad352e3be28a6d9f2d1b2f32ce9c729b9"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#ad352e3be28a6d9f2d1b2f32ce9c729b9">strings::horspool::findShiftTable</a></div><div class="ttdeci">std::unordered_map< char, int > findShiftTable(const std::string &prototype)</div><div class="ttdef"><b>Definition:</b> horspool.cpp:26</div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</a></li><li class="navelem"><a class="el" href="../../d3/dfe/horspool_8cpp.html">horspool.cpp</a></li>
|
||||
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
7
d3/dfe/horspool_8cpp.js
vendored
Normal file
7
d3/dfe/horspool_8cpp.js
vendored
Normal file
@@ -0,0 +1,7 @@
|
||||
var horspool_8cpp =
|
||||
[
|
||||
[ "findShiftTable", "d3/dfe/horspool_8cpp.html#ad352e3be28a6d9f2d1b2f32ce9c729b9", null ],
|
||||
[ "horspool", "d3/dfe/horspool_8cpp.html#a9884bca75ce39c116697ea2574adb37d", null ],
|
||||
[ "main", "d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
|
||||
[ "test", "d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
|
||||
];
|
||||
@@ -0,0 +1,10 @@
|
||||
<map id="strings::horspool::horspool" name="strings::horspool::horspool">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,98,132,139"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/end.html#" title=" " alt="" coords="355,5,521,32"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/find.html#" title=" " alt="" coords="369,57,507,98"/>
|
||||
<area shape="rect" id="node4" href="$d3/dfe/horspool_8cpp.html#ad352e3be28a6d9f2d1b2f32ce9c729b9" title=" " alt="" coords="180,139,307,181"/>
|
||||
<area shape="rect" id="node7" 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="382,305,494,332"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/insert.html#" title=" " alt="" coords="369,122,507,163"/>
|
||||
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="384,188,492,215"/>
|
||||
<area shape="rect" id="node8" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/size.html#" title=" " alt="" coords="369,239,507,281"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
d7858d7e2d01fa215744094935e9f9d3
|
||||
@@ -0,0 +1,156 @@
|
||||
<?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 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: strings::horspool::horspool Pages: 1 -->
|
||||
<svg width="395pt" height="253pt"
|
||||
viewBox="0.00 0.00 395.00 253.00" 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 249)">
|
||||
<title>strings::horspool::horspool</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-249 391,-249 391,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-145 0,-175 95,-175 95,-145 0,-145"/>
|
||||
<text text-anchor="start" x="8" y="-163" font-family="Helvetica,sans-Serif" font-size="10.00">strings::horspool::</text>
|
||||
<text text-anchor="middle" x="47.5" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">horspool</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="262,-225.5 262,-244.5 387,-244.5 387,-225.5 262,-225.5"/>
|
||||
<text text-anchor="middle" x="324.5" y="-232.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M85.51,-175.12C99.6,-180.56 115.91,-186.46 131,-191 174.7,-204.14 225,-215.51 263.22,-223.4"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="262.66,-226.86 273.16,-225.43 264.06,-220 262.66,-226.86"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="273,-176 273,-206 376,-206 376,-176 273,-176"/>
|
||||
<text text-anchor="start" x="281" y="-194" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
|
||||
<text text-anchor="middle" x="324.5" y="-183" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M95.13,-167.17C106.83,-168.86 119.36,-170.58 131,-172 174.88,-177.35 224.52,-182.22 262.41,-185.69"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="262.49,-189.22 272.77,-186.64 263.12,-182.25 262.49,-189.22"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../d3/dfe/horspool_8cpp.html#ad352e3be28a6d9f2d1b2f32ce9c729b9" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="131,-114 131,-144 226,-144 226,-114 131,-114"/>
|
||||
<text text-anchor="start" x="139" y="-132" font-family="Helvetica,sans-Serif" font-size="10.00">strings::horspool::</text>
|
||||
<text text-anchor="middle" x="178.5" y="-121" font-family="Helvetica,sans-Serif" font-size="10.00">findShiftTable</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M95.07,-148.81C103.57,-146.77 112.51,-144.62 121.25,-142.52"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="122.09,-145.92 131,-140.18 120.46,-139.11 122.09,-145.92"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="282.5,-0.5 282.5,-19.5 366.5,-19.5 366.5,-0.5 282.5,-0.5"/>
|
||||
<text text-anchor="middle" x="324.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node7 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M68.64,-144.93C105.32,-118.13 186.22,-61.92 262,-29 267.12,-26.77 272.59,-24.69 278.08,-22.78"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="279.49,-26 287.89,-19.54 277.3,-19.36 279.49,-26"/>
|
||||
</g>
|
||||
<!-- Node4->Node2 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node4->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M190,-144.18C204.18,-163.57 231.23,-196.89 262,-216 265.37,-218.1 269,-219.98 272.74,-221.66"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="271.6,-224.98 282.19,-225.45 274.21,-218.48 271.6,-224.98"/>
|
||||
</g>
|
||||
<!-- Node4->Node3 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node4->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M211.04,-144.06C226.33,-151.23 245.02,-159.78 262,-167 266.09,-168.74 270.34,-170.5 274.63,-172.23"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="273.4,-175.51 283.99,-175.98 276.01,-169.02 273.4,-175.51"/>
|
||||
</g>
|
||||
<!-- Node4->Node4 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node4->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M155.84,-144.16C150.38,-153.56 157.93,-162.5 178.5,-162.5 191.03,-162.5 198.73,-159.18 201.6,-154.46"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="205.08,-154 201.16,-144.16 198.09,-154.3 205.08,-154"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="273,-127 273,-157 376,-157 376,-127 273,-127"/>
|
||||
<text text-anchor="start" x="281" y="-145" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
|
||||
<text text-anchor="middle" x="324.5" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node5 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node4->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M226.25,-133.22C237.87,-134.27 250.48,-135.41 262.66,-136.51"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="262.48,-140.01 272.76,-137.42 263.11,-133.03 262.48,-140.01"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="284,-88.5 284,-107.5 365,-107.5 365,-88.5 284,-88.5"/>
|
||||
<text text-anchor="middle" x="324.5" y="-95.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node6 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node4->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M226.25,-118.94C241.48,-115.66 258.43,-112.01 273.86,-108.69"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="274.7,-112.09 283.74,-106.56 273.23,-105.24 274.7,-112.09"/>
|
||||
</g>
|
||||
<!-- Node4->Node7 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node4->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M190.44,-113.67C208.56,-88.67 244.52,-40.71 262,-29 265.35,-26.75 268.98,-24.77 272.74,-23"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="274.36,-26.12 282.28,-19.08 271.7,-19.65 274.36,-26.12"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/size.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="273,-39 273,-69 376,-69 376,-39 273,-39"/>
|
||||
<text text-anchor="start" x="281" y="-57" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
|
||||
<text text-anchor="middle" x="324.5" y="-46" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node8 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node4->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M202.06,-113.99C218.34,-103.49 241.05,-89.52 262,-79 265.99,-77 270.18,-75.03 274.42,-73.13"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="275.94,-76.28 283.72,-69.09 273.15,-69.86 275.94,-76.28"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 8.3 KiB |
@@ -0,0 +1,9 @@
|
||||
<map id="strings::horspool::findShiftTable" name="strings::horspool::findShiftTable">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,151,132,193"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/end.html#" title=" " alt="" coords="180,5,347,32"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/find.html#" title=" " alt="" coords="195,57,332,98"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/insert.html#" title=" " alt="" coords="195,122,332,163"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="209,188,317,215"/>
|
||||
<area shape="rect" id="node6" 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="207,239,319,265"/>
|
||||
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/size.html#" title=" " alt="" coords="195,290,332,331"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
503f022c4f648f4b2989ead4c50b2222
|
||||
@@ -0,0 +1,122 @@
|
||||
<?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 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: strings::horspool::findShiftTable Pages: 1 -->
|
||||
<svg width="264pt" height="253pt"
|
||||
viewBox="0.00 0.00 264.00 252.50" 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 248.5)">
|
||||
<title>strings::horspool::findShiftTable</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-248.5 260,-248.5 260,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-104.5 0,-134.5 95,-134.5 95,-104.5 0,-104.5"/>
|
||||
<text text-anchor="start" x="8" y="-122.5" font-family="Helvetica,sans-Serif" font-size="10.00">strings::horspool::</text>
|
||||
<text text-anchor="middle" x="47.5" y="-111.5" font-family="Helvetica,sans-Serif" font-size="10.00">findShiftTable</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M22.06,-134.66C15.92,-144.06 24.4,-153 47.5,-153 61.58,-153 70.22,-149.68 73.44,-144.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="76.92,-144.48 72.94,-134.66 69.93,-144.82 76.92,-144.48"/>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="131,-225 131,-244 256,-244 256,-225 131,-225"/>
|
||||
<text text-anchor="middle" x="193.5" y="-232" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M57.7,-134.83C71.18,-156.02 98.29,-194.05 131,-215.5 134.13,-217.55 137.49,-219.39 140.97,-221.04"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="139.8,-224.34 150.38,-224.97 142.5,-217.88 139.8,-224.34"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="142,-175.5 142,-205.5 245,-205.5 245,-175.5 142,-175.5"/>
|
||||
<text text-anchor="start" x="150" y="-193.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
|
||||
<text text-anchor="middle" x="193.5" y="-182.5" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M72.91,-134.65C89.07,-144.38 110.91,-156.92 131,-166.5 134.56,-168.2 138.28,-169.88 142.05,-171.51"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="140.88,-174.81 151.45,-175.44 143.58,-168.35 140.88,-174.81"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="142,-126.5 142,-156.5 245,-156.5 245,-126.5 142,-126.5"/>
|
||||
<text text-anchor="start" x="150" y="-144.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
|
||||
<text text-anchor="middle" x="193.5" y="-133.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M95.25,-126.64C106.87,-128.42 119.48,-130.34 131.66,-132.21"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="131.34,-135.7 141.76,-133.75 132.4,-128.78 131.34,-135.7"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="153,-88 153,-107 234,-107 234,-88 153,-88"/>
|
||||
<text text-anchor="middle" x="193.5" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M95.25,-112.36C110.48,-110.03 127.43,-107.44 142.86,-105.08"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="143.39,-108.54 152.74,-103.57 142.33,-101.62 143.39,-108.54"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="151.5,-50 151.5,-69 235.5,-69 235.5,-50 151.5,-50"/>
|
||||
<text text-anchor="middle" x="193.5" y="-57" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M76.24,-104.31C92.01,-96.03 112.29,-85.98 131,-78.5 136.52,-76.29 142.4,-74.18 148.25,-72.23"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="149.56,-75.48 158,-69.08 147.41,-68.82 149.56,-75.48"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/size.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="142,-0.5 142,-30.5 245,-30.5 245,-0.5 142,-0.5"/>
|
||||
<text text-anchor="start" x="150" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
|
||||
<text text-anchor="middle" x="193.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node7 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M61.13,-104.33C76.25,-86.98 103.04,-58.62 131,-40.5 133.94,-38.59 137.05,-36.79 140.25,-35.08"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="142.01,-38.12 149.43,-30.56 138.92,-31.84 142.01,-38.12"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 6.4 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="node1" title="Main Function that calls test function." alt="" coords="5,5,56,32"/>
|
||||
<area shape="rect" id="node2" href="$d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function with test cases for Horspool's algorithm." alt="" coords="104,5,148,32"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
d43230e8630838d3ffcc44f8084ec40e
|
||||
@@ -0,0 +1,37 @@
|
||||
<?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 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="115pt" height="28pt"
|
||||
viewBox="0.00 0.00 115.00 28.00" 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 24)">
|
||||
<title>main</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 111,-24 111,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Main Function that calls test function.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 38,-19.5 38,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="19" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function with test cases for Horspool's algorithm.">
|
||||
<polygon fill="white" stroke="black" points="74,-0.5 74,-19.5 107,-19.5 107,-0.5 74,-0.5"/>
|
||||
<text text-anchor="middle" x="90.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.26,-10C46.07,-10 55.31,-10 63.79,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="63.95,-13.5 73.95,-10 63.95,-6.5 63.95,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.7 KiB |
Reference in New Issue
Block a user