backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-01 14:03:17 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 53a6c16730

Browse Source
This commit is contained in:
github-actions
2022-01-16 16:05:19 +00:00
parent 778f1be9e5
commit 2cab28c905
3620 changed files with 52045 additions and 41188 deletions
Download Patch File Download Diff File Expand all files Collapse all files

164
d3/dfe/horspool_8cpp.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="generator" content="Doxygen 1.9.3"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: strings/horspool.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,8 +30,8 @@ MathJax.Hub.Config({
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.2 -->
<!-- Generated by Doxygen 1.9.3 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
@@ -157,31 +157,31 @@ Functions</h2></td></tr>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Shift Table of Horspool's algorithm </dd></dl>
<div class="fragment"><div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> {</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map&lt;char, int&gt;</a></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> shiftTable; <span class="comment">// A HashMap for shift table that has characters for keys and integers for values</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> </div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> i++) { <span class="comment">// Checking all characters of prototype string</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keywordflow">if</span> (shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(prototype[i]) ==</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) { <span class="comment">// If character does not exist in HashMap</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keywordflow">if</span> (i != prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1) {</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">insert</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> prototype[i], prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - i -</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> 1)); <span class="comment">// Insert the character as key and the size of prototype string - index of character - 1 as value</span></div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">insert</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> prototype[i],</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>())); <span class="comment">// Insert the character as key and the size of prototype string as value</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> }</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordflow">if</span> (i != prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1) {</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> shiftTable[prototype[i]] = prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/size.html">size</a>() - i - 1;</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> }</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> }</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> }</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordflow">return</span> shiftTable;</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 26</span> {</div>
<div class="line"><span class="lineno"> 27</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map&lt;char, int&gt;</a></div>
<div class="line"><span class="lineno"> 28</span> shiftTable; <span class="comment">// A HashMap for shift table that has characters for keys and integers for values</span></div>
<div class="line"><span class="lineno"> 29</span> </div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
<div class="line"><span class="lineno"> 31</span> i++) { <span class="comment">// Checking all characters of prototype string</span></div>
<div class="line"><span class="lineno"> 32</span> <span class="keywordflow">if</span> (shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(prototype[i]) ==</div>
<div class="line"><span class="lineno"> 33</span> shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) { <span class="comment">// If character does not exist in HashMap</span></div>
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">if</span> (i != prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1) {</div>
<div class="line"><span class="lineno"> 35</span> shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">insert</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><span class="lineno"> 36</span> prototype[i], prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - i -</div>
<div class="line"><span class="lineno"> 37</span> 1)); <span class="comment">// Insert the character as key and the size of prototype string - index of character - 1 as value</span></div>
<div class="line"><span class="lineno"> 38</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 39</span> shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">insert</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><span class="lineno"> 40</span> prototype[i],</div>
<div class="line"><span class="lineno"> 41</span> prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>())); <span class="comment">// Insert the character as key and the size of prototype string as value</span></div>
<div class="line"><span class="lineno"> 42</span> }</div>
<div class="line"><span class="lineno"> 43</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">if</span> (i != prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1) {</div>
<div class="line"><span class="lineno"> 45</span> shiftTable[prototype[i]] = prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/size.html">size</a>() - i - 1;</div>
<div class="line"><span class="lineno"> 46</span> }</div>
<div class="line"><span class="lineno"> 47</span> }</div>
<div class="line"><span class="lineno"> 48</span> }</div>
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">return</span> shiftTable;</div>
<div class="line"><span class="lineno"> 50</span>}</div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">std::unordered_map::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">std::unordered_map::find</a></div><div class="ttdeci">T find(T... args)</div></div>
<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">std::unordered_map::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
@@ -232,40 +232,40 @@ Here is the call graph for this function:</div>
<dl class="section return"><dt>Returns</dt><dd>true if text string contains prototype string </dd>
<dd>
false if text string does not contain prototype string </dd></dl>
<div class="fragment"><div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> {</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map&lt;char, int&gt;</a> shiftTable = <a class="code hl_function" href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336">findShiftTable</a>(</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> prototype); <span class="comment">// Initialise shift table calling findShiftTable function</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> </div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">int</span> i = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() -</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> 1); <span class="comment">// Index that we shift in text to find the substring</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">while</span> (i &lt; text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) {</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keywordtype">int</span> j = i, <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = 0;</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordtype">bool</span> flag = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> </div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> z = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1); z &gt;= 0 &amp;&amp; flag;</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> z--) { <span class="comment">// Checking if all characters of substring are equal with all characters of string</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">if</span> (text[j] == prototype[z]) {</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++;</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> j--;</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> flag = <span class="keyword">false</span>; <span class="comment">// If two characters are not equal set flag to false and break from loop</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> }</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> </div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">if</span> (k ==</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) { <span class="comment">// If all characters match then return true</span></div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">if</span> (shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(text[i]) != shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) {</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> i += shiftTable[text[i]]; <span class="comment">// If shift table contains the character then shift index as many steps as value</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> i += prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); <span class="comment">// If character does not exist in shift table then shift index as many steps as size of prototype string</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> }</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 59</span> {</div>
<div class="line"><span class="lineno"> 60</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map&lt;char, int&gt;</a> shiftTable = <a class="code hl_function" href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336">findShiftTable</a>(</div>
<div class="line"><span class="lineno"> 61</span> prototype); <span class="comment">// Initialise shift table calling findShiftTable function</span></div>
<div class="line"><span class="lineno"> 62</span> </div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordtype">int</span> i = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(</div>
<div class="line"><span class="lineno"> 64</span> prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() -</div>
<div class="line"><span class="lineno"> 65</span> 1); <span class="comment">// Index that we shift in text to find the substring</span></div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">while</span> (i &lt; text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) {</div>
<div class="line"><span class="lineno"> 67</span> <span class="keywordtype">int</span> j = i, <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = 0;</div>
<div class="line"><span class="lineno"> 68</span> <span class="keywordtype">bool</span> flag = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 69</span> </div>
<div class="line"><span class="lineno"> 70</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> z = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1); z &gt;= 0 &amp;&amp; flag;</div>
<div class="line"><span class="lineno"> 71</span> z--) { <span class="comment">// Checking if all characters of substring are equal with all characters of string</span></div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">if</span> (text[j] == prototype[z]) {</div>
<div class="line"><span class="lineno"> 73</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++;</div>
<div class="line"><span class="lineno"> 74</span> j--;</div>
<div class="line"><span class="lineno"> 75</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 76</span> flag = <span class="keyword">false</span>; <span class="comment">// If two characters are not equal set flag to false and break from loop</span></div>
<div class="line"><span class="lineno"> 77</span> }</div>
<div class="line"><span class="lineno"> 78</span> }</div>
<div class="line"><span class="lineno"> 79</span> </div>
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">if</span> (k ==</div>
<div class="line"><span class="lineno"> 81</span> prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) { <span class="comment">// If all characters match then return true</span></div>
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 83</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">if</span> (shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(text[i]) != shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) {</div>
<div class="line"><span class="lineno"> 85</span> i += shiftTable[text[i]]; <span class="comment">// If shift table contains the character then shift index as many steps as value</span></div>
<div class="line"><span class="lineno"> 86</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 87</span> i += prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); <span class="comment">// If character does not exist in shift table then shift index as many steps as size of prototype string</span></div>
<div class="line"><span class="lineno"> 88</span> }</div>
<div class="line"><span class="lineno"> 89</span> }</div>
<div class="line"><span class="lineno"> 90</span> }</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 92</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="ahorspool_8cpp_html_a1a9c3aa55ccc79d0f47d50c580997336"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336">strings::horspool::findShiftTable</a></div><div class="ttdeci">std::unordered_map&lt; char, int &gt; findShiftTable(const std::string &amp;prototype)</div><div class="ttdef"><b>Definition:</b> horspool.cpp:26</div></div>
</div><!-- fragment --><div class="dynheader">
@@ -295,10 +295,10 @@ Here is the call graph for this function:</div>
<p>Main Function that calls test function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> {</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <a class="code hl_function" href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 119</span> {</div>
<div class="line"><span class="lineno"> 120</span> <a class="code hl_function" href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
<div class="line"><span class="lineno"> 121</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 122</span>}</div>
<div class="ttc" id="ahorspool_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function with test cases for Horspool's algorithm.</div><div class="ttdef"><b>Definition:</b> horspool.cpp:100</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -334,20 +334,20 @@ Here is the call graph for this function:</div>
<p>Function with test cases for Horspool's algorithm. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> {</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;World&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot; World&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;ello&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;rld&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello&quot;</span>,<span class="stringliteral">&quot;Helo&quot;</span>) == <span class="keyword">false</span>);</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++_algorithms&quot;</span>,<span class="stringliteral">&quot;c++_algorithms&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++_algorithms&quot;</span>,<span class="stringliteral">&quot;c++_&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello&quot;</span>,<span class="stringliteral">&quot;Hello World&quot;</span>) == <span class="keyword">false</span>);</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++_algorithms&quot;</span>,<span class="stringliteral">&quot;&quot;</span>) == <span class="keyword">false</span>);</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++&quot;</span>,<span class="stringliteral">&quot;c&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;3458934793&quot;</span>,<span class="stringliteral">&quot;4793&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;3458934793&quot;</span>,<span class="stringliteral">&quot;123&quot;</span>) == <span class="keyword">false</span>);</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 100</span> {</div>
<div class="line"><span class="lineno"> 101</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;World&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 102</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot; World&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 103</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;ello&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 104</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;rld&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 105</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello&quot;</span>,<span class="stringliteral">&quot;Helo&quot;</span>) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 106</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++_algorithms&quot;</span>,<span class="stringliteral">&quot;c++_algorithms&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 107</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++_algorithms&quot;</span>,<span class="stringliteral">&quot;c++_&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 108</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello&quot;</span>,<span class="stringliteral">&quot;Hello World&quot;</span>) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 109</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++_algorithms&quot;</span>,<span class="stringliteral">&quot;&quot;</span>) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 110</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++&quot;</span>,<span class="stringliteral">&quot;c&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 111</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;3458934793&quot;</span>,<span class="stringliteral">&quot;4793&quot;</span>) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 112</span> assert(strings::horspool::horspool(<span class="stringliteral">&quot;3458934793&quot;</span>,<span class="stringliteral">&quot;123&quot;</span>) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 113</span>}</div>
</div><!-- fragment -->
</div>
</div>
@@ -357,7 +357,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</a></li><li class="navelem"><a class="el" href="../../d3/dfe/horspool_8cpp.html">horspool.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.2 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.3 </li>
</ul>
</div>
</body>

