ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-11-21 11:35:53 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
bbdaddc33eb0f97c35ded4b2435a8918befd1c49
rippled/SHAMapDelta_8cpp_source.html
bthomee 33451fdc96 deploy: 1d42c4f6de
2025-11-04 00:36:48 -08:00

504 lines
75 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" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>rippled: SHAMapDelta.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 id="projectrow">
<td id="projectalign">
<div id="projectname">rippled
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function() { init_codefold(0); });
/* @license-end */
</script>
<!-- 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">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_90ffdbabf412cfdffe6b2193e0ce938a.html">libxrpl</a></li><li class="navelem"><a class="el" href="dir_1cf8fc3bc79b026bd5b725d287fb7808.html">shamap</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle"><div class="title">SHAMapDelta.cpp</div></div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="preprocessor">#include &lt;xrpl/basics/IntrusivePointer.ipp&gt;</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="preprocessor">#include &lt;xrpl/basics/contract.h&gt;</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="preprocessor">#include &lt;xrpl/shamap/SHAMap.h&gt;</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span> </div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><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 id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="preprocessor">#include &lt;<a class="codeRef" href="http://en.cppreference.com/w/cpp/header/stack.html">stack</a>&gt;</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="preprocessor">#include &lt;<a class="codeRef" href="http://en.cppreference.com/w/cpp/header/vector.html">vector</a>&gt;</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span> </div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceripple.html">ripple</a> {</div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span> </div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// This code is used to compare another node&#39;s transaction tree</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// to our own. It returns a map containing all items that are different</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="comment">// between two SHA maps. It is optimized not to descend down tree</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="comment">// branches with the same branch hash. A limit can be passed so</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment">// that we will abort early if a node sends a map to us that</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment">// makes no sense at all. (And our sync algorithm will avoid</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment">// synchronizing matching branches too.)</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00020" data-start="{" data-end="}">
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#ae278ac777321e41b9b7b1614e28675e2"> 20</a></span><a class="code hl_function" href="classripple_1_1SHAMap.html#ae278ac777321e41b9b7b1614e28675e2">SHAMap::walkBranch</a>(</div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> <a class="code hl_class" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>* node,</div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> boost::intrusive_ptr&lt;SHAMapItem const&gt; <span class="keyword">const</span>&amp; otherMapItem,</div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span> <span class="keywordtype">bool</span> isFirstMap,</div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/map.html">Delta</a>&amp; differences,</div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> <span class="keywordtype">int</span>&amp; maxCount)<span class="keyword"> const</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// Walk a branch of a SHAMap that&#39;s matched by an empty branch or single</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// item in the other map</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;SHAMapTreeNode*, std::vector&lt;SHAMapTreeNode*&gt;</a>&gt; nodeStack;</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(node);</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> </div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keywordtype">bool</span> emptyBranch = !otherMapItem;</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> </div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keywordflow">while</span> (!nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> {</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> node = nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> </div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keywordflow">if</span> (node-&gt;<a class="code hl_function" href="classripple_1_1SHAMapTreeNode.html#a7aff7622ccd8ffd0be9367518b39436e">isInner</a>())</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> {</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// This is an inner node, add all non-empty branches</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordflow">if</span> (!inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>({<a class="code hl_function" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(inner, i)});</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> }</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> {</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// This is a leaf node, process its item</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keyword">auto</span> item = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(node)-&gt;<a class="code hl_function" href="classripple_1_1SHAMap.html#a381ecaa70bcce3f24bac35b7fed16985">peekItem</a>();</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> </div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordflow">if</span> (emptyBranch || (item-&gt;key() != otherMapItem-&gt;key()))</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> {</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// unmatched</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">if</span> (isFirstMap)</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> differences.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(item-&gt;key(), <a class="code hl_typedef" href="classripple_1_1SHAMap.html#a48dad6728c6fc737381f1cf4040d85ab">DeltaRef</a>(item, <span class="keyword">nullptr</span>)));</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> differences.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(item-&gt;key(), <a class="code hl_typedef" href="classripple_1_1SHAMap.html#a48dad6728c6fc737381f1cf4040d85ab">DeltaRef</a>(<span class="keyword">nullptr</span>, item)));</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> </div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> }</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (item-&gt;slice() != otherMapItem-&gt;slice())</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> {</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// non-matching items with same tag</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordflow">if</span> (isFirstMap)</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> differences.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> item-&gt;key(), <a class="code hl_typedef" href="classripple_1_1SHAMap.html#a48dad6728c6fc737381f1cf4040d85ab">DeltaRef</a>(item, otherMapItem)));</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> differences.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> item-&gt;key(), <a class="code hl_typedef" href="classripple_1_1SHAMap.html#a48dad6728c6fc737381f1cf4040d85ab">DeltaRef</a>(otherMapItem, item)));</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> </div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> </div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> emptyBranch = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> {</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// exact match</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> emptyBranch = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> }</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> }</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> }</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> </div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="keywordflow">if</span> (!emptyBranch)</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> {</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// otherMapItem was unmatched, must add</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">if</span> (isFirstMap) <span class="comment">// this is first map, so other item is from second</span></div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> differences.insert(<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> otherMapItem-&gt;key(), DeltaRef(<span class="keyword">nullptr</span>, otherMapItem)));</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> differences.insert(<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> otherMapItem-&gt;key(), DeltaRef(otherMapItem, <span class="keyword">nullptr</span>)));</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> </div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> }</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> </div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span>}</div>
</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> </div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span><span class="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00106" data-start="{" data-end="}">
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a09a39196247b7d775f001db67eb37882"> 106</a></span>SHAMap::compare(<a class="code hl_class" href="classripple_1_1SHAMap.html">SHAMap</a> <span class="keyword">const</span>&amp; otherMap, <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/map.html">Delta</a>&amp; differences, <span class="keywordtype">int</span> maxCount)<span class="keyword"> const</span></div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// compare two hash trees, add up to maxCount differences to the difference</span></div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// table return value: true=complete table of differences given, false=too</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// many differences throws on corrupt tables or missing nodes CAUTION:</span></div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="comment">// otherMap is not locked and must be immutable</span></div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> </div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> XRPL_ASSERT(</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> isValid() &amp;&amp; otherMap.<a class="code hl_function" href="classripple_1_1SHAMap.html#aa36f13285448ce66cdc04a0b7f4d8af7">isValid</a>(),</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="stringliteral">&quot;ripple::SHAMap::compare : valid state and valid input&quot;</span>);</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">if</span> (getHash() == otherMap.<a class="code hl_function" href="classripple_1_1SHAMap.html#a9b0dff3c3bf35efc30104c93becdc079">getHash</a>())</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> </div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="keyword">using </span>StackEntry = <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;SHAMapTreeNode*, SHAMapTreeNode*&gt;</a>;</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;StackEntry, std::vector&lt;StackEntry&gt;</a>&gt;</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> nodeStack; <span class="comment">// track nodes we&#39;ve pushed</span></div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> </div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>({root_.get(), otherMap.<a class="code hl_variable" href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">root_</a>.get()});</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">while</span> (!nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> {</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keyword">auto</span> [ourNode, otherNode] = nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> </div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keywordflow">if</span> (!ourNode || !otherNode)</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> {</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="comment">// LCOV_EXCL_START</span></div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> UNREACHABLE(<span class="stringliteral">&quot;ripple::SHAMap::compare : missing a node&quot;</span>);</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> Throw&lt;SHAMapMissingNode&gt;(type_, <a class="code hl_class" href="classripple_1_1base__uint.html">uint256</a>());</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="comment">// LCOV_EXCL_STOP</span></div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> }</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> </div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="keywordflow">if</span> (ourNode-&gt;isLeaf() &amp;&amp; otherNode-&gt;isLeaf())</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> {</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// two leaves</span></div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="keywordflow">if</span> (ours-&gt;peekItem()-&gt;key() == other-&gt;peekItem()-&gt;key())</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> {</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keywordflow">if</span> (ours-&gt;peekItem()-&gt;slice() != other-&gt;peekItem()-&gt;slice())</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> {</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> differences.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> ours-&gt;peekItem()-&gt;key(),</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">DeltaRef</a>(ours-&gt;peekItem(), other-&gt;peekItem())));</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> }</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> }</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> {</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> differences.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> ours-&gt;peekItem()-&gt;key(),</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">DeltaRef</a>(ours-&gt;peekItem(), <span class="keyword">nullptr</span>)));</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> </div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> differences.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> other-&gt;peekItem()-&gt;key(),</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">DeltaRef</a>(<span class="keyword">nullptr</span>, other-&gt;peekItem())));</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="keywordflow">if</span> (--maxCount &lt;= 0)</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> }</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> }</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode-&gt;isInner() &amp;&amp; otherNode-&gt;isLeaf())</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> {</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keywordflow">if</span> (!walkBranch(</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> ours, other-&gt;peekItem(), <span class="keyword">true</span>, differences, maxCount))</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> }</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode-&gt;isLeaf() &amp;&amp; otherNode-&gt;isInner())</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> {</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keywordflow">if</span> (!otherMap.<a class="code hl_function" href="classripple_1_1SHAMap.html#ae278ac777321e41b9b7b1614e28675e2">walkBranch</a>(</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> other, ours-&gt;peekItem(), <span class="keyword">false</span>, differences, maxCount))</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> }</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode-&gt;isInner() &amp;&amp; otherNode-&gt;isInner())</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> {</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code hl_class" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="keywordflow">if</span> (ours-&gt;getChildHash(i) != other-&gt;getChildHash(i))</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> {</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="keywordflow">if</span> (other-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> {</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="comment">// We have a branch, the other tree does not</span></div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <a class="code hl_class" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>* iNode = descendThrow(ours, i);</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keywordflow">if</span> (!walkBranch(</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> iNode, <span class="keyword">nullptr</span>, <span class="keyword">true</span>, differences, maxCount))</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> }</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ours-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> {</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// The other tree has a branch, we do not</span></div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <a class="code hl_class" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>* iNode = otherMap.<a class="code hl_function" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(other, i);</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <span class="keywordflow">if</span> (!otherMap.<a class="code hl_function" href="classripple_1_1SHAMap.html#ae278ac777321e41b9b7b1614e28675e2">walkBranch</a>(</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> iNode, <span class="keyword">nullptr</span>, <span class="keyword">false</span>, differences, maxCount))</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> }</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="keywordflow">else</span> <span class="comment">// The two trees have different non-empty branches</span></div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> {descendThrow(ours, i),</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> otherMap.<a class="code hl_function" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(other, i)});</div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> }</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> }</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> {</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="comment">// LCOV_EXCL_START</span></div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> UNREACHABLE(<span class="stringliteral">&quot;ripple::SHAMap::compare : invalid node&quot;</span>);</div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="comment">// LCOV_EXCL_STOP</span></div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> }</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> }</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> </div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span>}</div>
</div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> </div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span><span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00226" data-start="{" data-end="}">
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a9f99fac6b2778d1c82353fe773e3b436"> 226</a></span>SHAMap::walkMap(<a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;SHAMapMissingNode&gt;</a>&amp; missingNodes, <span class="keywordtype">int</span> maxMissing)<span class="keyword"></span></div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span><span class="keyword"> const</span></div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="keywordflow">if</span> (!root_-&gt;isInner()) <span class="comment">// root_ is only node, and we have it</span></div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> </div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="keyword">using </span>StackEntry = <a class="code hl_class" href="classripple_1_1SharedIntrusive.html">intr_ptr::SharedPtr&lt;SHAMapInnerNode&gt;</a>;</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;StackEntry, std::vector&lt;StackEntry&gt;</a>&gt; nodeStack;</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> </div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(intr_ptr::static_pointer_cast&lt;SHAMapInnerNode&gt;(root_));</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> </div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="keywordflow">while</span> (!nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> {</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <a class="code hl_class" href="classripple_1_1SharedIntrusive.html">intr_ptr::SharedPtr&lt;SHAMapInnerNode&gt;</a> node = std::move(nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>());</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> </div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> {</div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="keywordflow">if</span> (!node-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> {</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <a class="code hl_class" href="classripple_1_1SharedIntrusive.html">intr_ptr::SharedPtr&lt;SHAMapTreeNode&gt;</a> nextNode =</div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> descendNoStore(*node, i);</div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> </div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="keywordflow">if</span> (nextNode)</div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> {</div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keywordflow">if</span> (nextNode-&gt;isInner())</div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> nodeStack.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> intr_ptr::static_pointer_cast&lt;SHAMapInnerNode&gt;(</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> nextNode));</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> }</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> {</div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> missingNodes.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(type_, node-&gt;getChildHash(i));</div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <span class="keywordflow">if</span> (--maxMissing &lt;= 0)</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> }</div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> }</div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> }</div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> }</div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span>}</div>
</div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> </div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span><span class="keywordtype">bool</span></div>
<div class="foldopen" id="foldopen00268" data-start="{" data-end="}">
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#aa0fcb9d89a9f72e549c92cd38b92561b"> 268</a></span>SHAMap::walkMapParallel(</div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;SHAMapMissingNode&gt;</a>&amp; missingNodes,</div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <span class="keywordtype">int</span> maxMissing)<span class="keyword"> const</span></div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span><span class="keyword"></span>{</div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="keywordflow">if</span> (!root_-&gt;isInner()) <span class="comment">// root_ is only node, and we have it</span></div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> </div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="keyword">using </span>StackEntry = <a class="code hl_class" href="classripple_1_1SharedIntrusive.html">intr_ptr::SharedPtr&lt;SHAMapInnerNode&gt;</a>;</div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;intr_ptr::SharedPtr&lt;SHAMapTreeNode&gt;</a>, 16&gt; topChildren;</div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> {</div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; innerRoot =</div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> intr_ptr::static_pointer_cast&lt;SHAMapInnerNode&gt;(root_);</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> {</div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="keywordflow">if</span> (!innerRoot-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> topChildren[i] = descendNoStore(*innerRoot, i);</div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> }</div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> }</div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::thread&gt;</a> workers;</div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> workers.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">reserve</a>(16);</div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;SHAMapMissingNode&gt;</a> exceptions;</div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> exceptions.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">reserve</a>(16);</div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> </div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::stack&lt;StackEntry, std::vector&lt;StackEntry&gt;</a>&gt;, 16&gt; nodeStacks;</div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> </div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="comment">// This mutex is used inside the worker threads to protect `missingNodes`</span></div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="comment">// and `maxMissing` from race conditions</span></div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/thread/mutex.html">std::mutex</a> m;</div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> </div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> rootChildIndex = 0; rootChildIndex &lt; 16; ++rootChildIndex)</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> {</div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keyword">auto</span> <span class="keyword">const</span>&amp; child = topChildren[rootChildIndex];</div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="keywordflow">if</span> (!child || !child-&gt;isInner())</div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> </div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> nodeStacks[rootChildIndex].push(</div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> intr_ptr::static_pointer_cast&lt;SHAMapInnerNode&gt;(child));</div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> </div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> JLOG(journal_.debug()) &lt;&lt; <span class="stringliteral">&quot;starting worker &quot;</span> &lt;&lt; rootChildIndex;</div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> workers.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/thread/thread.html">std::thread</a>(</div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> [&amp;m, &amp;missingNodes, &amp;maxMissing, &amp;exceptions, <span class="keyword">this</span>](</div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a>&lt;StackEntry, <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;StackEntry&gt;</a>&gt; nodeStack) {</div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <span class="keywordflow">try</span></div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> {</div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="keywordflow">while</span> (!nodeStack.empty())</div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> {</div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> intr_ptr::SharedPtr&lt;SHAMapInnerNode&gt; node =</div>
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> std::move(nodeStack.top());</div>
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> XRPL_ASSERT(</div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> node,</div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> <span class="stringliteral">&quot;ripple::SHAMap::walkMapParallel : non-null node&quot;</span>);</div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> nodeStack.pop();</div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> </div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> for (int i = 0; i &lt; 16; ++i)</div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> {</div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> if (node-&gt;isEmptyBranch(i))</div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> continue;</div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> intr_ptr::SharedPtr&lt;SHAMapTreeNode&gt; nextNode =</div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> descendNoStore(*node, i);</div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> </div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> if (nextNode)</div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> {</div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> if (nextNode-&gt;isInner())</div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> nodeStack.push(</div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> intr_ptr::static_pointer_cast&lt;</div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> SHAMapInnerNode&gt;(nextNode));</div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> }</div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> else</div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> {</div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> std::lock_guard l{m};</div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> missingNodes.emplace_back(</div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> type_, node-&gt;getChildHash(i));</div>
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> if (--maxMissing &lt;= 0)</div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> return;</div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> }</div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> }</div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> }</div>
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> }</div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="keywordflow">catch</span> (<a class="code hl_class" href="classripple_1_1SHAMapMissingNode.html">SHAMapMissingNode</a> <span class="keyword">const</span>&amp; e)</div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> {</div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/thread/lock_guard.html">std::lock_guard</a> l(m);</div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> exceptions.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(e);</div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> }</div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> },</div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> std::move(nodeStacks[rootChildIndex])));</div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> }</div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> </div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/thread/thread.html">std::thread</a>&amp; worker : workers)</div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> worker.<a class="code hl_function" href="namespaceripple.html#a4cb289e93e9411b505381678d14d82d5">join</a>();</div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> </div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/thread/lock_guard.html">std::lock_guard</a> l(m);</div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> <span class="keywordflow">if</span> (exceptions.empty())</div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <a class="code hl_classRef" href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a> ss;</div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> ss &lt;&lt; <span class="stringliteral">&quot;Exception(s) in ledger load: &quot;</span>;</div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; e : exceptions)</div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> ss &lt;&lt; e.what() &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> JLOG(journal_.error()) &lt;&lt; ss.<a class="code hl_functionRef" href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html">str</a>();</div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span>}</div>
</div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> </div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span>} <span class="comment">// namespace ripple</span></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="abasic_stringstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html">ripple::SHAMapInnerNode</a></div><div class="ttdef"><b>Definition</b> <a href="SHAMapInnerNode_8h_source.html#l00015">SHAMapInnerNode.h:17</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapLeafNode_html"><div class="ttname"><a href="classripple_1_1SHAMapLeafNode.html">ripple::SHAMapLeafNode</a></div><div class="ttdef"><b>Definition</b> <a href="SHAMapLeafNode_8h_source.html#l00011">SHAMapLeafNode.h:12</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapMissingNode_html"><div class="ttname"><a href="classripple_1_1SHAMapMissingNode.html">ripple::SHAMapMissingNode</a></div><div class="ttdef"><b>Definition</b> <a href="SHAMapMissingNode_8h_source.html#l00037">SHAMapMissingNode.h:38</a></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#l00031">SHAMapTreeNode.h:32</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapTreeNode_html_a7aff7622ccd8ffd0be9367518b39436e"><div class="ttname"><a href="classripple_1_1SHAMapTreeNode.html#a7aff7622ccd8ffd0be9367518b39436e">ripple::SHAMapTreeNode::isInner</a></div><div class="ttdeci">virtual bool isInner() const =0</div><div class="ttdoc">Determines if this is an inner node.</div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html"><div class="ttname"><a href="classripple_1_1SHAMap.html">ripple::SHAMap</a></div><div class="ttdoc">A SHAMap is both a radix tree with a fan-out of 16 and a Merkle tree.</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00077">SHAMap.h:78</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a26f587d4b772fd02113deb67ff052e20"><div class="ttname"><a href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">ripple::SHAMap::descendThrow</a></div><div class="ttdeci">SHAMapTreeNode * descendThrow(SHAMapInnerNode *, int branch) const</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8cpp_source.html#l00276">SHAMap.cpp:276</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a2ef0103bef7aefba0219c40368fd3688"><div class="ttname"><a href="classripple_1_1SHAMap.html#a2ef0103bef7aefba0219c40368fd3688">ripple::SHAMap::root_</a></div><div class="ttdeci">intr_ptr::SharedPtr&lt; SHAMapTreeNode &gt; root_</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00089">SHAMap.h:89</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a381ecaa70bcce3f24bac35b7fed16985"><div class="ttname"><a href="classripple_1_1SHAMap.html#a381ecaa70bcce3f24bac35b7fed16985">ripple::SHAMap::peekItem</a></div><div class="ttdeci">boost::intrusive_ptr&lt; SHAMapItem const &gt; const &amp; peekItem(uint256 const &amp;id) const</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8cpp_source.html#l00598">SHAMap.cpp:598</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a48dad6728c6fc737381f1cf4040d85ab"><div class="ttname"><a href="classripple_1_1SHAMap.html#a48dad6728c6fc737381f1cf4040d85ab">ripple::SHAMap::DeltaRef</a></div><div class="ttdeci">std::pair&lt; boost::intrusive_ptr&lt; SHAMapItem const &gt;, boost::intrusive_ptr&lt; SHAMapItem const &gt; &gt; DeltaRef</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00353">SHAMap.h:355</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a9b0dff3c3bf35efc30104c93becdc079"><div class="ttname"><a href="classripple_1_1SHAMap.html#a9b0dff3c3bf35efc30104c93becdc079">ripple::SHAMap::getHash</a></div><div class="ttdeci">SHAMapHash getHash() const</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8cpp_source.html#l00871">SHAMap.cpp:871</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_aa36f13285448ce66cdc04a0b7f4d8af7"><div class="ttname"><a href="classripple_1_1SHAMap.html#aa36f13285448ce66cdc04a0b7f4d8af7">ripple::SHAMap::isValid</a></div><div class="ttdeci">bool isValid() const</div><div class="ttdef"><b>Definition</b> <a href="SHAMap_8h_source.html#l00610">SHAMap.h:610</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_ae278ac777321e41b9b7b1614e28675e2"><div class="ttname"><a href="classripple_1_1SHAMap.html#ae278ac777321e41b9b7b1614e28675e2">ripple::SHAMap::walkBranch</a></div><div class="ttdeci">bool walkBranch(SHAMapTreeNode *node, boost::intrusive_ptr&lt; SHAMapItem const &gt; const &amp;otherMapItem, bool isFirstMap, Delta &amp;differences, int &amp;maxCount) const</div><div class="ttdef"><b>Definition</b> <a href="SHAMapDelta_8cpp_source.html#l00020">SHAMapDelta.cpp:20</a></div></div>
<div class="ttc" id="aclassripple_1_1SharedIntrusive_html"><div class="ttname"><a href="classripple_1_1SharedIntrusive.html">ripple::SharedIntrusive</a></div><div class="ttdoc">A shared intrusive pointer class that supports weak pointers.</div><div class="ttdef"><b>Definition</b> <a href="IntrusivePointer_8h_source.html#l00068">IntrusivePointer.h:69</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="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/empty.html">std::stack::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map/insert.html">std::map::insert</a></div><div class="ttdeci">T insert(T... args)</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>
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
<div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></div></div>
<div class="ttc" id="amutex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/mutex.html">std::mutex</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="algorithm_8h_source.html#l00006">algorithm.h:6</a></div></div>
<div class="ttc" id="anamespaceripple_html_a4cb289e93e9411b505381678d14d82d5"><div class="ttname"><a href="namespaceripple.html#a4cb289e93e9411b505381678d14d82d5">ripple::join</a></div><div class="ttdeci">Stream &amp; join(Stream &amp;s, Iter iter, Iter end, std::string const &amp;delimiter)</div><div class="ttdef"><b>Definition</b> <a href="join_8h_source.html#l00010">join.h:10</a></div></div>
<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/pop.html">std::stack::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/push.html">std::stack::push</a></div><div class="ttdeci">T push(T... args)</div></div>
<div class="ttc" id="areserve_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">std::vector::reserve</a></div><div class="ttdeci">T reserve(T... args)</div></div>
<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/header/stack.html">stack</a></div></div>
<div class="ttc" id="astr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html">std::stringstream::str</a></div><div class="ttdeci">T str(T... args)</div></div>
<div class="ttc" id="athread_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/thread.html">std::thread</a></div></div>
<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/top.html">std::stack::top</a></div><div class="ttdeci">T top(T... args)</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/header/vector.html">vector</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8
</small></address>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink