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

deploy: 6534757d85

Browse Source
This commit is contained in:
bthomee
2025-07-10 18:20:07 +00:00
parent 542236acb3
commit 39032171d1
1427 changed files with 18077 additions and 18209 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
RangeSet_8cpp_source.html
View File

@@ -207,7 +207,7 @@ $(function() {
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span>TEST_SUITE_END();</div>
<div class="ttc" id="acstdint_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/header/cstdint.html">cstdint</a></div></div>
<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a></div></div>
<div class="ttc" id="anamespaceripple_html"><div class="ttname"><a href="namespaceripple.html">ripple</a></div><div class="ttdoc">Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.</div><div class="ttdef"><b>Definition:</b> <a href="algorithm_8h_source.html#l00026">algorithm.h:26</a></div></div>
<div class="ttc" id="anamespaceripple_html"><div class="ttname"><a href="namespaceripple.html">ripple</a></div><div class="ttdoc">Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.</div><div class="ttdef"><b>Definition:</b> <a href="algorithm_8h_source.html#l00025">algorithm.h:25</a></div></div>
<div class="ttc" id="anamespaceripple_html_a22768e0a41b646442c98d38f2f2a307ba8c46d8d9d3402788403e2f6911153089"><div class="ttname"><a href="namespaceripple.html#a22768e0a41b646442c98d38f2f2a307ba8c46d8d9d3402788403e2f6911153089">ripple::LedgerNameSpace::CHECK</a></div><div class="ttdeci">@ CHECK</div></div>
<div class="ttc" id="anamespaceripple_html_a32ba9fd762aad555e761c775d3bbaf6a"><div class="ttname"><a href="namespaceripple.html#a32ba9fd762aad555e761c775d3bbaf6a">ripple::prevMissing</a></div><div class="ttdeci">std::optional&lt; T &gt; prevMissing(RangeSet&lt; T &gt; const &amp;rs, T t, T minVal=0)</div><div class="ttdoc">Find the largest value not in the set that is less than a given value.</div><div class="ttdef"><b>Definition:</b> <a href="RangeSet_8h_source.html#l00183">RangeSet.h:183</a></div></div>
<div class="ttc" id="anamespaceripple_html_a53f80df10254751781250aa20704e98f"><div class="ttname"><a href="namespaceripple.html#a53f80df10254751781250aa20704e98f">ripple::set</a></div><div class="ttdeci">bool set(T &amp;target, std::string const &amp;name, Section const &amp;section)</div><div class="ttdoc">Set a value from a configuration Section If the named value is not found or doesn't parse as a T,...</div><div class="ttdef"><b>Definition:</b> <a href="BasicConfig_8h_source.html#l00315">BasicConfig.h:315</a></div></div>