deploy: e84eda5

_neighbourhood_8h_source.html

@@ -516,9 +516,9 @@
 <div class="ttc" id="aclasscomma_1_1_neighbourhood_pure_front_creator_html_a73b13c01032e09c04690d4320174d222"><div class="ttname"><a href="classcomma_1_1_neighbourhood_pure_front_creator.html#a73b13c01032e09c04690d4320174d222">comma::NeighbourhoodPureFrontCreator::clone</a></div><div class="ttdeci">std::shared_ptr&lt; NeighbourhoodBaseType &gt; clone(std::shared_ptr&lt; NeighbourhoodBaseType &gt; other) const override</div><div class="ttdoc">Create a new Neighbourhood object by copy.</div><div class="ttdef"><b>Definition:</b> Neighbourhood.h:554</div></div>
 <div class="ttc" id="aclasscomma_1_1_neighbourhood_pure_front_creator_html_a762a03d248377977aa1c60eacd4479a8"><div class="ttname"><a href="classcomma_1_1_neighbourhood_pure_front_creator.html#a762a03d248377977aa1c60eacd4479a8">comma::NeighbourhoodPureFrontCreator::~NeighbourhoodPureFrontCreator</a></div><div class="ttdeci">~NeighbourhoodPureFrontCreator() override=default</div><div class="ttdoc">Destructor.</div></div>
 <div class="ttc" id="aclasscomma_1_1_neighbourhood_pure_front_creator_html_aaac38025ac8e92eecd2b32d85c3e3d0e"><div class="ttname"><a href="classcomma_1_1_neighbourhood_pure_front_creator.html#aaac38025ac8e92eecd2b32d85c3e3d0e">comma::NeighbourhoodPureFrontCreator::create</a></div><div class="ttdeci">std::shared_ptr&lt; NeighbourhoodBaseType &gt; create(const std::unordered_set&lt; CoMMAIndexType &gt; &amp;s_neighbours_of_seed, const std::vector&lt; CoMMAWeightType &gt; &amp;priority_weights, const CoMMAIntType dimension) const override</div><div class="ttdoc">Create a new Neighbourhood object from scratch using the given arguments.</div><div class="ttdef"><b>Definition:</b> Neighbourhood.h:539</div></div>
-<div class="ttc" id="aclasscomma_1_1_pair_find_first_based_functor_html"><div class="ttname"><a href="classcomma_1_1_pair_find_first_based_functor.html">comma::PairFindFirstBasedFunctor</a></div><div class="ttdoc">Functor implementing an operator telling if a given value if the first one of pair.</div><div class="ttdef"><b>Definition:</b> Util.h:213</div></div>
+<div class="ttc" id="aclasscomma_1_1_pair_find_first_based_functor_html"><div class="ttname"><a href="classcomma_1_1_pair_find_first_based_functor.html">comma::PairFindFirstBasedFunctor</a></div><div class="ttdoc">Functor implementing an operator telling if a given value if the first one of pair.</div><div class="ttdef"><b>Definition:</b> Util.h:212</div></div>
 <div class="ttc" id="anamespacecomma_html"><div class="ttname"><a href="namespacecomma.html">comma</a></div><div class="ttdef"><b>Definition:</b> Agglomerator.h:34</div></div>
-<div class="ttc" id="astructcomma_1_1_custom_pair_greater_functor_html"><div class="ttname"><a href="structcomma_1_1_custom_pair_greater_functor.html">comma::CustomPairGreaterFunctor</a></div><div class="ttdoc">Functor for pairs implementing a custom 'greater than'. It relies on the 'greater than' operator for ...</div><div class="ttdef"><b>Definition:</b> Util.h:156</div></div>
+<div class="ttc" id="astructcomma_1_1_custom_pair_greater_functor_html"><div class="ttname"><a href="structcomma_1_1_custom_pair_greater_functor.html">comma::CustomPairGreaterFunctor</a></div><div class="ttdoc">Functor for pairs implementing a custom 'greater than'. It relies on the 'greater than' operator for ...</div><div class="ttdef"><b>Definition:</b> Util.h:155</div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->

_seeds___pool_8h_source.html

