rmontanana/BayesNet
1
0
Fork 0
Code Issues 2 Pull Requests 1 Actions Packages Projects Releases 6 Wiki Activity

Enhance tests coverage and report output

Browse Source
This commit is contained in:
Ricardo Montañana Gómez
2024-04-30 14:00:24 +02:00
parent b4a222b100
commit 3c7382a93a
947 changed files with 376596 additions and 3921 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
html/bayesnet/utils/Mst.cc.func.html
View File

@@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Test Date:</td>
<td class="headerValue">2024-04-29 20:48:03</td>
<td class="headerValue">2024-04-30 13:59:18</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntryHi">100.0&nbsp;%</td>
@@ -63,72 +63,72 @@
</tr>
<tr>
<td class="coverFn"><a href="Mst.cc.gcov.html#L54">_ZN8bayesnet13insertElementERNSt7__cxx114listIiSaIiEEEi</a></td>
<td class="coverFn"><a href="Mst.cc.gcov.html#L42">auto bayesnet::Graph::kruskal_algorithm()::{lambda(auto:1 const&amp;, auto:2 const&amp;)#1}::operator()&lt;std::pair&lt;float, std::pair&lt;int, int&gt; &gt;, std::pair&lt;float, std::pair&lt;int, int&gt; &gt; &gt;(std::pair&lt;float, std::pair&lt;int, int&gt; &gt; const&amp;, std::pair&lt;float, std::pair&lt;int, int&gt; &gt; const&amp;) const</a></td>
<td class="coverFnHi">1749</td>
<td class="coverFnHi">13278</td>
</tr>
<tr>
<td class="coverFn"><a href="Mst.cc.gcov.html#L103">_ZN8bayesnet3MST19maximumSpanningTreeEv</a></td>
<td class="coverFn"><a href="Mst.cc.gcov.html#L15">bayesnet::Graph::Graph(int)</a></td>
<td class="coverFnHi">319</td>
<td class="coverFnHi">174</td>
</tr>
<tr>
<td class="coverFn"><a href="Mst.cc.gcov.html#L102">_ZN8bayesnet3MSTC2ERKSt6vectorINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEESaIS7_EERKN2at6TensorEi</a></td>
<td class="coverFn"><a href="Mst.cc.gcov.html#L22">bayesnet::Graph::addEdge(int, int, float)</a></td>
<td class="coverFnHi">319</td>
<td class="coverFnHi">3456</td>
</tr>
<tr>
<td class="coverFn"><a href="Mst.cc.gcov.html#L39">_ZN8bayesnet5Graph17kruskal_algorithmEv</a></td>
<td class="coverFn"><a href="Mst.cc.gcov.html#L26">bayesnet::Graph::find_set(int)</a></td>
<td class="coverFnHi">319</td>
<td class="coverFnHi">15978</td>
</tr>
<tr>
<td class="coverFn"><a href="Mst.cc.gcov.html#L22">_ZN8bayesnet5Graph7addEdgeEiif</a></td>
<td class="coverFn"><a href="Mst.cc.gcov.html#L39">bayesnet::Graph::kruskal_algorithm()</a></td>
<td class="coverFnHi">6336</td>
<td class="coverFnHi">174</td>
</tr>
<tr>
<td class="coverFn"><a href="Mst.cc.gcov.html#L26">_ZN8bayesnet5Graph8find_setEi</a></td>
<td class="coverFn"><a href="Mst.cc.gcov.html#L35">bayesnet::Graph::union_set(int, int)</a></td>
<td class="coverFnHi">29293</td>
<td class="coverFnHi">954</td>
</tr>
<tr>
<td class="coverFn"><a href="Mst.cc.gcov.html#L35">_ZN8bayesnet5Graph9union_setEii</a></td>
<td class="coverFn"><a href="Mst.cc.gcov.html#L102">bayesnet::MST::MST(std::vector&lt;std::__cxx11::basic_string&lt;char, std::char_traits&lt;char&gt;, std::allocator&lt;char&gt; &gt;, std::allocator&lt;std::__cxx11::basic_string&lt;char, std::char_traits&lt;char&gt;, std::allocator&lt;char&gt; &gt; &gt; &gt; const&amp;, at::Tensor const&amp;, int)</a></td>
<td class="coverFnHi">1749</td>
<td class="coverFnHi">174</td>
</tr>
<tr>
<td class="coverFn"><a href="Mst.cc.gcov.html#L15">_ZN8bayesnet5GraphC2Ei</a></td>
<td class="coverFn"><a href="Mst.cc.gcov.html#L103">bayesnet::MST::maximumSpanningTree()</a></td>
<td class="coverFnHi">319</td>
<td class="coverFnHi">174</td>
</tr>
<tr>
<td class="coverFn"><a href="Mst.cc.gcov.html#L61">_ZN8bayesnet7reorderESt6vectorISt4pairIfS1_IiiEESaIS3_EEi</a></td>
<td class="coverFn"><a href="Mst.cc.gcov.html#L54">bayesnet::insertElement(std::__cxx11::list&lt;int, std::allocator&lt;int&gt; &gt;&amp;, int)</a></td>
<td class="coverFnHi">319</td>
<td class="coverFnHi">954</td>
</tr>
<tr>
<td class="coverFn"><a href="Mst.cc.gcov.html#L42">_ZZN8bayesnet5Graph17kruskal_algorithmEvENKUlRKT_RKT0_E_clISt4pairIfS9_IiiEESB_EEDaS3_S6_</a></td>
<td class="coverFn"><a href="Mst.cc.gcov.html#L61">bayesnet::reorder(std::vector&lt;std::pair&lt;float, std::pair&lt;int, int&gt; &gt;, std::allocator&lt;std::pair&lt;float, std::pair&lt;int, int&gt; &gt; &gt; &gt;, int)</a></td>
<td class="coverFnHi">24343</td>
<td class="coverFnHi">174</td>
</tr>