Documentation for 145111c

Author: realstealthninja

d4/de3/trapped__rainwater2_8cpp.html

@@ -0,0 +1,6 @@
+var trapped__rainwater2_8cpp =
+[
+    [ "main", "d4/de3/trapped__rainwater2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+    [ "test", "d4/de3/trapped__rainwater2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ],
+    [ "dynamic_programming::trappedRainwater", "dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8", null ]
+];

d4/de3/trapped__rainwater2_8cpp.js

@@ -0,0 +1,13 @@
+<map id="dynamic_programming/trapped_rainwater2.cpp" name="dynamic_programming/trapped_rainwater2.cpp">
+<area shape="rect" id="Node000001" title="Implementation of the Trapped Rainwater Problem" alt="" coords="144,5,304,46"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,80,120"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="180,49,85,90,83,85,177,44"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="104,94,168,120"/>
+<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="204,48,163,85,159,81,200,44"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="192,94,256,120"/>
+<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="226,46,226,78,221,78,221,46"/>
+<area shape="rect" id="Node000005" title=" " alt="" coords="280,94,341,120"/>
+<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="247,44,288,81,284,85,243,48"/>
+<area shape="rect" id="Node000006" title=" " alt="" coords="364,94,422,120"/>
+<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="267,44,355,85,352,90,265,49"/>
+</map>

d4/de3/trapped__rainwater2_8cpp_source.html

@@ -0,0 +1 @@
+be0c196d02274ca4fd6978f0dcc6a5f9

d6/d04/trapped__rainwater2_8cpp__incl.map

@@ -157,7 +157,8 @@
 <p>Dynamic Programming algorithms</p>
 <p>for std::assert for IO operations for unordered map</p>
 <p>Dynamic Programming algorithms</p>
-<p>For std::min and std::max For assert For std::size_t </p>
+<p>For std::min and std::max For assert For std::size_t</p>
+<p>For std::min and std::max For assert For std::size_t For std::uint32_t For std::vector </p>
 </div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
 <a id="af046365a8d77a1267acc082f86135a26" name="af046365a8d77a1267acc082f86135a26"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af046365a8d77a1267acc082f86135a26">&#9670;&#160;</a></span>is_armstrong()</h2>

d6/d04/trapped__rainwater2_8cpp__incl.md5

@@ -164,6 +164,8 @@
 <tr class="memdesc:dc/d67/subset__sum__dynamic_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implements [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm, which tells whether a subset with target sum exists or not. <br /></td></tr>
 <tr class="memitem:trapped_5Frainwater_2Ecpp" id="r_trapped_5Frainwater_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/d80/trapped__rainwater_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d80/trapped__rainwater_8cpp.html">trapped_rainwater.cpp</a></td></tr>
 <tr class="memdesc:d9/d80/trapped__rainwater_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.geeksforgeeks.org/trapping-rain-water/" target="_blank">Trapped Rainwater Problem</a> <br /></td></tr>
+<tr class="memitem:trapped_5Frainwater2_2Ecpp" id="r_trapped_5Frainwater2_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d4/de3/trapped__rainwater2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/de3/trapped__rainwater2_8cpp.html">trapped_rainwater2.cpp</a></td></tr>
+<tr class="memdesc:d4/de3/trapped__rainwater2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.geeksforgeeks.org/trapping-rain-water/" target="_blank">Trapped Rainwater Problem</a> <br /></td></tr>
 <tr class="memitem:tree_5Fheight_2Ecpp" id="r_tree_5Fheight_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="de/d77/tree__height_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>tree_height.cpp</b></td></tr>
 <tr class="memitem:unbounded_5F0_5F1_5Fknapsack_2Ecpp" id="r_unbounded_5F0_5F1_5Fknapsack_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/dec/unbounded__0__1__knapsack_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/dec/unbounded__0__1__knapsack_8cpp.html">unbounded_0_1_knapsack.cpp</a></td></tr>
 <tr class="memdesc:d9/dec/unbounded__0__1__knapsack_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the Unbounded 0/1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem. <br /></td></tr>

d6/d04/trapped__rainwater2_8cpp__incl.svg

@@ -28,6 +28,7 @@ var dir_8a20dd5bfd5341a725342bf72b6b686f =
     [ "shortest_common_supersequence.cpp", "d7/d65/shortest__common__supersequence_8cpp.html", "d7/d65/shortest__common__supersequence_8cpp" ],
     [ "subset_sum_dynamic.cpp", "dc/d67/subset__sum__dynamic_8cpp.html", "dc/d67/subset__sum__dynamic_8cpp" ],
     [ "trapped_rainwater.cpp", "d9/d80/trapped__rainwater_8cpp.html", "d9/d80/trapped__rainwater_8cpp" ],
+    [ "trapped_rainwater2.cpp", "d4/de3/trapped__rainwater2_8cpp.html", "d4/de3/trapped__rainwater2_8cpp" ],
     [ "tree_height.cpp", "de/d77/tree__height_8cpp_source.html", null ],
     [ "unbounded_0_1_knapsack.cpp", "d9/dec/unbounded__0__1__knapsack_8cpp.html", "d9/dec/unbounded__0__1__knapsack_8cpp" ],
     [ "word_break.cpp", "d3/d84/word__break_8cpp.html", "d3/d84/word__break_8cpp" ]