@@ -670,8 +670,8 @@
 <div class="ttc" id="anamespacecomma_html_a6676cd5a4d3dbf9141f8c7bc87617be8a4f18a70072d52370244908b93cf13e85"><div class="ttname"><a href="namespacecomma.html#a6676cd5a4d3dbf9141f8c7bc87617be8a4f18a70072d52370244908b93cf13e85">comma::VALLEY</a></div><div class="ttdeci">@ VALLEY</div><div class="ttdoc">Valley, one boundary face.</div><div class="ttdef"><b>Definition:</b> CoMMADefs.h:26</div></div>
 <div class="ttc" id="anamespacecomma_html_a6676cd5a4d3dbf9141f8c7bc87617be8aaa4cdfbb2d1efc15da1728bbc125e9f1"><div class="ttname"><a href="namespacecomma.html#a6676cd5a4d3dbf9141f8c7bc87617be8aaa4cdfbb2d1efc15da1728bbc125e9f1">comma::RIDGE</a></div><div class="ttdeci">@ RIDGE</div><div class="ttdoc">Ridge, two boundary faces.</div><div class="ttdef"><b>Definition:</b> CoMMADefs.h:27</div></div>
 <div class="ttc" id="anamespacecomma_html_a6676cd5a4d3dbf9141f8c7bc87617be8ada6f7a085b1f7f2125ce30f5e02db53c"><div class="ttname"><a href="namespacecomma.html#a6676cd5a4d3dbf9141f8c7bc87617be8ada6f7a085b1f7f2125ce30f5e02db53c">comma::INTERIOR</a></div><div class="ttdeci">@ INTERIOR</div><div class="ttdoc">Interior cell, no boundary faces.</div><div class="ttdef"><b>Definition:</b> CoMMADefs.h:25</div></div>
-<div class="ttc" id="astructcomma_1_1_custom_pair_greater_functor_html"><div class="ttname"><a href="structcomma_1_1_custom_pair_greater_functor.html">comma::CustomPairGreaterFunctor</a></div><div class="ttdoc">Functor for pairs implementing a custom 'greater than'. It relies on the 'greater than' operator for ...</div><div class="ttdef"><b>Definition:</b> Util.h:156</div></div>
-<div class="ttc" id="astructcomma_1_1_custom_pair_less_functor_html"><div class="ttname"><a href="structcomma_1_1_custom_pair_less_functor.html">comma::CustomPairLessFunctor</a></div><div class="ttdoc">Functor for pairs implementing a custom 'less than'. It relies on the 'less than' operator for the se...</div><div class="ttdef"><b>Definition:</b> Util.h:133</div></div>
+<div class="ttc" id="astructcomma_1_1_custom_pair_greater_functor_html"><div class="ttname"><a href="structcomma_1_1_custom_pair_greater_functor.html">comma::CustomPairGreaterFunctor</a></div><div class="ttdoc">Functor for pairs implementing a custom 'greater than'. It relies on the 'greater than' operator for ...</div><div class="ttdef"><b>Definition:</b> Util.h:155</div></div>
+<div class="ttc" id="astructcomma_1_1_custom_pair_less_functor_html"><div class="ttname"><a href="structcomma_1_1_custom_pair_less_functor.html">comma::CustomPairLessFunctor</a></div><div class="ttdoc">Functor for pairs implementing a custom 'less than'. It relies on the 'less than' operator for the se...</div><div class="ttdef"><b>Definition:</b> Util.h:132</div></div>
 <div class="ttc" id="astructcomma_1_1_s_p_full_initializator_html"><div class="ttname"><a href="structcomma_1_1_s_p_full_initializator.html">comma::SPFullInitializator</a></div><div class="ttdoc">Functor performing the full initialization of a seeds pool.</div><div class="ttdef"><b>Definition:</b> Seeds_Pool.h:88</div></div>
 <div class="ttc" id="astructcomma_1_1_s_p_full_initializator_html_a1a40a546f44cdd9bec7f20516cabb05c"><div class="ttname"><a href="structcomma_1_1_s_p_full_initializator.html#a1a40a546f44cdd9bec7f20516cabb05c">comma::SPFullInitializator::SPFullInitializator</a></div><div class="ttdeci">SPFullInitializator()</div><div class="ttdoc">Constructor.</div><div class="ttdef"><b>Definition:</b> Seeds_Pool.h:98</div></div>
 <div class="ttc" id="astructcomma_1_1_s_p_full_initializator_html_a41002d642267555e928ce4979c27d2c0"><div class="ttname"><a href="structcomma_1_1_s_p_full_initializator.html#a41002d642267555e928ce4979c27d2c0">comma::SPFullInitializator::~SPFullInitializator</a></div><div class="ttdeci">~SPFullInitializator() override=default</div><div class="ttdoc">Destructor.</div></div>

_util_8h.html

