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

deploy: 68286df23d

Browse Source
This commit is contained in:
manojsdoshi
2021-01-27 00:52:49 +00:00
parent 46ee4c24ed
commit 7ffc2e332b
2825 changed files with 90173 additions and 62954 deletions
Download Patch File Download Diff File Expand all files Collapse all files

113
SHAMapSync_8cpp_source.html
View File

@@ -851,37 +851,121 @@ $(function() {
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>&#160; <span class="comment">// already</span></div>
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>&#160;}</div>
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>&#160; </div>
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>&#160;} <span class="comment">// namespace ripple</span></div>
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>&#160;<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/optional.html">std::optional&lt;std::vector&lt;Blob&gt;</a>&gt;</div>
<div class="line"><a name="l00792"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#afcf889076d5459b52eb9eb8248344f5c"> 792</a></span>&#160;SHAMap::getProofPath(<a class="code" href="classripple_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; key)<span class="keyword"> const</span></div>
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>&#160;<span class="keyword"></span>{</div>
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack.html">SharedPtrNodeStack</a> stack;</div>
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>&#160; walkTowardsKey(key, &amp;stack);</div>
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>&#160; </div>
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>&#160; <span class="keywordflow">if</span> (stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>&#160; {</div>
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>&#160; JLOG(journal_.debug()) &lt;&lt; <span class="stringliteral">&quot;no path to &quot;</span> &lt;&lt; key;</div>
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>&#160; <span class="keywordflow">return</span> {};</div>
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>&#160; }</div>
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>&#160; </div>
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>&#160; <span class="keywordflow">if</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; node = stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>().<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">first</a>; !node || node-&gt;isInner() ||</div>
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>&#160; std::static_pointer_cast&lt;SHAMapLeafNode&gt;(node)-&gt;peekItem()-&gt;key() !=</div>
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>&#160; key)</div>
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>&#160; {</div>
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>&#160; JLOG(journal_.debug()) &lt;&lt; <span class="stringliteral">&quot;no path to &quot;</span> &lt;&lt; key;</div>
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>&#160; <span class="keywordflow">return</span> {};</div>
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>&#160; }</div>
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>&#160; </div>
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Blob&gt;</a> path;</div>
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>&#160; path.reserve(stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/size.html">size</a>());</div>
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>&#160; <span class="keywordflow">while</span> (!stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>())</div>
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>&#160; {</div>
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>&#160; <a class="code" href="classripple_1_1Serializer.html">Serializer</a> s;</div>
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>().<a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">first</a>-&gt;serializeForWire(s);</div>
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>&#160; path.emplace_back(std::move(s.<a class="code" href="classripple_1_1Serializer.html#a6d7436e5990cb278bd924cef9396df3c">modData</a>()));</div>
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>&#160; stack.<a class="codeRef" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>&#160; }</div>
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>&#160; </div>
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>&#160; JLOG(journal_.debug()) &lt;&lt; <span class="stringliteral">&quot;getPath for key &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot;, path length &quot;</span></div>
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>&#160; &lt;&lt; path.size();</div>
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>&#160; <span class="keywordflow">return</span> path;</div>
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>&#160;}</div>
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>&#160; </div>
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>&#160;<span class="keywordtype">bool</span></div>
<div class="line"><a name="l00827"></a><span class="lineno"><a class="line" href="classripple_1_1SHAMap.html#af382ac10dccf3f4b82c64548cd05a677"> 827</a></span>&#160;SHAMap::verifyProofPath(</div>
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>&#160; <a class="code" href="classripple_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; rootHash,</div>
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>&#160; <a class="code" href="classripple_1_1base__uint.html">uint256</a> <span class="keyword">const</span>&amp; key,</div>
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>&#160; <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Blob&gt;</a> <span class="keyword">const</span>&amp; path)</div>
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>&#160;{</div>
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>&#160; <span class="keywordflow">if</span> (path.empty() || path.size() &gt; 65)</div>
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>&#160; </div>
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>&#160; <a class="code" href="classripple_1_1SHAMapHash.html">SHAMapHash</a> hash{rootHash};</div>
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>&#160; <span class="keywordflow">try</span></div>
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>&#160; {</div>
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> rit = path.rbegin(); rit != path.rend(); ++rit)</div>
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>&#160; {</div>
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>&#160; <span class="keyword">auto</span> <span class="keyword">const</span>&amp; blob = *rit;</div>
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>&#160; <span class="keyword">auto</span> node = SHAMapTreeNode::makeFromWire(<a class="code" href="namespaceripple.html#aabe37451093c21757855542d68fba3ce">makeSlice</a>(blob));</div>
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>&#160; <span class="keywordflow">if</span> (!node)</div>
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>&#160; node-&gt;updateHash();</div>
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>&#160; <span class="keywordflow">if</span> (node-&gt;getHash() != hash)</div>
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>&#160; </div>
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>&#160; <span class="keyword">auto</span> depth = <a class="codeRef" href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a>(path.rbegin(), rit);</div>
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>&#160; <span class="keywordflow">if</span> (node-&gt;isInner())</div>
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>&#160; {</div>
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>&#160; <span class="keyword">auto</span> nodeId = SHAMapNodeID::createID(depth, key);</div>
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>&#160; hash = <span class="keyword">static_cast&lt;</span><a class="code" href="classripple_1_1SHAMapInnerNode.html">SHAMapInnerNode</a>*<span class="keyword">&gt;</span>(node.get())</div>
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>&#160; -&gt;getChildHash(<a class="code" href="namespaceripple.html#a179c66641961c1b976e7c050860064a3">selectBranch</a>(nodeId, key));</div>
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>&#160; }</div>
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>&#160; {</div>
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>&#160; <span class="comment">// should exhaust all the blobs now</span></div>
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>&#160; <span class="keywordflow">return</span> depth + 1 == path.size();</div>
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>&#160; }</div>
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>&#160; }</div>
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>&#160; }</div>
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>&#160; <span class="keywordflow">catch</span> (<a class="codeRef" href="http://en.cppreference.com/w/cpp/error/exception.html">std::exception</a> <span class="keyword">const</span>&amp;)</div>
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>&#160; {</div>
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>&#160; <span class="comment">// the data in the path may come from the network,</span></div>
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>&#160; <span class="comment">// exception could be thrown when parsing the data</span></div>
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>&#160; }</div>
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>&#160;}</div>
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>&#160; </div>
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>&#160;} <span class="comment">// namespace ripple</span></div>
</div><!-- fragment --></div><!-- contents -->
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html">ripple::SHAMap::MissingNodes</a></div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00443">SHAMap.h:443</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html">ripple::SHAMap::MissingNodes</a></div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00465">SHAMap.h:465</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapAddNode_html"><div class="ttname"><a href="classripple_1_1SHAMapAddNode.html">ripple::SHAMapAddNode</a></div><div class="ttdef"><b>Definition:</b> <a href="SHAMapAddNode_8h_source.html#l00028">SHAMapAddNode.h:28</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a033dc682ae2682f64b8e8973ae7bdc2b"><div class="ttname"><a href="classripple_1_1SHAMap.html#a033dc682ae2682f64b8e8973ae7bdc2b">ripple::SHAMap::visitDifferences</a></div><div class="ttdeci">void visitDifferences(SHAMap const *have, std::function&lt; bool(SHAMapTreeNode const &amp;)&gt;) const</div><div class="ttdoc">Visit every node in this SHAMap that is not present in the specified SHAMap.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapSync_8cpp_source.html#l00101">SHAMapSync.cpp:101</a></div></div>
<div class="ttc" id="amake_tuple_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a></div><div class="ttdeci">T make_tuple(T... args)</div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_aa3221154f0a1742601dba0160b900ae1"><div class="ttname"><a href="classripple_1_1SHAMap.html#aa3221154f0a1742601dba0160b900ae1">ripple::SHAMap::descendNoStore</a></div><div class="ttdeci">std::shared_ptr&lt; SHAMapTreeNode &gt; descendNoStore(std::shared_ptr&lt; SHAMapInnerNode &gt; const &amp;, int branch) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8cpp_source.html#l00340">SHAMap.cpp:340</a></div></div>
<div class="ttc" id="anamespaceripple_html_a6eaff79c38106bc3b27326d878c902d3a7c6c2e5d48ab37a007cbf70d3ea25fa4"><div class="ttname"><a href="namespaceripple.html#a6eaff79c38106bc3b27326d878c902d3a7c6c2e5d48ab37a007cbf70d3ea25fa4">ripple::ListDisposition::pending</a></div><div class="ttdeci">@ pending</div><div class="ttdoc">List will be valid in the future.</div></div>
<div class="ttc" id="anamespaceripple_html_aabe37451093c21757855542d68fba3ce"><div class="ttname"><a href="namespaceripple.html#aabe37451093c21757855542d68fba3ce">ripple::makeSlice</a></div><div class="ttdeci">std::enable_if_t&lt; std::is_same&lt; T, char &gt;::value||std::is_same&lt; T, unsigned char &gt;::value, Slice &gt; makeSlice(std::array&lt; T, N &gt; const &amp;a)</div><div class="ttdef"><b>Definition:</b> <a href="Slice_8h_source.html#l00240">Slice.h:240</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapNodeID_html_a23e606ffcd8a863d0f678f040001aedf"><div class="ttname"><a href="classripple_1_1SHAMapNodeID.html#a23e606ffcd8a863d0f678f040001aedf">ripple::SHAMapNodeID::getChildNodeID</a></div><div class="ttdeci">SHAMapNodeID getChildNodeID(unsigned int m) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapNodeID_8cpp_source.html#l00074">SHAMapNodeID.cpp:74</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a2ed60db474e8c9072068402313d16d0d"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a2ed60db474e8c9072068402313d16d0d">ripple::SHAMap::MissingNodes::deferLock_</a></div><div class="ttdeci">std::mutex deferLock_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00483">SHAMap.h:483</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a2ed60db474e8c9072068402313d16d0d"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a2ed60db474e8c9072068402313d16d0d">ripple::SHAMap::MissingNodes::deferLock_</a></div><div class="ttdeci">std::mutex deferLock_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00505">SHAMap.h:505</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_a0b1d68d0723680664e14401c86625b9f"><div class="ttname"><a href="classripple_1_1SHAMap.html#a0b1d68d0723680664e14401c86625b9f">ripple::SHAMap::backed_</a></div><div class="ttdeci">bool backed_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00110">SHAMap.h:110</a></div></div>
<div class="ttc" id="aexception_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/exception.html">std::exception</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="anamespaceripple_html_a179c66641961c1b976e7c050860064a3"><div class="ttname"><a href="namespaceripple.html#a179c66641961c1b976e7c050860064a3">ripple::selectBranch</a></div><div class="ttdeci">unsigned int selectBranch(SHAMapNodeID const &amp;id, uint256 const &amp;hash)</div><div class="ttdoc">Returns the branch that would contain the given hash.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapNodeID_8cpp_source.html#l00121">SHAMapNodeID.cpp:121</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a1053cf953a1f9d97319bd05fd1ee7510"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">ripple::SHAMap::MissingNodes::stack_</a></div><div class="ttdeci">std::stack&lt; StackEntry, std::deque&lt; StackEntry &gt; &gt; stack_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00473">SHAMap.h:473</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a1053cf953a1f9d97319bd05fd1ee7510"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a1053cf953a1f9d97319bd05fd1ee7510">ripple::SHAMap::MissingNodes::stack_</a></div><div class="ttdeci">std::stack&lt; StackEntry, std::deque&lt; StackEntry &gt; &gt; stack_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00495">SHAMap.h:495</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a8a20e910f929701bee2a43d408dd7afa"><div class="ttname"><a href="classripple_1_1SHAMap.html#a8a20e910f929701bee2a43d408dd7afa">ripple::SHAMap::hasInnerNode</a></div><div class="ttdeci">bool hasInnerNode(SHAMapNodeID const &amp;nodeID, SHAMapHash const &amp;hash) const</div><div class="ttdoc">Does this map have this inner node?</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapSync_8cpp_source.html#l00740">SHAMapSync.cpp:740</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a2a4e6a108abbbee0b809c01349de9dbc"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">ripple::SHAMap::MissingNodes::deferred_</a></div><div class="ttdeci">int deferred_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00482">SHAMap.h:482</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a2a4e6a108abbbee0b809c01349de9dbc"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a2a4e6a108abbbee0b809c01349de9dbc">ripple::SHAMap::MissingNodes::deferred_</a></div><div class="ttdeci">int deferred_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00504">SHAMap.h:504</a></div></div>
<div class="ttc" id="aclassripple_1_1Serializer_html_a6d7436e5990cb278bd924cef9396df3c"><div class="ttname"><a href="classripple_1_1Serializer.html#a6d7436e5990cb278bd924cef9396df3c">ripple::Serializer::modData</a></div><div class="ttdeci">Blob &amp; modData()</div><div class="ttdef"><b>Definition:</b> <a href="Serializer_8h_source.html#l00176">Serializer.h:176</a></div></div>
<div class="ttc" id="aclassripple_1_1Slice_html"><div class="ttname"><a href="classripple_1_1Slice.html">ripple::Slice</a></div><div class="ttdoc">An immutable linear range of bytes.</div><div class="ttdef"><b>Definition:</b> <a href="Slice_8h_source.html#l00044">Slice.h:44</a></div></div>
<div class="ttc" id="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="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="astructripple_1_1SHAMap_1_1MissingNodes_html_ac6ae00f4088ecc66b71cf9c69b2e7afe"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ac6ae00f4088ecc66b71cf9c69b2e7afe">ripple::SHAMap::MissingNodes::maxDefer_</a></div><div class="ttdeci">const int maxDefer_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00453">SHAMap.h:453</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a6394397a34fe323b6ef27b77c21d38d5"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a6394397a34fe323b6ef27b77c21d38d5">ripple::SHAMap::MissingNodes::generation_</a></div><div class="ttdeci">std::uint32_t generation_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00454">SHAMap.h:454</a></div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/size.html">std::stack::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_ac6ae00f4088ecc66b71cf9c69b2e7afe"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ac6ae00f4088ecc66b71cf9c69b2e7afe">ripple::SHAMap::MissingNodes::maxDefer_</a></div><div class="ttdeci">const int maxDefer_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00475">SHAMap.h:475</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a6394397a34fe323b6ef27b77c21d38d5"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a6394397a34fe323b6ef27b77c21d38d5">ripple::SHAMap::MissingNodes::generation_</a></div><div class="ttdeci">std::uint32_t generation_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00476">SHAMap.h:476</a></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#l00561">SHAMap.cpp:561</a></div></div>
<div class="ttc" id="aemplace_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/emplace.html">std::stack::emplace</a></div><div class="ttdeci">T emplace(T... args)</div></div>
<div class="ttc" id="adistance_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a></div><div class="ttdeci">T distance(T... args)</div></div>
<div class="ttc" id="atuple_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple.html">std::tuple</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_ade7ed01ff01b6207f63f5d7919c3f987"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ade7ed01ff01b6207f63f5d7919c3f987">ripple::SHAMap::MissingNodes::finishedReads_</a></div><div class="ttdeci">std::vector&lt; DeferredNode &gt; finishedReads_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00485">SHAMap.h:485</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_ade7ed01ff01b6207f63f5d7919c3f987"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ade7ed01ff01b6207f63f5d7919c3f987">ripple::SHAMap::MissingNodes::finishedReads_</a></div><div class="ttdeci">std::vector&lt; DeferredNode &gt; finishedReads_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00507">SHAMap.h:507</a></div></div>
<div class="ttc" id="afunction_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a></div></div>
<div class="ttc" id="aclassripple_1_1Family_html_ac16fa71cf792d5716da74e9164707769"><div class="ttname"><a href="classripple_1_1Family.html#ac16fa71cf792d5716da74e9164707769">ripple::Family::getFullBelowCache</a></div><div class="ttdeci">virtual std::shared_ptr&lt; FullBelowCache &gt; getFullBelowCache(std::uint32_t ledgerSeq)=0</div><div class="ttdoc">Return a pointer to the Family Full Below Cache.</div></div>
<div class="ttc" id="aclassripple_1_1SHAMapNodeID_html"><div class="ttname"><a href="classripple_1_1SHAMapNodeID.html">ripple::SHAMapNodeID</a></div><div class="ttdoc">Identifies a node inside a SHAMap.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapNodeID_8h_source.html#l00033">SHAMapNodeID.h:33</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_ad9c9b5733c3b993c3d4e46b0695ae116"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ad9c9b5733c3b993c3d4e46b0695ae116">ripple::SHAMap::MissingNodes::filter_</a></div><div class="ttdeci">SHAMapSyncFilter * filter_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00452">SHAMap.h:452</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_ad9c9b5733c3b993c3d4e46b0695ae116"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ad9c9b5733c3b993c3d4e46b0695ae116">ripple::SHAMap::MissingNodes::filter_</a></div><div class="ttdeci">SHAMapSyncFilter * filter_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00474">SHAMap.h:474</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapTreeNode_html_a7aff7622ccd8ffd0be9367518b39436e"><div class="ttname"><a href="classripple_1_1SHAMapTreeNode.html#a7aff7622ccd8ffd0be9367518b39436e">ripple::SHAMapTreeNode::isInner</a></div><div class="ttdeci">virtual bool isInner() const =0</div><div class="ttdoc">Determines if this is an inner node.</div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a241e6dd6c3be3fd11429a39c6e54111d"><div class="ttname"><a href="classripple_1_1SHAMap.html#a241e6dd6c3be3fd11429a39c6e54111d">ripple::SHAMap::gmn_ProcessNodes</a></div><div class="ttdeci">void gmn_ProcessNodes(MissingNodes &amp;, MissingNodes::StackEntry &amp;node)</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapSync_8cpp_source.html#l00173">SHAMapSync.cpp:173</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapLeafNode_html"><div class="ttname"><a href="classripple_1_1SHAMapLeafNode.html">ripple::SHAMapLeafNode</a></div><div class="ttdef"><b>Definition:</b> <a href="SHAMapLeafNode_8h_source.html#l00032">SHAMapLeafNode.h:32</a></div></div>
@@ -891,13 +975,13 @@ $(function() {
<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_1SHAMapInnerNode_html_a5b4f103d62324f6efb4e21a8a6404c27"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a5b4f103d62324f6efb4e21a8a6404c27">ripple::SHAMapInnerNode::isEmptyBranch</a></div><div class="ttdeci">bool isEmptyBranch(int m) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8h_source.html#l00195">SHAMapInnerNode.h:195</a></div></div>
<div class="ttc" id="aclassripple_1_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="astructripple_1_1SHAMap_1_1MissingNodes_html_ad412b8d16396e0c89bcf9b7673f0f450"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ad412b8d16396e0c89bcf9b7673f0f450">ripple::SHAMap::MissingNodes::resumes_</a></div><div class="ttdeci">std::map&lt; SHAMapInnerNode *, SHAMapNodeID &gt; resumes_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00489">SHAMap.h:489</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_ad412b8d16396e0c89bcf9b7673f0f450"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#ad412b8d16396e0c89bcf9b7673f0f450">ripple::SHAMap::MissingNodes::resumes_</a></div><div class="ttdeci">std::map&lt; SHAMapInnerNode *, SHAMapNodeID &gt; resumes_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00511">SHAMap.h:511</a></div></div>
<div class="ttc" id="anamespaceripple_html_a71a6227fec78db0b06595d62c06b25dc"><div class="ttname"><a href="namespaceripple.html#a71a6227fec78db0b06595d62c06b25dc">ripple::rand_int</a></div><div class="ttdeci">std::enable_if_t&lt; std::is_integral&lt; Integral &gt;::value &amp;&amp;detail::is_engine&lt; Engine &gt;::value, Integral &gt; rand_int(Engine &amp;engine, Integral min, Integral max)</div><div class="ttdoc">Return a uniformly distributed random integer.</div><div class="ttdef"><b>Definition:</b> <a href="ripple_2basics_2random_8h_source.html#l00115">ripple/basics/random.h:115</a></div></div>
<div class="ttc" id="anamespaceripple_html_ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77"><div class="ttname"><a href="namespaceripple.html#ad5143ceada01141772ae4aab984f94bdad9a09590da318a86ba2bd64b374c2d77">ripple::HashPrefix::innerNode</a></div><div class="ttdeci">@ innerNode</div><div class="ttdoc">inner node in V1 tree</div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a8932a6ff79c447556da4b17e908bd008"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a8932a6ff79c447556da4b17e908bd008">ripple::SHAMapInnerNode::getChildHash</a></div><div class="ttdeci">SHAMapHash const &amp; getChildHash(int m) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00353">SHAMapInnerNode.cpp:353</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_ab1c8e6f8066b79c3d025e6609e20918e"><div class="ttname"><a href="classripple_1_1SHAMap.html#ab1c8e6f8066b79c3d025e6609e20918e">ripple::SHAMap::hasLeafNode</a></div><div class="ttdeci">bool hasLeafNode(uint256 const &amp;tag, SHAMapHash const &amp;hash) const</div><div class="ttdoc">Does this map have this leaf node?</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapSync_8cpp_source.html#l00764">SHAMapSync.cpp:764</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#l00039">SHAMapInnerNode.h:39</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a55ea2bafa18548792a05de96107370de"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">ripple::SHAMap::MissingNodes::max_</a></div><div class="ttdeci">int max_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00451">SHAMap.h:451</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a55ea2bafa18548792a05de96107370de"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a55ea2bafa18548792a05de96107370de">ripple::SHAMap::MissingNodes::max_</a></div><div class="ttdeci">int max_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00473">SHAMap.h:473</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a483e3bb899522c7abfbf8218c5b21946"><div class="ttname"><a href="classripple_1_1SHAMap.html#a483e3bb899522c7abfbf8218c5b21946">ripple::SHAMap::visitLeaves</a></div><div class="ttdeci">void visitLeaves(std::function&lt; void(std::shared_ptr&lt; SHAMapItem const &gt; const &amp;)&gt; const &amp;) const</div><div class="ttdoc">Visit every leaf node in this SHAMap.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapSync_8cpp_source.html#l00027">SHAMapSync.cpp:27</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a597b4db5c84297776d2e8ebdbe9e1b6f"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a597b4db5c84297776d2e8ebdbe9e1b6f">ripple::SHAMapInnerNode::isFullBelow</a></div><div class="ttdeci">bool isFullBelow(std::uint32_t generation) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8h_source.html#l00201">SHAMapInnerNode.h:201</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapSyncFilter_html_a52d6a1cab3037707977a764d146d939f"><div class="ttname"><a href="classripple_1_1SHAMapSyncFilter.html#a52d6a1cab3037707977a764d146d939f">ripple::SHAMapSyncFilter::gotNode</a></div><div class="ttdeci">virtual void gotNode(bool fromFilter, SHAMapHash const &amp;nodeHash, std::uint32_t ledgerSeq, Blob &amp;&amp;nodeData, SHAMapNodeType type) const =0</div></div>
@@ -907,7 +991,7 @@ $(function() {
<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#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#l00283">SHAMap.cpp:283</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a0962b01670b88cd6de600fe072a2a860"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a0962b01670b88cd6de600fe072a2a860">ripple::SHAMap::MissingNodes::missingHashes_</a></div><div class="ttdeci">std::set&lt; SHAMapHash &gt; missingHashes_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00458">SHAMap.h:458</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a0962b01670b88cd6de600fe072a2a860"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a0962b01670b88cd6de600fe072a2a860">ripple::SHAMap::MissingNodes::missingHashes_</a></div><div class="ttdeci">std::set&lt; SHAMapHash &gt; missingHashes_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00480">SHAMap.h:480</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapNodeID_html_a17a2bccfba4ea39ba3c92570511a4d55"><div class="ttname"><a href="classripple_1_1SHAMapNodeID.html#a17a2bccfba4ea39ba3c92570511a4d55">ripple::SHAMapNodeID::getDepth</a></div><div class="ttdeci">unsigned int getDepth() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapNodeID_8h_source.html#l00058">SHAMapNodeID.h:58</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_aec522cbc8cfb50ed87ebf8c634a40276"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#aec522cbc8cfb50ed87ebf8c634a40276">ripple::SHAMapInnerNode::getBranchCount</a></div><div class="ttdeci">int getBranchCount() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00264">SHAMapInnerNode.cpp:264</a></div></div>
<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a></div></div>
@@ -915,11 +999,12 @@ $(function() {
<div class="ttc" id="anotify_one_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/condition_variable/notify_one.html">std::condition_variable::notify_one</a></div><div class="ttdeci">T notify_one(T... args)</div></div>
<div class="ttc" id="aclassripple_1_1Serializer_html"><div class="ttname"><a href="classripple_1_1Serializer.html">ripple::Serializer</a></div><div class="ttdef"><b>Definition:</b> <a href="Serializer_8h_source.html#l00039">Serializer.h:39</a></div></div>
<div class="ttc" id="anamespaceripple_html"><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="astructripple_1_1SHAMap_1_1MissingNodes_html_a2bb0e112bf72fe63d733867f480d11b7"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a2bb0e112bf72fe63d733867f480d11b7">ripple::SHAMap::MissingNodes::deferCondVar_</a></div><div class="ttdeci">std::condition_variable deferCondVar_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00484">SHAMap.h:484</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a2bb0e112bf72fe63d733867f480d11b7"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a2bb0e112bf72fe63d733867f480d11b7">ripple::SHAMap::MissingNodes::deferCondVar_</a></div><div class="ttdeci">std::condition_variable deferCondVar_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00506">SHAMap.h:506</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_a07ce8e5379558b4c0e256cbbf2636cb7"><div class="ttname"><a href="classripple_1_1SHAMap.html#a07ce8e5379558b4c0e256cbbf2636cb7">ripple::SHAMap::descendAsync</a></div><div class="ttdeci">SHAMapTreeNode * descendAsync(SHAMapInnerNode *parent, int branch, SHAMapSyncFilter *filter, bool &amp;pending, descendCallback &amp;&amp;) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8cpp_source.html#l00380">SHAMap.cpp:380</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="aclassripple_1_1SHAMap_html_ab1253302364db2ba0314e437075ef9d4"><div class="ttname"><a href="classripple_1_1SHAMap.html#ab1253302364db2ba0314e437075ef9d4">ripple::SHAMap::visitNodes</a></div><div class="ttdeci">void visitNodes(std::function&lt; bool(SHAMapTreeNode &amp;)&gt; const &amp;function) const</div><div class="ttdoc">Visit every node in this SHAMap.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapSync_8cpp_source.html#l00039">SHAMapSync.cpp:39</a></div></div>
<div class="ttc" id="aoptional_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/optional.html">std::optional</a></div></div>
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
<div class="ttc" id="aclassripple_1_1SHAMapNodeID_html_a01edaf807dbd6e2671e90b16a10a7e5a"><div class="ttname"><a href="classripple_1_1SHAMapNodeID.html#a01edaf807dbd6e2671e90b16a10a7e5a">ripple::SHAMapNodeID::getNodeID</a></div><div class="ttdeci">uint256 const &amp; getNodeID() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapNodeID_8h_source.html#l00064">SHAMapNodeID.h:64</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapInnerNode_html_a13fcdfee8199a8e54429edf6b9085ae0"><div class="ttname"><a href="classripple_1_1SHAMapInnerNode.html#a13fcdfee8199a8e54429edf6b9085ae0">ripple::SHAMapInnerNode::isEmpty</a></div><div class="ttdeci">bool isEmpty() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapInnerNode_8cpp_source.html#l00258">SHAMapInnerNode.cpp:258</a></div></div>
@@ -927,7 +1012,7 @@ $(function() {
<div class="ttc" id="aclassripple_1_1SHAMap_html_a586781012c019333e8286bf824310fd2"><div class="ttname"><a href="classripple_1_1SHAMap.html#a586781012c019333e8286bf824310fd2">ripple::SHAMap::descend</a></div><div class="ttdeci">SHAMapTreeNode * descend(SHAMapInnerNode *, int branch) const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8cpp_source.html#l00306">SHAMap.cpp:306</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMap_html_acbedaf0be7acd2816e01be821fdc4697"><div class="ttname"><a href="classripple_1_1SHAMap.html#acbedaf0be7acd2816e01be821fdc4697">ripple::SHAMap::ledgerSeq_</a></div><div class="ttdeci">std::uint32_t ledgerSeq_</div><div class="ttdoc">The sequence of the ledger that this map references, if any.</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00105">SHAMap.h:105</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapSyncFilter_html"><div class="ttname"><a href="classripple_1_1SHAMapSyncFilter.html">ripple::SHAMapSyncFilter</a></div><div class="ttdef"><b>Definition:</b> <a href="SHAMapSyncFilter_8h_source.html#l00030">SHAMapSyncFilter.h:30</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a64493410dec801e06486468f8ed5b4d0"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">ripple::SHAMap::MissingNodes::missingNodes_</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; SHAMapNodeID, uint256 &gt; &gt; missingNodes_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00457">SHAMap.h:457</a></div></div>
<div class="ttc" id="astructripple_1_1SHAMap_1_1MissingNodes_html_a64493410dec801e06486468f8ed5b4d0"><div class="ttname"><a href="structripple_1_1SHAMap_1_1MissingNodes.html#a64493410dec801e06486468f8ed5b4d0">ripple::SHAMap::MissingNodes::missingNodes_</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; SHAMapNodeID, uint256 &gt; &gt; missingNodes_</div><div class="ttdef"><b>Definition:</b> <a href="SHAMap_8h_source.html#l00479">SHAMap.h:479</a></div></div>
<div class="ttc" id="aclassripple_1_1SHAMapNodeID_html_a205ce1fb183881d67a7b171533141c6b"><div class="ttname"><a href="classripple_1_1SHAMapNodeID.html#a205ce1fb183881d67a7b171533141c6b">ripple::SHAMapNodeID::isRoot</a></div><div class="ttdeci">bool isRoot() const</div><div class="ttdef"><b>Definition:</b> <a href="SHAMapNodeID_8h_source.html#l00048">SHAMapNodeID.h:48</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 -->