ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-11-25 05:25:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

deploy: 5c8e072b7f

Browse Source
This commit is contained in:
nbougalis
2020-12-05 06:17:37 +00:00
parent 27ba201b4c
commit ee2b4c457d
4211 changed files with 96026 additions and 94287 deletions
Download Patch File Download Diff File Expand all files Collapse all files

183
SHAMapDelta_8cpp_source.html
View File

@@ -102,8 +102,8 @@ $(function() {
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160;<span class="comment">// synchronizing matching branches too.)</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; </div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160;<span class="keywordtype">bool</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#add8d713c827d5748598a63cf654034bc"> 34</a></span>&#160;<a class="code" href="classripple_1_1SHAMap.html#add8d713c827d5748598a63cf654034bc">SHAMap::walkBranch</a>(</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; <a class="code" href="classripple_1_1SHAMapAbstractNode.html">SHAMapAbstractNode</a>* node,</div>
<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b"> 34</a></span>&#160;<a class="code" href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b">SHAMap::walkBranch</a>(</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; <a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>* node,</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a> <span class="keyword">const</span>&amp; otherMapItem,</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; <span class="keywordtype">bool</span> isFirstMap,</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/map.html">Delta</a>&amp; differences,</div>
@@ -111,7 +111,7 @@ $(function() {
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <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 name="l00042"></a><span class="lineno"> 42</span>&#160; <span class="comment">// item in the other map</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;SHAMapAbstractNode*, std::vector&lt;SHAMapAbstractNode*&gt;</a>&gt; nodeStack;</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; <a class="codeRef" 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 name="l00044"></a><span class="lineno"> 44</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(node);</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; </div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="keywordtype">bool</span> emptyBranch = !otherMapItem;</div>
@@ -121,18 +121,18 @@ $(function() {
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; node = nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; </div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">if</span> (node-&gt;<a class="code" href="classripple_1_1SHAMapAbstractNode.html#a12f84ac5268602ad2a3e32e0be7e04c5">isInner</a>())</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">if</span> (node-&gt;<a class="code" href="classripple_1_1SHAMapTreeNode.html#a7aff7622ccd8ffd0be9367518b39436e">isInner</a>())</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; {</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <span class="comment">// This is an inner node, add all non-empty branches</span></div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="keyword">auto</span> inner = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node);</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="keywordflow">if</span> (!inner-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; 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#a482d6fba903e5c0f6c22af7017c21de3">descendThrow</a>(inner, i)});</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; 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="l00060"></a><span class="lineno"> 60</span>&#160; }</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="comment">// This is a leaf node, process its item</span></div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="keyword">auto</span> item = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>*<span class="keyword">&gt;</span>(node)-&gt;<a class="code" href="classripple_1_1SHAMap.html#a122cf539ce917e7a322cfb41c8db3f57">peekItem</a>();</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="keyword">auto</span> item = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(node)-&gt;<a class="code" href="classripple_1_1SHAMap.html#a122cf539ce917e7a322cfb41c8db3f57">peekItem</a>();</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; </div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; <span class="keywordflow">if</span> (emptyBranch || (item-&gt;key() != otherMapItem-&gt;key()))</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; {</div>
@@ -204,11 +204,11 @@ $(function() {
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; <span class="keywordflow">if</span> (getHash() == otherMap.<a class="code" href="classripple_1_1SHAMap.html#a9b0dff3c3bf35efc30104c93becdc079">getHash</a>())</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; </div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; <span class="keyword">using</span> StackEntry = <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;SHAMapAbstractNode*, SHAMapAbstractNode*&gt;</a>;</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; <span class="keyword">using</span> StackEntry = <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;SHAMapTreeNode*, SHAMapTreeNode*&gt;</a>;</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; <a class="codeRef" 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 name="l00138"></a><span class="lineno"> 138</span>&#160; nodeStack; <span class="comment">// track nodes we&#39;ve pushed</span></div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; </div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; 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#a05597cefb4d88231262e1731dd436402">root_</a>.get()});</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; 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="l00141"></a><span class="lineno"> 141</span>&#160; <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="l00142"></a><span class="lineno"> 142</span>&#160; {</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; <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>
@@ -223,8 +223,8 @@ $(function() {
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; <span class="keywordflow">if</span> (ourNode-&gt;isLeaf() &amp;&amp; otherNode-&gt;isLeaf())</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; {</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; <span class="comment">// two leaves</span></div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; <span class="keywordflow">if</span> (ours-&gt;peekItem()-&gt;key() == other-&gt;peekItem()-&gt;key())</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160; {</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; <span class="keywordflow">if</span> (ours-&gt;peekItem()-&gt;peekData() !=</div>
@@ -259,16 +259,16 @@ $(function() {
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode-&gt;isInner() &amp;&amp; otherNode-&gt;isLeaf())</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; {</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; <span class="keywordflow">if</span> (!walkBranch(</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; ours, other-&gt;peekItem(), <span class="keyword">true</span>, differences, maxCount))</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; }</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ourNode-&gt;isLeaf() &amp;&amp; otherNode-&gt;isInner())</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; {</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; <span class="keyword">auto</span> ours = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapLeafNode.html">SHAMapLeafNode</a>*<span class="keyword">&gt;</span>(ourNode);</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <span class="keyword">auto</span> other = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(otherNode);</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; <span class="keywordflow">if</span> (!otherMap.<a class="code" href="classripple_1_1SHAMap.html#add8d713c827d5748598a63cf654034bc">walkBranch</a>(</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; <span class="keywordflow">if</span> (!otherMap.<a class="code" href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b">walkBranch</a>(</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; other, ours-&gt;peekItem(), <span class="keyword">false</span>, differences, maxCount))</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160; }</div>
@@ -282,7 +282,7 @@ $(function() {
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; <span class="keywordflow">if</span> (other-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; {</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; <span class="comment">// We have a branch, the other tree does not</span></div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; <a class="code" href="classripple_1_1SHAMapAbstractNode.html">SHAMapAbstractNode</a>* iNode = descendThrow(ours, i);</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; <a class="code" href="classripple_1_1SHAMapTreeNode.html">SHAMapTreeNode</a>* iNode = descendThrow(ours, i);</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; <span class="keywordflow">if</span> (!walkBranch(</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; iNode,</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a>(),</div>
@@ -294,99 +294,98 @@ $(function() {
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ours-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; {</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160; <span class="comment">// The other tree has a branch, we do not</span></div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; <a class="code" href="classripple_1_1SHAMapAbstractNode.html">SHAMapAbstractNode</a>* iNode =</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; otherMap.<a class="code" href="classripple_1_1SHAMap.html#a482d6fba903e5c0f6c22af7017c21de3">descendThrow</a>(other, i);</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; <span class="keywordflow">if</span> (!otherMap.<a class="code" href="classripple_1_1SHAMap.html#add8d713c827d5748598a63cf654034bc">walkBranch</a>(</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; iNode,</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a>(),</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; <span class="keyword">false</span>,</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; differences,</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; maxCount))</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; }</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; <span class="keywordflow">else</span> <span class="comment">// The two trees have different non-empty branches</span></div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; {descendThrow(ours, i),</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; otherMap.<a class="code" href="classripple_1_1SHAMap.html#a482d6fba903e5c0f6c22af7017c21de3">descendThrow</a>(other, i)});</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160; }</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; }</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; assert(<span class="keyword">false</span>);</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; }</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160; </div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160;}</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; </div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00250"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a9f99fac6b2778d1c82353fe773e3b436"> 250</a></span>&#160;SHAMap::walkMap(<a class="codeRef" 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 name="l00251"></a><span class="lineno"> 251</span>&#160;<span class="keyword"> const</span></div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160; <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 name="l00254"></a><span class="lineno"> 254</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160; </div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160; <span class="keyword">using</span> StackEntry = <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapInnerNode&gt;</a>;</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>&#160; <a class="codeRef" 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 name="l00258"></a><span class="lineno"> 258</span>&#160; </div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(std::static_pointer_cast&lt;SHAMapInnerNode&gt;(root_));</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160; </div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160; <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="l00262"></a><span class="lineno"> 262</span>&#160; {</div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapInnerNode&gt;</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="l00264"></a><span class="lineno"> 264</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; </div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; {</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; <span class="keywordflow">if</span> (!node-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; {</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapAbstractNode&gt;</a> nextNode =</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; descendNoStore(node, i);</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; </div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; <span class="keywordflow">if</span> (nextNode)</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; {</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; <span class="keywordflow">if</span> (nextNode-&gt;isInner())</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; std::static_pointer_cast&lt;SHAMapInnerNode&gt;(</div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; nextNode));</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; }</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160; {</div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160; missingNodes.<a class="codeRef" 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 name="l00283"></a><span class="lineno"> 283</span>&#160; <span class="keywordflow">if</span> (--maxMissing &lt;= 0)</div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; }</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160; }</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160; }</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160; }</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160;}</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160; </div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>&#160;} <span class="comment">// namespace ripple</span></div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; <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="l00227"></a><span class="lineno"> 227</span>&#160; <span class="keywordflow">if</span> (!otherMap.<a class="code" href="classripple_1_1SHAMap.html#ae328c6d5cac6d3aea7054a9c7d2ffb5b">walkBranch</a>(</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; iNode,</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapItem const&gt;</a>(),</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; <span class="keyword">false</span>,</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; differences,</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; maxCount))</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; }</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; <span class="keywordflow">else</span> <span class="comment">// The two trees have different non-empty branches</span></div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; {descendThrow(ours, i),</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; otherMap.<a class="code" href="classripple_1_1SHAMap.html#a26f587d4b772fd02113deb67ff052e20">descendThrow</a>(other, i)});</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; }</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160; }</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; assert(<span class="keyword">false</span>);</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; }</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; </div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160;}</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160; </div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00249"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#a9f99fac6b2778d1c82353fe773e3b436"> 249</a></span>&#160;SHAMap::walkMap(<a class="codeRef" 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 name="l00250"></a><span class="lineno"> 250</span>&#160;<span class="keyword"> const</span></div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160; <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 name="l00253"></a><span class="lineno"> 253</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>&#160; </div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160; <span class="keyword">using</span> StackEntry = <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapInnerNode&gt;</a>;</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160; <a class="codeRef" 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 name="l00257"></a><span class="lineno"> 257</span>&#160; </div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(std::static_pointer_cast&lt;SHAMapInnerNode&gt;(root_));</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; </div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160; <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="l00261"></a><span class="lineno"> 261</span>&#160; {</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapInnerNode&gt;</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="l00263"></a><span class="lineno"> 263</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160; </div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 16; ++i)</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; {</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; <span class="keywordflow">if</span> (!node-&gt;isEmptyBranch(i))</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; {</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;SHAMapTreeNode&gt;</a> nextNode =</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; descendNoStore(node, i);</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; </div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; <span class="keywordflow">if</span> (nextNode)</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; {</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; <span class="keywordflow">if</span> (nextNode-&gt;isInner())</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; nodeStack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; std::static_pointer_cast&lt;SHAMapInnerNode&gt;(</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; nextNode));</div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; }</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160; {</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160; missingNodes.<a class="codeRef" 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 name="l00282"></a><span class="lineno"> 282</span>&#160; <span class="keywordflow">if</span> (--maxMissing &lt;= 0)</div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160; }</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; }</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160; }</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160; }</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160;}</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160; </div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160;} <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#l00522">SHAMap.h:522</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#l00537">SHAMap.h:537</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#l00796">SHAMap.cpp:796</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#l00778">SHAMap.cpp:778</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="aclassripple_1_1SHAMap_html_a482d6fba903e5c0f6c22af7017c21de3"><div class="ttname"><a href="classripple_1_1SHAMap.html#a482d6fba903e5c0f6c22af7017c21de3">ripple::SHAMap::descendThrow</a></div><div class="ttdeci">SHAMapAbstractNode * descendThrow(SHAMapInnerNode *, int branch) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8cpp_source.html#l00261">SHAMap.cpp:261</a></div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div><div class="ttdoc">STL class.</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&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#l00544">SHAMap.cpp:544</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&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#l00556">SHAMap.cpp:556</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_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_1base__uint_html"><div class="ttname"><a href="classripple_1_1base__uint.html">ripple::base_uint&lt; 256 &gt;</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapAbstractNode_html_a12f84ac5268602ad2a3e32e0be7e04c5"><div class="ttname"><a href="classripple_1_1SHAMapAbstractNode.html#a12f84ac5268602ad2a3e32e0be7e04c5">ripple::SHAMapAbstractNode::isInner</a></div><div class="ttdeci">bool isInner() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00364">SHAMapTreeNode.h:364</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&lt; std::shared_ptr&lt; SHAMapItem const &gt; const &amp;, std::shared_ptr&lt; SHAMapItem const &gt; const &amp; &gt; DeltaRef</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00304">SHAMap.h:304</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="SHAMapTreeNode_8h_source.html#l00207">SHAMapTreeNode.h:207</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#l00081">SHAMap.h:81</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&lt; std::shared_ptr&lt; SHAMapItem const &gt; const &amp;, std::shared_ptr&lt; SHAMapItem const &gt; const &amp; &gt; DeltaRef</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00323">SHAMap.h:323</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#l00038">SHAMapInnerNode.h:38</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#l00273">SHAMapTreeNode.h:273</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#l00133">SHAMapTreeNode.h:133</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="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="aclassripple_1_1SHAMap_html_add8d713c827d5748598a63cf654034bc"><div class="ttname"><a href="classripple_1_1SHAMap.html#add8d713c827d5748598a63cf654034bc">ripple::SHAMap::walkBranch</a></div><div class="ttdeci">bool walkBranch(SHAMapAbstractNode *node, std::shared_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#l00034">SHAMapDelta.cpp:34</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="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="aclassripple_1_1SHAMap_html_a05597cefb4d88231262e1731dd436402"><div class="ttname"><a href="classripple_1_1SHAMap.html#a05597cefb4d88231262e1731dd436402">ripple::SHAMap::root_</a></div><div class="ttdeci">std::shared_ptr&lt; SHAMapAbstractNode &gt; root_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00088">SHAMap.h:88</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapAbstractNode_html"><div class="ttname"><a href="classripple_1_1SHAMapAbstractNode.html">ripple::SHAMapAbstractNode</a></div><div class="ttdef"><b>Definition:</b> <a href="SHAMapTreeNode_8h_source.html#l00122">SHAMapTreeNode.h:122</a></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="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&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#l00034">SHAMapDelta.cpp:34</a></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&lt; SHAMapTreeNode &gt; 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 &#160;<a href="http://www.doxygen.org/index.html">