backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-16 11:32:44 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 0931d530ae

Browse Source
This commit is contained in:
github-actions
2023-01-22 19:44:10 +00:00
parent a448f64699
commit b48f6e8671
2457 changed files with 9513 additions and 8691 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
db/d01/brent__method__extrema_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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: numerical_methods/brent_method_extrema.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -125,33 +125,33 @@ Macros</h2></td></tr>
<tr class="memdesc:a525335710b53cb064ca56b936120431e"><td class="mdescLeft">&#160;</td><td class="mdescRight">required for MS Visual C++ <br /></td></tr>
<tr class="separator:a525335710b53cb064ca56b936120431e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a002b2f4894492820fe708b1b7e7c5e70"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></td></tr>
<tr class="memdesc:a002b2f4894492820fe708b1b7e7c5e70"><td class="mdescLeft">&#160;</td><td class="mdescRight">system accuracy limit <a href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">More...</a><br /></td></tr>
<tr class="memdesc:a002b2f4894492820fe708b1b7e7c5e70"><td class="mdescLeft">&#160;</td><td class="mdescRight">system accuracy limit <br /></td></tr>
<tr class="separator:a002b2f4894492820fe708b1b7e7c5e70"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a1aa76a6d5fd4d333f9072beff1dc486b"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</td></tr>
<tr class="memdesc:a1aa76a6d5fd4d333f9072beff1dc486b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the real root of a function in the given interval. <a href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">More...</a><br /></td></tr>
<tr class="memdesc:a1aa76a6d5fd4d333f9072beff1dc486b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the real root of a function in the given interval. <br /></td></tr>
<tr class="separator:a1aa76a6d5fd4d333f9072beff1dc486b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</td></tr>
<tr class="memdesc:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test function to find root for the function \(f(x)= (x-2)^2\) in the interval \([1,5]\) <br />
Expected result = 2. <a href="../../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">More...</a><br /></td></tr>
Expected result = 2. <br /></td></tr>
<tr class="separator:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0283886819c7c140a023582b7269e2d0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a> ()</td></tr>
<tr class="memdesc:a0283886819c7c140a023582b7269e2d0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test function to find root for the function \(f(x)= x^{\frac{1}{x}}\) in the interval \([-2,10]\) <br />
Expected result: \(e\approx 2.71828182845904509\). <a href="../../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">More...</a><br /></td></tr>
Expected result: \(e\approx 2.71828182845904509\). <br /></td></tr>
<tr class="separator:a0283886819c7c140a023582b7269e2d0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6d0455dd5c30adda100e95f0423c786e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a> ()</td></tr>
<tr class="memdesc:a6d0455dd5c30adda100e95f0423c786e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test function to find <em>maxima</em> for the function \(f(x)= \cos x\) in the interval \([0,12]\) <br />
Expected result: \(\pi\approx 3.14159265358979312\). <a href="../../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">More...</a><br /></td></tr>
Expected result: \(\pi\approx 3.14159265358979312\). <br /></td></tr>
<tr class="separator:a6d0455dd5c30adda100e95f0423c786e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Find real extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Brent%27s_method" target="_blank">Brent's method</a>. </p>
<p >Refer the algorithm discoverer's publication <a href="https://maths-people.anu.edu.au/~brent/pd/rpb011i.pdf" target="_blank">online</a> and also associated book: </p><blockquote class="doxtable">
<p >&zwj;R. P. Brent, Algorithms for Minimization without Derivatives, Prentice-Hall, Englewood Cliffs, New Jersey, 1973 </p>
<div class="textblock"><p>Find real extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Brent%27s_method" target="_blank">Brent's method</a>. </p>
<p>Refer the algorithm discoverer's publication <a href="https://maths-people.anu.edu.au/~brent/pd/rpb011i.pdf" target="_blank">online</a> and also associated book: </p><blockquote class="doxtable">
<p>&zwj;R. P. Brent, Algorithms for Minimization without Derivatives, Prentice-Hall, Englewood Cliffs, New Jersey, 1973 </p>
</blockquote>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d6/d7a/golden__search__extrema_8cpp.html" title="Find extrema of a univariate real function in a given interval using golden section search algorithm.">golden_search_extrema.cpp</a></dd></dl>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
@@ -347,7 +347,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Main function </p>
<p>Main function </p>
<div class="fragment"><div class="line"><span class="lineno"> 204</span> {</div>
<div class="line"><span class="lineno"> 205</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>.precision(18);</div>
<div class="line"><span class="lineno"> 206</span> </div>
@@ -505,7 +505,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_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../db/d01/brent__method__extrema_8cpp.html">brent_method_extrema.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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: test2 Pages: 1 -->
<svg width="244pt" height="82pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.7 KiB

After

Width:  |  Height:  |  Size: 3.7 KiB

2
db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: test1 Pages: 1 -->
<svg width="244pt" height="64pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.0 KiB

After

Width:  |  Height:  |  Size: 3.0 KiB

2
db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: get_minima Pages: 1 -->
<svg width="170pt" height="64pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

2
db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: test3 Pages: 1 -->
<svg width="244pt" height="82pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.7 KiB

After

Width:  |  Height:  |  Size: 3.7 KiB

2
db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<svg width="318pt" height="101pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 7.2 KiB

After

Width:  |  Height:  |  Size: 7.2 KiB

10
db/d03/_s_t-example.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: ST</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -100,8 +100,8 @@ $(document).ready(function(){initNavTree('db/d03/_s_t-example.html','../../'); i
<div class="headertitle"><div class="title">ST</div></div>
</div><!--header-->
<div class="contents">
<p >Builds the sparse table for computing min/max/gcd/lcm/...etc for any contiguous sub-segment of the array.This is an example of computing the index of the minimum value.</p>
<p >Builds the sparse table for computing min/max/gcd/lcm/...etc for any contiguous sub-segment of the array.This is an example of computing the index of the minimum value. </p><dl class="section return"><dt>Returns</dt><dd>void @complexity: O(n.log(n))&lt; precomputing <code>log2(i+1)</code></dd></dl>
<p>Builds the sparse table for computing min/max/gcd/lcm/...etc for any contiguous sub-segment of the array.This is an example of computing the index of the minimum value.</p>
<p>Builds the sparse table for computing min/max/gcd/lcm/...etc for any contiguous sub-segment of the array.This is an example of computing the index of the minimum value. </p><dl class="section return"><dt>Returns</dt><dd>void @complexity: O(n.log(n))&lt; precomputing <code>log2(i+1)</code></dd></dl>
<dl class="section note"><dt>Note</dt><dd>notice how we deal with the range of length <code>pow(2,i)</code>, and we can reuse the computation that we did for the range of length <code>pow(2,i-1)</code>.</dd></dl>
<p>So, ST[j][i] = min( ST[j-1][i], ST[j-1][i + pow(2,j-1)]). [2][3] = min(ST[1][3], ST[1][5])</p>
<div class="fragment"> </div><!-- fragment --> </div><!-- contents -->
@@ -109,7 +109,7 @@ $(document).ready(function(){initNavTree('db/d03/_s_t-example.html','../../'); i
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.5 </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.6 </li>
</ul>
</div>
</body>

8
db/d03/namespacewildcard__matching.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: wildcard_matching Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -104,14 +104,14 @@ $(document).ready(function(){initNavTree('db/d03/namespacewildcard__matching.htm
<p>Functions for the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem.
<a href="../../db/d03/namespacewildcard__matching.html#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Functions for the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem. </p>
<div class="textblock"><p>Functions for the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem. </p>
</div></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</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.5 </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.6 </li>
</ul>
</div>
</body>

22
db/d07/spiral__print_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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: others/spiral_print.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -123,7 +123,7 @@ Functions</h2></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Print the elements of a matrix traversing it spirally. </p>
<div class="textblock"><p>Print the elements of a matrix traversing it spirally. </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="acfff36db81326fb990a643ab198ee8a5" name="acfff36db81326fb990a643ab198ee8a5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acfff36db81326fb990a643ab198ee8a5">&#9670;&#160;</a></span>genArray()</h2>
@@ -156,7 +156,7 @@ Functions</h2></td></tr>
</tr>
</table>
</div><div class="memdoc">
<p >Arrange sequence of numbers from '1' in a matrix form </p><dl class="params"><dt>Parameters</dt><dd>
<p>Arrange sequence of numbers from '1' in a matrix form </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[out]</td><td class="paramname">a</td><td>matrix to fill </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">r</td><td>number of rows </td></tr>
@@ -201,7 +201,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >main function </p>
<p>main function </p>
<div class="fragment"><div class="line"><span class="lineno"> 69</span> {</div>
<div class="line"><span class="lineno"> 70</span> <span class="keywordtype">int</span> r, c;</div>
<div class="line"><span class="lineno"> 71</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; r &gt;&gt; c;</div>
@@ -258,7 +258,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Traverse the matrix spirally and print the sequence of elements </p><dl class="params"><dt>Parameters</dt><dd>
<p>Traverse the matrix spirally and print the sequence of elements </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">a</td><td>matrix to read from </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">r</td><td>number of rows </td></tr>
@@ -266,10 +266,10 @@ Here is the call graph for this function:</div>
</table>
</dd>
</dl>
<p >Print start row</p>
<p >Print the end col</p>
<p >Print the end row</p>
<p >Print the start Col</p>
<p>Print start row</p>
<p>Print the end col</p>
<p>Print the end row</p>
<p>Print the start Col</p>
<div class="fragment"><div class="line"><span class="lineno"> 29</span> {</div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordtype">int</span> startRow = 0, endRow = r - 1;</div>
<div class="line"><span class="lineno"> 31</span> <span class="keywordtype">int</span> startCol = 0, endCol = c - 1;</div>
@@ -317,7 +317,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_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../db/d07/spiral__print_8cpp.html">spiral_print.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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: genArray Pages: 1 -->
<svg width="154pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.5 KiB

After

Width:  |  Height:  |  Size: 1.5 KiB

2
db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<svg width="232pt" height="64pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.8 KiB

After

Width:  |  Height:  |  Size: 2.8 KiB

2
db/d0c/check__amicable__pair_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: math/check_amicable_pair.cpp Pages: 1 -->
<svg width="130pt" height="93pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

20
db/d0d/prime__factorization_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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math/prime_factorization.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -136,7 +136,7 @@ Variables</h2></td></tr>
<tr class="separator:acfb0df439a4beae5a34ef131ce737c1b"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Prime factorization of positive integers. </p>
<div class="textblock"><p>Prime factorization of positive integers. </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -153,7 +153,7 @@ Variables</h2></td></tr>
</tr>
</table>
</div><div class="memdoc">
<p >Main program </p>
<p>Main program </p>
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordtype">int</span> num;</div>
<div class="line"><span class="lineno"> 64</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\t\tComputes the prime factorization\n\n&quot;</span>;</div>
@@ -201,7 +201,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Prime factorization of a number </p>
<p>Prime factorization of a number </p>
<div class="fragment"><div class="line"><span class="lineno"> 40</span> {</div>
<div class="line"><span class="lineno"> 41</span> <span class="keywordtype">int</span> number = num;</div>
<div class="line"><span class="lineno"> 42</span> </div>
@@ -248,7 +248,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Calculating prime number upto a given range </p>
<p>Calculating prime number upto a given range </p>
<div class="fragment"><div class="line"><span class="lineno"> 23</span> {</div>
<div class="line"><span class="lineno"> 24</span> <span class="comment">// initializes the array isprime</span></div>
<div class="line"><span class="lineno"> 25</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/memset.html">memset</a>(<a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>, <span class="keyword">true</span>, <span class="keyword">sizeof</span> <a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>);</div>
@@ -289,7 +289,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >list of prime factor-pairs </p>
<p>list of prime factor-pairs </p>
</div>
</div>
@@ -304,7 +304,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Declaring variables for maintaing prime numbers and to check whether a number is prime or not </p>
<p>Declaring variables for maintaing prime numbers and to check whether a number is prime or not </p>
</div>
</div>
@@ -319,7 +319,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >list of prime numbers </p>
<p>list of prime numbers </p>
</div>
</div>
@@ -329,7 +329,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_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../db/d0d/prime__factorization_8cpp.html">prime_factorization.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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: prime_factorization Pages: 1 -->
<svg width="224pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.5 KiB

After

Width:  |  Height:  |  Size: 1.5 KiB

2
db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<svg width="344pt" height="101pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.3 KiB

After

Width:  |  Height:  |  Size: 4.3 KiB

2
db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: SieveOfEratosthenes Pages: 1 -->
<svg width="270pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.5 KiB

After

Width:  |  Height:  |  Size: 1.5 KiB

2
db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: data_structures::queue_using_array::Queue_Array Pages: 1 -->
<svg width="143pt" height="181pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.8 KiB

After

Width:  |  Height:  |  Size: 2.8 KiB

2
db/d10/classdsu__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: dsu Pages: 1 -->
<svg width="124pt" height="203pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.9 KiB

After

Width:  |  Height:  |  Size: 2.9 KiB

2
db/d13/modular__inverse__simple_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: math/modular_inverse_simple.cpp Pages: 1 -->
<svg width="130pt" height="93pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

18
db/d16/0__1__knapsack_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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: dynamic_programming/0_1_knapsack.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -130,21 +130,21 @@ Namespaces</h2></td></tr>
Functions</h2></td></tr>
<tr class="memitem:a15edf30f336885e5b851f6b7199c6cd1"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
<tr class="memitem:a15edf30f336885e5b851f6b7199c6cd1"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a> (const int capacity, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;weight, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;value)</td></tr>
<tr class="memdesc:a15edf30f336885e5b851f6b7199c6cd1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Picking up all those items whose combined weight is below the given capacity and calculating the value of those picked items. Trying all possible combinations will yield the maximum knapsack value. <a href="../../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1">More...</a><br /></td></tr>
<tr class="memdesc:a15edf30f336885e5b851f6b7199c6cd1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Picking up all those items whose combined weight is below the given capacity and calculating the value of those picked items. Trying all possible combinations will yield the maximum knapsack value. <br /></td></tr>
<tr class="separator:a15edf30f336885e5b851f6b7199c6cd1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test the above algorithm. <a href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test the above algorithm. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Implementation of [0-1 <a class="el" href="../../d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem] (<a href="https://en.wikipedia.org/wiki/Knapsack_problem">https://en.wikipedia.org/wiki/Knapsack_problem</a>) </p>
<p >Given weights and values of n items, put these items in a knapsack of capacity <code>W</code> to get the maximum total value in the knapsack. In other words, given two integer arrays <code>val[0..n-1]</code> and <code>wt[0..n-1]</code> which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of <code>val[]</code> such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the complete item or don’t pick it (0-1 property)</p>
<div class="textblock"><p>Implementation of [0-1 <a class="el" href="../../d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem] (<a href="https://en.wikipedia.org/wiki/Knapsack_problem">https://en.wikipedia.org/wiki/Knapsack_problem</a>) </p>
<p>Given weights and values of n items, put these items in a knapsack of capacity <code>W</code> to get the maximum total value in the knapsack. In other words, given two integer arrays <code>val[0..n-1]</code> and <code>wt[0..n-1]</code> which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of <code>val[]</code> such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the complete item or don’t pick it (0-1 property)</p>
<h3><a class="anchor" id="autotoc_md67"></a>
Algorithm</h3>
<p >The idea is to consider all subsets of items and calculate the total weight and value of all subsets. Consider the only subsets whose total weight is smaller than <code>W</code>. From all such subsets, pick the maximum value subset.</p>
<p>The idea is to consider all subsets of items and calculate the total weight and value of all subsets. Consider the only subsets whose total weight is smaller than <code>W</code>. From all such subsets, pick the maximum value subset.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Anmol3299" target="_blank">Anmol</a> </dd>
<dd>
<a href="https://github.com/Pardeep009" target="_blank">Pardeep</a> </dd></dl>
@@ -349,7 +349,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_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../db/d16/0__1__knapsack_8cpp.html">0_1_knapsack.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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: dynamic_programming::knapsack::maxKnapsackValue Pages: 1 -->
<svg width="256pt" height="56pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.1 KiB

After

Width:  |  Height:  |  Size: 2.1 KiB

2
db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: test Pages: 1 -->
<svg width="131pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.5 KiB

After

Width:  |  Height:  |  Size: 1.5 KiB

2
db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<svg width="205pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

8
db/d19/structlinear__probing_1_1_entry.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: linear_probing::Entry Struct Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -120,7 +120,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>key</b></td></tr>
<tr class="separator:a4d84e90b73022083761f85f8586c4c2a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p ><a class="el" href="../../db/d8b/struct_node.html">Node</a> object that holds key </p>
<div class="textblock"><p><a class="el" href="../../db/d8b/struct_node.html">Node</a> object that holds key </p>
</div><hr/>The documentation for this struct was generated from the following file:<ul>
<li>hashing/<a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp.html">linear_probing_hash_table.cpp</a></li>
</ul>
@@ -130,7 +130,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>key</b></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d89/namespacelinear__probing.html">linear_probing</a></li><li class="navelem"><a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</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.5 </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.6 </li>
</ul>
</div>
</body>

6
db/d1e/classgraph_1_1_graph-members.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -115,7 +115,7 @@ $(document).ready(function(){initNavTree('dc/d61/classgraph_1_1_graph.html','../
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.5 </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.6 </li>
</ul>
</div>
</body>

22
db/d27/n__bonacci_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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math/n_bonacci.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -129,19 +129,19 @@ Namespaces</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a6849b68f760be628d5975ab3eddec63d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d">math::n_bonacci::N_bonacci</a> (const uint64_t &amp;n, const uint64_t &amp;m)</td></tr>
<tr class="memdesc:a6849b68f760be628d5975ab3eddec63d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds the N-Bonacci series for the <code>n</code> parameter value and <code>m</code> parameter terms. <a href="../../db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d">More...</a><br /></td></tr>
<tr class="memdesc:a6849b68f760be628d5975ab3eddec63d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds the N-Bonacci series for the <code>n</code> parameter value and <code>m</code> parameter terms. <br /></td></tr>
<tr class="separator:a6849b68f760be628d5975ab3eddec63d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <a href="../../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series. </p>
<p >In general, in N-bonacci sequence, we generate sum of preceding N numbers from the next term.</p>
<p >For example, a 3-bonacci sequence is the following: 0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81 In this code we take N and M as input where M is the number of terms to be printed of the N-bonacci series</p>
<div class="textblock"><p>Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series. </p>
<p>In general, in N-bonacci sequence, we generate sum of preceding N numbers from the next term.</p>
<p>For example, a 3-bonacci sequence is the following: 0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81 In this code we take N and M as input where M is the number of terms to be printed of the N-bonacci series</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -211,8 +211,8 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>the n-bonacci sequence as vector array </dd></dl>
<p >we initialise the (n-1)th term as 1 which is the sum of preceding N zeros</p>
<p >similarily the sum of preceding N zeros and the (N+1)th 1 is also 1</p>
<p>we initialise the (n-1)th term as 1 which is the sum of preceding N zeros</p>
<p>similarily the sum of preceding N zeros and the (N+1)th 1 is also 1</p>
<div class="fragment"><div class="line"><span class="lineno"> 41</span> {</div>
<div class="line"><span class="lineno"> 42</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> a(m, 0); <span class="comment">// we create an empty array of size m</span></div>
<div class="line"><span class="lineno"> 43</span> </div>
@@ -336,7 +336,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_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../db/d27/n__bonacci_8cpp.html">n_bonacci.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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: math::n_bonacci::N_bonacci Pages: 1 -->
<svg width="110pt" height="56pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.3 KiB

After

Width:  |  Height:  |  Size: 1.3 KiB

2
db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: test Pages: 1 -->
<svg width="136pt" height="138pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.6 KiB

After

Width:  |  Height:  |  Size: 3.6 KiB

2
db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<svg width="210pt" height="138pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.4 KiB

After

Width:  |  Height:  |  Size: 4.4 KiB

2
db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: geometry::jarvis::Convexhull Pages: 1 -->
<svg width="149pt" height="170pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.6 KiB

After

Width:  |  Height:  |  Size: 2.6 KiB

2
db/d30/fast__power_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: math/fast_power.cpp Pages: 1 -->
<svg width="379pt" height="82pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.5 KiB

After

Width:  |  Height:  |  Size: 4.5 KiB

6
db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -113,7 +113,7 @@ $(document).ready(function(){initNavTree('da/d37/structdata__structures_1_1spars
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.5 </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.6 </li>
</ul>
</div>
</body>

16
db/d3c/tower__of__hanoi_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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: others/tower_of_hanoi.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -131,7 +131,7 @@ Functions</h2></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Solve the <a href="https://en.wikipedia.org/wiki/Tower_of_Hanoi" target="_blank">Tower of Hanoi</a> problem. </p>
<div class="textblock"><p>Solve the <a href="https://en.wikipedia.org/wiki/Tower_of_Hanoi" target="_blank">Tower of Hanoi</a> problem. </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -148,7 +148,7 @@ Functions</h2></td></tr>
</tr>
</table>
</div><div class="memdoc">
<p >Main function </p>
<p>Main function </p>
<div class="fragment"><div class="line"><span class="lineno"> 65</span> {</div>
<div class="line"><span class="lineno"> 66</span> <span class="keyword">struct </span><a class="code hl_struct" href="../../d2/d2c/structtower.html">tower</a> F, U, T;</div>
<div class="line"><span class="lineno"> 67</span> </div>
@@ -209,7 +209,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Move one disc from one tower to another </p><dl class="params"><dt>Parameters</dt><dd>
<p>Move one disc from one tower to another </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in,out]</td><td class="paramname">From</td><td>tower to move disk <em>from</em> </td></tr>
<tr><td class="paramdir">[in,out]</td><td class="paramname">To</td><td>tower to move disk <em>to</em> </td></tr>
@@ -256,7 +256,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Display the towers </p>
<p>Display the towers </p>
<div class="fragment"><div class="line"><span class="lineno"> 20</span> {</div>
<div class="line"><span class="lineno"> 21</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\n\tF : &quot;</span>;</div>
<div class="line"><span class="lineno"> 22</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; F-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>; i++) {</div>
@@ -311,7 +311,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Recursive algorithm to solve the puzzle </p><dl class="params"><dt>Parameters</dt><dd>
<p>Recursive algorithm to solve the puzzle </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>starting number of disks </td></tr>
<tr><td class="paramdir">[in,out]</td><td class="paramname">From</td><td>tower to move disks from </td></tr>
@@ -347,7 +347,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_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../db/d3c/tower__of__hanoi_8cpp.html">tower_of_hanoi.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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: TH Pages: 1 -->
<svg width="109pt" height="45pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.8 KiB

After

Width:  |  Height:  |  Size: 1.8 KiB

2
db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<svg width="183pt" height="45pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

16
db/d3f/wave__sort_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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: sorting/wave_sort.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -130,18 +130,18 @@ Namespaces</h2></td></tr>
Functions</h2></td></tr>
<tr class="memitem:a7d4f243b9dc13ace4ef77e30dbc56f12"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a7d4f243b9dc13ace4ef77e30dbc56f12"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;in_arr, int64_t n)</td></tr>
<tr class="memdesc:a7d4f243b9dc13ace4ef77e30dbc56f12"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements that implements the Wave Sort algorithm. <a href="../../db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12">More...</a><br /></td></tr>
<tr class="memdesc:a7d4f243b9dc13ace4ef77e30dbc56f12"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements that implements the Wave Sort algorithm. <br /></td></tr>
<tr class="separator:a7d4f243b9dc13ace4ef77e30dbc56f12"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <a href="../../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Implementation of the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> algorithm. </p>
<p >Wave Sort is a sorting algorithm that works in \(O(nlogn)\) time assuming the sort function used works in \(O(nlogn)\) time. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd></dl>
<div class="textblock"><p>Implementation of the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> algorithm. </p>
<p>Wave Sort is a sorting algorithm that works in \(O(nlogn)\) time assuming the sort function used works in \(O(nlogn)\) time. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -317,7 +317,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_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../db/d3f/wave__sort_8cpp.html">wave_sort.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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: sorting::wave_sort::waveSort Pages: 1 -->
<svg width="233pt" height="138pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.2 KiB

After

Width:  |  Height:  |  Size: 4.2 KiB

2
db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: test Pages: 1 -->
<svg width="131pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.5 KiB

After

Width:  |  Height:  |  Size: 1.5 KiB

2
db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<svg width="205pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

26
db/d40/integral__approximation2_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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math/integral_approximation2.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -140,22 +140,22 @@ using&#160;</td><td class="memItemRight" valign="bottom"><b>math::monte_carlo::F
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a71249ee535f16f8ed2e9cc8f0199a2cf"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf">math::monte_carlo::generate_samples</a> (const double &amp;start_point, const Function &amp;pdf, const uint32_t &amp;num_samples, const uint32_t &amp;discard=100000)</td></tr>
<tr class="memdesc:a71249ee535f16f8ed2e9cc8f0199a2cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">short-hand for std::functions used in this implementation <a href="../../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf">More...</a><br /></td></tr>
<tr class="memdesc:a71249ee535f16f8ed2e9cc8f0199a2cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">short-hand for std::functions used in this implementation <br /></td></tr>
<tr class="separator:a71249ee535f16f8ed2e9cc8f0199a2cf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af7da9ba8932f1f48b9bbc2d80471af51"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51">math::monte_carlo::integral_monte_carlo</a> (const double &amp;start_point, const Function &amp;function, const Function &amp;pdf, const uint32_t &amp;num_samples=1000000)</td></tr>
<tr class="memdesc:af7da9ba8932f1f48b9bbc2d80471af51"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute an approximation of an integral using Monte Carlo integration. <a href="../../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51">More...</a><br /></td></tr>
<tr class="memdesc:af7da9ba8932f1f48b9bbc2d80471af51"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute an approximation of an integral using Monte Carlo integration. <br /></td></tr>
<tr class="separator:af7da9ba8932f1f48b9bbc2d80471af51"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <a href="../../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p ><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </p>
<p >In mathematics, Monte Carlo integration is a technique for numerical integration using random numbers. It is a particular Monte Carlo method that numerically computes a definite integral. While other algorithms usually evaluate the integrand at a regular grid, Monte Carlo randomly chooses points at which the integrand is evaluated. This method is particularly useful for higher-dimensional integrals.</p>
<p >This implementation supports arbitrary pdfs. These pdfs are sampled using the <a href="https://en.wikipedia.org/wiki/Metropolis–Hastings_algorithm" target="_blank">Metropolis-Hastings algorithm</a>. This can be swapped out by every other sampling techniques for example the inverse method. Metropolis-Hastings was chosen because it is the most general and can also be extended for a higher dimensional sampling space.</p>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </p>
<p>In mathematics, Monte Carlo integration is a technique for numerical integration using random numbers. It is a particular Monte Carlo method that numerically computes a definite integral. While other algorithms usually evaluate the integrand at a regular grid, Monte Carlo randomly chooses points at which the integrand is evaluated. This method is particularly useful for higher-dimensional integrals.</p>
<p>This implementation supports arbitrary pdfs. These pdfs are sampled using the <a href="https://en.wikipedia.org/wiki/Metropolis–Hastings_algorithm" target="_blank">Metropolis-Hastings algorithm</a>. This can be swapped out by every other sampling techniques for example the inverse method. Metropolis-Hastings was chosen because it is the most general and can also be extended for a higher dimensional sampling space.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/DerAndereDomenic" target="_blank">Domenic Zingsheim</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a71249ee535f16f8ed2e9cc8f0199a2cf" name="a71249ee535f16f8ed2e9cc8f0199a2cf"></a>
@@ -197,8 +197,8 @@ Functions</h2></td></tr>
</div><div class="memdoc">
<p>short-hand for std::functions used in this implementation </p>
<p >Generate samples according to some pdf</p>
<p >This function uses Metropolis-Hastings to generate random numbers. It generates a sequence of random numbers by using a markov chain. Therefore, we need to define a start_point and the number of samples we want to generate. Because the first samples generated by the markov chain may not be distributed according to the given pdf, one can specify how many samples should be discarded before storing samples. </p><dl class="params"><dt>Parameters</dt><dd>
<p>Generate samples according to some pdf</p>
<p>This function uses Metropolis-Hastings to generate random numbers. It generates a sequence of random numbers by using a markov chain. Therefore, we need to define a start_point and the number of samples we want to generate. Because the first samples generated by the markov chain may not be distributed according to the given pdf, one can specify how many samples should be discarded before storing samples. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">start_point</td><td>The starting point of the markov chain </td></tr>
<tr><td class="paramname">pdf</td><td>The pdf to sample </td></tr>
@@ -294,7 +294,7 @@ Here is the call graph for this function:</div>
</div><div class="memdoc">
<p>Compute an approximation of an integral using Monte Carlo integration. </p>
<p >The integration domain [a,b] is given by the pdf. The pdf has to fulfill the following conditions: 1) for all x \in [a,b] : p(x) &gt; 0 2) for all x \not\in [a,b] : p(x) = 0 3) \int_a^b p(x) dx = 1 </p><dl class="params"><dt>Parameters</dt><dd>
<p>The integration domain [a,b] is given by the pdf. The pdf has to fulfill the following conditions: 1) for all x \in [a,b] : p(x) &gt; 0 2) for all x \not\in [a,b] : p(x) = 0 3) \int_a^b p(x) dx = 1 </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">start_point</td><td>The start point of the Markov Chain (see generate_samples) </td></tr>
<tr><td class="paramname">function</td><td>The function to integrate </td></tr>
@@ -484,7 +484,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_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../db/d40/integral__approximation2_8cpp.html">integral_approximation2.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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: math::monte_carlo::generate_samples Pages: 1 -->
<svg width="264pt" height="101pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.5 KiB

After

Width:  |  Height:  |  Size: 3.5 KiB

2
db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: test Pages: 1 -->
<svg width="131pt" height="138pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.6 KiB

After

Width:  |  Height:  |  Size: 3.6 KiB

2
db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<svg width="205pt" height="138pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.3 KiB

After

Width:  |  Height:  |  Size: 4.3 KiB

2
db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: math::monte_carlo::integral_monte_carlo Pages: 1 -->
<svg width="407pt" height="107pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.4 KiB

After

Width:  |  Height:  |  Size: 5.4 KiB

2
db/d4e/depth__first__search_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: graph/depth_first_search.cpp Pages: 1 -->
<svg width="198pt" height="82pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.7 KiB

After

Width:  |  Height:  |  Size: 2.7 KiB

2
db/d51/fibonacci__fast_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: math/fibonacci_fast.cpp Pages: 1 -->
<svg width="198pt" height="82pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.7 KiB

After

Width:  |  Height:  |  Size: 2.7 KiB

18
db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures::stack_using_queue::Stack Struct Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -119,13 +119,13 @@ Public Member Functions</h2></td></tr>
<tr class="memitem:a5540434e1b41245205eee86f664906f7"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7">top</a> ()</td></tr>
<tr class="separator:a5540434e1b41245205eee86f664906f7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af04a8f3536a52d8c9916086b656eefc2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">push</a> (int val)</td></tr>
<tr class="memdesc:af04a8f3536a52d8c9916086b656eefc2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts an element to the top of the stack. <a href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">More...</a><br /></td></tr>
<tr class="memdesc:af04a8f3536a52d8c9916086b656eefc2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts an element to the top of the stack. <br /></td></tr>
<tr class="separator:af04a8f3536a52d8c9916086b656eefc2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abdd461689df4983a3ad3b05d853cf5eb"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">pop</a> ()</td></tr>
<tr class="memdesc:abdd461689df4983a3ad3b05d853cf5eb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Removes the topmost element from the stack. <a href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">More...</a><br /></td></tr>
<tr class="memdesc:abdd461689df4983a3ad3b05d853cf5eb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Removes the topmost element from the stack. <br /></td></tr>
<tr class="separator:abdd461689df4983a3ad3b05d853cf5eb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac0ddec9ab8f778dad23ec446d7a77b39"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">size</a> ()</td></tr>
<tr class="memdesc:ac0ddec9ab8f778dad23ec446d7a77b39"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to return the current size of the stack. <a href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">More...</a><br /></td></tr>
<tr class="memdesc:ac0ddec9ab8f778dad23ec446d7a77b39"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to return the current size of the stack. <br /></td></tr>
<tr class="separator:ac0ddec9ab8f778dad23ec446d7a77b39"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
@@ -142,7 +142,7 @@ uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>current_size</b>
<tr class="separator:afdfd2f4418c70b1bda50f2c3e416d80b"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p ><a class="el" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure. </p>
<div class="textblock"><p><a class="el" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure. </p>
</div><h2 class="groupheader">Member Function Documentation</h2>
<a id="abdd461689df4983a3ad3b05d853cf5eb" name="abdd461689df4983a3ad3b05d853cf5eb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abdd461689df4983a3ad3b05d853cf5eb">&#9670;&#160;</a></span>pop()</h2>
@@ -294,7 +294,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Returns the top most element of the stack </p><dl class="section return"><dt>Returns</dt><dd>top element of the queue </dd></dl>
<p>Returns the top most element of the stack </p><dl class="section return"><dt>Returns</dt><dd>top element of the queue </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 40</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>(); }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -317,7 +317,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >used to carry out intermediate operations to implement stack </p>
<p>used to carry out intermediate operations to implement stack </p>
</div>
</div>
@@ -330,7 +330,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="../../d5/d3c/namespacedata__structures.html">data_structures</a></li><li class="navelem"><b>stack_using_queue</b></li><li class="navelem"><a class="el" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html">Stack</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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: data_structures::stack_using_queue::Stack::top Pages: 1 -->
<svg width="260pt" height="38pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: data_structures::stack_using_queue::Stack::pop Pages: 1 -->
<svg width="269pt" height="64pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.5 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

2
db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: data_structures::stack_using_queue::Stack::push Pages: 1 -->
<svg width="274pt" height="138pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

6
db/d62/class_easter_year_month_day-members.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -112,7 +112,7 @@ $(document).ready(function(){initNavTree('d1/df6/class_easter_year_month_day.htm
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: math::ncr_modulo_p::NCRModuloP Pages: 1 -->
<svg width="124pt" height="170pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.7 KiB

After

Width:  |  Height:  |  Size: 2.7 KiB

6
db/d66/struct_item.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Item Struct Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -122,7 +122,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>profit</b></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../db/d66/struct_item.html">Item</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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: others::recursive_tree_traversals::Node Pages: 1 -->
<svg width="156pt" height="38pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.6 KiB

After

Width:  |  Height:  |  Size: 1.6 KiB

2
db/d6c/count__inversions_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: sorting/count_inversions.cpp Pages: 1 -->
<svg width="256pt" height="82pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

2
db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: std::is_unsigned&lt; uint256_t &gt; Pages: 1 -->
<svg width="154pt" height="82pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.6 KiB

After

Width:  |  Height:  |  Size: 1.6 KiB

8
db/d6f/namespaceheavy__light__decomposition.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: heavy_light_decomposition Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -104,14 +104,14 @@ $(document).ready(function(){initNavTree('db/d6f/namespaceheavy__light__decompos
<p>Heavy light decomposition algorithm.
<a href="../../db/d6f/namespaceheavy__light__decomposition.html#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Heavy light decomposition algorithm. </p>
<div class="textblock"><p>Heavy light decomposition algorithm. </p>
</div></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../db/d6f/namespaceheavy__light__decomposition.html">heavy_light_decomposition</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.5 </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.6 </li>
</ul>
</div>
</body>

10
db/d71/quadratic__probing__hash__table_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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: hashing/quadratic_probing_hash_table.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -185,7 +185,7 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>quadratic_probing::re
<tr class="separator:ad20bb8020424def88917e26979051fae"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Storage mechanism using <a href="https://en.wikipedia.org/wiki/Quadratic_probing" target="_blank">quadratic probing hash</a> keys. </p>
<div class="textblock"><p>Storage mechanism using <a href="https://en.wikipedia.org/wiki/Quadratic_probing" target="_blank">quadratic probing hash</a> keys. </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/achance6" target="_blank">achance6</a> </dd>
<dd>
<a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
@@ -206,7 +206,7 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>quadratic_probing::re
</tr>
</table>
</div><div class="memdoc">
<p >Main function </p><dl class="section return"><dt>Returns</dt><dd>None </dd></dl>
<p>Main function </p><dl class="section return"><dt>Returns</dt><dd>None </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 246</span> {</div>
<div class="line"><span class="lineno"> 247</span> <span class="keywordtype">int</span> cmd = 0, <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hash</a> = 0, key = 0;</div>
<div class="line"><span class="lineno"> 248</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the initial size of Hash Table. = &quot;</span>;</div>
@@ -290,7 +290,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_ece9b94c107bbaa1dd68197a8c9983b9.html">hashing</a></li><li class="navelem"><a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp.html">quadratic_probing_hash_table.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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<!--zoomable 359 -->
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 22 KiB

After

Width:  |  Height:  |  Size: 22 KiB

2
db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<svg width="602pt" height="359pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 17 KiB

After

Width:  |  Height:  |  Size: 17 KiB

2
db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: std::is_arithmetic&lt; uint128_t &gt; Pages: 1 -->
<svg width="100pt" height="93pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

48
db/d82/classlarge__number.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: large_number Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -181,7 +181,7 @@ Friends</h2></td></tr>
<tr class="separator:abbd52948bee1b16543f1dae19aa9dd46"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Store large unsigned numbers as a C++ vector The class provides convenience functions to add a digit to the number, perform multiplication of large number with long unsigned integers. </p>
<div class="textblock"><p>Store large unsigned numbers as a C++ vector The class provides convenience functions to add a digit to the number, perform multiplication of large number with long unsigned integers. </p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a10119a83839e65962621b73df46a5337" name="a10119a83839e65962621b73df46a5337"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a10119a83839e65962621b73df46a5337">&#9670;&#160;</a></span>large_number() <span class="overload">[1/5]</span></h2>
@@ -205,7 +205,7 @@ Friends</h2></td></tr>
</tr>
</table>
</div><div class="memdoc">
<p >&lt; initializer with value = 1 </p>
<p>&lt; initializer with value = 1 </p>
<div class="fragment"><div class="line"><span class="lineno"> 27</span>{ <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(1); }</div>
<div class="ttc" id="aclasslarge__number_html_af2b3ec9c35842d3a46ac7326f268af57"><div class="ttname"><a href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">large_number::_digits</a></div><div class="ttdeci">std::vector&lt; unsigned char &gt; _digits</div><div class="ttdef"><b>Definition:</b> large_number.h:285</div></div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
@@ -241,7 +241,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >&lt; initializer from an integer initializer from another <a class="el" href="../../db/d82/classlarge__number.html">large_number</a> </p>
<p>&lt; initializer from an integer initializer from another <a class="el" href="../../db/d82/classlarge__number.html">large_number</a> </p>
<div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -274,7 +274,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >initializer from a vector </p>
<p>initializer from a vector </p>
</div>
</div>
@@ -301,7 +301,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >initializer from a string </p>
<p>initializer from a string </p>
</div>
</div>
@@ -363,7 +363,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >add a digit at MSB to the large number </p>
<p>add a digit at MSB to the large number </p>
<div class="fragment"><div class="line"><span class="lineno"> 118</span> {</div>
<div class="line"><span class="lineno"> 119</span> <span class="keywordflow">if</span> (value &gt; 9) {</div>
<div class="line"><span class="lineno"> 120</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;digit &gt; 9!!\n&quot;</span>;</div>
@@ -406,7 +406,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >returns i^th digit as an ASCII character </p>
<p>returns i^th digit as an ASCII character </p>
<div class="fragment"><div class="line"><span class="lineno"> 248</span> {</div>
<div class="line"><span class="lineno"> 249</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>[<a class="code hl_function" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>() - i - 1] + <span class="charliteral">&#39;0&#39;</span>;</div>
<div class="line"><span class="lineno"> 250</span> }</div>
@@ -445,7 +445,7 @@ template&lt;class T &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >multiply large number with another integer and store the result in the same large number </p>
<p>multiply large number with another integer and store the result in the same large number </p>
<div class="fragment"><div class="line"><span class="lineno"> 258</span> {</div>
<div class="line"><span class="lineno"> 259</span> <span class="keyword">static_assert</span>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>,</div>
<div class="line"><span class="lineno"> 260</span> <span class="stringliteral">&quot;Can only have integer types.&quot;</span>);</div>
@@ -504,7 +504,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Get number of digits in the number </p>
<p>Get number of digits in the number </p>
<div class="fragment"><div class="line"><span class="lineno"> 130</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); }</div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
@@ -541,7 +541,7 @@ template&lt;class T &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >operator overload to increment </p>
<p>operator overload to increment </p>
<div class="fragment"><div class="line"><span class="lineno"> 238</span> {</div>
<div class="line"><span class="lineno"> 239</span> <span class="keyword">static_assert</span>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>,</div>
<div class="line"><span class="lineno"> 240</span> <span class="stringliteral">&quot;Must be integer addition unsigned integer types.&quot;</span>);</div>
@@ -580,7 +580,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >operator overload to increment (prefix) </p>
<p>operator overload to increment (prefix) </p>
<div class="fragment"><div class="line"><span class="lineno"> 175</span> {</div>
<div class="line"><span class="lineno"> 176</span> (*this) += 1;</div>
<div class="line"><span class="lineno"> 177</span> <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -611,7 +611,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >operator overload to increment (postfix) </p>
<p>operator overload to increment (postfix) </p>
<div class="fragment"><div class="line"><span class="lineno"> 183</span> {</div>
<div class="line"><span class="lineno"> 184</span> <span class="keyword">static</span> <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> tmp(<a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>);</div>
<div class="line"><span class="lineno"> 185</span> ++(*this);</div>
@@ -672,7 +672,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >operator overload to add </p>
<p>operator overload to add </p>
<div class="fragment"><div class="line"><span class="lineno"> 192</span> {</div>
<div class="line"><span class="lineno"> 193</span> <span class="comment">// if adding with another large_number</span></div>
<div class="line"><span class="lineno"> 194</span> <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> *b = <span class="keyword">reinterpret_cast&lt;</span><a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> *<span class="keyword">&gt;</span>(&amp;n);</div>
@@ -725,7 +725,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >assignment operator </p>
<p>assignment operator </p>
<div class="fragment"><div class="line"><span class="lineno"> 229</span> {</div>
<div class="line"><span class="lineno"> 230</span> this-&gt;<a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a> = b.<a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>;</div>
<div class="line"><span class="lineno"> 231</span> <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -756,7 +756,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >operator over load to access the i^th digit conveniently and also assign value to it </p>
<p>operator over load to access the i^th digit conveniently and also assign value to it </p>
<div class="fragment"><div class="line"><span class="lineno"> 137</span>{ <span class="keywordflow">return</span> this-&gt;<a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>[n]; }</div>
</div><!-- fragment -->
</div>
@@ -812,7 +812,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Function to check implementation </p>
<p>Function to check implementation </p>
<div class="fragment"><div class="line"><span class="lineno"> 65</span> {</div>
<div class="line"><span class="lineno"> 66</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------ Checking `large_number` class implementations\t&quot;</span></div>
<div class="line"><span class="lineno"> 67</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
@@ -906,7 +906,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >operator overload to compare two numbers </p>
<p>operator overload to compare two numbers </p>
<div class="fragment"><div class="line"><span class="lineno"> 168</span> {</div>
<div class="line"><span class="lineno"> 169</span> <span class="keywordflow">return</span> !(a == b);</div>
<div class="line"><span class="lineno"> 170</span> }</div>
@@ -948,7 +948,7 @@ template&lt;class T &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >operator overload to perform addition </p>
<p>operator overload to perform addition </p>
<div class="fragment"><div class="line"><span class="lineno"> 220</span> {</div>
<div class="line"><span class="lineno"> 221</span> <span class="keyword">static</span> <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> c = a;</div>
<div class="line"><span class="lineno"> 222</span> c += b;</div>
@@ -990,7 +990,7 @@ template&lt;class T &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >operator overload to compare two numbers </p>
<p>operator overload to compare two numbers </p>
<div class="fragment"><div class="line"><span class="lineno"> 146</span> {</div>
<div class="line"><span class="lineno"> 147</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = a.num_digits(); i &gt; 0; i--)</div>
<div class="line"><span class="lineno"> 148</span> out &lt;&lt; static_cast&lt;int&gt;(a[i - 1]);</div>
@@ -1032,7 +1032,7 @@ template&lt;class T &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >operator overload to compare two numbers </p>
<p>operator overload to compare two numbers </p>
<div class="fragment"><div class="line"><span class="lineno"> 155</span> {</div>
<div class="line"><span class="lineno"> 156</span> <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = a.num_digits();</div>
<div class="line"><span class="lineno"> 157</span> <span class="keywordflow">if</span> (N != b.num_digits())</div>
@@ -1066,7 +1066,7 @@ template&lt;class T &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >where individual digits are stored </p>
<p>where individual digits are stored </p>
</div>
</div>
@@ -1079,7 +1079,7 @@ template&lt;class T &gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../db/d82/classlarge__number.html">large_number</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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: large_number::large_number Pages: 1 -->
<svg width="262pt" height="38pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: large_number::multiply Pages: 1 -->
<svg width="439pt" height="64pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.7 KiB

After

Width:  |  Height:  |  Size: 3.7 KiB

2
db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: large_number::add_digit Pages: 1 -->
<svg width="280pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.5 KiB

After

Width:  |  Height:  |  Size: 1.5 KiB

2
db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: large_number::operator*= Pages: 1 -->
<!--zoomable 64 -->
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 9.4 KiB

After

Width:  |  Height:  |  Size: 9.4 KiB

2
db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: large_number::operator*= Pages: 1 -->
<svg width="601pt" height="64pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.4 KiB

After

Width:  |  Height:  |  Size: 4.4 KiB

2
db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: large_number::test Pages: 1 -->
<svg width="396pt" height="76pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.1 KiB

After

Width:  |  Height:  |  Size: 3.1 KiB

2
db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: large_number::operator+= Pages: 1 -->
<svg width="452pt" height="101pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.3 KiB

After

Width:  |  Height:  |  Size: 4.3 KiB

2
db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: large_number::num_digits Pages: 1 -->
<svg width="259pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.5 KiB

After

Width:  |  Height:  |  Size: 1.5 KiB

2
db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: large_number::digit_char Pages: 1 -->
<svg width="418pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

2
db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: large_number::large_number Pages: 1 -->
<svg width="418pt" height="38pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

6
db/d8b/struct_node.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Node Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -179,7 +179,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>val</b></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../db/d8b/struct_node.html">Node</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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d8e/lowest__common__ancestor_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: graph/lowest_common_ancestor.cpp Pages: 1 -->
<svg width="312pt" height="93pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

2
db/d8f/struct_btree__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: Btree Pages: 1 -->
<svg width="85pt" height="30pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.3 KiB

After

Width:  |  Height:  |  Size: 1.3 KiB

2
db/d91/binomial__calculate_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: math/binomial_calculate.cpp Pages: 1 -->
<svg width="258pt" height="82pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

16
db/d93/check__prime_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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math/check_prime.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -118,14 +118,14 @@ Include dependency graph for check_prime.cpp:</div>
Functions</h2></td></tr>
<tr class="memitem:aa18b3517017d99bb4024853bddba5532"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:aa18b3517017d99bb4024853bddba5532"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a> (T num)</td></tr>
<tr class="memdesc:aa18b3517017d99bb4024853bddba5532"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <a href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">More...</a><br /></td></tr>
<tr class="memdesc:aa18b3517017d99bb4024853bddba5532"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <br /></td></tr>
<tr class="separator:aa18b3517017d99bb4024853bddba5532"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+6 jumping and check for i or i+2 to be a factor of the number; if it's a factor then we will return false otherwise true after the loop terminates at the terminating condition which is (i*i&lt;=num) </p>
<p >Copyright 2020 </p><dl class="section author"><dt>Author</dt><dd>omkarlanghe</dd></dl>
<div class="textblock"><p>Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+6 jumping and check for i or i+2 to be a factor of the number; if it's a factor then we will return false otherwise true after the loop terminates at the terminating condition which is (i*i&lt;=num) </p>
<p>Copyright 2020 </p><dl class="section author"><dt>Author</dt><dd>omkarlanghe</dd></dl>
<p>A simple program to check if the given number if prime or not. </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="aa18b3517017d99bb4024853bddba5532" name="aa18b3517017d99bb4024853bddba5532"></a>
@@ -147,7 +147,7 @@ template&lt;typename T &gt; </div>
</div><div class="memdoc">
<p>for IO operations </p>
<p >for assert Function to check if the given number is prime or not. </p><dl class="params"><dt>Parameters</dt><dd>
<p>for assert Function to check if the given number is prime or not. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">num</td><td>number to be checked. </td></tr>
</table>
@@ -191,7 +191,7 @@ template&lt;typename T &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >Main function </p>
<p>Main function </p>
<div class="fragment"><div class="line"><span class="lineno"> 46</span> {</div>
<div class="line"><span class="lineno"> 47</span> <span class="comment">// perform self-test</span></div>
<div class="line"><span class="lineno"> 48</span> assert(<a class="code hl_function" href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a>(50) == <span class="keyword">false</span>);</div>
@@ -228,7 +228,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_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../db/d93/check__prime_8cpp.html">check_prime.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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<svg width="136pt" height="64pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

2
db/d93/morse__code_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: ciphers/morse_code.cpp Pages: 1 -->
<svg width="252pt" height="82pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

174
db/d9a/classuint128__t.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: uint128_t Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -116,52 +116,52 @@ $(document).ready(function(){initNavTree('db/d9a/classuint128__t.html','../../')
Public Member Functions</h2></td></tr>
<tr class="memitem:adce2432b148fe18179a5ea272f4eb040"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:adce2432b148fe18179a5ea272f4eb040"><td class="memTemplItemLeft" align="right" valign="top">&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">uint128_t</a> (T low)</td></tr>
<tr class="memdesc:adce2432b148fe18179a5ea272f4eb040"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized constructor. <a href="../../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">More...</a><br /></td></tr>
<tr class="memdesc:adce2432b148fe18179a5ea272f4eb040"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized constructor. <br /></td></tr>
<tr class="separator:adce2432b148fe18179a5ea272f4eb040"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0b6612186d8f678452e011d08ee1f5ac"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac">uint128_t</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str)</td></tr>
<tr class="memdesc:a0b6612186d8f678452e011d08ee1f5ac"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized constructor. <a href="../../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac">More...</a><br /></td></tr>
<tr class="memdesc:a0b6612186d8f678452e011d08ee1f5ac"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized constructor. <br /></td></tr>
<tr class="separator:a0b6612186d8f678452e011d08ee1f5ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a95ac8be8f414fcbce09301b912f5079d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d">uint128_t</a> (const uint64_t high, const uint64_t low)</td></tr>
<tr class="memdesc:a95ac8be8f414fcbce09301b912f5079d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized constructor. <a href="../../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d">More...</a><br /></td></tr>
<tr class="memdesc:a95ac8be8f414fcbce09301b912f5079d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized constructor. <br /></td></tr>
<tr class="separator:a95ac8be8f414fcbce09301b912f5079d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a60bf2739c93bb1cd41654fd60c76ae6b"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b">uint128_t</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;num)=default</td></tr>
<tr class="memdesc:a60bf2739c93bb1cd41654fd60c76ae6b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Copy constructor. <a href="../../db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b">More...</a><br /></td></tr>
<tr class="memdesc:a60bf2739c93bb1cd41654fd60c76ae6b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Copy constructor. <br /></td></tr>
<tr class="separator:a60bf2739c93bb1cd41654fd60c76ae6b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7d56143b2e291e8087188192533d2e3c"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c">uint128_t</a> (<a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&amp;num) noexcept</td></tr>
<tr class="memdesc:a7d56143b2e291e8087188192533d2e3c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Move constructor. <a href="../../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c">More...</a><br /></td></tr>
<tr class="memdesc:a7d56143b2e291e8087188192533d2e3c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Move constructor. <br /></td></tr>
<tr class="separator:a7d56143b2e291e8087188192533d2e3c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4147188abcdcdb12c61bfbe4e4c0a363"><td class="memItemLeft" align="right" valign="top"><a id="a4147188abcdcdb12c61bfbe4e4c0a363" name="a4147188abcdcdb12c61bfbe4e4c0a363"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>~uint128_t</b> ()=default</td></tr>
<tr class="memdesc:a4147188abcdcdb12c61bfbe4e4c0a363"><td class="mdescLeft">&#160;</td><td class="mdescRight">Destructor for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a>. <br /></td></tr>
<tr class="separator:a4147188abcdcdb12c61bfbe4e4c0a363"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af139bb6e630f1a61919f180978611cd2"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">_lez</a> ()</td></tr>
<tr class="memdesc:af139bb6e630f1a61919f180978611cd2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Leading zeroes in binary. <a href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">More...</a><br /></td></tr>
<tr class="memdesc:af139bb6e630f1a61919f180978611cd2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Leading zeroes in binary. <br /></td></tr>
<tr class="separator:af139bb6e630f1a61919f180978611cd2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7d2285a8a6e20b77f82f1f0351afe76e"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">_trz</a> ()</td></tr>
<tr class="memdesc:a7d2285a8a6e20b77f82f1f0351afe76e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Trailing zeroes in binary. <a href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">More...</a><br /></td></tr>
<tr class="memdesc:a7d2285a8a6e20b77f82f1f0351afe76e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Trailing zeroes in binary. <br /></td></tr>
<tr class="separator:a7d2285a8a6e20b77f82f1f0351afe76e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6d45302022ef7f5195458f41b8aedb6e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e">operator bool</a> () const</td></tr>
<tr class="memdesc:a6d45302022ef7f5195458f41b8aedb6e"><td class="mdescLeft">&#160;</td><td class="mdescRight">casting operator to boolean value <a href="../../db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e">More...</a><br /></td></tr>
<tr class="memdesc:a6d45302022ef7f5195458f41b8aedb6e"><td class="mdescLeft">&#160;</td><td class="mdescRight">casting operator to boolean value <br /></td></tr>
<tr class="separator:a6d45302022ef7f5195458f41b8aedb6e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a75767cb2b6fd47ecb1f721755fdc7639"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a75767cb2b6fd47ecb1f721755fdc7639"><td class="memTemplItemLeft" align="right" valign="top">&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639">operator T</a> () const</td></tr>
<tr class="memdesc:a75767cb2b6fd47ecb1f721755fdc7639"><td class="mdescLeft">&#160;</td><td class="mdescRight">casting operator to any integer valu <a href="../../db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639">More...</a><br /></td></tr>
<tr class="memdesc:a75767cb2b6fd47ecb1f721755fdc7639"><td class="mdescLeft">&#160;</td><td class="mdescRight">casting operator to any integer valu <br /></td></tr>
<tr class="separator:a75767cb2b6fd47ecb1f721755fdc7639"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa69e1064c0b0b1df1c61acd2ea04fabd"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">lower</a> () const</td></tr>
<tr class="memdesc:aa69e1064c0b0b1df1c61acd2ea04fabd"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns lower 64-bit integer part <a href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">More...</a><br /></td></tr>
<tr class="memdesc:aa69e1064c0b0b1df1c61acd2ea04fabd"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns lower 64-bit integer part <br /></td></tr>
<tr class="separator:aa69e1064c0b0b1df1c61acd2ea04fabd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1ee2f1ffbd9984faad34883eb45e9705"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">upper</a> () const</td></tr>
<tr class="memdesc:a1ee2f1ffbd9984faad34883eb45e9705"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns upper 64-bit integer part <a href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">More...</a><br /></td></tr>
<tr class="memdesc:a1ee2f1ffbd9984faad34883eb45e9705"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns upper 64-bit integer part <br /></td></tr>
<tr class="separator:a1ee2f1ffbd9984faad34883eb45e9705"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac924cc09bbb919532dc42f1f93f6f544"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:ac924cc09bbb919532dc42f1f93f6f544"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544">operator=</a> (const T &amp;p)</td></tr>
<tr class="memdesc:ac924cc09bbb919532dc42f1f93f6f544"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator = for other types <a href="../../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544">More...</a><br /></td></tr>
<tr class="memdesc:ac924cc09bbb919532dc42f1f93f6f544"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator = for other types <br /></td></tr>
<tr class="separator:ac924cc09bbb919532dc42f1f93f6f544"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abae08ef3c1d6dc512edd68ca68327f74"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74">operator=</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;p)</td></tr>
<tr class="memdesc:abae08ef3c1d6dc512edd68ca68327f74"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator = for type string <a href="../../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74">More...</a><br /></td></tr>
<tr class="memdesc:abae08ef3c1d6dc512edd68ca68327f74"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator = for type string <br /></td></tr>
<tr class="separator:abae08ef3c1d6dc512edd68ca68327f74"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab6aa4d14ed52c7c640468c45350da0c5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5">operator=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)=default</td></tr>
<tr class="memdesc:ab6aa4d14ed52c7c640468c45350da0c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator = for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5">More...</a><br /></td></tr>
<tr class="memdesc:ab6aa4d14ed52c7c640468c45350da0c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator = for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:ab6aa4d14ed52c7c640468c45350da0c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3c4a7e775a0820196fc08303bbeed44a"><td class="memItemLeft" align="right" valign="top"><a id="a3c4a7e775a0820196fc08303bbeed44a" name="a3c4a7e775a0820196fc08303bbeed44a"></a>
<a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><b>operator=</b> (<a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&amp;p)=default</td></tr>
@@ -169,220 +169,220 @@ Public Member Functions</h2></td></tr>
<tr class="separator:a3c4a7e775a0820196fc08303bbeed44a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5133f854a93efe47fd1f0f6a9589856d"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a5133f854a93efe47fd1f0f6a9589856d"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d">operator+</a> (const T p)</td></tr>
<tr class="memdesc:a5133f854a93efe47fd1f0f6a9589856d"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator + for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d">More...</a><br /></td></tr>
<tr class="memdesc:a5133f854a93efe47fd1f0f6a9589856d"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator + for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:a5133f854a93efe47fd1f0f6a9589856d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0fd125cc2b7702370a4aefa740d57606"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606">operator+</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:a0fd125cc2b7702370a4aefa740d57606"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator + for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606">More...</a><br /></td></tr>
<tr class="memdesc:a0fd125cc2b7702370a4aefa740d57606"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator + for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:a0fd125cc2b7702370a4aefa740d57606"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a55a3f122c4d982c60c2eb9fc09b9e004"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a55a3f122c4d982c60c2eb9fc09b9e004"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004">operator+=</a> (const T p)</td></tr>
<tr class="memdesc:a55a3f122c4d982c60c2eb9fc09b9e004"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator += for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004">More...</a><br /></td></tr>
<tr class="memdesc:a55a3f122c4d982c60c2eb9fc09b9e004"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator += for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:a55a3f122c4d982c60c2eb9fc09b9e004"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9704e6a4d32750461bff663e40e537cb"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb">operator+=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:a9704e6a4d32750461bff663e40e537cb"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator += for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb">More...</a><br /></td></tr>
<tr class="memdesc:a9704e6a4d32750461bff663e40e537cb"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator += for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a9704e6a4d32750461bff663e40e537cb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac8d293d20cdf65c48d8d1e0ba7034c8e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e">operator++</a> ()</td></tr>
<tr class="memdesc:ac8d293d20cdf65c48d8d1e0ba7034c8e"><td class="mdescLeft">&#160;</td><td class="mdescRight">pre-increment operator <a href="../../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e">More...</a><br /></td></tr>
<tr class="memdesc:ac8d293d20cdf65c48d8d1e0ba7034c8e"><td class="mdescLeft">&#160;</td><td class="mdescRight">pre-increment operator <br /></td></tr>
<tr class="separator:ac8d293d20cdf65c48d8d1e0ba7034c8e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af71990a1fba93a5528ddb1e6662bffd6"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6">operator++</a> (int)</td></tr>
<tr class="memdesc:af71990a1fba93a5528ddb1e6662bffd6"><td class="mdescLeft">&#160;</td><td class="mdescRight">post-increment operator <a href="../../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6">More...</a><br /></td></tr>
<tr class="memdesc:af71990a1fba93a5528ddb1e6662bffd6"><td class="mdescLeft">&#160;</td><td class="mdescRight">post-increment operator <br /></td></tr>
<tr class="separator:af71990a1fba93a5528ddb1e6662bffd6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6824700c9c732a4200e7493fe7ed0eec"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a6824700c9c732a4200e7493fe7ed0eec"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec">operator-</a> (const T &amp;p)</td></tr>
<tr class="memdesc:a6824700c9c732a4200e7493fe7ed0eec"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator - for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec">More...</a><br /></td></tr>
<tr class="memdesc:a6824700c9c732a4200e7493fe7ed0eec"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator - for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:a6824700c9c732a4200e7493fe7ed0eec"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a81a568510e6d0b0950133dd9fc37fc0c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c">operator-</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:a81a568510e6d0b0950133dd9fc37fc0c"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator - for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c">More...</a><br /></td></tr>
<tr class="memdesc:a81a568510e6d0b0950133dd9fc37fc0c"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator - for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a81a568510e6d0b0950133dd9fc37fc0c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a07945fe010079a35e18812636d5c70c3"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3">operator-</a> ()</td></tr>
<tr class="memdesc:a07945fe010079a35e18812636d5c70c3"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator - using twos complement <a href="../../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3">More...</a><br /></td></tr>
<tr class="memdesc:a07945fe010079a35e18812636d5c70c3"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator - using twos complement <br /></td></tr>
<tr class="separator:a07945fe010079a35e18812636d5c70c3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1d390c6ea5450680dcaff341235f0fed"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed">operator--</a> ()</td></tr>
<tr class="memdesc:a1d390c6ea5450680dcaff341235f0fed"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &ndash; (pre-decrement) <a href="../../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed">More...</a><br /></td></tr>
<tr class="memdesc:a1d390c6ea5450680dcaff341235f0fed"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &ndash; (pre-decrement) <br /></td></tr>
<tr class="separator:a1d390c6ea5450680dcaff341235f0fed"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2ecb71686e1c9ed0267124580c91c414"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414">operator--</a> (int p)</td></tr>
<tr class="memdesc:a2ecb71686e1c9ed0267124580c91c414"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &ndash; (post-decrement) <a href="../../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414">More...</a><br /></td></tr>
<tr class="memdesc:a2ecb71686e1c9ed0267124580c91c414"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &ndash; (post-decrement) <br /></td></tr>
<tr class="separator:a2ecb71686e1c9ed0267124580c91c414"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0a4623fae71566dfcf2e742c8c156798"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a0a4623fae71566dfcf2e742c8c156798"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798">operator-=</a> (const T &amp;p)</td></tr>
<tr class="memdesc:a0a4623fae71566dfcf2e742c8c156798"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator -= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798">More...</a><br /></td></tr>
<tr class="memdesc:a0a4623fae71566dfcf2e742c8c156798"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator -= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:a0a4623fae71566dfcf2e742c8c156798"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abea727c69c2acd74ffe21464199d27c8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8">operator-=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:abea727c69c2acd74ffe21464199d27c8"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator -= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8">More...</a><br /></td></tr>
<tr class="memdesc:abea727c69c2acd74ffe21464199d27c8"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator -= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:abea727c69c2acd74ffe21464199d27c8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a488e65a14d4c32a096011aa4725cdb30"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a488e65a14d4c32a096011aa4725cdb30"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30">operator*</a> (const T p)</td></tr>
<tr class="memdesc:a488e65a14d4c32a096011aa4725cdb30"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator * for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30">More...</a><br /></td></tr>
<tr class="memdesc:a488e65a14d4c32a096011aa4725cdb30"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator * for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:a488e65a14d4c32a096011aa4725cdb30"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a44e472cf685cac6edc5172eac2e66860"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860">operator*</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:a44e472cf685cac6edc5172eac2e66860"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator * for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860">More...</a><br /></td></tr>
<tr class="memdesc:a44e472cf685cac6edc5172eac2e66860"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator * for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:a44e472cf685cac6edc5172eac2e66860"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3016b71f92a0c7e090a7c5b6a3935092"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a3016b71f92a0c7e090a7c5b6a3935092"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092">operator*=</a> (const T p)</td></tr>
<tr class="memdesc:a3016b71f92a0c7e090a7c5b6a3935092"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator *= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092">More...</a><br /></td></tr>
<tr class="memdesc:a3016b71f92a0c7e090a7c5b6a3935092"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator *= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:a3016b71f92a0c7e090a7c5b6a3935092"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a96fc7c2df4325bb1a0c22b566bcc6295"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295">operator*=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:a96fc7c2df4325bb1a0c22b566bcc6295"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator *= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295">More...</a><br /></td></tr>
<tr class="memdesc:a96fc7c2df4325bb1a0c22b566bcc6295"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator *= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:a96fc7c2df4325bb1a0c22b566bcc6295"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8bf81f7f5f5c98f197822ec88e106c6c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>, <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:a8bf81f7f5f5c98f197822ec88e106c6c"><td class="mdescLeft">&#160;</td><td class="mdescRight">divide function for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">More...</a><br /></td></tr>
<tr class="memdesc:a8bf81f7f5f5c98f197822ec88e106c6c"><td class="mdescLeft">&#160;</td><td class="mdescRight">divide function for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:a8bf81f7f5f5c98f197822ec88e106c6c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3072a7e43da3600c345c81bc80c957ee"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee">operator/</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:a3072a7e43da3600c345c81bc80c957ee"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator / for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee">More...</a><br /></td></tr>
<tr class="memdesc:a3072a7e43da3600c345c81bc80c957ee"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator / for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:a3072a7e43da3600c345c81bc80c957ee"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aed49b24b99293ae6b14ac9850f5deb94"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:aed49b24b99293ae6b14ac9850f5deb94"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94">operator/</a> (const T p)</td></tr>
<tr class="memdesc:aed49b24b99293ae6b14ac9850f5deb94"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator / for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94">More...</a><br /></td></tr>
<tr class="memdesc:aed49b24b99293ae6b14ac9850f5deb94"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator / for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:aed49b24b99293ae6b14ac9850f5deb94"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a300ed88fe2054788cc6e0b6a8fdf66db"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db">operator/=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:a300ed88fe2054788cc6e0b6a8fdf66db"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator /= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db">More...</a><br /></td></tr>
<tr class="memdesc:a300ed88fe2054788cc6e0b6a8fdf66db"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator /= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a300ed88fe2054788cc6e0b6a8fdf66db"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aaacb9fda7adcfee224f1b09124c0438b"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:aaacb9fda7adcfee224f1b09124c0438b"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b">operator/=</a> (const T p)</td></tr>
<tr class="memdesc:aaacb9fda7adcfee224f1b09124c0438b"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator /= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b">More...</a><br /></td></tr>
<tr class="memdesc:aaacb9fda7adcfee224f1b09124c0438b"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator /= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:aaacb9fda7adcfee224f1b09124c0438b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abfc6a8765039cacc829a5cd386b5a066"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066">operator%</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:abfc6a8765039cacc829a5cd386b5a066"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator % for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066">More...</a><br /></td></tr>
<tr class="memdesc:abfc6a8765039cacc829a5cd386b5a066"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator % for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:abfc6a8765039cacc829a5cd386b5a066"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:add9938b97fc66560cec2d32e8c83eaad"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:add9938b97fc66560cec2d32e8c83eaad"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad">operator%</a> (const T &amp;p)</td></tr>
<tr class="memdesc:add9938b97fc66560cec2d32e8c83eaad"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator % for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <a href="../../db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad">More...</a><br /></td></tr>
<tr class="memdesc:add9938b97fc66560cec2d32e8c83eaad"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator % for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. <br /></td></tr>
<tr class="separator:add9938b97fc66560cec2d32e8c83eaad"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a279209a184db20a7ffc8e687fdb05be2"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2">operator%=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:a279209a184db20a7ffc8e687fdb05be2"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator %= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2">More...</a><br /></td></tr>
<tr class="memdesc:a279209a184db20a7ffc8e687fdb05be2"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator %= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a279209a184db20a7ffc8e687fdb05be2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0500a90bcde5a8254750c361eed9bc40"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a0500a90bcde5a8254750c361eed9bc40"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40">operator%=</a> (const T &amp;p)</td></tr>
<tr class="memdesc:a0500a90bcde5a8254750c361eed9bc40"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator %= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40">More...</a><br /></td></tr>
<tr class="memdesc:a0500a90bcde5a8254750c361eed9bc40"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator %= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a0500a90bcde5a8254750c361eed9bc40"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac9a4365fb9ea5e2d2c751258f09168a4"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4">operator&lt;</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;other)</td></tr>
<tr class="memdesc:ac9a4365fb9ea5e2d2c751258f09168a4"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt; for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4">More...</a><br /></td></tr>
<tr class="memdesc:ac9a4365fb9ea5e2d2c751258f09168a4"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt; for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:ac9a4365fb9ea5e2d2c751258f09168a4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a16eb351c1d0ed3b89c771c63808e035a"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a">operator&lt;=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;other)</td></tr>
<tr class="memdesc:a16eb351c1d0ed3b89c771c63808e035a"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt;= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a">More...</a><br /></td></tr>
<tr class="memdesc:a16eb351c1d0ed3b89c771c63808e035a"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt;= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a16eb351c1d0ed3b89c771c63808e035a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a291d2787d668e8d06a7cfab0f5144440"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440">operator&gt;</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;other)</td></tr>
<tr class="memdesc:a291d2787d668e8d06a7cfab0f5144440"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &gt; for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440">More...</a><br /></td></tr>
<tr class="memdesc:a291d2787d668e8d06a7cfab0f5144440"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &gt; for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a291d2787d668e8d06a7cfab0f5144440"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae7af1bad048942eeabc092d8e0194292"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292">operator&gt;=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;other)</td></tr>
<tr class="memdesc:ae7af1bad048942eeabc092d8e0194292"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &gt;= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292">More...</a><br /></td></tr>
<tr class="memdesc:ae7af1bad048942eeabc092d8e0194292"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &gt;= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:ae7af1bad048942eeabc092d8e0194292"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7b1de5584505c189664d0edd306e979e"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e">operator==</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;other)</td></tr>
<tr class="memdesc:a7b1de5584505c189664d0edd306e979e"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator == for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e">More...</a><br /></td></tr>
<tr class="memdesc:a7b1de5584505c189664d0edd306e979e"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator == for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a7b1de5584505c189664d0edd306e979e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab3359b104bbb5a31c11c2027387c4b4e"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e">operator!=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;other)</td></tr>
<tr class="memdesc:ab3359b104bbb5a31c11c2027387c4b4e"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator != for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e">More...</a><br /></td></tr>
<tr class="memdesc:ab3359b104bbb5a31c11c2027387c4b4e"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator != for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:ab3359b104bbb5a31c11c2027387c4b4e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad24d6fe1fe63f415fee806b377dfa47d"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d">operator!</a> ()</td></tr>
<tr class="memdesc:ad24d6fe1fe63f415fee806b377dfa47d"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator ! for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d">More...</a><br /></td></tr>
<tr class="memdesc:ad24d6fe1fe63f415fee806b377dfa47d"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator ! for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:ad24d6fe1fe63f415fee806b377dfa47d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab07413c67d205e406abf3a9f554d59e1"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1">operator&amp;&amp;</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;b)</td></tr>
<tr class="memdesc:ab07413c67d205e406abf3a9f554d59e1"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &amp;&amp; for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1">More...</a><br /></td></tr>
<tr class="memdesc:ab07413c67d205e406abf3a9f554d59e1"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &amp;&amp; for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:ab07413c67d205e406abf3a9f554d59e1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a312509b1c5b3ae5eaaf342f2ba131d03"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03">operator||</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;b)</td></tr>
<tr class="memdesc:a312509b1c5b3ae5eaaf342f2ba131d03"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator || for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03">More...</a><br /></td></tr>
<tr class="memdesc:a312509b1c5b3ae5eaaf342f2ba131d03"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator || for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a312509b1c5b3ae5eaaf342f2ba131d03"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af4ce01d81a0369218f7d46567d136733"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733">operator()</a> ()</td></tr>
<tr class="memdesc:af4ce01d81a0369218f7d46567d136733"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator () for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733">More...</a><br /></td></tr>
<tr class="memdesc:af4ce01d81a0369218f7d46567d136733"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator () for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:af4ce01d81a0369218f7d46567d136733"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a56f579c802a6cc16f31e43af274453dc"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a56f579c802a6cc16f31e43af274453dc"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc">operator&lt;</a> (const T other)</td></tr>
<tr class="memdesc:a56f579c802a6cc16f31e43af274453dc"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt; for other types <a href="../../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc">More...</a><br /></td></tr>
<tr class="memdesc:a56f579c802a6cc16f31e43af274453dc"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt; for other types <br /></td></tr>
<tr class="separator:a56f579c802a6cc16f31e43af274453dc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4562c218813c8705bccb25d8786ca77c"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a4562c218813c8705bccb25d8786ca77c"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c">operator&lt;=</a> (const T other)</td></tr>
<tr class="memdesc:a4562c218813c8705bccb25d8786ca77c"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt;= for other types <a href="../../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c">More...</a><br /></td></tr>
<tr class="memdesc:a4562c218813c8705bccb25d8786ca77c"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt;= for other types <br /></td></tr>
<tr class="separator:a4562c218813c8705bccb25d8786ca77c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a82c63f8c18b8d2d255b8b0d373ac7d6e"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a82c63f8c18b8d2d255b8b0d373ac7d6e"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e">operator&gt;</a> (const T other)</td></tr>
<tr class="memdesc:a82c63f8c18b8d2d255b8b0d373ac7d6e"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &gt; for other types <a href="../../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e">More...</a><br /></td></tr>
<tr class="memdesc:a82c63f8c18b8d2d255b8b0d373ac7d6e"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &gt; for other types <br /></td></tr>
<tr class="separator:a82c63f8c18b8d2d255b8b0d373ac7d6e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a334bc710f411f108a0243b24ac73b481"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a334bc710f411f108a0243b24ac73b481"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481">operator&gt;=</a> (const T other)</td></tr>
<tr class="memdesc:a334bc710f411f108a0243b24ac73b481"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &gt;= for other types <a href="../../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481">More...</a><br /></td></tr>
<tr class="memdesc:a334bc710f411f108a0243b24ac73b481"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &gt;= for other types <br /></td></tr>
<tr class="separator:a334bc710f411f108a0243b24ac73b481"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7a95e3accdac1cb38c9767f9550c0896"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a7a95e3accdac1cb38c9767f9550c0896"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896">operator==</a> (const T other)</td></tr>
<tr class="memdesc:a7a95e3accdac1cb38c9767f9550c0896"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator == for other types <a href="../../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896">More...</a><br /></td></tr>
<tr class="memdesc:a7a95e3accdac1cb38c9767f9550c0896"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator == for other types <br /></td></tr>
<tr class="separator:a7a95e3accdac1cb38c9767f9550c0896"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7737bb30a5480c7286546b911d82e696"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a7737bb30a5480c7286546b911d82e696"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696">operator!=</a> (const T other)</td></tr>
<tr class="memdesc:a7737bb30a5480c7286546b911d82e696"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator != for other types <a href="../../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696">More...</a><br /></td></tr>
<tr class="memdesc:a7737bb30a5480c7286546b911d82e696"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator != for other types <br /></td></tr>
<tr class="separator:a7737bb30a5480c7286546b911d82e696"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ad881643c707f6ae3c5de3822a8cb8a"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a0ad881643c707f6ae3c5de3822a8cb8a"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a">operator&amp;&amp;</a> (const T b)</td></tr>
<tr class="memdesc:a0ad881643c707f6ae3c5de3822a8cb8a"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &amp;&amp; for other types <a href="../../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a">More...</a><br /></td></tr>
<tr class="memdesc:a0ad881643c707f6ae3c5de3822a8cb8a"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &amp;&amp; for other types <br /></td></tr>
<tr class="separator:a0ad881643c707f6ae3c5de3822a8cb8a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a817b66c32268cf46244058a50db99503"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a817b66c32268cf46244058a50db99503"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503">operator||</a> (const T b)</td></tr>
<tr class="memdesc:a817b66c32268cf46244058a50db99503"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator || for other types <a href="../../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503">More...</a><br /></td></tr>
<tr class="memdesc:a817b66c32268cf46244058a50db99503"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator || for other types <br /></td></tr>
<tr class="separator:a817b66c32268cf46244058a50db99503"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a43eafd4824666b413befe5edbc90ae7f"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f">operator~</a> ()</td></tr>
<tr class="memdesc:a43eafd4824666b413befe5edbc90ae7f"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator ~ for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f">More...</a><br /></td></tr>
<tr class="memdesc:a43eafd4824666b413befe5edbc90ae7f"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator ~ for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a43eafd4824666b413befe5edbc90ae7f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a16e7e1211ba6c27e9a229d97fb0d9190"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a16e7e1211ba6c27e9a229d97fb0d9190"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190">operator&lt;&lt;</a> (const T p)</td></tr>
<tr class="memdesc:a16e7e1211ba6c27e9a229d97fb0d9190"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt;&lt; for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190">More...</a><br /></td></tr>
<tr class="memdesc:a16e7e1211ba6c27e9a229d97fb0d9190"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt;&lt; for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a16e7e1211ba6c27e9a229d97fb0d9190"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa5b93187b1d199071f204b9987d5d16a"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:aa5b93187b1d199071f204b9987d5d16a"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a">operator&lt;&lt;=</a> (const T p)</td></tr>
<tr class="memdesc:aa5b93187b1d199071f204b9987d5d16a"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt;&lt;= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a">More...</a><br /></td></tr>
<tr class="memdesc:aa5b93187b1d199071f204b9987d5d16a"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt;&lt;= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:aa5b93187b1d199071f204b9987d5d16a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6f24982de03e0e3d04ac7f8ae30f5848"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a6f24982de03e0e3d04ac7f8ae30f5848"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848">operator&gt;&gt;</a> (const T p)</td></tr>
<tr class="memdesc:a6f24982de03e0e3d04ac7f8ae30f5848"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &gt;&gt; for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848">More...</a><br /></td></tr>
<tr class="memdesc:a6f24982de03e0e3d04ac7f8ae30f5848"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &gt;&gt; for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a6f24982de03e0e3d04ac7f8ae30f5848"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ae5fc0c2bcc9138b32d7582466aa7f9"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a0ae5fc0c2bcc9138b32d7582466aa7f9"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9">operator&gt;&gt;=</a> (const T p)</td></tr>
<tr class="memdesc:a0ae5fc0c2bcc9138b32d7582466aa7f9"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &gt;&gt;= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <a href="../../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9">More...</a><br /></td></tr>
<tr class="memdesc:a0ae5fc0c2bcc9138b32d7582466aa7f9"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &gt;&gt;= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> <br /></td></tr>
<tr class="separator:a0ae5fc0c2bcc9138b32d7582466aa7f9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad1717d3a38391258befa413b7e2b9244"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244">operator&amp;</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:ad1717d3a38391258befa413b7e2b9244"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &amp; for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> (bitwise operator) <a href="../../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244">More...</a><br /></td></tr>
<tr class="memdesc:ad1717d3a38391258befa413b7e2b9244"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &amp; for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> (bitwise operator) <br /></td></tr>
<tr class="separator:ad1717d3a38391258befa413b7e2b9244"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9fa81ef0d54ecb9050d0be4249358ca4"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a9fa81ef0d54ecb9050d0be4249358ca4"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4">operator&amp;</a> (const T p)</td></tr>
<tr class="memdesc:a9fa81ef0d54ecb9050d0be4249358ca4"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &amp; for other types (bitwise operator) <a href="../../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4">More...</a><br /></td></tr>
<tr class="memdesc:a9fa81ef0d54ecb9050d0be4249358ca4"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &amp; for other types (bitwise operator) <br /></td></tr>
<tr class="separator:a9fa81ef0d54ecb9050d0be4249358ca4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac7d55ed3bac01075b9cd11cc59508050"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050">operator&amp;=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:ac7d55ed3bac01075b9cd11cc59508050"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &amp;= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> (bitwise operator) <a href="../../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050">More...</a><br /></td></tr>
<tr class="memdesc:ac7d55ed3bac01075b9cd11cc59508050"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &amp;= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> (bitwise operator) <br /></td></tr>
<tr class="separator:ac7d55ed3bac01075b9cd11cc59508050"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a225146042c6456a3c5595645870ca640"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a225146042c6456a3c5595645870ca640"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640">operator&amp;=</a> (const T p)</td></tr>
<tr class="memdesc:a225146042c6456a3c5595645870ca640"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &amp;= for other types (bitwise operator) <a href="../../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640">More...</a><br /></td></tr>
<tr class="memdesc:a225146042c6456a3c5595645870ca640"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &amp;= for other types (bitwise operator) <br /></td></tr>
<tr class="separator:a225146042c6456a3c5595645870ca640"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3facc74d6d078604fe2c80d0abfd3304"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a3facc74d6d078604fe2c80d0abfd3304"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304">operator|</a> (const T p)</td></tr>
<tr class="memdesc:a3facc74d6d078604fe2c80d0abfd3304"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator | for other types (bitwise operator) <a href="../../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304">More...</a><br /></td></tr>
<tr class="memdesc:a3facc74d6d078604fe2c80d0abfd3304"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator | for other types (bitwise operator) <br /></td></tr>
<tr class="separator:a3facc74d6d078604fe2c80d0abfd3304"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2fda65032d9fdbaf9142a6322654dbdd"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd">operator|</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:a2fda65032d9fdbaf9142a6322654dbdd"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator | for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> (bitwise operator) <a href="../../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd">More...</a><br /></td></tr>
<tr class="memdesc:a2fda65032d9fdbaf9142a6322654dbdd"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator | for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> (bitwise operator) <br /></td></tr>
<tr class="separator:a2fda65032d9fdbaf9142a6322654dbdd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab88330f3c4f3bcde75dc5ef9eb8eb39d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d">operator|=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:ab88330f3c4f3bcde75dc5ef9eb8eb39d"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator |= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> (bitwise operator) <a href="../../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d">More...</a><br /></td></tr>
<tr class="memdesc:ab88330f3c4f3bcde75dc5ef9eb8eb39d"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator |= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> (bitwise operator) <br /></td></tr>
<tr class="separator:ab88330f3c4f3bcde75dc5ef9eb8eb39d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6110aa452a6d114fcd2f42d2bc106fee"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a6110aa452a6d114fcd2f42d2bc106fee"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee">operator|=</a> (const T p)</td></tr>
<tr class="memdesc:a6110aa452a6d114fcd2f42d2bc106fee"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator |= for other types (bitwise operator) <a href="../../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee">More...</a><br /></td></tr>
<tr class="memdesc:a6110aa452a6d114fcd2f42d2bc106fee"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator |= for other types (bitwise operator) <br /></td></tr>
<tr class="separator:a6110aa452a6d114fcd2f42d2bc106fee"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aab88fd72d0370b12e4a257e378b82d37"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:aab88fd72d0370b12e4a257e378b82d37"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37">operator^</a> (const T p)</td></tr>
<tr class="memdesc:aab88fd72d0370b12e4a257e378b82d37"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator ^ for other types (bitwise operator) <a href="../../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37">More...</a><br /></td></tr>
<tr class="memdesc:aab88fd72d0370b12e4a257e378b82d37"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator ^ for other types (bitwise operator) <br /></td></tr>
<tr class="separator:aab88fd72d0370b12e4a257e378b82d37"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9487ed06019d846add5dc8874e41eb8b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b">operator^</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:a9487ed06019d846add5dc8874e41eb8b"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator ^ for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> (bitwise operator) <a href="../../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b">More...</a><br /></td></tr>
<tr class="memdesc:a9487ed06019d846add5dc8874e41eb8b"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator ^ for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> (bitwise operator) <br /></td></tr>
<tr class="separator:a9487ed06019d846add5dc8874e41eb8b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae3f0ef8a3f68d9cbd9d99e772f1a947a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a">operator^=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:ae3f0ef8a3f68d9cbd9d99e772f1a947a"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator ^= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> (bitwise operator) <a href="../../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a">More...</a><br /></td></tr>
<tr class="memdesc:ae3f0ef8a3f68d9cbd9d99e772f1a947a"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator ^= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> (bitwise operator) <br /></td></tr>
<tr class="separator:ae3f0ef8a3f68d9cbd9d99e772f1a947a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a44fd2a4a4cc1d13f93ac222db5a46c67"><td class="memTemplParams" colspan="2">template&lt;typename T , typename = typename std::enable_if&lt; std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
<tr class="memitem:a44fd2a4a4cc1d13f93ac222db5a46c67"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67">operator^=</a> (const T &amp;p)</td></tr>
<tr class="memdesc:a44fd2a4a4cc1d13f93ac222db5a46c67"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator ^= for other types (bitwise operator) <a href="../../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67">More...</a><br /></td></tr>
<tr class="memdesc:a44fd2a4a4cc1d13f93ac222db5a46c67"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator ^= for other types (bitwise operator) <br /></td></tr>
<tr class="separator:a44fd2a4a4cc1d13f93ac222db5a46c67"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:a857a3c69c1e775a1bd3935c2bfbb02df"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df">__get_integer_from_string</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str)</td></tr>
<tr class="memdesc:a857a3c69c1e775a1bd3935c2bfbb02df"><td class="mdescLeft">&#160;</td><td class="mdescRight">First and second half of 128 bit number. <a href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df">More...</a><br /></td></tr>
<tr class="memdesc:a857a3c69c1e775a1bd3935c2bfbb02df"><td class="mdescLeft">&#160;</td><td class="mdescRight">First and second half of 128 bit number. <br /></td></tr>
<tr class="separator:a857a3c69c1e775a1bd3935c2bfbb02df"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
@@ -397,11 +397,11 @@ uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>s</b> {}</td></tr
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
Friends</h2></td></tr>
<tr class="memitem:a5f2ace9fdcd459f74f8e43ef30a2a953"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;op, const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
<tr class="memdesc:a5f2ace9fdcd459f74f8e43ef30a2a953"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt;&lt; for printing <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer <a href="../../db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953">More...</a><br /></td></tr>
<tr class="memdesc:a5f2ace9fdcd459f74f8e43ef30a2a953"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt;&lt; for printing <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer <br /></td></tr>
<tr class="separator:a5f2ace9fdcd459f74f8e43ef30a2a953"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >class for 128-bit unsigned integer </p>
<div class="textblock"><p>class for 128-bit unsigned integer </p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="adce2432b148fe18179a5ea272f4eb040" name="adce2432b148fe18179a5ea272f4eb040"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adce2432b148fe18179a5ea272f4eb040">&#9670;&#160;</a></span>uint128_t() <span class="overload">[1/5]</span></h2>
@@ -631,8 +631,8 @@ Here is the call graph for this function:</div>
</div><div class="memdoc">
<p>First and second half of 128 bit number. </p>
<p >Get integer from given string.</p>
<p >Create an integer from a given string </p><dl class="params"><dt>Parameters</dt><dd>
<p>Get integer from given string.</p>
<p>Create an integer from a given string </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">str</td><td>integer string, can be hexadecimal (starting on 0x... or number) </td></tr>
</table>
@@ -693,7 +693,7 @@ Here is the call graph for this function:</div>
</div><div class="memdoc">
<p>Leading zeroes in binary. </p>
<p >Calculates leading zeros in 128-bit integer </p><dl class="section return"><dt>Returns</dt><dd>Integer denoting leading zeroes </dd></dl>
<p>Calculates leading zeros in 128-bit integer </p><dl class="section return"><dt>Returns</dt><dd>Integer denoting leading zeroes </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 139</span> {</div>
<div class="line"><span class="lineno"> 140</span><span class="preprocessor">#ifndef _MSC_VER</span></div>
<div class="line"><span class="lineno"> 141</span> <span class="keywordflow">if</span> (f) {</div>
@@ -739,7 +739,7 @@ Here is the call graph for this function:</div>
</div><div class="memdoc">
<p>Trailing zeroes in binary. </p>
<p >Calculates leading zeros in 128-bit integer </p><dl class="section return"><dt>Returns</dt><dd>Integer denoting Trailing zeroes </dd></dl>
<p>Calculates leading zeros in 128-bit integer </p><dl class="section return"><dt>Returns</dt><dd>Integer denoting Trailing zeroes </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 162</span> {</div>
<div class="line"><span class="lineno"> 163</span><span class="preprocessor">#ifndef _MSC_VER</span></div>
<div class="line"><span class="lineno"> 164</span> <span class="keywordflow">if</span> (f) {</div>
@@ -785,7 +785,7 @@ Here is the call graph for this function:</div>
</div><div class="memdoc">
<p>divide function for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types. </p>
<p >divide this value and </p><dl class="params"><dt>Parameters</dt><dd>
<p>divide this value and </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">p</td><td>128-bit unsigned integer </td></tr>
</table>
@@ -3674,7 +3674,7 @@ template&lt;typename T , typename = typename std::enable_if&lt;
</div><div class="memdoc">
<p>operator &lt;&lt; for printing <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer </p>
<p >Prints the <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer in decimal form </p><dl class="section note"><dt>Note</dt><dd>Note that this operator is costly since it uses strings to print the value </dd></dl>
<p>Prints the <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer in decimal form </p><dl class="section note"><dt>Note</dt><dd>Note that this operator is costly since it uses strings to print the value </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">op</td><td>ostream object </td></tr>
@@ -3718,7 +3718,7 @@ template&lt;typename T , typename = typename std::enable_if&lt;
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: uint128_t::uint128_t Pages: 1 -->
<svg width="387pt" height="38pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

2
db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: uint128_t::operator%= Pages: 1 -->
<svg width="361pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

2
db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: uint128_t::operator/= Pages: 1 -->
<svg width="355pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

2
db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: uint128_t::operator/ Pages: 1 -->
<svg width="349pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

2
db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: uint128_t::__get_integer_from_string Pages: 1 -->
<svg width="249pt" height="38pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: uint128_t::divide Pages: 1 -->
<svg width="212pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.6 KiB

After

Width:  |  Height:  |  Size: 1.6 KiB

2
db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: uint128_t::operator= Pages: 1 -->
<svg width="389pt" height="38pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

2
db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: uint128_t::operator% Pages: 1 -->
<svg width="355pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

2
db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: operations_on_datastructures::reverse_binary_tree::Node Pages: 1 -->
<svg width="190pt" height="38pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
db/da2/reverse__a__linked__list_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: data_structures/reverse_a_linked_list.cpp Pages: 1 -->
<svg width="253pt" height="93pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.5 KiB

After

Width:  |  Height:  |  Size: 3.5 KiB

2
db/da8/subset__sum_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: backtracking/subset_sum.cpp Pages: 1 -->
<svg width="192pt" height="93pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.8 KiB

After

Width:  |  Height:  |  Size: 2.8 KiB

28
db/da9/classqueue.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: queue&lt; Kind &gt; Class Template Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -138,7 +138,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>size</b></td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><div class="compoundTemplParams">template&lt;class Kind&gt;<br />
class queue&lt; Kind &gt;</div><p >Definition of the queue class </p>
class queue&lt; Kind &gt;</div><p>Definition of the queue class </p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a21381ee7f95daae0332665914780e970" name="a21381ee7f95daae0332665914780e970"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a21381ee7f95daae0332665914780e970">&#9670;&#160;</a></span>queue()</h2>
@@ -164,7 +164,7 @@ template&lt;class Kind &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >Default constructor </p>
<p>Default constructor </p>
<div class="fragment"><div class="line"><span class="lineno"> 32</span> {</div>
<div class="line"><span class="lineno"> 33</span> <a class="code hl_variable" href="../../db/da9/classqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a> = NULL;</div>
<div class="line"><span class="lineno"> 34</span> <a class="code hl_variable" href="../../db/da9/classqueue.html#ae2a7a36270f5d15218a180fa59e5b3a5">queueRear</a> = NULL;</div>
@@ -199,7 +199,7 @@ template&lt;class Kind &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >Destructor </p>
<p>Destructor </p>
<div class="fragment"><div class="line"><span class="lineno"> 39</span>{}</div>
</div><!-- fragment -->
</div>
@@ -229,7 +229,7 @@ template&lt;class Kind &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >Clear queue </p>
<p>Clear queue </p>
<div class="fragment"><div class="line"><span class="lineno"> 80</span>{ <a class="code hl_variable" href="../../db/da9/classqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a> = NULL; }</div>
</div><!-- fragment -->
</div>
@@ -258,7 +258,7 @@ template&lt;class Kind &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >Remove the top element of the queue </p>
<p>Remove the top element of the queue </p>
<div class="fragment"><div class="line"><span class="lineno"> 67</span> {</div>
<div class="line"><span class="lineno"> 68</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node&lt;Kind&gt;</a> *temp;</div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../db/da9/classqueue.html#ac2fff88dce4d7d2eb7134af382bd1b31">isEmptyQueue</a>()) {</div>
@@ -307,7 +307,7 @@ template&lt;class Kind &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >Show queue </p>
<p>Show queue </p>
<div class="fragment"><div class="line"><span class="lineno"> 20</span> {</div>
<div class="line"><span class="lineno"> 21</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node&lt;Kind&gt;</a> *current = <a class="code hl_variable" href="../../db/da9/classqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a>;</div>
<div class="line"><span class="lineno"> 22</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Front --&gt; &quot;</span>;</div>
@@ -352,7 +352,7 @@ template&lt;class Kind &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >Add new item to the queue </p>
<p>Add new item to the queue </p>
<div class="fragment"><div class="line"><span class="lineno"> 45</span> {</div>
<div class="line"><span class="lineno"> 46</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node&lt;Kind&gt;</a> *newNode;</div>
<div class="line"><span class="lineno"> 47</span> newNode = <span class="keyword">new</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node&lt;Kind&gt;</a>;</div>
@@ -394,7 +394,7 @@ template&lt;class Kind &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >Return the first element of the queue </p>
<p>Return the first element of the queue </p>
<div class="fragment"><div class="line"><span class="lineno"> 61</span> {</div>
<div class="line"><span class="lineno"> 62</span> assert(<a class="code hl_variable" href="../../db/da9/classqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a> != NULL);</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../db/da9/classqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a>-&gt;data;</div>
@@ -426,7 +426,7 @@ template&lt;class Kind &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >Determine whether the queue is empty </p>
<p>Determine whether the queue is empty </p>
<div class="fragment"><div class="line"><span class="lineno"> 42</span>{ <span class="keywordflow">return</span> (<a class="code hl_variable" href="../../db/da9/classqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a> == NULL); }</div>
</div><!-- fragment -->
</div>
@@ -453,7 +453,7 @@ template&lt;class Kind &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >Pointer to the front of the queue </p>
<p>Pointer to the front of the queue </p>
</div>
</div>
@@ -478,7 +478,7 @@ template&lt;class Kind &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >Pointer to the rear of the queue <br />
<p>Pointer to the rear of the queue <br />
</p>
</div>
@@ -492,7 +492,7 @@ template&lt;class Kind &gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../db/da9/classqueue.html">queue</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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/da9/classqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: queue::deQueue Pages: 1 -->
<svg width="245pt" height="64pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

2
db/da9/classqueue_a26f48801df462ade003b50739196fa4c_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: queue::display Pages: 1 -->
<svg width="178pt" height="27pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.5 KiB

After

Width:  |  Height:  |  Size: 1.5 KiB

2
db/dad/linear__probing__hash__table_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: hashing/linear_probing_hash_table.cpp Pages: 1 -->
<svg width="125pt" height="93pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

16
db/dbc/tree__234_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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures/tree_234.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -142,18 +142,18 @@ Namespaces</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ae7880ce913f3058a35ff106d5be9e243"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a> ()</td></tr>
<tr class="memdesc:ae7880ce913f3058a35ff106d5be9e243"><td class="mdescLeft">&#160;</td><td class="mdescRight">simple test to insert a given array and delete some item, and print the tree <a href="../../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">More...</a><br /></td></tr>
<tr class="memdesc:ae7880ce913f3058a35ff106d5be9e243"><td class="mdescLeft">&#160;</td><td class="mdescRight">simple test to insert a given array and delete some item, and print the tree <br /></td></tr>
<tr class="separator:ae7880ce913f3058a35ff106d5be9e243"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af1ac73779b0fcfbbdce3976c0ca57342"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342">test2</a> (int64_t n)</td></tr>
<tr class="memdesc:af1ac73779b0fcfbbdce3976c0ca57342"><td class="mdescLeft">&#160;</td><td class="mdescRight">simple test to insert continuous number of range [0, n), and print the tree <a href="../../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342">More...</a><br /></td></tr>
<tr class="memdesc:af1ac73779b0fcfbbdce3976c0ca57342"><td class="mdescLeft">&#160;</td><td class="mdescRight">simple test to insert continuous number of range [0, n), and print the tree <br /></td></tr>
<tr class="separator:af1ac73779b0fcfbbdce3976c0ca57342"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
<tr class="memdesc:a0ddf1224851353fc92bfbff6f499fa97"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">More...</a><br /></td></tr>
<tr class="memdesc:a0ddf1224851353fc92bfbff6f499fa97"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >A demo 2-3-4 tree implementation. </p>
<p >2–3–4 tree is a self-balancing data structure that is an isometry of red–black trees. Though we seldom use them in practice, we study them to understand the theory behind Red-Black tree. Please read following links for more infomation. <a href="https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree" target="_blank">2–3–4 tree</a> <a href="https://www.educative.io/page/5689413791121408/80001" target="_blank">2-3-4 Trees: A Visual Introduction</a> We Only implement some basic and complicated operations in this demo. Other operations should be easy to be added. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/fedom" target="_blank">liuhuan</a> </dd></dl>
<div class="textblock"><p>A demo 2-3-4 tree implementation. </p>
<p>2–3–4 tree is a self-balancing data structure that is an isometry of red–black trees. Though we seldom use them in practice, we study them to understand the theory behind Red-Black tree. Please read following links for more infomation. <a href="https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree" target="_blank">2–3–4 tree</a> <a href="https://www.educative.io/page/5689413791121408/80001" target="_blank">2-3-4 Trees: A Visual Introduction</a> We Only implement some basic and complicated operations in this demo. Other operations should be easy to be added. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/fedom" target="_blank">liuhuan</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
@@ -319,7 +319,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_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../db/dbc/tree__234_8cpp.html">tree_234.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.5 </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.6 </li>
</ul>
</div>
</body>

2
db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<!--zoomable 907 -->
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 52 KiB

After

Width:  |  Height:  |  Size: 52 KiB

2
db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: main Pages: 1 -->
<svg width="1076pt" height="907pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 48 KiB

After

Width:  |  Height:  |  Size: 48 KiB

2
db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: test1 Pages: 1 -->
<!--zoomable 703 -->
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 40 KiB

After

Width:  |  Height:  |  Size: 40 KiB

2
db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: test1 Pages: 1 -->
<svg width="988pt" height="703pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 35 KiB

After

Width:  |  Height:  |  Size: 35 KiB

Some files were not shown because too many files have changed in this diff Show More