/usr/share/doc/libdune-typetree-doc/doxygen/a00017_source.html is in libdune-typetree-doc 2.5.0-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 | <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.12"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>dune-typetree: childextraction.hh Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">dune-typetree
 <span id="projectnumber">2.5.0</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.12 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('',false,false,'search.php','Search');
});
</script>
<div id="main-nav"></div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_5e69be5995c9f5d42bf491ae6f29600e.html">dune</a></li><li class="navelem"><a class="el" href="dir_5e74c06688912037f4b476b8dc05fab9.html">typetree</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">childextraction.hh</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00017.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// -*- tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// vi: set et ts=8 sw=2 sts=2:</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> </div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="preprocessor">#ifndef DUNE_TYPETREE_CHILDEXTRACTION_HH</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="preprocessor">#define DUNE_TYPETREE_CHILDEXTRACTION_HH</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> </div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#include <utility></span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> </div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#include <dune/common/concept.hh></span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include <dune/common/documentation.hh></span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#include <dune/common/typetraits.hh></span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include <dune/common/shared_ptr.hh></span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include <<a class="code" href="a00041.html">dune/typetree/nodeinterface.hh</a>></span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include <<a class="code" href="a00074.html">dune/typetree/treepath.hh</a>></span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="keyword">namespace </span><a class="code" href="a00096.html">Dune</a> {</div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  <span class="keyword">namespace </span>TypeTree {</div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#ifndef DOXYGEN</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keyword">namespace </span>impl {</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="comment">// ********************************************************************************</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="comment">// end of the recursion, there are no child indices, so just return the node itself</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="comment">// ********************************************************************************</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> </div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keyword">struct </span>IsPointerLike {</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">template</span> <<span class="keyword">class</span> Node></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keyword">auto</span> require(<span class="keyword">const</span> Node& node) -> decltype(*node);</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  };</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keyword">auto</span> <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(Node&& node) -> decltype(std::forward<Node>(node))</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  {</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">return</span> std::forward<Node>(node);</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  }</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// for now, this wants the passed-in object to be pointer-like. I don't know how clever</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// that is in the long run, though.</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, <span class="keyword">typename</span> std::enable_if_t<Dune::models<IsPo<span class="keywordtype">int</span>erLike,Node>(),<span class="keywordtype">int</span>> = 0></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">auto</span> <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">childStorage</a>(Node&& node)</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  {</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">return</span> std::forward<Node>(node);</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  }</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="comment">// ********************************************************************************</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// next index is a compile-time constant</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// ********************************************************************************</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> </div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// we need a concept to make sure that the node has a templated child()</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// method</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">struct </span>HasTemplateChildMethod {</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">template</span> <<span class="keyword">class</span> Node></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">auto</span> require(<span class="keyword">const</span> Node& node) -> decltype(node.template child<0>());</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  };</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// The actual implementation is rather simple, we just use an overload that requires the first index</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// to be an index_constant, get the child and then recurse.</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">// It only gets ugly due to the enable_if, but without that trick, the error messages for the user</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="comment">// can get *very* obscure (they are bad enough as it is).</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, std::size_t i, <span class="keyword">typename</span>... J,</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">typename</span> std::enable_if<</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  Dune::models<HasTemplateChildMethod, Node>() &&</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  (i < StaticDegree<Node>::value), <span class="keywordtype">int</span>>::type = 0></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  decltype(<span class="keyword">auto</span>) <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(Node&& node, index_constant<i>, J... j)</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  {</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">return</span> <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(std::forward<Node>(node).<span class="keyword">template</span> child<i>(),j...);</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  }</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, std::size_t i, <span class="keyword">typename</span>... J,</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">typename</span> std::enable_if<</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  Dune::models<HasTemplateChildMethod, decltype(*std::declval<std::decay_t<Node>>())>() &&</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  (i < <a class="code" href="a00092.html#gabe5026d7d5d93af5419de874c33d93db">StaticDegree</a><decltype(*std::declval<Node>())>::value), <span class="keywordtype">int</span>>::type = 0></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  decltype(<span class="keyword">auto</span>) <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">childStorage</a>(Node&& node, index_constant<i>, J... j)</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  {</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">return</span> <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">childStorage</a>(std::forward<Node>(node)-><span class="keyword">template</span> childStorage<i>(),j...);</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// This overload is only present to give useful compiler</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// error messages via static_assert in case the other overloads</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// fail.</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, std::size_t i, <span class="keyword">typename</span>... J,</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">typename</span> std::enable_if<</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  (!Dune::models<HasTemplateChildMethod, Node>()) ||</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  (i >= StaticDegree<Node>::value), <span class="keywordtype">int</span>>::type = 0></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordtype">void</span> <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(Node&& node, index_constant<i>, J... j)</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  {</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  static_assert(Dune::models<HasTemplateChildMethod, Node>(), <span class="stringliteral">"Node does not have a template method child()"</span>);</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  static_assert(i < StaticDegree<Node>::value, <span class="stringliteral">"Child index out of range"</span>);</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// ********************************************************************************</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// next index is a run-time value</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// ********************************************************************************</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> </div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// The actual implemention here overloads on std::size_t. It is a little less ugly because it currently</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// has a hard requirement on the PowerNode Tag (although only using is_convertible, as tags can be</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// inherited (important!).</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, <span class="keyword">typename</span>... J></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  decltype(<span class="keyword">auto</span>)</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  Node&& node,</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <a class="code" href="a00095.html">std</a>::enable_if_t<</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <a class="code" href="a00095.html">std</a>::is_convertible<</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <a class="code" href="a00092.html#ga69a1959f7e199cc23ff490487dc683b9">NodeTag</a><Node>,</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  PowerNodeTag</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  >{},</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  std::size_t> i,</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  J... j</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  )</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  {</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">return</span> <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(std::forward<Node>(node).<a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(i),j...);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, <span class="keyword">typename</span>... J></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  decltype(<span class="keyword">auto</span>)</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">childStorage</a>(</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  Node&& node,</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <a class="code" href="a00095.html">std</a>::enable_if_t<</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <a class="code" href="a00095.html">std</a>::is_convertible<</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <a class="code" href="a00092.html#ga69a1959f7e199cc23ff490487dc683b9">NodeTag</a><decltype(*<a class="code" href="a00095.html">std</a>::declval<Node>())>,</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  PowerNodeTag</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  >{},</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  std::size_t> i,</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  J... j</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  )</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  {</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">return</span> <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">childStorage</a>(std::forward<Node>(node)-><a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">childStorage</a>(i),j...);</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> </div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, <span class="keyword">typename</span>... Indices, std::size_t... i></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  decltype(<span class="keyword">auto</span>) <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(Node&& node, HybridTreePath<Indices...> tp, <a class="code" href="a00095.html">std</a>::index_sequence<i...>)</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  {</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">return</span> <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(std::forward<Node>(node),treePathEntry<i>(tp)...);</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  }</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, <span class="keyword">typename</span>... Indices, std::size_t... i></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  decltype(<span class="keyword">auto</span>) <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">childStorage</a>(Node&& node, HybridTreePath<Indices...> tp, <a class="code" href="a00095.html">std</a>::index_sequence<i...>)</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  {</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">return</span> <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">childStorage</a>(std::forward<Node>(node),treePathEntry<i>(tp)...);</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  } <span class="comment">// namespace imp</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="preprocessor">#endif // DOXYGEN</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> </div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> </div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, <span class="keyword">typename</span>... Indices></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="preprocessor">#ifdef DOXYGEN</span></div><div class="line"><a name="l00179"></a><span class="lineno"><a class="line" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b"> 179</a></span>  ImplementationDefined <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(Node&& node, Indices... indices)</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  decltype(<span class="keyword">auto</span>) <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(Node&& node, Indices... indices)</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  {</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">return</span> <a class="code" href="a00091.html#gae4133f4dba113143455fcab49d8a103e">impl::child</a>(std::forward<Node>(node),indices...);</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  }</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> </div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, <span class="keyword">typename</span>... Indices></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="preprocessor">#ifdef DOXYGEN</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  ImplementationDefined <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(Node&& node, Indices... indices)</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keyword">auto</span> <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">childStorage</a>(Node&& node, Indices... indices)</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  {</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="comment">//static_assert(sizeof...(Indices) > 0, "childStorage() cannot be called with an empty list of child indices");</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">return</span> <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">impl::childStorage</a>(&node,indices...);</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  }</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, std::size_t... Indices></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="preprocessor">#ifdef DOXYGEN</span></div><div class="line"><a name="l00219"></a><span class="lineno"><a class="line" href="a00091.html#gaed62da60cd0a4a33bb2fa54ad89de410"> 219</a></span>  ImplementationDefined <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(Node&& node, <a class="code" href="a01060.html">TreePath<Indices...></a> treePath)</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  decltype(<span class="keyword">auto</span>) <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(Node&& node, <a class="code" href="a01060.html">TreePath</a><Indices...>)</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  {</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">return</span> <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(std::forward<Node>(node),index_constant<Indices>{}...);</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, std::size_t... Indices></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="preprocessor">#ifdef DOXYGEN</span></div><div class="line"><a name="l00229"></a><span class="lineno"><a class="line" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d"> 229</a></span>  ImplementationDefined <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">childStorage</a>(Node&& node, <a class="code" href="a01060.html">TreePath<Indices...></a> treePath)</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keyword">auto</span> <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">childStorage</a>(Node&& node, <a class="code" href="a01060.html">TreePath<Indices...></a>)</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  {</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  static_assert(<span class="keyword">sizeof</span>...(Indices) > 0, <span class="stringliteral">"childStorage() cannot be called with an empty TreePath"</span>);</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">return</span> <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">impl::childStorage</a>(&node,index_constant<Indices>{}...);</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> </div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, <span class="keyword">typename</span>... Indices></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="preprocessor">#ifdef DOXYGEN</span></div><div class="line"><a name="l00264"></a><span class="lineno"><a class="line" href="a00091.html#gae4133f4dba113143455fcab49d8a103e"> 264</a></span>  ImplementationDefined <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(Node&& node, <a class="code" href="a01140.html">HybridTreePath<Indices...></a> treePath)</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  decltype(<span class="keyword">auto</span>) <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(Node&& node, <a class="code" href="a01140.html">HybridTreePath</a><Indices...> tp)</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  {</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">return</span> <a class="code" href="a00091.html#gae4133f4dba113143455fcab49d8a103e">impl::child</a>(std::forward<Node>(node),tp,std::index_sequence_for<Indices...>{});</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> </div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, <span class="keyword">typename</span>... Indices></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="preprocessor">#ifdef DOXYGEN</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  ImplementationDefined <a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">child</a>(Node&& node, <a class="code" href="a01140.html">HybridTreePath<Indices...></a> treePath)</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">auto</span> <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">childStorage</a>(Node&& node, <a class="code" href="a01140.html">HybridTreePath<Indices...></a> tp)</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  {</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  static_assert(<span class="keyword">sizeof</span>...(Indices) > 0, <span class="stringliteral">"childStorage() cannot be called with an empty TreePath"</span>);</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">return</span> <a class="code" href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">impl::childStorage</a>(&node,tp,std::index_sequence_for<Indices...>{});</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> </div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="preprocessor">#ifndef DOXYGEN</span></div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keyword">namespace </span>impl {</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, std::size_t... indices></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keyword">struct </span>_Child</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  {</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">using</span> type = std::decay_t<decltype(child(std::declval<Node>(),index_constant<indices>{}...))>;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  };</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> </div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  }</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> </div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="preprocessor">#endif // DOXYGEN</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> </div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> </div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, std::size_t... indices></div><div class="line"><a name="l00307"></a><span class="lineno"><a class="line" href="a00091.html#ga8136d392450f4308b90a04a143e20feb"> 307</a></span>  <span class="keyword">using</span> <a class="code" href="a00091.html#ga8136d392450f4308b90a04a143e20feb">Child</a> = <span class="keyword">typename</span> impl::_Child<Node,indices...>::type;</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> </div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="preprocessor">#ifndef DOXYGEN</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> </div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keyword">namespace </span>impl {</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> </div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, <span class="keyword">typename</span> TreePath></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keyword">struct </span>_ChildForTreePath</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  {</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keyword">using</span> type = <span class="keyword">typename</span> std::decay<decltype(child(std::declval<Node>(),std::declval<TreePath>()))>::type;</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  };</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> </div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  }</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> </div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="preprocessor">#endif // DOXYGEN</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> </div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node, <span class="keyword">typename</span> TreePath></div><div class="line"><a name="l00334"></a><span class="lineno"><a class="line" href="a00091.html#gac7126c2c9df855877ce3e71c77738398"> 334</a></span>  <span class="keyword">using</span> <a class="code" href="a00091.html#gac7126c2c9df855877ce3e71c77738398">ChildForTreePath</a> = <span class="keyword">typename</span> impl::_ChildForTreePath<Node,TreePath>::type;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> </div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="preprocessor">#ifndef DOXYGEN</span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keyword">namespace </span>impl {</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">// By default, types are flat indices if they are integral</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keyword">template</span><<span class="keyword">typename</span> T></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keyword">struct </span>_is_flat_index</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  {</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keyword">using</span> type = std::is_integral<T>;</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  };</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// And so is any index_constant</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">template</span><std::<span class="keywordtype">size_t</span> i></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keyword">struct </span>_is_flat_index<index_constant<i>></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  {</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keyword">using</span> type = std::true_type;</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  };</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> </div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  }</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> </div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="preprocessor">#endif // DOXYGEN</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> </div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="comment">/*</span></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="comment"> * This type trait can be used to check whether T is a flat index (i.e. either `std::size_t`</span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="comment"> * or `index_constant`). The type trait normalizes T before doing the check, so it will also</span></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span> <span class="comment"> * work correctly for references and cv-qualified types.</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="comment"> */</span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keyword">template</span><<span class="keyword">typename</span> T></div><div class="line"><a name="l00366"></a><span class="lineno"><a class="line" href="a00091.html#ga5b53c408df3b712e78d6a4f072ed5507"> 366</a></span>  <span class="keyword">using</span> <a class="code" href="a00091.html#ga5b53c408df3b712e78d6a4f072ed5507">is_flat_index</a> = <span class="keyword">typename</span> impl::_is_flat_index<std::decay_t<T>>::type;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> </div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="preprocessor">#ifndef DOXYGEN</span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> </div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keyword">namespace </span>impl {</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="comment">// helper struct to perform lazy return type evaluation in the forwarding member child() methods</span></div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="comment">// of nodes</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Node></div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">struct </span>_lazy_member_child_decltype</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  {</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... Indices></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keyword">struct </span>evaluate</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  {</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keyword">using</span> type = decltype(<a class="code" href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">Dune::TypeTree::child</a>(std::declval<Node>(),std::declval<Indices>()...));</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  };</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  };</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> </div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="comment">// helper function for check in member child() functions that tolerates being passed something that</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">// isn't a TreePath. It will just return 0 in that case</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> </div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keyword">template</span><<span class="keyword">typename</span> T></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  constexpr <span class="keyword">typename</span> std::enable_if<</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <a class="code" href="a00091.html#ga5b53c408df3b712e78d6a4f072ed5507">is_flat_index<T></a>{},</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  >::type</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  _non_empty_tree_path(T)</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  {</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  }</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> </div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keyword">template</span><<span class="keyword">typename</span> T></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  constexpr <span class="keyword">typename</span> std::enable_if<</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  !<a class="code" href="a00091.html#ga5b53c408df3b712e78d6a4f072ed5507">is_flat_index<T></a>{},</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  >::type</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  _non_empty_tree_path(T t)</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  {</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">return</span> <a class="code" href="a00093.html#ga59ec4100d33c07cf0dfa0f4f96ab5ee4">treePathSize</a>(t) > 0;</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  }</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> </div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  }</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> </div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="preprocessor">#endif // DOXYGEN</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> </div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> </div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  } <span class="comment">// namespace TypeTree</span></div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> } <span class="comment">//namespace Dune</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> </div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="preprocessor">#endif // DUNE_TYPETREE_CHILDEXTRACTION_HH</span></div><div class="ttc" id="a00091_html_gab8f2fef526363564e7bbe91daad49b9b"><div class="ttname"><a href="a00091.html#gab8f2fef526363564e7bbe91daad49b9b">Dune::TypeTree::child</a></div><div class="ttdeci">ImplementationDefined child(Node &&node, Indices... indices)</div><div class="ttdoc">Extracts the child of a node given by a sequence of compile-time and run-time indices. </div><div class="ttdef"><b>Definition:</b> childextraction.hh:179</div></div>
<div class="ttc" id="a00091_html_ga8136d392450f4308b90a04a143e20feb"><div class="ttname"><a href="a00091.html#ga8136d392450f4308b90a04a143e20feb">Dune::TypeTree::Child</a></div><div class="ttdeci">typename impl::_Child< Node, indices... >::type Child</div><div class="ttdoc">Template alias for the type of a child node given by a list of child indices. </div><div class="ttdef"><b>Definition:</b> childextraction.hh:307</div></div>
<div class="ttc" id="a00091_html_ga1f16d292f21ec89d59ae706a8b0b886d"><div class="ttname"><a href="a00091.html#ga1f16d292f21ec89d59ae706a8b0b886d">Dune::TypeTree::childStorage</a></div><div class="ttdeci">ImplementationDefined childStorage(Node &&node, TreePath< Indices... > treePath)</div><div class="ttdef"><b>Definition:</b> childextraction.hh:229</div></div>
<div class="ttc" id="a00096_html"><div class="ttname"><a href="a00096.html">Dune</a></div><div class="ttdef"><b>Definition:</b> accumulate_static.hh:13</div></div>
<div class="ttc" id="a00093_html_ga59ec4100d33c07cf0dfa0f4f96ab5ee4"><div class="ttname"><a href="a00093.html#ga59ec4100d33c07cf0dfa0f4f96ab5ee4">Dune::TypeTree::treePathSize</a></div><div class="ttdeci">constexpr std::size_t treePathSize(const TreePath< i... > &)</div><div class="ttdoc">Returns the size (number of components) of the given TreePath. </div><div class="ttdef"><b>Definition:</b> treepath.hh:51</div></div>
<div class="ttc" id="a00091_html_ga5b53c408df3b712e78d6a4f072ed5507"><div class="ttname"><a href="a00091.html#ga5b53c408df3b712e78d6a4f072ed5507">Dune::TypeTree::is_flat_index</a></div><div class="ttdeci">typename impl::_is_flat_index< std::decay_t< T >>::type is_flat_index</div><div class="ttdoc">Type trait that determines whether T is a flat index in the context of child extraction. </div><div class="ttdef"><b>Definition:</b> childextraction.hh:366</div></div>
<div class="ttc" id="a00041_html"><div class="ttname"><a href="a00041.html">nodeinterface.hh</a></div></div>
<div class="ttc" id="a00095_html"><div class="ttname"><a href="a00095.html">std</a></div><div class="ttdoc">STL namespace. </div></div>
<div class="ttc" id="a00091_html_gac7126c2c9df855877ce3e71c77738398"><div class="ttname"><a href="a00091.html#gac7126c2c9df855877ce3e71c77738398">Dune::TypeTree::ChildForTreePath</a></div><div class="ttdeci">typename impl::_ChildForTreePath< Node, TreePath >::type ChildForTreePath</div><div class="ttdoc">Template alias for the type of a child node given by a TreePath or a HybridTreePath type...</div><div class="ttdef"><b>Definition:</b> childextraction.hh:334</div></div>
<div class="ttc" id="a00074_html"><div class="ttname"><a href="a00074.html">treepath.hh</a></div></div>
<div class="ttc" id="a00092_html_gabe5026d7d5d93af5419de874c33d93db"><div class="ttname"><a href="a00092.html#gabe5026d7d5d93af5419de874c33d93db">Dune::TypeTree::StaticDegree</a></div><div class="ttdeci">std::integral_constant< std::size_t, degree(static_cast< std::decay_t< Node > * >(nullptr), NodeTag< std::decay_t< Node >>()) > StaticDegree</div><div class="ttdoc">Returns the statically known degree of the given Node type as a std::integral_constant. </div><div class="ttdef"><b>Definition:</b> nodeinterface.hh:105</div></div>
<div class="ttc" id="a01140_html"><div class="ttname"><a href="a01140.html">Dune::TypeTree::HybridTreePath</a></div><div class="ttdoc">A hybrid version of TreePath that supports both compile time and run time indices. </div><div class="ttdef"><b>Definition:</b> treepath.hh:322</div></div>
<div class="ttc" id="a01060_html"><div class="ttname"><a href="a01060.html">Dune::TypeTree::TreePath</a></div><div class="ttdef"><b>Definition:</b> treepath.hh:30</div></div>
<div class="ttc" id="a00092_html_ga69a1959f7e199cc23ff490487dc683b9"><div class="ttname"><a href="a00092.html#ga69a1959f7e199cc23ff490487dc683b9">Dune::TypeTree::NodeTag</a></div><div class="ttdeci">typename std::decay_t< Node >::NodeTag NodeTag</div><div class="ttdoc">Returns the node tag of the given Node. </div><div class="ttdef"><b>Definition:</b> nodeinterface.hh:62</div></div>
<div class="ttc" id="a00091_html_gae4133f4dba113143455fcab49d8a103e"><div class="ttname"><a href="a00091.html#gae4133f4dba113143455fcab49d8a103e">Dune::TypeTree::child</a></div><div class="ttdeci">ImplementationDefined child(Node &&node, HybridTreePath< Indices... > treePath)</div><div class="ttdoc">Extracts the child of a node given by a HybridTreePath object. </div><div class="ttdef"><b>Definition:</b> childextraction.hh:264</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.12
</small></address>
</body>
</html>
|