12
d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.map
View File

@@ -1,9 +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"/>
<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#" 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#" 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#" 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#" 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#" 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#" title=" " alt="" coords="195,290,332,331"/>
</map>

2
d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.md5
View File

@@ -1 +1 @@
503f022c4f648f4b2989ead4c50b2222
c19faf8a85b326182dfafa1567d6eca2

12
d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.svg
View File

@@ -28,7 +28,7 @@
<!-- 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#" xlink:title=" ">
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end#" 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>
@@ -43,7 +43,7 @@
<!-- 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#" xlink:title=" ">
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find#" 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>
@@ -59,7 +59,7 @@
<!-- 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#" xlink:title=" ">
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/insert#" 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>
@@ -75,7 +75,7 @@
<!-- 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#" xlink:title=" ">
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair#" 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>
@@ -90,7 +90,7 @@
<!-- 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#" xlink:title=" ">
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size#" 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>
@@ -105,7 +105,7 @@
<!-- 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#" xlink:title=" ">
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/size#" 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>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.3 KiB

After

Width:  |  Height:  |  Size: 6.3 KiB

12
d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.map
View File

@@ -1,10 +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="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/end#" 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#" title=" " alt="" coords="369,57,507,98"/>
<area shape="rect" id="node4" href="$d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336" 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"/>
<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#" 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#" 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#" 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#" title=" " alt="" coords="369,239,507,281"/>
</map>

2
d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.md5
View File

@@ -1 +1 @@
ceb0225be01789b57da85f9932dd33f6
18badd530b6d2e554c2327a88e79b437

12
d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.svg
View File

@@ -22,7 +22,7 @@
<!-- 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#" xlink:title=" ">
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end#" 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>
@@ -37,7 +37,7 @@
<!-- 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#" xlink:title=" ">
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find#" 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>
@@ -69,7 +69,7 @@
<!-- 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#" xlink:title=" ">
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size#" 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>
@@ -102,7 +102,7 @@
<!-- 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#" xlink:title=" ">
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/insert#" 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>
@@ -118,7 +118,7 @@
<!-- 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#" xlink:title=" ">
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair#" 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>
@@ -139,7 +139,7 @@
<!-- 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#" xlink:title=" ">
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/size#" 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>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 8.2 KiB

After

Width:  |  Height:  |  Size: 8.1 KiB