Skip to content

Commit

Permalink
Deploying to gh-pages from @ a813363 🚀
Browse files Browse the repository at this point in the history
  • Loading branch information
@bevanwsjones
bevanwsjones committed Mar 9, 2024
1 parent 1430385 commit 5fc7c73
Show file tree
Hide file tree
Showing 197 changed files with 3,006 additions and 2,611 deletions.
10 changes: 5 additions & 5 deletions adjacency__graph_8h_source.html
View file
Original file line number Diff line number Diff line change
Expand Up @@ -154,14 +154,14 @@
<div class="line"><a name="l00120"></a><span class="lineno"><a class="line" href="class_disa_1_1_adjacency___graph.html#afffd3889c5d38a1a8ab86abcadc98070"> 120</a></span>&#160; [[nodiscard]] <span class="keyword">inline</span> std::span&lt;const std::size_t&gt; <a class="code" href="class_disa_1_1_adjacency___graph.html#afffd3889c5d38a1a8ab86abcadc98070">operator[]</a>(<span class="keyword">const</span> std::size_t&amp; i_vertex)<span class="keyword"> const </span>{</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; <a class="code" href="macros_8h.html#aa43468426b5b5a5e19a1f40f8118a6b3">ASSERT_DEBUG</a>(i_vertex &lt; <a class="code" href="class_disa_1_1_adjacency___graph.html#a6278cc8407882022d4790eadf867860c">size_vertex</a>(),</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; <span class="stringliteral">&quot;Vertex index &quot;</span> + std::to_string(i_vertex) + <span class="stringliteral">&quot; not in range [0, &quot;</span> + std::to_string(i_vertex) + <span class="stringliteral">&quot;).&quot;</span>);</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; <span class="keywordflow">return</span> {<a class="code" href="class_disa_1_1_adjacency___graph.html#ada1d193b23e67a018ee5987607f93eb9">vertex_adjacent_list</a>.begin() + <span class="keyword">static_cast&lt;</span><a class="code" href="namespace_disa.html#a0ba6342ec1af226ef99781cde1070757">s_size_t</a><span class="keyword">&gt;</span>(<a class="code" href="class_disa_1_1_adjacency___graph.html#a42a9ca141195563377732b946682cd7d">offset</a>[i_vertex]),</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; <span class="keywordflow">return</span> {<a class="code" href="class_disa_1_1_adjacency___graph.html#ada1d193b23e67a018ee5987607f93eb9">vertex_adjacent_list</a>.begin() + <span class="keyword">static_cast&lt;</span><a class="code" href="namespace_disa.html#a292ef5870b9a88a0657959d670390c41">s_size_t</a><span class="keyword">&gt;</span>(<a class="code" href="class_disa_1_1_adjacency___graph.html#a42a9ca141195563377732b946682cd7d">offset</a>[i_vertex]),</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; <a class="code" href="class_disa_1_1_adjacency___graph.html#a42a9ca141195563377732b946682cd7d">offset</a>[i_vertex + 1] - <a class="code" href="class_disa_1_1_adjacency___graph.html#a42a9ca141195563377732b946682cd7d">offset</a>[i_vertex]};</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; }</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; </div>
<div class="line"><a name="l00132"></a><span class="lineno"><a class="line" href="class_disa_1_1_adjacency___graph.html#ad7bda48d930c6060c12bb296148ed46c"> 132</a></span>&#160; [[nodiscard]] <span class="keyword">inline</span> std::span&lt;std::size_t&gt; <a class="code" href="class_disa_1_1_adjacency___graph.html#ad7bda48d930c6060c12bb296148ed46c">operator[]</a>(<span class="keyword">const</span> std::size_t&amp; i_vertex) {</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; <a class="code" href="macros_8h.html#aa43468426b5b5a5e19a1f40f8118a6b3">ASSERT_DEBUG</a>(i_vertex &lt; <a class="code" href="class_disa_1_1_adjacency___graph.html#a6278cc8407882022d4790eadf867860c">size_vertex</a>(),</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <span class="stringliteral">&quot;Vertex index &quot;</span> + std::to_string(i_vertex) + <span class="stringliteral">&quot; not in range [0, &quot;</span> + std::to_string(i_vertex) + <span class="stringliteral">&quot;).&quot;</span>);</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <span class="keywordflow">return</span> {<a class="code" href="class_disa_1_1_adjacency___graph.html#ada1d193b23e67a018ee5987607f93eb9">vertex_adjacent_list</a>.begin() + <span class="keyword">static_cast&lt;</span><a class="code" href="namespace_disa.html#a0ba6342ec1af226ef99781cde1070757">s_size_t</a><span class="keyword">&gt;</span>(<a class="code" href="class_disa_1_1_adjacency___graph.html#a42a9ca141195563377732b946682cd7d">offset</a>[i_vertex]),</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <span class="keywordflow">return</span> {<a class="code" href="class_disa_1_1_adjacency___graph.html#ada1d193b23e67a018ee5987607f93eb9">vertex_adjacent_list</a>.begin() + <span class="keyword">static_cast&lt;</span><a class="code" href="namespace_disa.html#a292ef5870b9a88a0657959d670390c41">s_size_t</a><span class="keyword">&gt;</span>(<a class="code" href="class_disa_1_1_adjacency___graph.html#a42a9ca141195563377732b946682cd7d">offset</a>[i_vertex]),</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; <a class="code" href="class_disa_1_1_adjacency___graph.html#a42a9ca141195563377732b946682cd7d">offset</a>[i_vertex + 1] - <a class="code" href="class_disa_1_1_adjacency___graph.html#a42a9ca141195563377732b946682cd7d">offset</a>[i_vertex]};</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; }</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; </div>
Expand Down Expand Up @@ -275,8 +275,8 @@
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>&#160; </div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>&#160; [[nodiscard]] <span class="keyword">inline</span> std::pair&lt;std::vector&lt;std::size_t&gt;::iterator, std::vector&lt;std::size_t&gt;::iterator&gt;</div>
<div class="line"><a name="l00345"></a><span class="lineno"><a class="line" href="class_disa_1_1_adjacency___graph.html#ac24b67143fc80b11153ae39bcaed50ce"> 345</a></span>&#160; <a class="code" href="class_disa_1_1_adjacency___graph.html#ac24b67143fc80b11153ae39bcaed50ce">vertex_adjacency_iter</a>(<span class="keyword">const</span> std::size_t&amp; i_vertex) {</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>&#160; <span class="keywordflow">return</span> std::make_pair(std::next(<a class="code" href="class_disa_1_1_adjacency___graph.html#ada1d193b23e67a018ee5987607f93eb9">vertex_adjacent_list</a>.begin(), <span class="keyword">static_cast&lt;</span><a class="code" href="namespace_disa.html#a0ba6342ec1af226ef99781cde1070757">s_size_t</a><span class="keyword">&gt;</span>(<a class="code" href="class_disa_1_1_adjacency___graph.html#a42a9ca141195563377732b946682cd7d">offset</a>[i_vertex])),</div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>&#160; std::next(<a class="code" href="class_disa_1_1_adjacency___graph.html#ada1d193b23e67a018ee5987607f93eb9">vertex_adjacent_list</a>.begin(), <span class="keyword">static_cast&lt;</span><a class="code" href="namespace_disa.html#a0ba6342ec1af226ef99781cde1070757">s_size_t</a><span class="keyword">&gt;</span>(<a class="code" href="class_disa_1_1_adjacency___graph.html#a42a9ca141195563377732b946682cd7d">offset</a>[i_vertex + 1])));</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>&#160; <span class="keywordflow">return</span> std::make_pair(std::next(<a class="code" href="class_disa_1_1_adjacency___graph.html#ada1d193b23e67a018ee5987607f93eb9">vertex_adjacent_list</a>.begin(), <span class="keyword">static_cast&lt;</span><a class="code" href="namespace_disa.html#a292ef5870b9a88a0657959d670390c41">s_size_t</a><span class="keyword">&gt;</span>(<a class="code" href="class_disa_1_1_adjacency___graph.html#a42a9ca141195563377732b946682cd7d">offset</a>[i_vertex])),</div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>&#160; std::next(<a class="code" href="class_disa_1_1_adjacency___graph.html#ada1d193b23e67a018ee5987607f93eb9">vertex_adjacent_list</a>.begin(), <span class="keyword">static_cast&lt;</span><a class="code" href="namespace_disa.html#a292ef5870b9a88a0657959d670390c41">s_size_t</a><span class="keyword">&gt;</span>(<a class="code" href="class_disa_1_1_adjacency___graph.html#a42a9ca141195563377732b946682cd7d">offset</a>[i_vertex + 1])));</div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>&#160; }</div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>&#160; </div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>&#160; <span class="keywordtype">void</span> <a class="code" href="class_disa_1_1_adjacency___graph.html#a719e65b36024dab62f4a5e05293721e6">insert_vertex_adjacent_list</a>(std::size_t vertex, std::size_t insert_vertex);</div>
Expand Down Expand Up @@ -347,7 +347,7 @@
<div class="ttc" id="amacros_8h_html_aa06eedd6f738a415870e97a375337d51"><div class="ttname"><a href="macros_8h.html#aa06eedd6f738a415870e97a375337d51">ASSERT</a></div><div class="ttdeci">#define ASSERT(condition, message)</div><div class="ttdoc">Checks for a true condition, if not, writes an error message to screen and exits the program.</div><div class="ttdef"><b>Definition:</b> macros.h:106</div></div>
<div class="ttc" id="amacros_8h_html_aa43468426b5b5a5e19a1f40f8118a6b3"><div class="ttname"><a href="macros_8h.html#aa43468426b5b5a5e19a1f40f8118a6b3">ASSERT_DEBUG</a></div><div class="ttdeci">#define ASSERT_DEBUG(condition, exception)</div><div class="ttdef"><b>Definition:</b> macros.h:116</div></div>
<div class="ttc" id="anamespace_disa_html"><div class="ttname"><a href="namespace_disa.html">Disa</a></div><div class="ttdef"><b>Definition:</b> macros.h:31</div></div>
<div class="ttc" id="anamespace_disa_html_a0ba6342ec1af226ef99781cde1070757"><div class="ttname"><a href="namespace_disa.html#a0ba6342ec1af226ef99781cde1070757">Disa::s_size_t</a></div><div class="ttdeci">std::make_signed&lt; std::size_t &gt;::type s_size_t</div><div class="ttdoc">Signed type for size type, used for conversion.</div><div class="ttdef"><b>Definition:</b> macros.h:123</div></div>
<div class="ttc" id="anamespace_disa_html_a292ef5870b9a88a0657959d670390c41"><div class="ttname"><a href="namespace_disa.html#a292ef5870b9a88a0657959d670390c41">Disa::s_size_t</a></div><div class="ttdeci">std::make_signed&lt; std::size_t &gt;::type s_size_t</div><div class="ttdoc">Used for static casting where needed, and to prevent compile warnings (if you are using a signed type...</div><div class="ttdef"><b>Definition:</b> macros.h:123</div></div>
<div class="ttc" id="anamespace_disa_html_a5d0458dbd92d3cbd94eddeb318b6d88f"><div class="ttname"><a href="namespace_disa.html#a5d0458dbd92d3cbd94eddeb318b6d88f">Disa::Edge</a></div><div class="ttdeci">std::pair&lt; std::size_t, std::size_t &gt; Edge</div><div class="ttdef"><b>Definition:</b> edge.h:35</div></div>
<div class="ttc" id="anamespace_disa_html_abc9ac18476d94a7fb07a8ccbcd276327"><div class="ttname"><a href="namespace_disa.html#abc9ac18476d94a7fb07a8ccbcd276327">Disa::operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;stream, Matrix_Sparse &amp;matrix)</div><div class="ttdoc">Output shift operator - to write to console.</div><div class="ttdef"><b>Definition:</b> matrix_sparse.h:1159</div></div>
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="namespacestd.html">std</a></div><div class="ttdef"><b>Definition:</b> adjacency_graph.h:382</div></div>
Expand Down
Loading

0 comments on commit 5fc7c73

Please sign in to comment.