mirror of
https://github.com/XRPLF/rippled.git
synced 2025-11-22 12:05:53 +00:00
509 lines
75 KiB
HTML
509 lines
75 KiB
HTML
<!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: 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 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&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&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">SHAMapDelta.cpp</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">/*</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <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> <span class="comment"> Copyright (c) 2012, 2013 Ripple Labs Inc.</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <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> <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> <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> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <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> <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> <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> <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> <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> <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> <span class="comment">*/</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">//==============================================================================</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  </div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <ripple/basics/contract.h></span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <ripple/shamap/SHAMap.h></span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  </div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <<a class="codeRef" href="http://en.cppreference.com/w/cpp/header/array.html">array</a>></span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <<a class="codeRef" href="http://en.cppreference.com/w/cpp/header/stack.html">stack</a>></span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <<a class="codeRef" href="http://en.cppreference.com/w/cpp/header/vector.html">vector</a>></span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span><a class="code" href="namespaceripple.html">ripple</a> {</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  </div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// This code is used to compare another node's transaction tree</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// to our own. It returns a map containing all items that are different</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// between two SHA maps. It is optimized not to descend down tree</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// branches with the same branch hash. A limit can be passed so</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// that we will abort early if a node sends a map to us that</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// makes no sense at all. (And our sync algorithm will avoid</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// synchronizing matching branches too.)</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  </div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keywordtype">bool</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b"> 38</a></span> <a class="code" href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b">SHAMap::walkBranch</a>(</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>* node,</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapItem const></a> <span class="keyword">const</span>& otherMapItem,</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keywordtype">bool</span> isFirstMap,</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map.html">Delta</a>& differences,</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordtype">int</span>& maxCount)<span class="keyword"> const</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keyword"></span>{</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// Walk a branch of a SHAMap that's matched by an empty branch or single</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// item in the other map</span></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack<SHAMapTreeNode*, std::vector<SHAMapTreeNode*></a>> nodeStack;</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(node);</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  </div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordtype">bool</span> emptyBranch = !otherMapItem;</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  </div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">while</span> (!nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  {</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  node = nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  </div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">if</span> (node-><a class="code" href="classripple_1_1SHAMapTreeNode.html#a7aff7622ccd8ffd0be9367518b39436e">isInner</a>())</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  {</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// This is an inner node, add all non-empty branches</span></div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">auto</span> inner = <span class="keyword">static_cast<</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">></span>(node);</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 16; ++i)</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">if</span> (!inner->isEmptyBranch(i))</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>({<a class="code" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(inner, i)});</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  }</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">else</span></div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  {</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="comment">// This is a leaf node, process its item</span></div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">auto</span> item = <span class="keyword">static_cast<</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">></span>(node)-><a class="code" href="classripple_1_1SHAMap.html#a122cf539ce917e7a322cfb41c8db3f57">peekItem</a>();</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  </div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">if</span> (emptyBranch || (item->key() != otherMapItem->key()))</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  {</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// unmatched</span></div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (isFirstMap)</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  item->key(),</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="classripple_1_1SHAMap.html#af97eaa11f0ba83945729dc0f5af2b193">DeltaRef</a>(item, <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapItem const></a>())));</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">else</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  item->key(),</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <a class="code" href="classripple_1_1SHAMap.html#af97eaa11f0ba83945729dc0f5af2b193">DeltaRef</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapItem const></a>(), item)));</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  </div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">if</span> (--maxCount <= 0)</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (item->slice() != otherMapItem->slice())</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  {</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// non-matching items with same tag</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">if</span> (isFirstMap)</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  item->key(), <a class="code" href="classripple_1_1SHAMap.html#af97eaa11f0ba83945729dc0f5af2b193">DeltaRef</a>(item, otherMapItem)));</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">else</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  item->key(), <a class="code" href="classripple_1_1SHAMap.html#af97eaa11f0ba83945729dc0f5af2b193">DeltaRef</a>(otherMapItem, item)));</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  </div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (--maxCount <= 0)</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  </div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  emptyBranch = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  }</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">else</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  {</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// exact match</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  emptyBranch = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  </div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">if</span> (!emptyBranch)</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  {</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// otherMapItem was unmatched, must add</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</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 name="l00112"></a><span class="lineno"> 112</span>  differences.insert(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  otherMapItem->key(),</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  DeltaRef(<a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapItem const></a>(), otherMapItem)));</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">else</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  differences.insert(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  otherMapItem->key(),</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  DeltaRef(otherMapItem, <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapItem const></a>())));</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  </div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (--maxCount <= 0)</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  </div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> }</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  </div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="keywordtype">bool</span></div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a09a39196247b7d775f001db67eb37882"> 128</a></span> SHAMap::compare(<a class="code" href="classripple_1_1SHAMap.html">SHAMap</a> <span class="keyword">const</span>& otherMap, <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map.html">Delta</a>& differences, <span class="keywordtype">int</span> maxCount)<span class="keyword"> const</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="keyword"></span>{</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">// compare two hash trees, add up to maxCount differences to the difference</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">// table return value: true=complete table of differences given, false=too</span></div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="comment">// many differences throws on corrupt tables or missing nodes CAUTION:</span></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="comment">// otherMap is not locked and must be immutable</span></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  </div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  assert(isValid() && otherMap.<a class="code" href="classripple_1_1SHAMap.html#aa36f13285448ce66cdc04a0b7f4d8af7">isValid</a>());</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  </div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">if</span> (getHash() == otherMap.<a class="code" href="classripple_1_1SHAMap.html#a9b0dff3c3bf35efc30104c93becdc079">getHash</a>())</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  </div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">using</span> StackEntry = <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<SHAMapTreeNode*, SHAMapTreeNode*></a>;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack<StackEntry, std::vector<StackEntry></a>></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  nodeStack; <span class="comment">// track nodes we've pushed</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  </div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>({root_.get(), otherMap.<a class="code" href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">root_</a>.get()});</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">while</span> (!nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  {</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">auto</span> [ourNode, otherNode] = nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  </div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">if</span> (!ourNode || !otherNode)</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  {</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  assert(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  Throw<SHAMapMissingNode>(type_, <a class="code" href="classripple_1_1base__uint.html">uint256</a>());</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  </div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (ourNode->isLeaf() && otherNode->isLeaf())</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  {</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// two leaves</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">auto</span> ours = <span class="keyword">static_cast<</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">></span>(ourNode);</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keyword">auto</span> other = <span class="keyword">static_cast<</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">></span>(otherNode);</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">if</span> (ours->peekItem()->key() == other->peekItem()->key())</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  {</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">if</span> (ours->peekItem()->slice() != other->peekItem()->slice())</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  {</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  ours->peekItem()->key(),</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">DeltaRef</a>(ours->peekItem(), other->peekItem())));</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">if</span> (--maxCount <= 0)</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  }</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">else</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  {</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  ours->peekItem()->key(),</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">DeltaRef</a>(</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  ours->peekItem(),</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapItem const></a>())));</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">if</span> (--maxCount <= 0)</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  </div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  differences.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  other->peekItem()->key(),</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">DeltaRef</a>(</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapItem const></a>(),</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  other->peekItem())));</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span> (--maxCount <= 0)</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  }</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  }</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode->isInner() && otherNode->isLeaf())</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  {</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">auto</span> ours = <span class="keyword">static_cast<</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">></span>(ourNode);</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">auto</span> other = <span class="keyword">static_cast<</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">></span>(otherNode);</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">if</span> (!walkBranch(</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  ours, other->peekItem(), <span class="keyword">true</span>, differences, maxCount))</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode->isLeaf() && otherNode->isInner())</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  {</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">auto</span> ours = <span class="keyword">static_cast<</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">></span>(ourNode);</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keyword">auto</span> other = <span class="keyword">static_cast<</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">></span>(otherNode);</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">if</span> (!otherMap.<a class="code" href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b">walkBranch</a>(</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  other, ours->peekItem(), <span class="keyword">false</span>, differences, maxCount))</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode->isInner() && otherNode->isInner())</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  {</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keyword">auto</span> ours = <span class="keyword">static_cast<</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">></span>(ourNode);</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">auto</span> other = <span class="keyword">static_cast<</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">></span>(otherNode);</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 16; ++i)</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">if</span> (ours->getChildHash(i) != other->getChildHash(i))</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  {</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">if</span> (other->isEmptyBranch(i))</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  {</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// We have a branch, the other tree does not</span></div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>* iNode = descendThrow(ours, i);</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">if</span> (!walkBranch(</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  iNode,</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapItem const></a>(),</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">true</span>,</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  differences,</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  maxCount))</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ours->isEmptyBranch(i))</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  {</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">// The other tree has a branch, we do not</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>* iNode = otherMap.<a class="code" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(other, i);</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">if</span> (!otherMap.<a class="code" href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b">walkBranch</a>(</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  iNode,</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapItem const></a>(),</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keyword">false</span>,</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  differences,</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  maxCount))</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  }</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">else</span> <span class="comment">// The two trees have different non-empty branches</span></div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  {descendThrow(ours, i),</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  otherMap.<a class="code" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(other, i)});</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  }</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">else</span></div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  assert(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  }</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  </div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span> }</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  </div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="keywordtype">void</span></div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a9f99fac6b2778d1c82353fe773e3b436"> 252</a></span> SHAMap::walkMap(<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<SHAMapMissingNode></a>& missingNodes, <span class="keywordtype">int</span> maxMissing)<span class="keyword"></span></div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="keyword"> const</span></div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="keyword"></span>{</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">if</span> (!root_->isInner()) <span class="comment">// root_ is only node, and we have it</span></div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  </div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">using</span> StackEntry = <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapInnerNode></a>;</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack<StackEntry, std::vector<StackEntry></a>> nodeStack;</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  </div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(std::static_pointer_cast<SHAMapInnerNode>(root_));</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  </div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">while</span> (!nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  {</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapInnerNode></a> node = std::move(nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>());</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  </div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 16; ++i)</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  {</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">if</span> (!node->isEmptyBranch(i))</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  {</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapTreeNode></a> nextNode =</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  descendNoStore(node, i);</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  </div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">if</span> (nextNode)</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  {</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">if</span> (nextNode->isInner())</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  std::static_pointer_cast<SHAMapInnerNode>(</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  nextNode));</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">else</span></div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  {</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  missingNodes.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(type_, node->getChildHash(i));</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">if</span> (--maxMissing <= 0)</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  }</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span> }</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  </div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="keywordtype">bool</span></div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#aa0fcb9d89a9f72e549c92cd38b92561b"> 294</a></span> SHAMap::walkMapParallel(</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<SHAMapMissingNode></a>& missingNodes,</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordtype">int</span> maxMissing)<span class="keyword"> const</span></div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="keyword"></span>{</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">if</span> (!root_->isInner()) <span class="comment">// root_ is only node, and we have it</span></div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  </div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">using</span> StackEntry = <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<SHAMapInnerNode></a>;</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::shared_ptr<SHAMapTreeNode></a>, 16> topChildren;</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  {</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keyword">auto</span> <span class="keyword">const</span>& innerRoot =</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  std::static_pointer_cast<SHAMapInnerNode>(root_);</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 16; ++i)</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  {</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">if</span> (!innerRoot->isEmptyBranch(i))</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  topChildren[i] = descendNoStore(innerRoot, i);</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  }</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  }</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::thread></a> workers;</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  workers.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">reserve</a>(16);</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<SHAMapMissingNode></a> exceptions;</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  exceptions.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">reserve</a>(16);</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  </div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::stack<StackEntry, std::vector<StackEntry></a>>, 16> nodeStacks;</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  </div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// This mutex is used inside the worker threads to protect `missingNodes`</span></div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="comment">// and `maxMissing` from race conditions</span></div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/mutex.html">std::mutex</a> m;</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  </div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> rootChildIndex = 0; rootChildIndex < 16; ++rootChildIndex)</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  {</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keyword">auto</span> <span class="keyword">const</span>& child = topChildren[rootChildIndex];</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">if</span> (!child || !child->isInner())</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  nodeStacks[rootChildIndex].push(</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  std::static_pointer_cast<SHAMapInnerNode>(child));</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  </div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  JLOG(journal_.debug()) << <span class="stringliteral">"starting worker "</span> << rootChildIndex;</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  workers.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/thread.html">std::thread</a>(</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  [&m, &missingNodes, &maxMissing, &exceptions, <span class="keyword">this</span>](</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a><StackEntry, <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<StackEntry></a>> nodeStack) {</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">try</span></div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  {</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">while</span> (!nodeStack.empty())</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  {</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  std::shared_ptr<SHAMapInnerNode> node =</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  std::move(nodeStack.top());</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  assert(node);</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  nodeStack.pop();</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  </div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  for (int i = 0; i < 16; ++i)</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  {</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  if (node->isEmptyBranch(i))</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  continue;</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  std::shared_ptr<SHAMapTreeNode> nextNode =</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  descendNoStore(node, i);</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  </div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  if (nextNode)</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  {</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  if (nextNode->isInner())</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  nodeStack.push(std::static_pointer_cast<</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  SHAMapInnerNode>(nextNode));</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  }</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  else</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  {</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  std::lock_guard l{m};</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  missingNodes.emplace_back(</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  type_, node->getChildHash(i));</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  if (--maxMissing <= 0)</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  return;</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  }</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  }</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  }</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">catch</span> (<a class="code" href="classripple_1_1SHAMapMissingNode.html">SHAMapMissingNode</a> <span class="keyword">const</span>& e)</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  {</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/lock_guard.html">std::lock_guard</a> l(m);</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  exceptions.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(e);</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  }</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  },</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  std::move(nodeStacks[rootChildIndex])));</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  }</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  </div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">for</span> (<a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/thread.html">std::thread</a>& worker : workers)</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  worker.<a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/thread/join.html">join</a>();</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  </div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/thread/lock_guard.html">std::lock_guard</a> l(m);</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">if</span> (exceptions.empty())</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <a class="codeRef" href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a> ss;</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  ss << <span class="stringliteral">"Exception(s) in ledger load: "</span>;</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>& e : exceptions)</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  ss << e.what() << <span class="stringliteral">", "</span>;</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  JLOG(journal_.error()) << ss.<a class="codeRef" href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html">str</a>();</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span> }</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  </div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span> } <span class="comment">// namespace ripple</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<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#l00611">SHAMap.h:611</a></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="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#l00845">SHAMap.cpp:845</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="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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/header/vector.html">vector</a></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="aclassripple_1_1SHAMap_html_a122cf539ce917e7a322cfb41c8db3f57"><div class="ttname"><a href="classripple_1_1SHAMap.html#a122cf539ce917e7a322cfb41c8db3f57">ripple::SHAMap::peekItem</a></div><div class="ttdeci">std::shared_ptr< SHAMapItem const > const & peekItem(uint256 const &id) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8cpp_source.html#l00586">SHAMap.cpp:586</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 class="ttdoc">STL class.</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_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_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#l00032">SHAMapLeafNode.h:32</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#l00055">SHAMapMissingNode.h:55</a></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="aclassripple_1_1base__uint_html"><div class="ttname"><a href="classripple_1_1base__uint.html">ripple::base_uint< 256 ></a></div></div>
|
|
<div class="ttc" id="aclassripple_1_1SHAMap_html_af97eaa11f0ba83945729dc0f5af2b193"><div class="ttname"><a href="classripple_1_1SHAMap.html#af97eaa11f0ba83945729dc0f5af2b193">ripple::SHAMap::DeltaRef</a></div><div class="ttdeci">std::pair< std::shared_ptr< SHAMapItem const > const &, std::shared_ptr< SHAMapItem const > const & > DeltaRef</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00359">SHAMap.h:359</a></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 class="ttdoc">STL class.</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#l00039">SHAMapInnerNode.h:39</a></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#l00095">SHAMap.h:95</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="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="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#l00053">SHAMapTreeNode.h:53</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_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#l00283">SHAMap.cpp:283</a></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 class="ttdoc">STL class.</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="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="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="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="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="amutex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/mutex.html">std::mutex</a></div><div class="ttdoc">STL class.</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="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="aclassripple_1_1SHAMap_html_ae328c6d5cac6d3aea7054a9c7d2ffb5b"><div class="ttname"><a href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b">ripple::SHAMap::walkBranch</a></div><div class="ttdeci">bool walkBranch(SHAMapTreeNode *node, std::shared_ptr< SHAMapItem const > const &otherMapItem, bool isFirstMap, Delta &differences, int &maxCount) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapDelta_8cpp_source.html#l00038">SHAMapDelta.cpp:38</a></div></div>
|
|
<div class="ttc" id="ajoin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/thread/join.html">std::thread::join</a></div><div class="ttdeci">T join(T... args)</div></div>
|
|
<div class="ttc" id="aclassripple_1_1SHAMap_html_a5b5f477358f0d5ce1b24d0888ffefb1d"><div class="ttname"><a href="classripple_1_1SHAMap.html#a5b5f477358f0d5ce1b24d0888ffefb1d">ripple::SHAMap::root_</a></div><div class="ttdeci">std::shared_ptr< SHAMapTreeNode > root_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00107">SHAMap.h:107</a></div></div>
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
Generated by  <a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/>
|
|
</a> 1.8.17
|
|
</small></address>
|
|
</body>
|
|
</html>
|