Documentation for 34a6faf401

d8/d95/vector__ops_8hpp_source.html

@@ -650,6 +650,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="alist_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a></div><div class="ttdoc">STL class.</div></div>
 <div class="ttc" id="anamespacemachine__learning_html_a62a418f243cd52b49f59015dddff188e"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a62a418f243cd52b49f59015dddff188e">machine_learning::equal_shuffle</a></div><div class="ttdeci">void equal_shuffle(std::vector&lt; std::vector&lt; std::valarray&lt; T &gt;&gt;&gt; &amp;A, std::vector&lt; std::vector&lt; std::valarray&lt; T &gt;&gt;&gt; &amp;B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:136</div></div>
 <div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a80825a4fd4c41860b689d253dd2c8e93"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">graph::LowestCommonAncestor::LowestCommonAncestor</a></div><div class="ttdeci">LowestCommonAncestor(const RootedTree &amp;tree_)</div><div class="ttdoc">Stores the tree and precomputs &quot;up lifts&quot;.</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:151</div></div>
+<div class="ttc" id="aword__break_8cpp_html_afe4dcd6fd5282e535685361cba645d7c"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c">dynamic_programming::word_break::wordBreak</a></div><div class="ttdeci">bool wordBreak(const std::string &amp;s, const std::vector&lt; std::string &gt; &amp;wordDict)</div><div class="ttdoc">Function that checks if the string passed in param can be segmented into the strings present in the v...</div><div class="ttdef"><b>Definition:</b> word_break.cpp:131</div></div>
 <div class="ttc" id="ainner_product_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html">std::inner_product</a></div><div class="ttdeci">T inner_product(T... args)</div></div>
 <div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a3d9101e3b4598159005fd028b9b0ff74"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">graph::HKGraph::m</a></div><div class="ttdeci">int m</div><div class="ttdoc">m is the number of vertices on left side of Bipartite Graph</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:68</div></div>
 <div class="ttc" id="astructlinear__probing_1_1_entry_html_a2139f643a3caf074da1db8a9fa16fa77"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77">linear_probing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:36</div></div>
@@ -661,7 +662,9 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="anamespacelinear__probing_html_a75d779938df7ebc68581d922b60a2541"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">linear_probing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:98</div></div>
 <div class="ttc" id="anamespacemachine__learning_html_ad9d119e7520fa5c2d2428433f578c0bc"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad9d119e7520fa5c2d2428433f578c0bc">machine_learning::pop_front</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_front(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:102</div></div>
 <div class="ttc" id="anamespacedouble__hashing_html"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html">double_hashing</a></div><div class="ttdoc">An implementation of hash table using double hashing algorithm.</div></div>
+<div class="ttc" id="aunordered_set_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_set.html">std::unordered_set</a></div><div class="ttdoc">STL class.</div></div>
 <div class="ttc" id="astructlinear__probing_1_1_entry_html"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a></div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:35</div></div>
+<div class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &amp;str, const std::unordered_set&lt; std::string &gt; &amp;strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition:</b> word_break.cpp:60</div></div>
 <div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
 <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a8973f687738ddd76f93b5562feae4027"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027">machine_learning::neural_network::NeuralNetwork::~NeuralNetwork</a></div><div class="ttdeci">~NeuralNetwork()=default</div></div>
 <div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector&lt; int &gt; level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:106</div></div>
@@ -676,7 +679,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="anamespacelinear__probing_html_a6a082dc1426a79f866cee6b370df37b0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0">linear_probing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:138</div></div>
 <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a8f984bfd3e32b9b71c33a4f62335c710"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8f984bfd3e32b9b71c33a4f62335c710">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork(const std::vector&lt; std::pair&lt; int, std::string &gt;&gt; &amp;config)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:313</div></div>
 <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div>
-<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map/find.html">std::map::find</a></div><div class="ttdeci">T find(T... args)</div></div>
+<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html">std::unordered_set::find</a></div><div class="ttdeci">T find(T... args)</div></div>
 <div class="ttc" id="anamespacequadratic__probing_html"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html">quadratic_probing</a></div><div class="ttdoc">An implementation of hash table using quadratic probing algorithm.</div></div>
 <div class="ttc" id="akohonen__som__topology_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:369</div></div>
 <div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
@@ -800,6 +803,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="anamespacegraph_html_a2e6017a54d445819ede9adcf33240e1a"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a2e6017a54d445819ede9adcf33240e1a">graph::depth_first_search</a></div><div class="ttdeci">void depth_first_search(const std::vector&lt; std::vector&lt; size_t &gt;&gt; &amp;adj, size_t start)</div><div class="ttdoc">initiates depth first search algorithm.</div><div class="ttdef"><b>Definition:</b> depth_first_search.cpp:99</div></div>
 <div class="ttc" id="aclasshash__chain_html_ae9ddce410015ed8dda6380130d82d6c2"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">hash_chain::_mod</a></div><div class="ttdeci">int _mod</div><div class="ttdoc">modulus of the class</div><div class="ttdef"><b>Definition:</b> chaining.cpp:27</div></div>
 <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
