C++/Python FEniCS/dolfinx@6151987

dolfinx/main/cpp/demos/demo_biharmonic.html

@@ -138,8 +138,8 @@ <h3>Weak formulation<a class="headerlink" href="#weak-formulation" title="Link t
 \forall \ K \in \mathcal{T} \right\}
 \]</div>
 <p>and considering the boundary conditions</p>
-<div class="amsmath math notranslate nohighlight" id="equation-ff33a26d-f40a-458c-a5e4-423f981c068c">
-<span class="eqno">(1)<a class="headerlink" href="#equation-ff33a26d-f40a-458c-a5e4-423f981c068c" title="Permalink to this equation"></a></span>\[\begin{align}
+<div class="amsmath math notranslate nohighlight" id="equation-2e9e61f0-1a1a-4bcd-90c4-013a0b51af9a">
+<span class="eqno">(1)<a class="headerlink" href="#equation-2e9e61f0-1a1a-4bcd-90c4-013a0b51af9a" title="Permalink to this equation"></a></span>\[\begin{align}
 u &amp;= 0 \quad {\rm on} \ \partial\Omega, \\
 \nabla^{2} u &amp;= 0 \quad {\rm on} \ \partial\Omega,
 \end{align}\]</div>

dolfinx/main/cpp/doxygen/d1/d52/namespacedolfinx_1_1graph_1_1build.html

@@ -107,9 +107,9 @@
 <tr class="memitem:acaec57499e623c18ef20134c4532163e" id="r_acaec57499e623c18ef20134c4532163e"><td class="memItemLeft" align="right" valign="top">std::tuple&lt; <a class="el" href="../../df/d84/classdolfinx_1_1graph_1_1AdjacencyList.html">graph::AdjacencyList</a>&lt; std::int64_t &gt;, std::vector&lt; int &gt;, std::vector&lt; std::int64_t &gt;, std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acaec57499e623c18ef20134c4532163e">distribute</a> (MPI_Comm comm, const <a class="el" href="../../df/d84/classdolfinx_1_1graph_1_1AdjacencyList.html">graph::AdjacencyList</a>&lt; std::int64_t &gt; &amp;list, const <a class="el" href="../../df/d84/classdolfinx_1_1graph_1_1AdjacencyList.html">graph::AdjacencyList</a>&lt; std::int32_t &gt; &amp;destinations)</td></tr>
 <tr class="memdesc:acaec57499e623c18ef20134c4532163e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Distribute adjacency list nodes to destination ranks.  <br /></td></tr>
 <tr class="separator:acaec57499e623c18ef20134c4532163e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9fb4d855a8fb2d452facea19bee3e4e5" id="r_a9fb4d855a8fb2d452facea19bee3e4e5"><td class="memItemLeft" align="right" valign="top">std::tuple&lt; std::vector&lt; std::int64_t &gt;, std::vector&lt; std::int64_t &gt;, std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9fb4d855a8fb2d452facea19bee3e4e5">distribute</a> (MPI_Comm comm, std::span&lt; const std::int64_t &gt; list, std::array&lt; std::size_t, 2 &gt; shape, const <a class="el" href="../../df/d84/classdolfinx_1_1graph_1_1AdjacencyList.html">graph::AdjacencyList</a>&lt; std::int32_t &gt; &amp;destinations)</td></tr>
-<tr class="memdesc:a9fb4d855a8fb2d452facea19bee3e4e5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Distribute fixed size nodes to destination ranks.  <br /></td></tr>
-<tr class="separator:a9fb4d855a8fb2d452facea19bee3e4e5"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a2e8a15e5aaf2b08b1a995c0428682937" id="r_a2e8a15e5aaf2b08b1a995c0428682937"><td class="memItemLeft" align="right" valign="top">std::tuple&lt; std::vector&lt; std::int64_t &gt;, std::vector&lt; int &gt;, std::vector&lt; std::int64_t &gt;, std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2e8a15e5aaf2b08b1a995c0428682937">distribute</a> (MPI_Comm comm, std::span&lt; const std::int64_t &gt; list, std::array&lt; std::size_t, 2 &gt; shape, const <a class="el" href="../../df/d84/classdolfinx_1_1graph_1_1AdjacencyList.html">graph::AdjacencyList</a>&lt; std::int32_t &gt; &amp;destinations)</td></tr>
+<tr class="memdesc:a2e8a15e5aaf2b08b1a995c0428682937"><td class="mdescLeft">&#160;</td><td class="mdescRight">Distribute fixed size nodes to destination ranks.  <br /></td></tr>
+<tr class="separator:a2e8a15e5aaf2b08b1a995c0428682937"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a33b85b292330fd733cc87124a0e6af6d" id="r_a33b85b292330fd733cc87124a0e6af6d"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a33b85b292330fd733cc87124a0e6af6d">compute_ghost_indices</a> (MPI_Comm comm, std::span&lt; const std::int64_t &gt; owned_indices, std::span&lt; const std::int64_t &gt; ghost_indices, std::span&lt; const int &gt; ghost_owners)</td></tr>
 <tr class="memdesc:a33b85b292330fd733cc87124a0e6af6d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Take a set of distributed input global indices, including ghosts, and determine the new global indices after remapping.  <br /></td></tr>
 <tr class="separator:a33b85b292330fd733cc87124a0e6af6d"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -267,20 +267,20 @@ <h2 class="memtitle"><span class="permalink"><a href="#acaec57499e623c18ef20134c
 <li>Received adjacency list for this process</li>
 <li>Source ranks for each node in the adjacency list</li>
 <li>Original global index for each node in the adjacency list</li>
-<li>Owner rank of ghost nodes </li>
+<li>Owning rank of ghost nodes. </li>
 </ol>
 </dd></dl>
 
 </div>
 </div>
-<a id="a9fb4d855a8fb2d452facea19bee3e4e5" name="a9fb4d855a8fb2d452facea19bee3e4e5"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#a9fb4d855a8fb2d452facea19bee3e4e5">&#9670;&#160;</a></span>distribute() <span class="overload">[2/2]</span></h2>
+<a id="a2e8a15e5aaf2b08b1a995c0428682937" name="a2e8a15e5aaf2b08b1a995c0428682937"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2e8a15e5aaf2b08b1a995c0428682937">&#9670;&#160;</a></span>distribute() <span class="overload">[2/2]</span></h2>
 
 <div class="memitem">
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname">std::tuple&lt; std::vector&lt; std::int64_t &gt;, std::vector&lt; std::int64_t &gt;, std::vector&lt; int &gt; &gt; distribute </td>
+          <td class="memname">std::tuple&lt; std::vector&lt; std::int64_t &gt;, std::vector&lt; int &gt;, std::vector&lt; std::int64_t &gt;, std::vector&lt; int &gt; &gt; distribute </td>
           <td>(</td>
           <td class="paramtype">MPI_Comm</td>          <td class="paramname"><span class="paramname"><em>comm</em></span>, </td>
         </tr>
@@ -307,16 +307,17 @@ <h2 class="memtitle"><span class="permalink"><a href="#a9fb4d855a8fb2d452facea19
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in]</td><td class="paramname">comm</td><td><a class="el" href="../../da/dfe/namespacedolfinx_1_1MPI.html" title="MPI support functionality.">MPI</a> Communicator </td></tr>
-    <tr><td class="paramdir">[in]</td><td class="paramname">list</td><td>A flattened 2D row major array </td></tr>
-    <tr><td class="paramdir">[in]</td><td class="paramname">shape</td><td>The shape of the array </td></tr>
-    <tr><td class="paramdir">[in]</td><td class="paramname">destinations</td><td>Destination ranks for the ith row of the array. The first rank is the 'owner' of the node. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">list</td><td>Constant degree (valency) adjacency list. The array shape is (num_nodes, degree). Storage is row-major. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">shape</td><td>Shape <code>(num_nodes, degree)</code> of <code>list</code>. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">destinations</td><td>Destination ranks for the ith node (row) of <code>list</code>. The first rank is the 'owner' of the node. </td></tr>
   </table>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd><ol type="1">
-<li>Received list for this process</li>
-<li>Original global index for each node</li>
-<li>Owner rank of ghost nodes </li>
+<li>Received adjacency list on this process. The array shape is (num_nodes, degree). Storage is row-major.</li>
+<li>Source rank for each received node.</li>
+<li>Original global index for each received node.</li>
+<li>Owning rank of ghost nodes. </li>
 </ol>
 </dd></dl>
 

dolfinx/main/cpp/doxygen/d3/d8b/Geometry_8h_source.html

@@ -492,8 +492,8 @@
 <div class="ttc" id="aclassdolfinx_1_1mesh_1_1Topology_html_a9d7170c6e2d646c7b6fdfa139dbdc2f6"><div class="ttname"><a href="../../da/d02/classdolfinx_1_1mesh_1_1Topology.html#a9d7170c6e2d646c7b6fdfa139dbdc2f6">dolfinx::mesh::Topology::entity_types</a></div><div class="ttdeci">std::vector&lt; CellType &gt; entity_types(std::int8_t dim) const</div><div class="ttdoc">Get the entity types in the topology for a given dimension.</div><div class="ttdef"><b>Definition</b> Topology.cpp:1023</div></div>
 <div class="ttc" id="aclassdolfinx_1_1mesh_1_1Topology_html_aa1804e93bcd191ae0ad91df7ae775836"><div class="ttname"><a href="../../da/d02/classdolfinx_1_1mesh_1_1Topology.html#aa1804e93bcd191ae0ad91df7ae775836">dolfinx::mesh::Topology::dim</a></div><div class="ttdeci">int dim() const noexcept</div><div class="ttdoc">Return the topological dimension of the mesh.</div><div class="ttdef"><b>Definition</b> Topology.cpp:794</div></div>
 <div class="ttc" id="anamespacedolfinx_1_1fem_html_ae243b5f1e53ad867535767929d8847be"><div class="ttname"><a href="../../d8/dbf/namespacedolfinx_1_1fem.html#ae243b5f1e53ad867535767929d8847be">dolfinx::fem::build_dofmap_data</a></div><div class="ttdeci">std::tuple&lt; common::IndexMap, int, std::vector&lt; std::vector&lt; std::int32_t &gt; &gt; &gt; build_dofmap_data(MPI_Comm comm, const mesh::Topology &amp;topology, const std::vector&lt; ElementDofLayout &gt; &amp;element_dof_layouts, const std::function&lt; std::vector&lt; int &gt;(const graph::AdjacencyList&lt; std::int32_t &gt; &amp;)&gt; &amp;reorder_fn)</div><div class="ttdef"><b>Definition</b> dofmapbuilder.cpp:617</div></div>
-<div class="ttc" id="anamespacedolfinx_1_1graph_1_1build_html_abb5b31c983ae23a599fd09383cf003b3"><div class="ttname"><a href="../../d1/d52/namespacedolfinx_1_1graph_1_1build.html#abb5b31c983ae23a599fd09383cf003b3">dolfinx::graph::build::compute_local_to_global</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; compute_local_to_global(std::span&lt; const std::int64_t &gt; global, std::span&lt; const std::int32_t &gt; local)</div><div class="ttdef"><b>Definition</b> partition.cpp:539</div></div>
-<div class="ttc" id="anamespacedolfinx_1_1graph_1_1build_html_ace15f6925ed85b175a7e32ef2ad46d3a"><div class="ttname"><a href="../../d1/d52/namespacedolfinx_1_1graph_1_1build.html#ace15f6925ed85b175a7e32ef2ad46d3a">dolfinx::graph::build::compute_local_to_local</a></div><div class="ttdeci">std::vector&lt; std::int32_t &gt; compute_local_to_local(std::span&lt; const std::int64_t &gt; local0_to_global, std::span&lt; const std::int64_t &gt; local1_to_global)</div><div class="ttdoc">Compute a local0-to-local1 map from two local-to-global maps with common global indices.</div><div class="ttdef"><b>Definition</b> partition.cpp:561</div></div>
+<div class="ttc" id="anamespacedolfinx_1_1graph_1_1build_html_abb5b31c983ae23a599fd09383cf003b3"><div class="ttname"><a href="../../d1/d52/namespacedolfinx_1_1graph_1_1build.html#abb5b31c983ae23a599fd09383cf003b3">dolfinx::graph::build::compute_local_to_global</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; compute_local_to_global(std::span&lt; const std::int64_t &gt; global, std::span&lt; const std::int32_t &gt; local)</div><div class="ttdef"><b>Definition</b> partition.cpp:532</div></div>
+<div class="ttc" id="anamespacedolfinx_1_1graph_1_1build_html_ace15f6925ed85b175a7e32ef2ad46d3a"><div class="ttname"><a href="../../d1/d52/namespacedolfinx_1_1graph_1_1build.html#ace15f6925ed85b175a7e32ef2ad46d3a">dolfinx::graph::build::compute_local_to_local</a></div><div class="ttdeci">std::vector&lt; std::int32_t &gt; compute_local_to_local(std::span&lt; const std::int64_t &gt; local0_to_global, std::span&lt; const std::int64_t &gt; local1_to_global)</div><div class="ttdoc">Compute a local0-to-local1 map from two local-to-global maps with common global indices.</div><div class="ttdef"><b>Definition</b> partition.cpp:554</div></div>
 <div class="ttc" id="anamespacedolfinx_1_1mesh_html"><div class="ttname"><a href="../../dd/d7d/namespacedolfinx_1_1mesh.html">dolfinx::mesh</a></div><div class="ttdoc">Mesh data structures and algorithms on meshes.</div><div class="ttdef"><b>Definition</b> DofMap.h:32</div></div>
 <div class="ttc" id="anamespacedolfinx_1_1mesh_html_a4517d9b85ae3658d28f603f29116130a"><div class="ttname"><a href="../../dd/d7d/namespacedolfinx_1_1mesh.html#a4517d9b85ae3658d28f603f29116130a">dolfinx::mesh::create_geometry</a></div><div class="ttdeci">Geometry&lt; typename std::remove_reference_t&lt; typename U::value_type &gt; &gt; create_geometry(const Topology &amp;topology, const std::vector&lt; fem::CoordinateElement&lt; std::remove_reference_t&lt; typename U::value_type &gt; &gt; &gt; &amp;elements, std::span&lt; const std::int64_t &gt; nodes, std::span&lt; const std::int64_t &gt; xdofs, const U &amp;x, int dim, std::function&lt; std::vector&lt; int &gt;(const graph::AdjacencyList&lt; std::int32_t &gt; &amp;)&gt; reorder_fn=nullptr)</div><div class="ttdoc">Build Geometry from input data.</div><div class="ttdef"><b>Definition</b> Geometry.h:264</div></div>
 </div><!-- fragment --></div><!-- contents -->