@@ -166,10 +166,10 @@
 <tr class="memitem:a81affca718f9c9927cfb82c317c8239e"><td class="memTemplItemLeft" align="right" valign="top">std::unordered_set&lt; KeyT &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacecomma.html#a81affca718f9c9927cfb82c317c8239e">comma::d_keys_to_set</a> (const std::unordered_map&lt; KeyT, ValueT &gt; &amp;dict)</td></tr>
 <tr class="memdesc:a81affca718f9c9927cfb82c317c8239e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function for creating a set out of the keys of a map. <a href="namespacecomma.html#a81affca718f9c9927cfb82c317c8239e">More...</a><br /></td></tr>
 <tr class="separator:a81affca718f9c9927cfb82c317c8239e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4bcb27b4d8d828bd3b5b0a51710d310a"><td class="memTemplParams" colspan="2">template&lt;typename IndexT , typename IntT &gt; </td></tr>
-<tr class="memitem:a4bcb27b4d8d828bd3b5b0a51710d310a"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacecomma.html#a4bcb27b4d8d828bd3b5b0a51710d310a">comma::filter_cells_by_n_edges</a> (const std::vector&lt; IndexT &gt; &amp;indices, const std::vector&lt; IntT &gt; &amp;n_bnd_faces, const std::unordered_set&lt; IntT &gt; allowed, std::vector&lt; IndexT &gt; &amp;filtered)</td></tr>
-<tr class="memdesc:a4bcb27b4d8d828bd3b5b0a51710d310a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Given the connectivity of the graph, filter cells keeping only those with the desired number of edges / neighbours. <a href="namespacecomma.html#a4bcb27b4d8d828bd3b5b0a51710d310a">More...</a><br /></td></tr>
-<tr class="separator:a4bcb27b4d8d828bd3b5b0a51710d310a"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a5193675e5abbdc422bcb8be506e6c08c"><td class="memTemplParams" colspan="2">template&lt;typename IndexT , typename IntT &gt; </td></tr>
+<tr class="memitem:a5193675e5abbdc422bcb8be506e6c08c"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacecomma.html#a5193675e5abbdc422bcb8be506e6c08c">comma::filter_cells_by_n_edges</a> (const std::vector&lt; IndexT &gt; &amp;indices, const std::vector&lt; IntT &gt; &amp;n_bnd_faces, const std::unordered_set&lt; IntT &gt; &amp;allowed, std::vector&lt; IndexT &gt; &amp;filtered)</td></tr>
+<tr class="memdesc:a5193675e5abbdc422bcb8be506e6c08c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Given the connectivity of the graph, filter cells keeping only those with the desired number of edges / neighbours. <a href="namespacecomma.html#a5193675e5abbdc422bcb8be506e6c08c">More...</a><br /></td></tr>
+<tr class="separator:a5193675e5abbdc422bcb8be506e6c08c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae3653181db03b3ea76722462c3b3e02b"><td class="memTemplParams" colspan="2">template&lt;typename IndexT , typename DistT &gt; </td></tr>
 <tr class="memitem:ae3653181db03b3ea76722462c3b3e02b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacecomma.html#ae3653181db03b3ea76722462c3b3e02b">comma::compute_neighbourhood_based_wall_distance</a> (const std::vector&lt; IndexT &gt; &amp;neigh_idxs, const std::vector&lt; IndexT &gt; &amp;neighs, const std::vector&lt; IndexT &gt; &amp;wall, std::vector&lt; DistT &gt; &amp;dist)</td></tr>
 <tr class="memdesc:ae3653181db03b3ea76722462c3b3e02b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute a neighbourhood-base wall-distance, that is, the distance of a given cell from a wall is the number of cells though which the minimum path starting from the cell and ending at the wall. For example, in a Cartesian grids this is equivalent to the minimum of the Manhattan distance.<br />

_util_8h.js

@@ -9,7 +9,7 @@ var _util_8h =
  [ "d_keys_to_set", "_util_8h.html#a81affca718f9c9927cfb82c317c8239e", null ],
  [ "dot_deviate", "_util_8h.html#aa6823809d0c8cc7a1e30d51cfb0ce21a", null ],
  [ "dot_product", "_util_8h.html#a0e43c30768d45d4f1f643f2f8be53f5d", null ],
- [ "filter_cells_by_n_edges", "_util_8h.html#a4bcb27b4d8d828bd3b5b0a51710d310a", null ],
+ [ "filter_cells_by_n_edges", "_util_8h.html#a5193675e5abbdc422bcb8be506e6c08c", null ],
  [ "get_direction", "_util_8h.html#a3fda6288b7b5c19904abf0312557c774", null ],
  [ "squared_euclidean_distance", "_util_8h.html#a39eb676bbec9475d7b0b5a6186b5f3d0", null ],
  [ "vector_of_first_elements", "_util_8h.html#ab712cf58df5dacc470f08332abdde7ec", null ],