ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-11-21 03:26:01 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
2709cd752f3078815b2988d264bb2d84fac07db5
rippled/SHAMapInnerNode_8cpp_source.html
manojsdoshi 2709cd752f deploy: 7bd5d51e4e
2021-06-04 17:39:30 +00:00

592 lines
107 KiB
HTML
Raw Blame History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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.17"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>rippled: SHAMapInnerNode.cpp 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="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.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">rippled
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.17 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_df9c78dcf3f59a33b12284f95992a64b.html">ripple</a></li><li class="navelem"><a class="el" href="dir_380eda8174f5eb060d37b8b034a94866.html">shamap</a></li><li class="navelem"><a class="el" href="dir_105cccbbf432365df53e381b580b4a54.html">impl</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">SHAMapInnerNode.cpp</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">//------------------------------------------------------------------------------</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="comment"> This file is part of rippled: https://github.com/ripple/rippled</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160;<span class="comment"> Copyright (c) 2012, 2013 Ripple Labs Inc.</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="comment"> Permission to use, copy, modify, and/or distribute this software for any</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="comment"> purpose with or without fee is hereby granted, provided that the above</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<span class="comment"> copyright notice and this permission notice appear in all copies.</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<span class="comment"> THE SOFTWARE IS PROVIDED &quot;AS IS&quot; AND THE AUTHOR DISCLAIMS ALL WARRANTIES</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160;<span class="comment"> WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span>&#160;<span class="comment"> MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;<span class="comment"> ANY SPECIAL , DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="comment"> WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="comment"> ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="comment"> OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="comment">*/</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="comment">//==============================================================================</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160; </div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="preprocessor">#include &lt;ripple/shamap/SHAMapInnerNode.h&gt;</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160; </div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="preprocessor">#include &lt;ripple/basics/ByteUtilities.h&gt;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="preprocessor">#include &lt;ripple/basics/Log.h&gt;</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="preprocessor">#include &lt;ripple/basics/Slice.h&gt;</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="preprocessor">#include &lt;ripple/basics/contract.h&gt;</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;<span class="preprocessor">#include &lt;ripple/basics/safe_cast.h&gt;</span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160;<span class="preprocessor">#include &lt;ripple/beast/core/LexicalCast.h&gt;</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160;<span class="preprocessor">#include &lt;ripple/protocol/HashPrefix.h&gt;</span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160;<span class="preprocessor">#include &lt;ripple/protocol/digest.h&gt;</span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160;<span class="preprocessor">#include &lt;ripple/shamap/SHAMapTreeNode.h&gt;</span></div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160;<span class="preprocessor">#include &lt;ripple/shamap/impl/TaggedPointer.ipp&gt;</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; </div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160;<span class="preprocessor">#include &lt;openssl/sha.h&gt;</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; </div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160;<span class="preprocessor">#include &lt;<a class="codeRef" href="http://en.cppreference.com/w/cpp/header/algorithm.html">algorithm</a>&gt;</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160;<span class="preprocessor">#include &lt;<a class="codeRef" href="http://en.cppreference.com/w/cpp/header/array.html">array</a>&gt;</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160;<span class="preprocessor">#include &lt;<a class="codeRef" href="http://en.cppreference.com/w/cpp/header/iterator.html">iterator</a>&gt;</span></div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160;<span class="preprocessor">#include &lt;<a class="codeRef" href="http://en.cppreference.com/w/cpp/header/mutex.html">mutex</a>&gt;</span></div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160;<span class="preprocessor">#include &lt;<a class="codeRef" href="http://en.cppreference.com/w/cpp/header/utility.html">utility</a>&gt;</span></div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; </div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespaceripple.html">ripple</a> {</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; </div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160;<a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/mutex.html">std::mutex</a> <a class="code" href="classripple_1_1SHAMapInnerNode.html#ade4fdfad9804690e890a095c9e0cc089">SHAMapInnerNode::childLock</a>;</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; </div>
<div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a2cf4d1f797c61c9e2bb458b7b14056b6"> 45</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a2cf4d1f797c61c9e2bb458b7b14056b6">SHAMapInnerNode::SHAMapInnerNode</a>(</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> cowid,</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint8_t</a> numAllocatedChildren)</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; : <a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>(cowid), hashesAndChildren_(numAllocatedChildren)</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160;{</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160;}</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; </div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#aa36ffe7811690d0c57b52c792a634dee">SHAMapInnerNode::~SHAMapInnerNode</a>() = <span class="keywordflow">default</span>;</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; </div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a636a12a32e96bbd6a7d32e580a55fd4f"> 56</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a636a12a32e96bbd6a7d32e580a55fd4f">SHAMapInnerNode::iterChildren</a>(F&amp;&amp; f)<span class="keyword"> const</span></div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#ac549f5187a2f29c8fb65a5a399cce913">iterChildren</a>(<a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a>, std::forward&lt;F&gt;(f));</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160;}</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; </div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> F&gt;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a5c356c106a60a7f75bff902bd04cb505"> 63</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a5c356c106a60a7f75bff902bd04cb505">SHAMapInnerNode::iterNonEmptyChildIndexes</a>(F&amp;&amp; f)<span class="keyword"> const</span></div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a00d143272df241cef3ff904d3291652b">iterNonEmptyChildIndexes</a>(<a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a>, std::forward&lt;F&gt;(f));</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160;}</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; </div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a64c8817ea46bb682a9d354590cd11449"> 69</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a64c8817ea46bb682a9d354590cd11449">SHAMapInnerNode::resizeChildArrays</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint8_t</a> toAllocate)</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160;{</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a> =</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; <a class="code" href="classripple_1_1TaggedPointer.html">TaggedPointer</a>(std::move(<a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>), <a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a>, toAllocate);</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160;}</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; </div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160;<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/optional.html">std::optional&lt;int&gt;</a></div>
<div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a25aac316c799590fec7f818d5b5584b5"> 76</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a25aac316c799590fec7f818d5b5584b5">SHAMapInnerNode::getChildIndex</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const</span></div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; <span class="keywordflow">return</span> <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a38d6dfe0e6c5c842ef8886ac59d6f722">getChildIndex</a>(<a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a>, i);</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160;}</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; </div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160;<a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a></div>
<div class="line"><a name="l00082"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a3a2d1da1093314594a2e1c5e0bcd13af"> 82</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a3a2d1da1093314594a2e1c5e0bcd13af">SHAMapInnerNode::clone</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> cowid)<span class="keyword"> const</span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span> branchCount = <a class="code" href="classripple_1_1SHAMapInnerNode.html#aec522cbc8cfb50ed87ebf8c634a40276">getBranchCount</a>();</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span> thisIsSparse = !<a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#ae529fdc057df9e07c40b488d45855b19">isDense</a>();</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <span class="keyword">auto</span> p = std::make_shared&lt;SHAMapInnerNode&gt;(<a class="code" href="group__SHAMap.html#gac9adec7146a8bea60fe6acf6c1ed98d1">cowid</a>, branchCount);</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; p-&gt;hash_ = <a class="code" href="classripple_1_1SHAMapTreeNode.html#a705bca4eb622097a917a3cac5c3a013d">hash_</a>;</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; p-&gt;isBranch_ = <a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a>;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; p-&gt;fullBelowGen_ = <a class="code" href="classripple_1_1SHAMapInnerNode.html#a07f4125beab496a2b812ce3f3c43f31e">fullBelowGen_</a>;</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; <a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> *cloneHashes, *thisHashes;</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a>*cloneChildren, *thisChildren;</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <span class="comment">// structured bindings can&#39;t be captured in c++ 17; use tie instead</span></div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(std::ignore, cloneHashes, cloneChildren) =</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; p-&gt;hashesAndChildren_.getHashesAndChildren();</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(std::ignore, thisHashes, thisChildren) =</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a41f33a7472b07de90ec241770e60e114">getHashesAndChildren</a>();</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; </div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; <span class="keywordflow">if</span> (thisIsSparse)</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; {</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; <span class="keywordtype">int</span> cloneChildIndex = 0;</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a5c356c106a60a7f75bff902bd04cb505">iterNonEmptyChildIndexes</a>([&amp;](<span class="keyword">auto</span> branchNum, <span class="keyword">auto</span> indexNum) {</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; cloneHashes[cloneChildIndex++] = thisHashes[indexNum];</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; });</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; }</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; {</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a5c356c106a60a7f75bff902bd04cb505">iterNonEmptyChildIndexes</a>([&amp;](<span class="keyword">auto</span> branchNum, <span class="keyword">auto</span> indexNum) {</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; cloneHashes[branchNum] = thisHashes[indexNum];</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; });</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; }</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/lock_guard.html">std::lock_guard</a> lock(<a class="code" href="classripple_1_1SHAMapInnerNode.html#ade4fdfad9804690e890a095c9e0cc089">childLock</a>);</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <span class="keywordflow">if</span> (thisIsSparse)</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; {</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; <span class="keywordtype">int</span> cloneChildIndex = 0;</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a5c356c106a60a7f75bff902bd04cb505">iterNonEmptyChildIndexes</a>([&amp;](<span class="keyword">auto</span> branchNum, <span class="keyword">auto</span> indexNum) {</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; cloneChildren[cloneChildIndex++] = thisChildren[indexNum];</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; });</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; }</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; {</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a5c356c106a60a7f75bff902bd04cb505">iterNonEmptyChildIndexes</a>([&amp;](<span class="keyword">auto</span> branchNum, <span class="keyword">auto</span> indexNum) {</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; cloneChildren[branchNum] = thisChildren[indexNum];</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; });</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; }</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; <span class="keywordflow">return</span> p;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160;}</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; </div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160;<a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a></div>
<div class="line"><a name="l00130"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#ad1efe48ac7bf6f3b4a10ad9c26573bec"> 130</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#ad1efe48ac7bf6f3b4a10ad9c26573bec">SHAMapInnerNode::makeFullInner</a>(</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; <a class="code" href="classripple_1_1Slice.html">Slice</a> data,</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; <a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; hash,</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; <span class="keywordtype">bool</span> hashValid)</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160;{</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <span class="keywordflow">if</span> (data.size() != 512)</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; Throw&lt;std::runtime_error&gt;(<span class="stringliteral">&quot;Invalid FI node&quot;</span>);</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; <span class="keyword">auto</span> ret = std::make_shared&lt;SHAMapInnerNode&gt;(0, <a class="code" href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">branchFactor</a>);</div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; </div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; <a class="code" href="classripple_1_1Serializer.html">Serializer</a> s(data.data(), data.size());</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; </div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160; <span class="keyword">auto</span> retHashes = ret-&gt;hashesAndChildren_.getHashes();</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">branchFactor</a>; ++i)</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; {</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; s.<a class="code" href="classripple_1_1Serializer.html#a2a89965bbb918a1aee8a34034e4d82f7">getBitString</a>(retHashes[i].as_uint256(), i * 32);</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; </div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; <span class="keywordflow">if</span> (retHashes[i].isNonZero())</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; ret-&gt;isBranch_ |= (1 &lt;&lt; i);</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; }</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; </div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160; ret-&gt;resizeChildArrays(ret-&gt;getBranchCount());</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; </div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; <span class="keywordflow">if</span> (hashValid)</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; ret-&gt;hash_ = hash;</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; ret-&gt;updateHash();</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160;}</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; </div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160;<a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a></div>
<div class="line"><a name="l00161"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a7c00b72186bf55aad286505bb5cedc00"> 161</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a7c00b72186bf55aad286505bb5cedc00">SHAMapInnerNode::makeCompressedInner</a>(<a class="code" href="classripple_1_1Slice.html">Slice</a> data)</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160;{</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; <a class="code" href="classripple_1_1Serializer.html">Serializer</a> s(data.data(), data.size());</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; </div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; <span class="keywordtype">int</span> len = s.<a class="code" href="classripple_1_1Serializer.html#aa5c7aa53db0c7c90c6a86dd5144e9255">getLength</a>();</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; </div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; <span class="keyword">auto</span> ret = std::make_shared&lt;SHAMapInnerNode&gt;(0, <a class="code" href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">branchFactor</a>);</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160; </div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160; <span class="keyword">auto</span> retHashes = ret-&gt;hashesAndChildren_.getHashes();</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; (len / 33); ++i)</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; {</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; <span class="keywordtype">int</span> pos;</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160; </div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160; <span class="keywordflow">if</span> (!s.<a class="code" href="classripple_1_1Serializer.html#a437528ba7c48120f7d6432a9ab39d019">get8</a>(pos, 32 + (i * 33)))</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160; Throw&lt;std::runtime_error&gt;(<span class="stringliteral">&quot;short CI node&quot;</span>);</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; </div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; <span class="keywordflow">if</span> ((pos &lt; 0) || (pos &gt;= <a class="code" href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">branchFactor</a>))</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; Throw&lt;std::runtime_error&gt;(<span class="stringliteral">&quot;invalid CI node&quot;</span>);</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; </div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; s.<a class="code" href="classripple_1_1Serializer.html#a2a89965bbb918a1aee8a34034e4d82f7">getBitString</a>(retHashes[pos].as_uint256(), i * 33);</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; </div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160; <span class="keywordflow">if</span> (retHashes[pos].isNonZero())</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160; ret-&gt;isBranch_ |= (1 &lt;&lt; pos);</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160; }</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>&#160; </div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>&#160; ret-&gt;resizeChildArrays(ret-&gt;getBranchCount());</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; </div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; ret-&gt;updateHash();</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; </div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160;}</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; </div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00194"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a73212411125e46812e0e19f2e307b155"> 194</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a73212411125e46812e0e19f2e307b155">SHAMapInnerNode::updateHash</a>()</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160;{</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; <a class="code" href="classripple_1_1base__uint.html">uint256</a> nh;</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a> != 0)</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; {</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <a class="code" href="structripple_1_1detail_1_1basic__sha512__half__hasher.html">sha512_half_hasher</a> h;</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; <span class="keyword">using</span> <a class="code" href="namespacebeast.html#a4a9eebb8b68941c49b07763d7a95d456">beast::hash_append</a>;</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; <a class="code" href="namespaceripple.html#a9c3a01178261b6e8a98c0ea99f01d154">hash_append</a>(h, <a class="code" href="namespaceripple.html#ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77">HashPrefix::innerNode</a>);</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a636a12a32e96bbd6a7d32e580a55fd4f">iterChildren</a>([&amp;](<a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; hh) { <a class="code" href="namespaceripple.html#a9c3a01178261b6e8a98c0ea99f01d154">hash_append</a>(h, hh); });</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160; nh = <span class="keyword">static_cast&lt;</span>typename <a class="code" href="classripple_1_1base__uint.html">sha512_half_hasher::result_type</a><span class="keyword">&gt;</span>(h);</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; }</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160; <a class="code" href="classripple_1_1SHAMapTreeNode.html#a705bca4eb622097a917a3cac5c3a013d">hash_</a> = <a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a>{nh};</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160;}</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; </div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00209"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#ad83701be0c7a908a61601d1bcbf7ecb1"> 209</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#ad83701be0c7a908a61601d1bcbf7ecb1">SHAMapInnerNode::updateHashDeep</a>()</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160;{</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; <a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a>* hashes;</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a>* children;</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; <span class="comment">// structured bindings can&#39;t be captured in c++ 17; use tie instead</span></div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(std::ignore, hashes, children) =</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a41f33a7472b07de90ec241770e60e114">getHashesAndChildren</a>();</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a5c356c106a60a7f75bff902bd04cb505">iterNonEmptyChildIndexes</a>([&amp;](<span class="keyword">auto</span> branchNum, <span class="keyword">auto</span> indexNum) {</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; <span class="keywordflow">if</span> (children[indexNum] != <span class="keyword">nullptr</span>)</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; hashes[indexNum] = children[indexNum]-&gt;<a class="code" href="classripple_1_1SHAMapTreeNode.html#a454e86c9ed693f8921d53a915d8b1415">getHash</a>();</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160; });</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a73212411125e46812e0e19f2e307b155">updateHash</a>();</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160;}</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160; </div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00224"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#ad0ebb4c9ea3cc41acaf6806a3e43ec91"> 224</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#ad0ebb4c9ea3cc41acaf6806a3e43ec91">SHAMapInnerNode::serializeForWire</a>(<a class="code" href="classripple_1_1Serializer.html">Serializer</a>&amp; s)<span class="keyword"> const</span></div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; assert(!<a class="code" href="classripple_1_1SHAMapInnerNode.html#a13fcdfee8199a8e54429edf6b9085ae0">isEmpty</a>());</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; </div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; <span class="comment">// If the node is sparse, then only send non-empty branches:</span></div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="classripple_1_1SHAMapInnerNode.html#aec522cbc8cfb50ed87ebf8c634a40276">getBranchCount</a>() &lt; 12)</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; {</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; <span class="comment">// compressed node</span></div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; <span class="keyword">auto</span> hashes = <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a5beba186305ba9a93219feecd43a71d8">getHashes</a>();</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a5c356c106a60a7f75bff902bd04cb505">iterNonEmptyChildIndexes</a>([&amp;](<span class="keyword">auto</span> branchNum, <span class="keyword">auto</span> indexNum) {</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; s.<a class="code" href="classripple_1_1Serializer.html#a96daec54ca0c8ec7f6e7e683e9abbe0e">addBitString</a>(hashes[indexNum].as_uint256());</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; s.<a class="code" href="classripple_1_1Serializer.html#ab6de064efbc9b2efaeff2b069a02b644">add8</a>(branchNum);</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; });</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; s.<a class="code" href="classripple_1_1Serializer.html#ab6de064efbc9b2efaeff2b069a02b644">add8</a>(<a class="code" href="namespaceripple.html#ac329442511917ee4fb295996041263e9">wireTypeCompressedInner</a>);</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; }</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160; {</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a636a12a32e96bbd6a7d32e580a55fd4f">iterChildren</a>(</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; [&amp;](<a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; hh) { s.<a class="code" href="classripple_1_1Serializer.html#a96daec54ca0c8ec7f6e7e683e9abbe0e">addBitString</a>(hh.<a class="code" href="classripple_1_1SHAMapHash.html#a8f95b5bc14b7085d368f56aeaa17ef4f">as_uint256</a>()); });</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; s.<a class="code" href="classripple_1_1Serializer.html#ab6de064efbc9b2efaeff2b069a02b644">add8</a>(<a class="code" href="namespaceripple.html#ae4966411bf110181aa1b1ef4a2d8c690">wireTypeInner</a>);</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; }</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160;}</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160; </div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00248"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a5f4b0002303fdffed19ea5019f8070f8"> 248</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a5f4b0002303fdffed19ea5019f8070f8">SHAMapInnerNode::serializeWithPrefix</a>(<a class="code" href="classripple_1_1Serializer.html">Serializer</a>&amp; s)<span class="keyword"> const</span></div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160; assert(!<a class="code" href="classripple_1_1SHAMapInnerNode.html#a13fcdfee8199a8e54429edf6b9085ae0">isEmpty</a>());</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160; </div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160; s.<a class="code" href="classripple_1_1Serializer.html#a55ebab5e9bf8d8231da8f3c796150719">add32</a>(<a class="code" href="namespaceripple.html#ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77">HashPrefix::innerNode</a>);</div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a636a12a32e96bbd6a7d32e580a55fd4f">iterChildren</a>(</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>&#160; [&amp;](<a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp; hh) { s.<a class="code" href="classripple_1_1Serializer.html#a96daec54ca0c8ec7f6e7e683e9abbe0e">addBitString</a>(hh.<a class="code" href="classripple_1_1SHAMapHash.html#a8f95b5bc14b7085d368f56aeaa17ef4f">as_uint256</a>()); });</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160;}</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160; </div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>&#160;<span class="keywordtype">bool</span></div>
<div class="line"><a name="l00258"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a13fcdfee8199a8e54429edf6b9085ae0"> 258</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a13fcdfee8199a8e54429edf6b9085ae0">SHAMapInnerNode::isEmpty</a>()<span class="keyword"> const</span></div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160; <span class="keywordflow">return</span> <a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a> == 0;</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160;}</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160; </div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160;<span class="keywordtype">int</span></div>
<div class="line"><a name="l00264"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#aec522cbc8cfb50ed87ebf8c634a40276"> 264</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#aec522cbc8cfb50ed87ebf8c634a40276">SHAMapInnerNode::getBranchCount</a>()<span class="keyword"> const</span></div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; <span class="keywordflow">return</span> popcnt16(<a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a>);</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160;}</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; </div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160;<a class="codeRef" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div>
<div class="line"><a name="l00270"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#aa91785cf9d4979e8dd4dd9c183ad9c5e"> 270</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#aa91785cf9d4979e8dd4dd9c183ad9c5e">SHAMapInnerNode::getString</a>(<span class="keyword">const</span> <a class="code" href="classripple_1_1SHAMapNodeID.html">SHAMapNodeID</a>&amp; <span class="keywordtype">id</span>)<span class="keyword"> const</span></div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ret = <a class="code" href="classripple_1_1SHAMapTreeNode.html#a2dbee3cfa72319c01b649f4c255a5a9d">SHAMapTreeNode::getString</a>(<span class="keywordtype">id</span>);</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; <span class="keyword">auto</span> hashes = <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a5beba186305ba9a93219feecd43a71d8">getHashes</a>();</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a5c356c106a60a7f75bff902bd04cb505">iterNonEmptyChildIndexes</a>([&amp;](<span class="keyword">auto</span> branchNum, <span class="keyword">auto</span> indexNum) {</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; ret += <span class="stringliteral">&quot;\nb&quot;</span>;</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; ret += <a class="codeRef" href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a>(branchNum);</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; ret += <span class="stringliteral">&quot; = &quot;</span>;</div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; ret += <a class="code" href="namespaceripple.html#af9776f187d3686a7fba4c2d2fbeebdf4">to_string</a>(hashes[indexNum]);</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; });</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160; <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160;}</div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160; </div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160;<span class="comment">// We are modifying an inner node</span></div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00285"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a816fb1a18b49832dcffccc073a5dd929"> 285</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a816fb1a18b49832dcffccc073a5dd929">SHAMapInnerNode::setChild</a>(<span class="keywordtype">int</span> m, <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a> <span class="keyword">const</span>&amp; child)</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160;{</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160; assert((m &gt;= 0) &amp;&amp; (m &lt; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">branchFactor</a>));</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160; assert(<a class="code" href="classripple_1_1SHAMapTreeNode.html#a7f27d867484104446867c0f50adc5ffb">cowid_</a> != 0);</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160; assert(child.get() != <span class="keyword">this</span>);</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160; </div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span> dstIsBranch = [&amp;] {</div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>&#160; <span class="keywordflow">if</span> (child)</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>&#160; <span class="keywordflow">return</span> <a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a> | (1 &lt;&lt; m);</div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>&#160; <span class="keywordflow">return</span> <a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a> &amp; ~(1 &lt;&lt; m);</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>&#160; }();</div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>&#160; </div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span> dstToAllocate = popcnt16(dstIsBranch);</div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>&#160; <span class="comment">// change hashesAndChildren to remove the element, or make room for the</span></div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>&#160; <span class="comment">// added element, if necessary</span></div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a> = <a class="code" href="classripple_1_1TaggedPointer.html">TaggedPointer</a>(</div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>&#160; std::move(<a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>), <a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a>, dstIsBranch, dstToAllocate);</div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>&#160; </div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a> = dstIsBranch;</div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>&#160; </div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>&#160; <span class="keywordflow">if</span> (child)</div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>&#160; {</div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span> childIndex = *<a class="code" href="classripple_1_1SHAMapInnerNode.html#a25aac316c799590fec7f818d5b5584b5">getChildIndex</a>(m);</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>&#160; <span class="keyword">auto</span> [_, hashes, children] = <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a41f33a7472b07de90ec241770e60e114">getHashesAndChildren</a>();</div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>&#160; hashes[childIndex].zero();</div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>&#160; children[childIndex] = child;</div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>&#160; }</div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>&#160; </div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>&#160; <a class="code" href="classripple_1_1SHAMapTreeNode.html#a705bca4eb622097a917a3cac5c3a013d">hash_</a>.<a class="code" href="classripple_1_1SHAMapHash.html#af4ebd102e0623885986c4fc9874323f3">zero</a>();</div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>&#160; </div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>&#160; assert(<a class="code" href="classripple_1_1SHAMapInnerNode.html#aec522cbc8cfb50ed87ebf8c634a40276">getBranchCount</a>() &lt;= <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#aa3fcb13ead97c21651ae2ea0f60e8909">capacity</a>());</div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>&#160;}</div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>&#160; </div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>&#160;<span class="comment">// finished modifying, now make shareable</span></div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00321"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a1a5be285c023d39777772c86322df101"> 321</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a1a5be285c023d39777772c86322df101">SHAMapInnerNode::shareChild</a>(<span class="keywordtype">int</span> m, <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a> <span class="keyword">const</span>&amp; child)</div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>&#160;{</div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>&#160; assert((m &gt;= 0) &amp;&amp; (m &lt; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">branchFactor</a>));</div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>&#160; assert(<a class="code" href="classripple_1_1SHAMapTreeNode.html#a7f27d867484104446867c0f50adc5ffb">cowid_</a> != 0);</div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>&#160; assert(child);</div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>&#160; assert(child.get() != <span class="keyword">this</span>);</div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>&#160; </div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>&#160; assert(!<a class="code" href="classripple_1_1SHAMapInnerNode.html#a5b4f103d62324f6efb4e21a8a6404c27">isEmptyBranch</a>(m));</div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a00ec86c8b6236c594e262847eeea68fd">getChildren</a>()[*<a class="code" href="classripple_1_1SHAMapInnerNode.html#a25aac316c799590fec7f818d5b5584b5">getChildIndex</a>(m)] = child;</div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>&#160;}</div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>&#160; </div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>&#160;<a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>*</div>
<div class="line"><a name="l00333"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#aee8c4572b5618083dd1513dbffba280d"> 333</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#aee8c4572b5618083dd1513dbffba280d">SHAMapInnerNode::getChildPointer</a>(<span class="keywordtype">int</span> branch)</div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>&#160;{</div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>&#160; assert(branch &gt;= 0 &amp;&amp; branch &lt; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">branchFactor</a>);</div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>&#160; assert(!<a class="code" href="classripple_1_1SHAMapInnerNode.html#a5b4f103d62324f6efb4e21a8a6404c27">isEmptyBranch</a>(branch));</div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>&#160; </div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/lock_guard.html">std::lock_guard</a> lock(<a class="code" href="classripple_1_1SHAMapInnerNode.html#ade4fdfad9804690e890a095c9e0cc089">childLock</a>);</div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>&#160; <span class="keywordflow">return</span> <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a00ec86c8b6236c594e262847eeea68fd">getChildren</a>()[*<a class="code" href="classripple_1_1SHAMapInnerNode.html#a25aac316c799590fec7f818d5b5584b5">getChildIndex</a>(branch)].get();</div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>&#160;}</div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>&#160; </div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>&#160;<a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a></div>
<div class="line"><a name="l00343"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a5693ae02e17473b1d7fec7cfea0d4443"> 343</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a5693ae02e17473b1d7fec7cfea0d4443">SHAMapInnerNode::getChild</a>(<span class="keywordtype">int</span> branch)</div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>&#160;{</div>
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>&#160; assert(branch &gt;= 0 &amp;&amp; branch &lt; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">branchFactor</a>);</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>&#160; assert(!<a class="code" href="classripple_1_1SHAMapInnerNode.html#a5b4f103d62324f6efb4e21a8a6404c27">isEmptyBranch</a>(branch));</div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>&#160; </div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/lock_guard.html">std::lock_guard</a> lock(<a class="code" href="classripple_1_1SHAMapInnerNode.html#ade4fdfad9804690e890a095c9e0cc089">childLock</a>);</div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>&#160; <span class="keywordflow">return</span> <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a00ec86c8b6236c594e262847eeea68fd">getChildren</a>()[*<a class="code" href="classripple_1_1SHAMapInnerNode.html#a25aac316c799590fec7f818d5b5584b5">getChildIndex</a>(branch)];</div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>&#160;}</div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>&#160; </div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>&#160;<a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> <span class="keyword">const</span>&amp;</div>
<div class="line"><a name="l00353"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a8932a6ff79c447556da4b17e908bd008"> 353</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a8932a6ff79c447556da4b17e908bd008">SHAMapInnerNode::getChildHash</a>(<span class="keywordtype">int</span> m)<span class="keyword"> const</span></div>
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>&#160; assert((m &gt;= 0) &amp;&amp; (m &lt; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">branchFactor</a>));</div>
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>&#160; <span class="keywordflow">if</span> (<span class="keyword">auto</span> <span class="keyword">const</span> i = <a class="code" href="classripple_1_1SHAMapInnerNode.html#a25aac316c799590fec7f818d5b5584b5">getChildIndex</a>(m))</div>
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>&#160; <span class="keywordflow">return</span> <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a5beba186305ba9a93219feecd43a71d8">getHashes</a>()[*i];</div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>&#160; </div>
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>&#160; <span class="keywordflow">return</span> zeroSHAMapHash;</div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>&#160;}</div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>&#160; </div>
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>&#160;<a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a></div>
<div class="line"><a name="l00363"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#ad1d3440e82f822d85cc57734a16dc524"> 363</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#ad1d3440e82f822d85cc57734a16dc524">SHAMapInnerNode::canonicalizeChild</a>(</div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>&#160; <span class="keywordtype">int</span> branch,</div>
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a> node)</div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>&#160;{</div>
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>&#160; assert(branch &gt;= 0 &amp;&amp; branch &lt; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">branchFactor</a>);</div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>&#160; assert(node);</div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>&#160; assert(!<a class="code" href="classripple_1_1SHAMapInnerNode.html#a5b4f103d62324f6efb4e21a8a6404c27">isEmptyBranch</a>(branch));</div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span> childIndex = *<a class="code" href="classripple_1_1SHAMapInnerNode.html#a25aac316c799590fec7f818d5b5584b5">getChildIndex</a>(branch);</div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>&#160; <span class="keyword">auto</span> [_, hashes, children] = <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a41f33a7472b07de90ec241770e60e114">getHashesAndChildren</a>();</div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>&#160; assert(node-&gt;getHash() == hashes[childIndex]);</div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>&#160; </div>
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/lock_guard.html">std::lock_guard</a> lock(<a class="code" href="classripple_1_1SHAMapInnerNode.html#ade4fdfad9804690e890a095c9e0cc089">childLock</a>);</div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>&#160; <span class="keywordflow">if</span> (children[childIndex])</div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>&#160; {</div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>&#160; <span class="comment">// There is already a node hooked up, return it</span></div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>&#160; node = children[childIndex];</div>
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>&#160; }</div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>&#160; {</div>
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>&#160; <span class="comment">// Hook this node up</span></div>
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>&#160; children[childIndex] = node;</div>
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>&#160; }</div>
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>&#160; <span class="keywordflow">return</span> node;</div>
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>&#160;}</div>
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>&#160; </div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00389"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMapInnerNode.html#a964421b7b7b071f1a5daa95afa8f0fe9"> 389</a></span>&#160;<a class="code" href="classripple_1_1SHAMapInnerNode.html#a964421b7b7b071f1a5daa95afa8f0fe9">SHAMapInnerNode::invariants</a>(<span class="keywordtype">bool</span> is_root)<span class="keyword"> const</span></div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>&#160; <span class="keywordtype">unsigned</span> count = 0;</div>
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>&#160; <span class="keyword">auto</span> [numAllocated, hashes, children] =</div>
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>&#160; <a class="code" href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">hashesAndChildren_</a>.<a class="code" href="classripple_1_1TaggedPointer.html#a41f33a7472b07de90ec241770e60e114">getHashesAndChildren</a>();</div>
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>&#160; </div>
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>&#160; <span class="keywordflow">if</span> (numAllocated != <a class="code" href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">branchFactor</a>)</div>
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>&#160; {</div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span> branchCount = <a class="code" href="classripple_1_1SHAMapInnerNode.html#aec522cbc8cfb50ed87ebf8c634a40276">getBranchCount</a>();</div>
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; branchCount; ++i)</div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>&#160; {</div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>&#160; assert(hashes[i].isNonZero());</div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>&#160; <span class="keywordflow">if</span> (children[i] != <span class="keyword">nullptr</span>)</div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>&#160; children[i]-&gt;invariants();</div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>&#160; ++count;</div>
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>&#160; }</div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>&#160; }</div>
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>&#160; {</div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code" href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">branchFactor</a>; ++i)</div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>&#160; {</div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>&#160; <span class="keywordflow">if</span> (hashes[i].isNonZero())</div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>&#160; {</div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>&#160; assert((<a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a> &amp; (1 &lt;&lt; i)) != 0);</div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>&#160; <span class="keywordflow">if</span> (children[i] != <span class="keyword">nullptr</span>)</div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>&#160; children[i]-&gt;invariants();</div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>&#160; ++count;</div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>&#160; }</div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>&#160; {</div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>&#160; assert((<a class="code" href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">isBranch_</a> &amp; (1 &lt;&lt; i)) == 0);</div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>&#160; }</div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>&#160; }</div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>&#160; }</div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>&#160; </div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>&#160; <span class="keywordflow">if</span> (!is_root)</div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>&#160; {</div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>&#160; assert(<a class="code" href="classripple_1_1SHAMapTreeNode.html#a705bca4eb622097a917a3cac5c3a013d">hash_</a>.<a class="code" href="classripple_1_1SHAMapHash.html#a6e42edf954f9565ebffd6a9036d6646f">isNonZero</a>());</div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>&#160; assert(count &gt;= 1);</div>
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>&#160; }</div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>&#160; assert((count == 0) ? <a class="code" href="classripple_1_1SHAMapTreeNode.html#a705bca4eb622097a917a3cac5c3a013d">hash_</a>.<a class="code" href="classripple_1_1SHAMapHash.html#a9da182ac6ba19109c55bd2a6cd745a13">isZero</a>() : <a class="code" href="classripple_1_1SHAMapTreeNode.html#a705bca4eb622097a917a3cac5c3a013d">hash_</a>.<a class="code" href="classripple_1_1SHAMapHash.html#a6e42edf954f9565ebffd6a9036d6646f">isNonZero</a>());</div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>&#160;}</div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>&#160; </div>
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>&#160;} <span class="comment">// namespace ripple</span></div>
</div><!-- fragment --></div><!-- contents -->
<div class="ttc" id="agroup__SHAMap_html_gac9adec7146a8bea60fe6acf6c1ed98d1"><div class="ttname"><a href="group__SHAMap.html#gac9adec7146a8bea60fe6acf6c1ed98d1">ripple::SHAMapTreeNode::cowid</a></div><div class="ttdeci">std::uint32_t cowid() const</div><div class="ttdoc">Returns the SHAMap that owns this node.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00197">SHAMapTreeNode.h:197</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a5f4b0002303fdffed19ea5019f8070f8"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a5f4b0002303fdffed19ea5019f8070f8">ripple::SHAMapInnerNode::serializeWithPrefix</a></div><div class="ttdeci">void serializeWithPrefix(Serializer &amp;) const override</div><div class="ttdoc">Serialize the node in a format appropriate for hashing.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00248">SHAMapInnerNode.cpp:248</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a816fb1a18b49832dcffccc073a5dd929"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a816fb1a18b49832dcffccc073a5dd929">ripple::SHAMapInnerNode::setChild</a></div><div class="ttdeci">void setChild(int m, std::shared_ptr&lt; SHAMapTreeNode &gt; const &amp;child)</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00285">SHAMapInnerNode.cpp:285</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a3a2d1da1093314594a2e1c5e0bcd13af"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a3a2d1da1093314594a2e1c5e0bcd13af">ripple::SHAMapInnerNode::clone</a></div><div class="ttdeci">std::shared_ptr&lt; SHAMapTreeNode &gt; clone(std::uint32_t cowid) const override</div><div class="ttdoc">Make a copy of this node, setting the owner.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00082">SHAMapInnerNode.cpp:82</a></div></div>
<div class="ttc" id="aclassripple_1_1TaggedPointer_html_a38d6dfe0e6c5c842ef8886ac59d6f722"><div class="ttname"><a href="classripple_1_1TaggedPointer.html#a38d6dfe0e6c5c842ef8886ac59d6f722">ripple::TaggedPointer::getChildIndex</a></div><div class="ttdeci">std::optional&lt; int &gt; getChildIndex(std::uint16_t isBranch, int i) const</div><div class="ttdoc">Get the child's index inside the hashes or children array (which may or may not be sparse).</div></div>
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="autility_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/header/utility.html">utility</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_ac506e73531d73c05cf6505d3ece00d41"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#ac506e73531d73c05cf6505d3ece00d41">ripple::SHAMapInnerNode::hashesAndChildren_</a></div><div class="ttdeci">TaggedPointer hashesAndChildren_</div><div class="ttdoc">Opaque type that contains the hashes array (array of type SHAMapHash) and the children array (array o...</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8h_source.html#l00051">SHAMapInnerNode.h:51</a></div></div>
<div class="ttc" id="astructripple_1_1detail_1_1basic__sha512__half__hasher_html"><div class="ttname"><a href="structripple_1_1detail_1_1basic__sha512__half__hasher.html">ripple::detail::basic_sha512_half_hasher</a></div><div class="ttdoc">Returns the SHA512-Half digest of a message.</div><div class="ttdef"><b>Definition:</b> <a href="digest_8h_source.html#l00166">digest.h:166</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a5693ae02e17473b1d7fec7cfea0d4443"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a5693ae02e17473b1d7fec7cfea0d4443">ripple::SHAMapInnerNode::getChild</a></div><div class="ttdeci">std::shared_ptr&lt; SHAMapTreeNode &gt; getChild(int branch)</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00343">SHAMapInnerNode.cpp:343</a></div></div>
<div class="ttc" id="aclassripple_1_1Slice_html"><div class="ttname"><a href="classripple_1_1Slice.html">ripple::Slice</a></div><div class="ttdoc">An immutable linear range of bytes.</div><div class="ttdef"><b>Definition:</b> <a href="Slice_8h_source.html#l00044">Slice.h:44</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_ad1efe48ac7bf6f3b4a10ad9c26573bec"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#ad1efe48ac7bf6f3b4a10ad9c26573bec">ripple::SHAMapInnerNode::makeFullInner</a></div><div class="ttdeci">static std::shared_ptr&lt; SHAMapTreeNode &gt; makeFullInner(Slice data, SHAMapHash const &amp;hash, bool hashValid)</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00130">SHAMapInnerNode.cpp:130</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_ad1d3440e82f822d85cc57734a16dc524"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#ad1d3440e82f822d85cc57734a16dc524">ripple::SHAMapInnerNode::canonicalizeChild</a></div><div class="ttdeci">virtual std::shared_ptr&lt; SHAMapTreeNode &gt; canonicalizeChild(int branch, std::shared_ptr&lt; SHAMapTreeNode &gt; node)</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00363">SHAMapInnerNode.cpp:363</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapTreeNode_html_a7f27d867484104446867c0f50adc5ffb"><div class="ttname"><a href="classripple_1_1SHAMapTreeNode.html#a7f27d867484104446867c0f50adc5ffb">ripple::SHAMapTreeNode::cowid_</a></div><div class="ttdeci">std::uint32_t cowid_</div><div class="ttdoc">Determines the owning SHAMap, if any.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00145">SHAMapTreeNode.h:145</a></div></div>
<div class="ttc" id="aclassripple_1_1Serializer_html_ab6de064efbc9b2efaeff2b069a02b644"><div class="ttname"><a href="classripple_1_1Serializer.html#ab6de064efbc9b2efaeff2b069a02b644">ripple::Serializer::add8</a></div><div class="ttdeci">int add8(unsigned char i)</div><div class="ttdef"><b>Definition:</b> <a href="Serializer_8cpp_source.html#l00166">Serializer.cpp:166</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a73212411125e46812e0e19f2e307b155"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a73212411125e46812e0e19f2e307b155">ripple::SHAMapInnerNode::updateHash</a></div><div class="ttdeci">void updateHash() override</div><div class="ttdoc">Recalculate the hash of this node.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00194">SHAMapInnerNode.cpp:194</a></div></div>
<div class="ttc" id="aiterator_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/header/iterator.html">iterator</a></div></div>
<div class="ttc" id="alock_guard_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/lock_guard.html">std::lock_guard</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="aclassripple_1_1SHAMapHash_html_a9da182ac6ba19109c55bd2a6cd745a13"><div class="ttname"><a href="classripple_1_1SHAMapHash.html#a9da182ac6ba19109c55bd2a6cd745a13">ripple::SHAMapHash::isZero</a></div><div class="ttdeci">bool isZero() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00069">SHAMapTreeNode.h:69</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a42a7132ff24a6edf8ca1e022f61826d9"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a42a7132ff24a6edf8ca1e022f61826d9">ripple::SHAMapInnerNode::branchFactor</a></div><div class="ttdeci">static constexpr unsigned int branchFactor</div><div class="ttdoc">Each inner node has 16 children (the 'radix tree' part of the map)</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8h_source.html#l00044">SHAMapInnerNode.h:44</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a1a5be285c023d39777772c86322df101"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a1a5be285c023d39777772c86322df101">ripple::SHAMapInnerNode::shareChild</a></div><div class="ttdeci">void shareChild(int m, std::shared_ptr&lt; SHAMapTreeNode &gt; const &amp;child)</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00321">SHAMapInnerNode.cpp:321</a></div></div>
<div class="ttc" id="anamespaceripple_html_ae4966411bf110181aa1b1ef4a2d8c690"><div class="ttname"><a href="namespaceripple.html#ae4966411bf110181aa1b1ef4a2d8c690">ripple::wireTypeInner</a></div><div class="ttdeci">static constexpr unsigned const char wireTypeInner</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00041">SHAMapTreeNode.h:41</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapNodeID_html"><div class="ttname"><a href="classripple_1_1SHAMapNodeID.html">ripple::SHAMapNodeID</a></div><div class="ttdoc">Identifies a node inside a SHAMap.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapNodeID_8h_source.html#l00033">SHAMapNodeID.h:33</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapHash_html_a6e42edf954f9565ebffd6a9036d6646f"><div class="ttname"><a href="classripple_1_1SHAMapHash.html#a6e42edf954f9565ebffd6a9036d6646f">ripple::SHAMapHash::isNonZero</a></div><div class="ttdeci">bool isNonZero() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00074">SHAMapTreeNode.h:74</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapTreeNode_html_a2dbee3cfa72319c01b649f4c255a5a9d"><div class="ttname"><a href="classripple_1_1SHAMapTreeNode.html#a2dbee3cfa72319c01b649f4c255a5a9d">ripple::SHAMapTreeNode::getString</a></div><div class="ttdeci">virtual std::string getString(SHAMapNodeID const &amp;) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8cpp_source.html#l00184">SHAMapTreeNode.cpp:184</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapTreeNode_html_a705bca4eb622097a917a3cac5c3a013d"><div class="ttname"><a href="classripple_1_1SHAMapTreeNode.html#a705bca4eb622097a917a3cac5c3a013d">ripple::SHAMapTreeNode::hash_</a></div><div class="ttdeci">SHAMapHash hash_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00137">SHAMapTreeNode.h:137</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a636a12a32e96bbd6a7d32e580a55fd4f"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a636a12a32e96bbd6a7d32e580a55fd4f">ripple::SHAMapInnerNode::iterChildren</a></div><div class="ttdeci">void iterChildren(F &amp;&amp;f) const</div><div class="ttdoc">Call the f callback for all 16 (branchFactor) branches - even if the branch is empty.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00056">SHAMapInnerNode.cpp:56</a></div></div>
<div class="ttc" id="aclassripple_1_1TaggedPointer_html"><div class="ttname"><a href="classripple_1_1TaggedPointer.html">ripple::TaggedPointer</a></div><div class="ttdoc">TaggedPointer is a combination of a pointer and a mask stored in the lowest two bits.</div><div class="ttdef"><b>Definition:</b> <a href="TaggedPointer_8h_source.html#l00057">TaggedPointer.h:57</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapHash_html"><div class="ttname"><a href="classripple_1_1SHAMapHash.html">ripple::SHAMapHash</a></div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00048">SHAMapTreeNode.h:48</a></div></div>
<div class="ttc" id="aalgorithm_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/header/algorithm.html">algorithm</a></div></div>
<div class="ttc" id="atie_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a></div><div class="ttdeci">T tie(T... args)</div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a5b4f103d62324f6efb4e21a8a6404c27"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a5b4f103d62324f6efb4e21a8a6404c27">ripple::SHAMapInnerNode::isEmptyBranch</a></div><div class="ttdeci">bool isEmptyBranch(int m) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8h_source.html#l00195">SHAMapInnerNode.h:195</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a5c356c106a60a7f75bff902bd04cb505"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a5c356c106a60a7f75bff902bd04cb505">ripple::SHAMapInnerNode::iterNonEmptyChildIndexes</a></div><div class="ttdeci">void iterNonEmptyChildIndexes(F &amp;&amp;f) const</div><div class="ttdoc">Call the f callback for all non-empty branches.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00063">SHAMapInnerNode.cpp:63</a></div></div>
<div class="ttc" id="aclassripple_1_1base__uint_html"><div class="ttname"><a href="classripple_1_1base__uint.html">ripple::base_uint&lt; 256 &gt;</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_aa91785cf9d4979e8dd4dd9c183ad9c5e"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#aa91785cf9d4979e8dd4dd9c183ad9c5e">ripple::SHAMapInnerNode::getString</a></div><div class="ttdeci">std::string getString(SHAMapNodeID const &amp;) const override</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00270">SHAMapInnerNode.cpp:270</a></div></div>
<div class="ttc" id="anamespaceripple_html_ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77"><div class="ttname"><a href="namespaceripple.html#ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77">ripple::HashPrefix::innerNode</a></div><div class="ttdeci">@ innerNode</div><div class="ttdoc">inner node in V1 tree</div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a8932a6ff79c447556da4b17e908bd008"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a8932a6ff79c447556da4b17e908bd008">ripple::SHAMapInnerNode::getChildHash</a></div><div class="ttdeci">SHAMapHash const &amp; getChildHash(int m) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00353">SHAMapInnerNode.cpp:353</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a64c8817ea46bb682a9d354590cd11449"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a64c8817ea46bb682a9d354590cd11449">ripple::SHAMapInnerNode::resizeChildArrays</a></div><div class="ttdeci">void resizeChildArrays(std::uint8_t toAllocate)</div><div class="ttdoc">Convert arrays stored in hashesAndChildren_ so they can store the requested number of children.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00069">SHAMapInnerNode.cpp:69</a></div></div>
<div class="ttc" id="aclassripple_1_1TaggedPointer_html_a5beba186305ba9a93219feecd43a71d8"><div class="ttname"><a href="classripple_1_1TaggedPointer.html#a5beba186305ba9a93219feecd43a71d8">ripple::TaggedPointer::getHashes</a></div><div class="ttdeci">SHAMapHash * getHashes() const</div><div class="ttdoc">Get the hashes array.</div></div>
<div class="ttc" id="aclassripple_1_1TaggedPointer_html_ae529fdc057df9e07c40b488d45855b19"><div class="ttname"><a href="classripple_1_1TaggedPointer.html#ae529fdc057df9e07c40b488d45855b19">ripple::TaggedPointer::isDense</a></div><div class="ttdeci">bool isDense() const</div><div class="ttdoc">Check if the arrays have a dense format.</div></div>
<div class="ttc" id="aclassripple_1_1SHAMapTreeNode_html"><div class="ttname"><a href="classripple_1_1SHAMapTreeNode.html">ripple::SHAMapTreeNode</a></div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00134">SHAMapTreeNode.h:134</a></div></div>
<div class="ttc" id="ato_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a></div><div class="ttdeci">T to_string(T... args)</div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a25aac316c799590fec7f818d5b5584b5"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a25aac316c799590fec7f818d5b5584b5">ripple::SHAMapInnerNode::getChildIndex</a></div><div class="ttdeci">std::optional&lt; int &gt; getChildIndex(int i) const</div><div class="ttdoc">Get the child's index inside the hashes or children array (stored in hashesAndChildren_.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00076">SHAMapInnerNode.cpp:76</a></div></div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/header/array.html">array</a></div></div>
<div class="ttc" id="aclassripple_1_1Serializer_html_a437528ba7c48120f7d6432a9ab39d019"><div class="ttname"><a href="classripple_1_1Serializer.html#a437528ba7c48120f7d6432a9ab39d019">ripple::Serializer::get8</a></div><div class="ttdeci">bool get8(int &amp;, int offset) const</div><div class="ttdef"><b>Definition:</b> <a href="Serializer_8cpp_source.html#l00174">Serializer.cpp:174</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_ad83701be0c7a908a61601d1bcbf7ecb1"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#ad83701be0c7a908a61601d1bcbf7ecb1">ripple::SHAMapInnerNode::updateHashDeep</a></div><div class="ttdeci">void updateHashDeep()</div><div class="ttdoc">Recalculate the hash of all children and this node.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00209">SHAMapInnerNode.cpp:209</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a2cf4d1f797c61c9e2bb458b7b14056b6"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a2cf4d1f797c61c9e2bb458b7b14056b6">ripple::SHAMapInnerNode::SHAMapInnerNode</a></div><div class="ttdeci">SHAMapInnerNode(std::uint32_t cowid, std::uint8_t numAllocatedChildren=2)</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00045">SHAMapInnerNode.cpp:45</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a52169174ccb10b0ea379da3463dba155"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a52169174ccb10b0ea379da3463dba155">ripple::SHAMapInnerNode::isBranch_</a></div><div class="ttdeci">std::uint16_t isBranch_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8h_source.html#l00054">SHAMapInnerNode.h:54</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_aec522cbc8cfb50ed87ebf8c634a40276"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#aec522cbc8cfb50ed87ebf8c634a40276">ripple::SHAMapInnerNode::getBranchCount</a></div><div class="ttdeci">int getBranchCount() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00264">SHAMapInnerNode.cpp:264</a></div></div>
<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_aa36ffe7811690d0c57b52c792a634dee"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#aa36ffe7811690d0c57b52c792a634dee">ripple::SHAMapInnerNode::~SHAMapInnerNode</a></div><div class="ttdeci">~SHAMapInnerNode()</div></div>
<div class="ttc" id="aclassripple_1_1TaggedPointer_html_a00d143272df241cef3ff904d3291652b"><div class="ttname"><a href="classripple_1_1TaggedPointer.html#a00d143272df241cef3ff904d3291652b">ripple::TaggedPointer::iterNonEmptyChildIndexes</a></div><div class="ttdeci">void iterNonEmptyChildIndexes(std::uint16_t isBranch, F &amp;&amp;f) const</div><div class="ttdoc">Call the f callback for all non-empty branches.</div></div>
<div class="ttc" id="aclassripple_1_1SHAMapTreeNode_html_a454e86c9ed693f8921d53a915d8b1415"><div class="ttname"><a href="classripple_1_1SHAMapTreeNode.html#a454e86c9ed693f8921d53a915d8b1415">ripple::SHAMapTreeNode::getHash</a></div><div class="ttdeci">SHAMapHash const &amp; getHash() const</div><div class="ttdoc">Return the hash of this node.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00224">SHAMapTreeNode.h:224</a></div></div>
<div class="ttc" id="aclassripple_1_1Serializer_html"><div class="ttname"><a href="classripple_1_1Serializer.html">ripple::Serializer</a></div><div class="ttdef"><b>Definition:</b> <a href="Serializer_8h_source.html#l00039">Serializer.h:39</a></div></div>
<div class="ttc" id="anamespaceripple_html_ac329442511917ee4fb295996041263e9"><div class="ttname"><a href="namespaceripple.html#ac329442511917ee4fb295996041263e9">ripple::wireTypeCompressedInner</a></div><div class="ttdeci">static constexpr unsigned const char wireTypeCompressedInner</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00042">SHAMapTreeNode.h:42</a></div></div>
<div class="ttc" id="anamespaceripple_html"><div class="ttname"><a href="namespaceripple.html">ripple</a></div><div class="ttdoc">Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.</div><div class="ttdef"><b>Definition:</b> <a href="RCLCensorshipDetector_8h_source.html#l00029">RCLCensorshipDetector.h:29</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_ad0ebb4c9ea3cc41acaf6806a3e43ec91"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#ad0ebb4c9ea3cc41acaf6806a3e43ec91">ripple::SHAMapInnerNode::serializeForWire</a></div><div class="ttdeci">void serializeForWire(Serializer &amp;) const override</div><div class="ttdoc">Serialize the node in a format appropriate for sending over the wire.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00224">SHAMapInnerNode.cpp:224</a></div></div>
<div class="ttc" id="aclassripple_1_1Serializer_html_a96daec54ca0c8ec7f6e7e683e9abbe0e"><div class="ttname"><a href="classripple_1_1Serializer.html#a96daec54ca0c8ec7f6e7e683e9abbe0e">ripple::Serializer::addBitString</a></div><div class="ttdeci">int addBitString(base_uint&lt; Bits, Tag &gt; const &amp;v)</div><div class="ttdef"><b>Definition:</b> <a href="Serializer_8h_source.html#l00097">Serializer.h:97</a></div></div>
<div class="ttc" id="aclassripple_1_1Serializer_html_a2a89965bbb918a1aee8a34034e4d82f7"><div class="ttname"><a href="classripple_1_1Serializer.html#a2a89965bbb918a1aee8a34034e4d82f7">ripple::Serializer::getBitString</a></div><div class="ttdeci">bool getBitString(base_uint&lt; Bits, Tag &gt; &amp;data, int offset) const</div><div class="ttdef"><b>Definition:</b> <a href="Serializer_8h_source.html#l00146">Serializer.h:146</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapHash_html_af4ebd102e0623885986c4fc9874323f3"><div class="ttname"><a href="classripple_1_1SHAMapHash.html#af4ebd102e0623885986c4fc9874323f3">ripple::SHAMapHash::zero</a></div><div class="ttdeci">void zero()</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00084">SHAMapTreeNode.h:84</a></div></div>
<div class="ttc" id="anamespacebeast_html_a4a9eebb8b68941c49b07763d7a95d456"><div class="ttname"><a href="namespacebeast.html#a4a9eebb8b68941c49b07763d7a95d456">beast::hash_append</a></div><div class="ttdeci">std::enable_if_t&lt; is_contiguously_hashable&lt; T, Hasher &gt;::value &gt; hash_append(Hasher &amp;h, T const &amp;t) noexcept</div><div class="ttdoc">Logically concatenate input data to a Hasher.</div><div class="ttdef"><b>Definition:</b> <a href="hash__append_8h_source.html#l00236">hash_append.h:236</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_ade4fdfad9804690e890a095c9e0cc089"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#ade4fdfad9804690e890a095c9e0cc089">ripple::SHAMapInnerNode::childLock</a></div><div class="ttdeci">static std::mutex childLock</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8h_source.html#l00056">SHAMapInnerNode.h:56</a></div></div>
<div class="ttc" id="aoptional_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/optional.html">std::optional&lt; int &gt;</a></div></div>
<div class="ttc" id="amutex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/header/mutex.html">mutex</a></div></div>
<div class="ttc" id="aclassripple_1_1TaggedPointer_html_a00ec86c8b6236c594e262847eeea68fd"><div class="ttname"><a href="classripple_1_1TaggedPointer.html#a00ec86c8b6236c594e262847eeea68fd">ripple::TaggedPointer::getChildren</a></div><div class="ttdeci">std::shared_ptr&lt; SHAMapTreeNode &gt; * getChildren() const</div><div class="ttdoc">Get the children array.</div></div>
<div class="ttc" id="anamespaceripple_html_af9776f187d3686a7fba4c2d2fbeebdf4"><div class="ttname"><a href="namespaceripple.html#af9776f187d3686a7fba4c2d2fbeebdf4">ripple::to_string</a></div><div class="ttdeci">std::string to_string(Manifest const &amp;m)</div><div class="ttdoc">Format the specified manifest to a string for debugging purposes.</div><div class="ttdef"><b>Definition:</b> <a href="app_2misc_2impl_2Manifest_8cpp_source.html#l00039">app/misc/impl/Manifest.cpp:39</a></div></div>
<div class="ttc" id="aclassripple_1_1Serializer_html_a55ebab5e9bf8d8231da8f3c796150719"><div class="ttname"><a href="classripple_1_1Serializer.html#a55ebab5e9bf8d8231da8f3c796150719">ripple::Serializer::add32</a></div><div class="ttdeci">int add32(std::uint32_t i)</div><div class="ttdef"><b>Definition:</b> <a href="Serializer_8cpp_source.html#l00038">Serializer.cpp:38</a></div></div>
<div class="ttc" id="aclassripple_1_1TaggedPointer_html_ac549f5187a2f29c8fb65a5a399cce913"><div class="ttname"><a href="classripple_1_1TaggedPointer.html#ac549f5187a2f29c8fb65a5a399cce913">ripple::TaggedPointer::iterChildren</a></div><div class="ttdeci">void iterChildren(std::uint16_t isBranch, F &amp;&amp;f) const</div><div class="ttdoc">Call the f callback for all 16 (branchFactor) branches - even if the branch is empty.</div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a13fcdfee8199a8e54429edf6b9085ae0"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a13fcdfee8199a8e54429edf6b9085ae0">ripple::SHAMapInnerNode::isEmpty</a></div><div class="ttdeci">bool isEmpty() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00258">SHAMapInnerNode.cpp:258</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a7c00b72186bf55aad286505bb5cedc00"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a7c00b72186bf55aad286505bb5cedc00">ripple::SHAMapInnerNode::makeCompressedInner</a></div><div class="ttdeci">static std::shared_ptr&lt; SHAMapTreeNode &gt; makeCompressedInner(Slice data)</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00161">SHAMapInnerNode.cpp:161</a></div></div>
<div class="ttc" id="aclassripple_1_1TaggedPointer_html_a41f33a7472b07de90ec241770e60e114"><div class="ttname"><a href="classripple_1_1TaggedPointer.html#a41f33a7472b07de90ec241770e60e114">ripple::TaggedPointer::getHashesAndChildren</a></div><div class="ttdeci">std::tuple&lt; std::uint8_t, SHAMapHash *, std::shared_ptr&lt; SHAMapTreeNode &gt; * &gt; getHashesAndChildren() const</div><div class="ttdoc">Get the number of elements in each array and a pointer to the start of each array.</div></div>
<div class="ttc" id="aclassripple_1_1SHAMapHash_html_a8f95b5bc14b7085d368f56aeaa17ef4f"><div class="ttname"><a href="classripple_1_1SHAMapHash.html#a8f95b5bc14b7085d368f56aeaa17ef4f">ripple::SHAMapHash::as_uint256</a></div><div class="ttdeci">uint256 const &amp; as_uint256() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00059">SHAMapTreeNode.h:59</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_aee8c4572b5618083dd1513dbffba280d"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#aee8c4572b5618083dd1513dbffba280d">ripple::SHAMapInnerNode::getChildPointer</a></div><div class="ttdeci">SHAMapTreeNode * getChildPointer(int branch)</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00333">SHAMapInnerNode.cpp:333</a></div></div>
<div class="ttc" id="aclassripple_1_1TaggedPointer_html_aa3fcb13ead97c21651ae2ea0f60e8909"><div class="ttname"><a href="classripple_1_1TaggedPointer.html#aa3fcb13ead97c21651ae2ea0f60e8909">ripple::TaggedPointer::capacity</a></div><div class="ttdeci">std::uint8_t capacity() const</div><div class="ttdoc">Get the number of elements allocated for each array.</div></div>
<div class="ttc" id="aclassripple_1_1Serializer_html_aa5c7aa53db0c7c90c6a86dd5144e9255"><div class="ttname"><a href="classripple_1_1Serializer.html#aa5c7aa53db0c7c90c6a86dd5144e9255">ripple::Serializer::getLength</a></div><div class="ttdeci">int getLength() const</div><div class="ttdef"><b>Definition:</b> <a href="Serializer_8h_source.html#l00199">Serializer.h:199</a></div></div>
<div class="ttc" id="anamespaceripple_html_a9c3a01178261b6e8a98c0ea99f01d154"><div class="ttname"><a href="namespaceripple.html#a9c3a01178261b6e8a98c0ea99f01d154">ripple::hash_append</a></div><div class="ttdeci">void hash_append(Hasher &amp;h, ValidatorBlobInfo const &amp;blobInfo)</div><div class="ttdef"><b>Definition:</b> <a href="ValidatorList_8h_source.html#l00897">ValidatorList.h:897</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a964421b7b7b071f1a5daa95afa8f0fe9"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a964421b7b7b071f1a5daa95afa8f0fe9">ripple::SHAMapInnerNode::invariants</a></div><div class="ttdeci">void invariants(bool is_root=false) const override</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00389">SHAMapInnerNode.cpp:389</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a07f4125beab496a2b812ce3f3c43f31e"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a07f4125beab496a2b812ce3f3c43f31e">ripple::SHAMapInnerNode::fullBelowGen_</a></div><div class="ttdeci">std::uint32_t fullBelowGen_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8h_source.html#l00053">SHAMapInnerNode.h:53</a></div></div>
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.17
</small></address>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink