mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-31 01:02:46 +08:00
Documentation for 8b1eab204b
This commit is contained in:
realstealthninja
@@ -1,3 +1,4 @@
|
||||
<!-- HTML header for doxygen 1.12.0-->
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
||||
<head>
|
||||
@@ -5,10 +6,15 @@
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||||
<meta name="generator" content="Doxygen 1.12.0"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: sorting/strand_sort.cpp File Reference</title>
|
||||
<title>TheAlgorithms/C++: sorting/strand_sort.cpp File Reference</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
||||
<script type="text/javascript">
|
||||
DoxygenAwesomeDarkModeToggle.init()
|
||||
</script>
|
||||
<script type="text/javascript" src="../../clipboard.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
@@ -18,14 +24,24 @@
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
<script type="text/javascript">
|
||||
window.MathJax = {
|
||||
options: {
|
||||
ignoreHtmlClass: 'tex2jax_ignore',
|
||||
processHtmlClass: 'tex2jax_process'
|
||||
},
|
||||
loader: {
|
||||
load: ['[tex]/ams']
|
||||
},
|
||||
tex: {
|
||||
macros: {},
|
||||
packages: ['base','configmacros','ams']
|
||||
}
|
||||
};
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr id="projectrow">
|
||||
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
||||
<td id="projectalign">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
<div id="projectbrief">All the algorithms implemented in C++</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
@@ -120,7 +137,9 @@ Include dependency graph for strand_sort.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d26/strand__sort_8cpp__incl.svg" width="166" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
</div><table class="memberdecls">
|
||||
</div>
|
||||
<p><a href="../../dc/dd9/strand__sort_8cpp_source.html">Go to the source code of this file.</a></p>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
|
||||
@@ -133,7 +152,7 @@ Namespaces</h2></td></tr>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a2bea2fe5dd38ed63610fdeaddf5785cd" id="r_a2bea2fe5dd38ed63610fdeaddf5785cd"><td class="memTemplParams" colspan="2">template<typename T > </td></tr>
|
||||
<tr class="memitem:a2bea2fe5dd38ed63610fdeaddf5785cd"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>< T > </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a2bea2fe5dd38ed63610fdeaddf5785cd">sorting::strand::strand_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>< T > lst)</td></tr>
|
||||
<tr class="memitem:a2bea2fe5dd38ed63610fdeaddf5785cd"><td class="memTemplItemLeft" align="right" valign="top">std::list< T > </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a2bea2fe5dd38ed63610fdeaddf5785cd">sorting::strand::strand_sort</a> (std::list< T > lst)</td></tr>
|
||||
<tr class="memdesc:a2bea2fe5dd38ed63610fdeaddf5785cd"><td class="mdescLeft"> </td><td class="mdescRight">Apply sorting. <br /></td></tr>
|
||||
<tr class="separator:a2bea2fe5dd38ed63610fdeaddf5785cd"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
|
||||
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
|
||||
<p>Strand Sort is a sorting algorithm that works in \(O(n)\) time if list is already sorted and works in \(O(n^2)\) in worst case.</p>
|
||||
<p>It is passed over the array to be sorted once and the ascending (sequential) numbers are taken. After the first iteration, the sequential sub-array is put on the empty sorted array. The main sequence is passed over again and a new sub-sequence is created in order. Now that the sorted array is not empty, the newly extracted substring is merged with the sorted array. Repeat types 3 and 4 until the sub-sequence and main sequence are empty.</p>
|
||||
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/mertcandav" target="_blank">Mertcan Davulcu</a> </dd></dl>
|
||||
|
||||
<p class="definition">Definition in file <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html">strand_sort.cpp</a>.</p>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
@@ -166,17 +187,14 @@ Functions</h2></td></tr>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html">strand_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 84</span> {</div>
|
||||
<div class="line"><span class="lineno"> 85</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
|
||||
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 87</span>}</div>
|
||||
<div class="ttc" id="astrand__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function for testing.</div><div class="ttdef"><b>Definition</b> strand_sort.cpp:64</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
<div class="ttc" id="astrand__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function for testing.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dd9/strand__sort_8cpp_source.html#l00064">strand_sort.cpp:64</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a2bea2fe5dd38ed63610fdeaddf5785cd" name="a2bea2fe5dd38ed63610fdeaddf5785cd"></a>
|
||||
@@ -188,9 +206,9 @@ Here is the call graph for this function:</div>
|
||||
template<typename T > </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>< T > sorting::strand::strand_sort </td>
|
||||
<td class="memname">std::list< T > sorting::strand::strand_sort </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>< T ></td> <td class="paramname"><span class="paramname"><em>lst</em></span></td><td>)</td>
|
||||
<td class="paramtype">std::list< T ></td> <td class="paramname"><span class="paramname"><em>lst</em></span></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
@@ -210,19 +228,21 @@ template<typename T > </div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>Sorted list<T> instance </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html">strand_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 36</span> {</div>
|
||||
<div class="line"><span class="lineno"> 37</span> <span class="keywordflow">if</span> (lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/size.html">size</a>() < 2) { <span class="comment">// Returns list if empty or contains only one element</span></div>
|
||||
<div class="line"><span class="lineno"> 37</span> <span class="keywordflow">if</span> (lst.size() < 2) { <span class="comment">// Returns list if empty or contains only one element</span></div>
|
||||
<div class="line"><span class="lineno"> 38</span> <span class="keywordflow">return</span> lst; <span class="comment">// Returns list</span></div>
|
||||
<div class="line"><span class="lineno"> 39</span> }</div>
|
||||
<div class="line"><span class="lineno"> 40</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list<T></a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>; <span class="comment">// Define new "result" named list instance.</span></div>
|
||||
<div class="line"><span class="lineno"> 41</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list<T></a> sorted; <span class="comment">// Define new "sorted" named list instance.</span></div>
|
||||
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">while</span>(!lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/empty.html">empty</a>()) <span class="comment">/* if lst is not empty */</span> {</div>
|
||||
<div class="line"><span class="lineno"> 43</span> sorted.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/push_back.html">push_back</a>(lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/front.html">front</a>()); <span class="comment">// Adds the first element of "lst" list to the bottom of the "sorted" list.</span></div>
|
||||
<div class="line"><span class="lineno"> 44</span> lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/pop_front.html">pop_front</a>(); <span class="comment">// Remove first element of "lst" list.</span></div>
|
||||
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/begin.html">begin</a>(); it != lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/end.html">end</a>(); ) { <span class="comment">// Return the loop as long as the current iterator is not equal to the last literator of the "lst" list.</span></div>
|
||||
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span> (sorted.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/back.html">back</a>() <= *it) { <span class="comment">// If the last reference of the "sorted" list is less than or equal to the current iterator reference.</span></div>
|
||||
<div class="line"><span class="lineno"> 47</span> sorted.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/push_back.html">push_back</a>(*it); <span class="comment">// Adds the iterator retrieved in the loop under the "sorted" list.</span></div>
|
||||
<div class="line"><span class="lineno"> 48</span> it = lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/erase.html">erase</a>(it); <span class="comment">// Deletes the element with the current iterator and assigns the deleted element to the iterator.</span></div>
|
||||
<div class="line"><span class="lineno"> 40</span> std::list<T> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>; <span class="comment">// Define new "result" named list instance.</span></div>
|
||||
<div class="line"><span class="lineno"> 41</span> std::list<T> sorted; <span class="comment">// Define new "sorted" named list instance.</span></div>
|
||||
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">while</span>(!lst.empty()) <span class="comment">/* if lst is not empty */</span> {</div>
|
||||
<div class="line"><span class="lineno"> 43</span> sorted.push_back(lst.front()); <span class="comment">// Adds the first element of "lst" list to the bottom of the "sorted" list.</span></div>
|
||||
<div class="line"><span class="lineno"> 44</span> lst.pop_front(); <span class="comment">// Remove first element of "lst" list.</span></div>
|
||||
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = lst.begin(); it != lst.end(); ) { <span class="comment">// Return the loop as long as the current iterator is not equal to the last literator of the "lst" list.</span></div>
|
||||
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span> (sorted.back() <= *it) { <span class="comment">// If the last reference of the "sorted" list is less than or equal to the current iterator reference.</span></div>
|
||||
<div class="line"><span class="lineno"> 47</span> sorted.push_back(*it); <span class="comment">// Adds the iterator retrieved in the loop under the "sorted" list.</span></div>
|
||||
<div class="line"><span class="lineno"> 48</span> it = lst.erase(it); <span class="comment">// Deletes the element with the current iterator and assigns the deleted element to the iterator.</span></div>
|
||||
<div class="line"><span class="lineno"> 49</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 50</span> it++; <span class="comment">// Next iterator.</span></div>
|
||||
<div class="line"><span class="lineno"> 51</span> }</div>
|
||||
@@ -231,23 +251,8 @@ template<typename T > </div>
|
||||
<div class="line"><span class="lineno"> 54</span> }</div>
|
||||
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>; <span class="comment">// Returns sorted list</span></div>
|
||||
<div class="line"><span class="lineno"> 56</span> }</div>
|
||||
<div class="ttc" id="aback_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/back.html">std::list::back</a></div><div class="ttdeci">T back(T... args)</div></div>
|
||||
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/begin.html">std::list::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
|
||||
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/empty.html">std::list::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
|
||||
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/end.html">std::list::end</a></div><div class="ttdeci">T end(T... args)</div></div>
|
||||
<div class="ttc" id="aerase_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/erase.html">std::list::erase</a></div><div class="ttdeci">T erase(T... args)</div></div>
|
||||
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
|
||||
<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/front.html">std::list::front</a></div><div class="ttdeci">T front(T... args)</div></div>
|
||||
<div class="ttc" id="alist_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a></div></div>
|
||||
<div class="ttc" id="apop_front_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/pop_front.html">std::list::pop_front</a></div><div class="ttdeci">T pop_front(T... args)</div></div>
|
||||
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/push_back.html">std::list::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/size.html">std::list::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.svg" width="372" height="431"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
|
||||
@@ -275,23 +280,24 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Function for testing. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>N/A </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html">strand_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 64</span> {</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list<int></a> lst = { -333, 525, 1, 0, 94, 52, 33 };</div>
|
||||
<div class="line"><span class="lineno"> 65</span> std::list<int> lst = { -333, 525, 1, 0, 94, 52, 33 };</div>
|
||||
<div class="line"><span class="lineno"> 66</span> </div>
|
||||
<div class="line"><span class="lineno"> 67</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Before: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 67</span> std::cout << <span class="stringliteral">"Before: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 68</span> <span class="keywordflow">for</span>(<span class="keyword">auto</span> item: lst) {</div>
|
||||
<div class="line"><span class="lineno"> 69</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << item << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 69</span> std::cout << item << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 70</span> }</div>
|
||||
<div class="line"><span class="lineno"> 71</span> </div>
|
||||
<div class="line"><span class="lineno"> 72</span> lst = <a class="code hl_function" href="#a2bea2fe5dd38ed63610fdeaddf5785cd">sorting::strand::strand_sort</a>(lst); <span class="comment">// Sort list.</span></div>
|
||||
<div class="line"><span class="lineno"> 73</span> </div>
|
||||
<div class="line"><span class="lineno"> 74</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nAfter: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 74</span> std::cout << <span class="stringliteral">"\nAfter: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">for</span>(<span class="keyword">auto</span> item: lst) {</div>
|
||||
<div class="line"><span class="lineno"> 76</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << item << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 76</span> std::cout << item << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 77</span> }</div>
|
||||
<div class="line"><span class="lineno"> 78</span>}</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="astrand__sort_8cpp_html_a2bea2fe5dd38ed63610fdeaddf5785cd"><div class="ttname"><a href="#a2bea2fe5dd38ed63610fdeaddf5785cd">sorting::strand::strand_sort</a></div><div class="ttdeci">std::list< T > strand_sort(std::list< T > lst)</div><div class="ttdoc">Apply sorting.</div><div class="ttdef"><b>Definition</b> strand_sort.cpp:36</div></div>
|
||||
<div class="ttc" id="astrand__sort_8cpp_html_a2bea2fe5dd38ed63610fdeaddf5785cd"><div class="ttname"><a href="#a2bea2fe5dd38ed63610fdeaddf5785cd">sorting::strand::strand_sort</a></div><div class="ttdeci">std::list< T > strand_sort(std::list< T > lst)</div><div class="ttdoc">Apply sorting.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dd9/strand__sort_8cpp_source.html#l00036">strand_sort.cpp:36</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
|
||||
Reference in New Issue
Block a user