Documentation for c56496d

Author: jenningsloy318

d2/d90/namespacegreedy__algorithms.html

@@ -119,6 +119,9 @@
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html">dijkstra</a></td></tr>
 <tr class="memdesc:d2/d2f/namespacegreedy__algorithms_1_1dijkstra"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html">stable_matching</a></td></tr>
+<tr class="memdesc:dd/d9a/namespacegreedy__algorithms_1_1stable__matching"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the Gale-Shapley Algorithm. <br /></td></tr>
+<tr class="separator:"><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>
@@ -133,8 +136,11 @@
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
 <p>for uint32_t</p>
+<p>for assert</p>
 <p>for assert for INT_MAX for IO operations</p>
 <p>Greedy Algorithms</p>
+<p>for std::u32int_t for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a></p>
+<p>Greedy Algorithms</p>
 <p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></p>
 <p>Greedy Algorithms</p>
 <p>for array for IO operations for numeric limits</p>

d2/d90/namespacegreedy__algorithms.js

@@ -1,6 +1,9 @@
 var namespacegreedy__algorithms =
 [
     [ "dijkstra", "d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html", "d2/d2f/namespacegreedy__algorithms_1_1dijkstra" ],
+    [ "stable_matching", "dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html", [
+      [ "gale_shapley", "dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c", null ]
+    ] ],
     [ "can_jump", "d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502", null ],
     [ "findMinimumEdge", "d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098", null ]
 ];

d5/dd0/namespacephysics.html

@@ -112,7 +112,7 @@
 <a href="#details">More...</a></p>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>for IO operations </p>
-<p>for assert() for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin()</a>, and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos()</a></p>
+<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin()</a>, and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos()</a></p>
 <p>Physics algorithms </p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->

d7/d81/namespacebit__manipulation.html

@@ -126,11 +126,14 @@
 <div class="textblock"><p>for IO operations </p>
 <p>Bit manipulation algorithms.</p>
 <p>for io operations</p>
+<p>Program to generate n-bit <a href="https://en.wikipedia.org/wiki/Gray_code" target="_blank">Gray code</a></p>
 <p>storing the numbers</p>
 <p>for assert</p>
 <p>Bit manipulation algorithms</p>
 <p>for assert for IO operations</p>
 <p>Bit manipulation algorithms</p>
+<p>Gray code is a binary numeral system where consecutive values differ in exactly 1 bit. The following code offers one of many possible Gray codes given some pre-determined number of bits. for gray code representation for assert for IO operations for vector data structure</p>
+<p>Bit manipulation algorithms</p>
 <p>for assert</p>
 <p>Bit Manipulation algorithms</p>
 <p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a> for assert for IO operations for limits of integral types for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>