+<div class="ttc" id="aword__break_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> word_break.cpp:174</div></div>
 <div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div>
 <div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div><div class="ttdoc">STL class.</div></div>
 <div class="ttc" id="astruct_segment_intersection_html_a3beb2ac1b35d67354f1dbaf9a971e655"><div class="ttname"><a href="../../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655">SegmentIntersection::direction</a></div><div class="ttdeci">int direction(Point first_point, Point second_point, Point third_point)</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:63</div></div>
@@ -920,6 +924,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a35ab6f1b2840f89a858ca36b78739b69"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a35ab6f1b2840f89a858ca36b78739b69">machine_learning::neural_network::layers::DenseLayer::DenseLayer</a></div><div class="ttdeci">DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::vector&lt; std::valarray&lt; double &gt;&gt; &amp;kernel)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:183</div></div>
 <div class="ttc" id="aclassmachine__learning_1_1adaline_html_a1d821a24e1503d468c95d4acedca58b3"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a1d821a24e1503d468c95d4acedca58b3">machine_learning::adaline::operator&lt;&lt;</a></div><div class="ttdeci">friend std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, const adaline &amp;ada)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:76</div></div>
 <div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
+<div class="ttc" id="anamespaceword__break_html"><div class="ttname"><a href="../../d6/d53/namespaceword__break.html">word_break</a></div><div class="ttdoc">Functions for Word Break problem.</div></div>
 <div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">std::string::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
 <div class="ttc" id="agetline_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a></div><div class="ttdeci">T getline(T... args)</div></div>
 <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_ac130322a5abb1ff763b7c1a55405a35e"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ac130322a5abb1ff763b7c1a55405a35e">machine_learning::neural_network::NeuralNetwork::single_predict</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; double &gt; &gt; single_predict(const std::vector&lt; std::valarray&lt; double &gt;&gt; &amp;X)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:451</div></div>
@@ -933,6 +938,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_afa4a080c9526909ea87a6c0f6cfd6a2f"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#afa4a080c9526909ea87a6c0f6cfd6a2f">machine_learning::neural_network::NeuralNetwork::operator=</a></div><div class="ttdeci">NeuralNetwork &amp; operator=(NeuralNetwork &amp;&amp;)=default</div></div>
 <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a4f14e473bb0722c6490b9dc8da5982aa"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa">machine_learning::neural_network::NeuralNetwork::save_model</a></div><div class="ttdeci">void save_model(const std::string &amp;_file_name)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:652</div></div>
 <div class="ttc" id="anamespacemachine__learning_html_a7220dbb7fa896d83bfb7a50e4fce1786"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786">machine_learning::MIN_DISTANCE</a></div><div class="ttdeci">constexpr double MIN_DISTANCE</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:129</div></div>
+<div class="ttc" id="aword__break_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> word_break.cpp:156</div></div>
 <div class="ttc" id="anamespacelinear__probing_html_a75854f5aa216e61219154c62167ce8f0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:201</div></div>
 <div class="ttc" id="atower__of__hanoi_8cpp_html_a746d9a3984bba88fd6dd91978f6931ed"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed">show</a></div><div class="ttdeci">void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:19</div></div>
 <div class="ttc" id="aclassgraph_1_1_graph_html_ae2f6992450faa2c3da93edea0818869a"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:74</div></div>
@@ -973,6 +979,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
 <div class="ttc" id="anamespacemachine__learning_html_ab58fb68da2cfc5326d3da0cba6f58118"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ab58fb68da2cfc5326d3da0cba6f58118">machine_learning::operator*</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator*(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A, const T &amp;val)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:347</div></div>
 <div class="ttc" id="aneural__network_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:830</div></div>
 <div class="ttc" id="atrie__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Testing function.</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:178</div></div>
+<div class="ttc" id="aword__break_8cpp_html_a272b0f5cdb4e41fd6dee4538b808c06a"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">dynamic_programming::word_break::check</a></div><div class="ttdeci">bool check(const std::string &amp;s, const std::unordered_set&lt; std::string &gt; &amp;strSet, int pos, std::vector&lt; int &gt; *dp)</div><div class="ttdoc">Function that checks if the string passed in param can be segmented from position 'pos',...</div><div class="ttdef"><b>Definition:</b> word_break.cpp:80</div></div>
 <div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
 <div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
 <div class="ttc" id="anamespacequadratic__probing_html_a2093d91dd3d377cf0a5c939e45dcefc7"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">quadratic_probing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:46</div></div>