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

deploy: 023f5704d0

Browse Source
This commit is contained in:
manojsdoshi
2020-04-24 01:09:47 +00:00
parent 4ad595bf18
commit 430f6c0cf3
2864 changed files with 304301 additions and 292875 deletions
Download Patch File Download Diff File Expand all files Collapse all files

78
GraphAlgorithms_8h_source.html
View File

@@ -99,50 +99,50 @@ $(function() {
<div class="line"><a name="l00028"></a><span class="lineno"><a class="line" href="structripple_1_1PeerFinder_1_1Sim_1_1VertexTraits.html"> 28</a></span>&#160;<span class="keyword">struct </span><a class="code" href="structripple_1_1PeerFinder_1_1Sim_1_1VertexTraits.html">VertexTraits</a>;</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; </div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> Vertex, <span class="keyword">typename</span> Function&gt;</div>
<div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="namespaceripple_1_1PeerFinder_1_1Sim.html#ab4c46379edf889926d192afc3168589f"> 36</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="namespaceripple_1_1PeerFinder_1_1Sim.html#ab4c46379edf889926d192afc3168589f">breadth_first_traverse</a> (Vertex&amp; start, Function f)</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160;{</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <span class="keyword">using</span> Traits = <a class="code" href="structripple_1_1PeerFinder_1_1Sim_1_1VertexTraits.html">VertexTraits &lt;Vertex&gt;</a>;</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; <span class="keyword">using</span> Edges = <span class="keyword">typename</span> Traits::Edges;</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <span class="keyword">using</span> Edge = <span class="keyword">typename</span> Traits::Edge;</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; </div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; <span class="keyword">using</span> Probe = <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair &lt;Vertex*, int&gt;</a>;</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; <span class="keyword">using</span> Work = <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/deque.html">std::deque &lt;Probe&gt;</a>;</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <span class="keyword">using</span> Visited = <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/set.html">std::set &lt;Vertex*&gt;</a>;</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; Work work;</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; Visited visited;</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; work.emplace_back (&amp;start, 0);</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="keywordtype">int</span> diameter (0);</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="keywordflow">while</span> (! work.empty ())</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; {</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; Probe <span class="keyword">const</span> p (work.front());</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; work.pop_front ();</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">if</span> (visited.find (p.first) != visited.end ())</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; diameter = <a class="codeRef" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a> (p.second, diameter);</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; visited.insert (p.first);</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">typename</span> Edges::iterator iter (</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; Traits::edges (*p.first).begin());</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; iter != Traits::edges (*p.first).end(); ++iter)</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; Vertex* v (Traits::vertex (*iter));</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <span class="keywordflow">if</span> (visited.find (v) != visited.end())</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="keywordflow">if</span> (! iter-&gt;closed())</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; work.emplace_back (v, p.second + 1);</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; }</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; f (*p.first, diameter);</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; }</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160;}</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; </div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160;<span class="keywordtype">void</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="namespaceripple_1_1PeerFinder_1_1Sim.html#ab4c46379edf889926d192afc3168589f"> 37</a></span>&#160;<a class="code" href="namespaceripple_1_1PeerFinder_1_1Sim.html#ab4c46379edf889926d192afc3168589f">breadth_first_traverse</a>(Vertex&amp; start, Function f)</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160;{</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; <span class="keyword">using</span> Traits = <a class="code" href="structripple_1_1PeerFinder_1_1Sim_1_1VertexTraits.html">VertexTraits&lt;Vertex&gt;</a>;</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <span class="keyword">using</span> Edges = <span class="keyword">typename</span> Traits::Edges;</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <span class="keyword">using</span> Edge = <span class="keyword">typename</span> Traits::Edge;</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; </div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; <span class="keyword">using</span> Probe = <a class="codeRef" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;Vertex*, int&gt;</a>;</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <span class="keyword">using</span> Work = <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/deque.html">std::deque&lt;Probe&gt;</a>;</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; <span class="keyword">using</span> Visited = <a class="codeRef" href="http://en.cppreference.com/w/cpp/container/set.html">std::set&lt;Vertex*&gt;</a>;</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; Work work;</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; Visited visited;</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; work.emplace_back(&amp;start, 0);</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="keywordtype">int</span> diameter(0);</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordflow">while</span> (!work.empty())</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; {</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; Probe <span class="keyword">const</span> p(work.front());</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; work.pop_front();</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keywordflow">if</span> (visited.find(p.first) != visited.end())</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; diameter = <a class="codeRef" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(p.second, diameter);</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; visited.insert(p.first);</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">typename</span> Edges::iterator iter(Traits::edges(*p.first).begin());</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; iter != Traits::edges(*p.first).end();</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; ++iter)</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; {</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; Vertex* v(Traits::vertex(*iter));</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="keywordflow">if</span> (visited.find(v) != visited.end())</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="keywordflow">if</span> (!iter-&gt;closed())</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; work.emplace_back(v, p.second + 1);</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; }</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; f(*p.first, diameter);</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; }</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160;}</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; </div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160;}</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160;}</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160;}</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160;} <span class="comment">// namespace Sim</span></div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160;} <span class="comment">// namespace PeerFinder</span></div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160;} <span class="comment">// namespace ripple</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; </div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160;<span class="preprocessor">#endif</span></div>
</div><!-- fragment --></div><!-- contents -->
<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="anamespaceripple_1_1PeerFinder_1_1Sim_html_ab4c46379edf889926d192afc3168589f"><div class="ttname"><a href="namespaceripple_1_1PeerFinder_1_1Sim.html#ab4c46379edf889926d192afc3168589f">ripple::PeerFinder::Sim::breadth_first_traverse</a></div><div class="ttdeci">void breadth_first_traverse(Vertex &amp;start, Function f)</div><div class="ttdoc">Call a function for each vertex in a connected graph.</div><div class="ttdef"><b>Definition:</b> <a href="GraphAlgorithms_8h_source.html#l00036">GraphAlgorithms.h:36</a></div></div>
<div class="ttc" id="anamespaceripple_1_1PeerFinder_1_1Sim_html_ab4c46379edf889926d192afc3168589f"><div class="ttname"><a href="namespaceripple_1_1PeerFinder_1_1Sim.html#ab4c46379edf889926d192afc3168589f">ripple::PeerFinder::Sim::breadth_first_traverse</a></div><div class="ttdeci">void breadth_first_traverse(Vertex &amp;start, Function f)</div><div class="ttdoc">Call a function for each vertex in a connected graph.</div><div class="ttdef"><b>Definition:</b> <a href="GraphAlgorithms_8h_source.html#l00037">GraphAlgorithms.h:37</a></div></div>
<div class="ttc" id="astructripple_1_1PeerFinder_1_1Sim_1_1VertexTraits_html"><div class="ttname"><a href="structripple_1_1PeerFinder_1_1Sim_1_1VertexTraits.html">ripple::PeerFinder::Sim::VertexTraits</a></div><div class="ttdef"><b>Definition:</b> <a href="GraphAlgorithms_8h_source.html#l00028">GraphAlgorithms.h:28</a></div></div>
<div class="ttc" id="adeque_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/deque.html">std::deque</a></div><div class="ttdoc">STL class.</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>