backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-16 11:32:44 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 53a6c16730

Browse Source
This commit is contained in:
github-actions
2022-01-16 16:05:19 +00:00
parent 778f1be9e5
commit 2cab28c905
3620 changed files with 52045 additions and 41188 deletions
Download Patch File Download Diff File Expand all files Collapse all files

140
df/d47/fcfs__scheduling_8cpp.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="generator" content="Doxygen 1.9.3"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: cpu_scheduling_algorithms/fcfs_scheduling.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,8 +30,8 @@ MathJax.Hub.Config({
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.2 -->
<!-- Generated by Doxygen 1.9.3 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
@@ -171,31 +171,31 @@ template&lt;typename S , typename T , typename E &gt; </div>
</dd>
</dl>
<p>Sorts the input vector according to arrival time. Processes whose arrival times are same get sorted according to process ID For each process, completion time, turnaround time and completion time are calculated, inserted in a tuple, which is added to the vector result. </p><dl class="section return"><dt>Returns</dt><dd>A vector of tuples consisting of process ID, arrival time, burst time, completion time, turnaround time and waiting time for each process. </dd></dl>
<div class="fragment"><div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> {</div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">sort</a>(input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(), sortcol&lt;S, T, E&gt;);</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;tuple&lt;S, T, E, double, double, double&gt;</a>&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>());</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="keywordtype">double</span> timeElapsed = 0;</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i{}; i &lt; input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> T arrival = get&lt;1&gt;(input[i]);</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> E burst = get&lt;2&gt;(input[i]);</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> </div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="keywordflow">if</span> (arrival &gt; timeElapsed) {</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> timeElapsed += arrival - timeElapsed;</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> }</div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> timeElapsed += burst;</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="keywordtype">double</span> completion = timeElapsed;</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="keywordtype">double</span> turnaround = completion - arrival;</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="keywordtype">double</span> waiting = turnaround - burst;</div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> </div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> get&lt;0&gt;(result[i]) = get&lt;0&gt;(input[i]);</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> get&lt;1&gt;(result[i]) = arrival;</div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> get&lt;2&gt;(result[i]) = burst;</div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> get&lt;3&gt;(result[i]) = completion;</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> get&lt;4&gt;(result[i]) = turnaround;</div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> get&lt;5&gt;(result[i]) = waiting;</div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> }</div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 226</span> {</div>
<div class="line"><span class="lineno"> 227</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">sort</a>(input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(), sortcol&lt;S, T, E&gt;);</div>
<div class="line"><span class="lineno"> 228</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;tuple&lt;S, T, E, double, double, double&gt;</a>&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>());</div>
<div class="line"><span class="lineno"> 229</span> <span class="keywordtype">double</span> timeElapsed = 0;</div>
<div class="line"><span class="lineno"> 230</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i{}; i &lt; input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
<div class="line"><span class="lineno"> 231</span> T arrival = get&lt;1&gt;(input[i]);</div>
<div class="line"><span class="lineno"> 232</span> E burst = get&lt;2&gt;(input[i]);</div>
<div class="line"><span class="lineno"> 233</span> </div>
<div class="line"><span class="lineno"> 234</span> <span class="keywordflow">if</span> (arrival &gt; timeElapsed) {</div>
<div class="line"><span class="lineno"> 235</span> timeElapsed += arrival - timeElapsed;</div>
<div class="line"><span class="lineno"> 236</span> }</div>
<div class="line"><span class="lineno"> 237</span> timeElapsed += burst;</div>
<div class="line"><span class="lineno"> 238</span> <span class="keywordtype">double</span> completion = timeElapsed;</div>
<div class="line"><span class="lineno"> 239</span> <span class="keywordtype">double</span> turnaround = completion - arrival;</div>
<div class="line"><span class="lineno"> 240</span> <span class="keywordtype">double</span> waiting = turnaround - burst;</div>
<div class="line"><span class="lineno"> 241</span> </div>
<div class="line"><span class="lineno"> 242</span> get&lt;0&gt;(result[i]) = get&lt;0&gt;(input[i]);</div>
<div class="line"><span class="lineno"> 243</span> get&lt;1&gt;(result[i]) = arrival;</div>
<div class="line"><span class="lineno"> 244</span> get&lt;2&gt;(result[i]) = burst;</div>
<div class="line"><span class="lineno"> 245</span> get&lt;3&gt;(result[i]) = completion;</div>
<div class="line"><span class="lineno"> 246</span> get&lt;4&gt;(result[i]) = turnaround;</div>
<div class="line"><span class="lineno"> 247</span> get&lt;5&gt;(result[i]) = waiting;</div>
<div class="line"><span class="lineno"> 248</span> }</div>
<div class="line"><span class="lineno"> 249</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 250</span>}</div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(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:76</div></div>
@@ -223,15 +223,15 @@ template&lt;typename S , typename T , typename E &gt; </div>
<p>Entry point of the program. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> {</div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <a class="code hl_function" href="../../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 287</span> {</div>
<div class="line"><span class="lineno"> 288</span> <a class="code hl_function" href="../../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 289</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 290</span>}</div>
<div class="ttc" id="afcfs__scheduling_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> fcfs_scheduling.cpp:256</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="../../df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="571" height="170"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="571" height="402"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
@@ -284,14 +284,14 @@ template&lt;typename S , typename T , typename E &gt; </div>
<dl class="section return"><dt>Returns</dt><dd>true if t1 and t2 are in the CORRECT order </dd>
<dd>
false if t1 and t2 are in the INCORRECT order </dd></dl>
<div class="fragment"><div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> {</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordflow">if</span> (get&lt;1&gt;(t1) &lt; get&lt;1&gt;(t2)) {</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (get&lt;1&gt;(t1) == get&lt;1&gt;(t2) &amp;&amp; get&lt;0&gt;(t1) &lt; get&lt;0&gt;(t2)) {</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> }</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 45</span> {</div>
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span> (get&lt;1&gt;(t1) &lt; get&lt;1&gt;(t2)) {</div>
<div class="line"><span class="lineno"> 47</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 48</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (get&lt;1&gt;(t1) == get&lt;1&gt;(t2) &amp;&amp; get&lt;0&gt;(t1) &lt; get&lt;0&gt;(t2)) {</div>
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 50</span> }</div>
<div class="line"><span class="lineno"> 51</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 52</span>}</div>
</div><!-- fragment -->
</div>
</div>
@@ -320,32 +320,32 @@ false if t1 and t2 are in the INCORRECT order </dd></dl>
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> {</div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i{}; i &lt; 1000; i++) {</div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));</div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> uint32_t n = 1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a>() % 1000;</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <a class="code hl_class" href="../../dd/dca/class_f_c_f_s.html">FCFS&lt;uint32_t, uint32_t, uint32_t&gt;</a> readyQueue;</div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t&gt;</a>&gt; input(n);</div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> </div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <span class="keywordflow">for</span> (uint32_t i{}; i &lt; n; i++) {</div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> get&lt;0&gt;(input[i]) = i;</div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));</div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> get&lt;1&gt;(input[i]) = 1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a>() % 10000;</div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));</div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> get&lt;2&gt;(input[i]) = 1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a>() % 10000;</div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> }</div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> </div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="keywordflow">for</span> (uint32_t i{}; i &lt; n; i++) {</div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> readyQueue.<a class="code hl_function" href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">addProcess</a>(get&lt;0&gt;(input[i]), get&lt;1&gt;(input[i]),</div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> get&lt;2&gt;(input[i]));</div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> }</div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t, double, double, double&gt;</a>&gt;</div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> res = get_final_status&lt;uint32_t, uint32_t, uint32_t&gt;(input);</div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> assert(res == readyQueue.<a class="code hl_function" href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91">scheduleForFcfs</a>());</div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="comment">// readyQueue.printResult();</span></div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> }</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;All the tests have successfully passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 256</span> {</div>
<div class="line"><span class="lineno"> 257</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i{}; i &lt; 1000; i++) {</div>
<div class="line"><span class="lineno"> 258</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));</div>
<div class="line"><span class="lineno"> 259</span> uint32_t n = 1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a>() % 1000;</div>
<div class="line"><span class="lineno"> 260</span> <a class="code hl_class" href="../../dd/dca/class_f_c_f_s.html">FCFS&lt;uint32_t, uint32_t, uint32_t&gt;</a> readyQueue;</div>
<div class="line"><span class="lineno"> 261</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t&gt;</a>&gt; input(n);</div>
<div class="line"><span class="lineno"> 262</span> </div>
<div class="line"><span class="lineno"> 263</span> <span class="keywordflow">for</span> (uint32_t i{}; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 264</span> get&lt;0&gt;(input[i]) = i;</div>
<div class="line"><span class="lineno"> 265</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));</div>
<div class="line"><span class="lineno"> 266</span> get&lt;1&gt;(input[i]) = 1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a>() % 10000;</div>
<div class="line"><span class="lineno"> 267</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));</div>
<div class="line"><span class="lineno"> 268</span> get&lt;2&gt;(input[i]) = 1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a>() % 10000;</div>
<div class="line"><span class="lineno"> 269</span> }</div>
<div class="line"><span class="lineno"> 270</span> </div>
<div class="line"><span class="lineno"> 271</span> <span class="keywordflow">for</span> (uint32_t i{}; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 272</span> readyQueue.<a class="code hl_function" href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">addProcess</a>(get&lt;0&gt;(input[i]), get&lt;1&gt;(input[i]),</div>
<div class="line"><span class="lineno"> 273</span> get&lt;2&gt;(input[i]));</div>
<div class="line"><span class="lineno"> 274</span> }</div>
<div class="line"><span class="lineno"> 275</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t, double, double, double&gt;</a>&gt;</div>
<div class="line"><span class="lineno"> 276</span> res = get_final_status&lt;uint32_t, uint32_t, uint32_t&gt;(input);</div>
<div class="line"><span class="lineno"> 277</span> assert(res == readyQueue.<a class="code hl_function" href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91">scheduleForFcfs</a>());</div>
<div class="line"><span class="lineno"> 278</span> <span class="comment">// readyQueue.printResult();</span></div>
<div class="line"><span class="lineno"> 279</span> }</div>
<div class="line"><span class="lineno"> 280</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;All the tests have successfully passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><span class="lineno"> 281</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="aclass_f_c_f_s_html"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html">FCFS</a></div><div class="ttdoc">Class which implements the FCFS scheduling algorithm.</div><div class="ttdef"><b>Definition:</b> fcfs_scheduling.cpp:97</div></div>
<div class="ttc" id="aclass_f_c_f_s_html_a8fbfe4d85f7576b4a7aade07d29fbd69"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">FCFS::addProcess</a></div><div class="ttdeci">void addProcess(S id, T arrival, E burst)</div><div class="ttdoc">Adds the process to the ready queue if it isn't already there.</div><div class="ttdef"><b>Definition:</b> fcfs_scheduling.cpp:129</div></div>
@@ -357,7 +357,7 @@ false if t1 and t2 are in the INCORRECT order </dd></dl>
</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="../../df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="472" height="170"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="472" height="402"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
@@ -369,7 +369,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html">cpu_scheduling_algorithms</a></li><li class="navelem"><a class="el" href="../../df/d47/fcfs__scheduling_8cpp.html">fcfs_scheduling.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.2 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.3 </li>
</ul>
</div>
</body>

16
df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
View File

@@ -1,8 +1,12 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,89,49,116"/>
<area shape="rect" id="node2" href="$dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69" title="Adds the process to the ready queue if it isn&#39;t already there." alt="" coords="111,64,246,91"/>
<area shape="rect" id="node6" href="$dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor..." alt="" coords="97,115,260,141"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/end.html#" title=" " alt="" coords="308,5,467,32"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/find.html#" title=" " alt="" coords="322,57,453,98"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/insert.html#" title=" " alt="" coords="322,122,453,163"/>
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,224,49,251"/>
<area shape="rect" id="node2" href="$dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69" title="Adds the process to the ready queue if it isn&#39;t already there." alt="" coords="111,129,246,156"/>
<area shape="rect" id="node7" href="$dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor..." alt="" coords="97,289,260,316"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/end#" title=" " alt="" coords="308,5,467,32"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/find#" title=" " alt="" coords="322,57,453,98"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/insert#" title=" " alt="" coords="322,122,453,163"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/push#" title=" " alt="" coords="323,187,452,229"/>
<area shape="rect" id="node8" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/empty#" title=" " alt="" coords="323,253,452,294"/>
<area shape="rect" id="node9" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/pop#" title=" " alt="" coords="308,319,467,345"/>
<area shape="rect" id="node10" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/top#" title=" " alt="" coords="310,369,465,396"/>
</map>

2
df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
View File

@@ -1 +1 @@
eb25f61bb3c01f732953e7b177f935be
dd8504a723938ac379d7970db9fe62c5

138
df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: test Pages: 1 -->
<svg width="354pt" height="127pt"
viewBox="0.00 0.00 354.00 126.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 122.5)">
<svg width="354pt" height="301pt"
viewBox="0.00 0.00 354.00 301.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 297)">
<title>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-122.5 350,-122.5 350,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-297 350,-297 350,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#bfbfbf" stroke="black" points="0,-36 0,-55 33,-55 33,-36 0,-36"/>
<text text-anchor="middle" x="16.5" y="-43" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
<polygon fill="#bfbfbf" stroke="black" points="0,-109.5 0,-128.5 33,-128.5 33,-109.5 0,-109.5"/>
<text text-anchor="middle" x="16.5" y="-116.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
@@ -22,78 +22,140 @@
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69" target="_top" xlink:title="Adds the process to the ready queue if it isn&#39;t already there.">
<polygon fill="white" stroke="black" points="79.5,-55 79.5,-74 180.5,-74 180.5,-55 79.5,-55"/>
<text text-anchor="middle" x="130" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::addProcess</text>
<polygon fill="white" stroke="black" points="79.5,-180.5 79.5,-199.5 180.5,-199.5 180.5,-180.5 79.5,-180.5"/>
<text text-anchor="middle" x="130" y="-187.5" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::addProcess</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M33,-48.14C42.64,-49.78 55.7,-52.01 69.09,-54.29"/>
<polygon fill="midnightblue" stroke="midnightblue" points="68.89,-57.81 79.33,-56.04 70.06,-50.91 68.89,-57.81"/>
<path fill="none" stroke="midnightblue" d="M32.54,-128.58C51.24,-140.49 83.39,-160.95 105.39,-174.97"/>
<polygon fill="midnightblue" stroke="midnightblue" points="103.53,-177.93 113.84,-180.35 107.29,-172.03 103.53,-177.93"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" target="_top" xlink:title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor...">
<polygon fill="white" stroke="black" points="69,-17 69,-36 191,-36 191,-17 69,-17"/>
<text text-anchor="middle" x="130" y="-24" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::scheduleForFcfs</text>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" target="_top" xlink:title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor...">
<polygon fill="white" stroke="black" points="69,-60.5 69,-79.5 191,-79.5 191,-60.5 69,-60.5"/>
<text text-anchor="middle" x="130" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::scheduleForFcfs</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M33,-42.86C41.2,-41.46 51.87,-39.64 63.11,-37.73"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.82,-41.16 73.09,-36.03 62.65,-34.26 63.82,-41.16"/>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node1&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M33,-112.19C49.71,-104.84 76.75,-92.96 97.88,-83.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="99.37,-86.85 107.11,-79.62 96.55,-80.44 99.37,-86.85"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="227,-99 227,-118 346,-118 346,-99 227,-99"/>
<text text-anchor="middle" x="286.5" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end#" xlink:title=" ">
<polygon fill="white" stroke="black" points="227,-273.5 227,-292.5 346,-292.5 346,-273.5 227,-273.5"/>
<text text-anchor="middle" x="286.5" y="-280.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M164.52,-74.05C187.3,-80.53 217.64,-89.17 242.24,-96.18"/>
<polygon fill="midnightblue" stroke="midnightblue" points="241.46,-99.6 252.04,-98.97 243.38,-92.87 241.46,-99.6"/>
<path fill="none" stroke="midnightblue" d="M141.11,-199.73C157.77,-215.28 192.57,-245.84 227,-264 231.04,-266.13 235.36,-268.08 239.76,-269.85"/>
<polygon fill="midnightblue" stroke="midnightblue" points="238.84,-273.24 249.44,-273.43 241.28,-266.68 238.84,-273.24"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="237.5,-49.5 237.5,-79.5 335.5,-79.5 335.5,-49.5 237.5,-49.5"/>
<text text-anchor="start" x="245.5" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
<text text-anchor="middle" x="286.5" y="-56.5" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find#" xlink:title=" ">
<polygon fill="white" stroke="black" points="237.5,-224 237.5,-254 335.5,-254 335.5,-224 237.5,-224"/>
<text text-anchor="start" x="245.5" y="-242" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
<text text-anchor="middle" x="286.5" y="-231" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M180.74,-64.5C195.5,-64.5 211.81,-64.5 227.07,-64.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="227.44,-68 237.44,-64.5 227.44,-61 227.44,-68"/>
<path fill="none" stroke="midnightblue" d="M161.16,-199.56C180.29,-205.63 205.65,-213.68 228.48,-220.92"/>
<polygon fill="midnightblue" stroke="midnightblue" points="227.5,-224.28 238.09,-223.96 229.61,-217.6 227.5,-224.28"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/insert.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="237.5,-0.5 237.5,-30.5 335.5,-30.5 335.5,-0.5 237.5,-0.5"/>
<text text-anchor="start" x="245.5" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
<text text-anchor="middle" x="286.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/insert#" xlink:title=" ">
<polygon fill="white" stroke="black" points="237.5,-175 237.5,-205 335.5,-205 335.5,-175 237.5,-175"/>
<text text-anchor="start" x="245.5" y="-193" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
<text text-anchor="middle" x="286.5" y="-182" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node2&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M161.22,-54.94C170.75,-51.92 181.31,-48.57 191,-45.5 203.04,-41.68 215.94,-37.59 228.22,-33.69"/>
<polygon fill="midnightblue" stroke="midnightblue" points="229.44,-36.98 237.91,-30.61 227.32,-30.3 229.44,-36.98"/>
<path fill="none" stroke="midnightblue" d="M180.74,-190C195.5,-190 211.81,-190 227.07,-190"/>
<polygon fill="midnightblue" stroke="midnightblue" points="227.44,-193.5 237.44,-190 227.44,-186.5 227.44,-193.5"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push#" xlink:title=" ">
<polygon fill="white" stroke="black" points="238,-126 238,-156 335,-156 335,-126 238,-126"/>
<text text-anchor="start" x="246" y="-144" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
<text text-anchor="middle" x="286.5" y="-133" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node2&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M161.16,-180.44C180.29,-174.37 205.65,-166.32 228.48,-159.08"/>
<polygon fill="midnightblue" stroke="midnightblue" points="229.61,-162.4 238.09,-156.04 227.5,-155.72 229.61,-162.4"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty#" xlink:title=" ">
<polygon fill="white" stroke="black" points="238,-77 238,-107 335,-107 335,-77 238,-77"/>
<text text-anchor="start" x="246" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
<text text-anchor="middle" x="286.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node7&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M191.18,-78.57C203.1,-80.27 215.6,-82.05 227.46,-83.73"/>
<polygon fill="midnightblue" stroke="midnightblue" points="227.28,-87.25 237.68,-85.19 228.27,-80.32 227.28,-87.25"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop#" xlink:title=" ">
<polygon fill="white" stroke="black" points="227,-38.5 227,-57.5 346,-57.5 346,-38.5 227,-38.5"/>
<text text-anchor="middle" x="286.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node9 -->
<g id="edge8" class="edge">
<title>Node7&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M191.18,-61.43C199.58,-60.23 208.27,-59 216.81,-57.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="217.35,-61.24 226.76,-56.36 216.36,-54.31 217.35,-61.24"/>
</g>
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top#" xlink:title=" ">
<polygon fill="white" stroke="black" points="228.5,-0.5 228.5,-19.5 344.5,-19.5 344.5,-0.5 228.5,-0.5"/>
<text text-anchor="middle" x="286.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node10 -->
<g id="edge9" class="edge">
<title>Node7&#45;&gt;Node10</title>
<path fill="none" stroke="midnightblue" d="M151.76,-60.5C171.05,-51.81 200.7,-38.87 227,-29 232.64,-26.89 238.63,-24.78 244.54,-22.79"/>
<polygon fill="midnightblue" stroke="midnightblue" points="245.96,-26 254.35,-19.54 243.76,-19.36 245.96,-26"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.0 KiB

After

Width:  |  Height:  |  Size: 8.2 KiB

18
df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,9 +1,13 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Entry point of the program." alt="" coords="5,89,56,116"/>
<area shape="rect" id="node2" href="$df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="104,89,148,116"/>
<area shape="rect" id="node3" href="$dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69" title="Adds the process to the ready queue if it isn&#39;t already there." alt="" coords="210,64,345,91"/>
<area shape="rect" id="node7" href="$dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor..." alt="" coords="196,115,359,141"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/end.html#" title=" " alt="" coords="407,5,565,32"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/find.html#" title=" " alt="" coords="421,57,551,98"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/insert.html#" title=" " alt="" coords="421,122,551,163"/>
<area shape="rect" id="node1" title="Entry point of the program." alt="" coords="5,224,56,251"/>
<area shape="rect" id="node2" href="$df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="104,224,148,251"/>
<area shape="rect" id="node3" href="$dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69" title="Adds the process to the ready queue if it isn&#39;t already there." alt="" coords="210,129,345,156"/>
<area shape="rect" id="node8" href="$dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor..." alt="" coords="196,289,359,316"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/end#" title=" " alt="" coords="407,5,565,32"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/find#" title=" " alt="" coords="421,57,551,98"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/insert#" title=" " alt="" coords="421,122,551,163"/>
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/push#" title=" " alt="" coords="421,187,551,229"/>
<area shape="rect" id="node9" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/empty#" title=" " alt="" coords="421,253,551,294"/>
<area shape="rect" id="node10" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/pop#" title=" " alt="" coords="407,319,565,345"/>
<area shape="rect" id="node11" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/top#" title=" " alt="" coords="409,369,563,396"/>
</map>

2
df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +1 @@
d1153ad5effebcdd01be2ae30d68c8af
d5d089a5f2b048e4ae665d15bd840340

146
df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: main Pages: 1 -->
<svg width="428pt" height="127pt"
viewBox="0.00 0.00 428.00 126.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 122.5)">
<svg width="428pt" height="301pt"
viewBox="0.00 0.00 428.00 301.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 297)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-122.5 424,-122.5 424,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-297 424,-297 424,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Entry point of the program.">
<polygon fill="#bfbfbf" stroke="black" points="0,-36 0,-55 38,-55 38,-36 0,-36"/>
<text text-anchor="middle" x="19" y="-43" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<polygon fill="#bfbfbf" stroke="black" points="0,-109.5 0,-128.5 38,-128.5 38,-109.5 0,-109.5"/>
<text text-anchor="middle" x="19" y="-116.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
@@ -22,93 +22,155 @@
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="black" points="74,-36 74,-55 107,-55 107,-36 74,-36"/>
<text text-anchor="middle" x="90.5" y="-43" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
<polygon fill="white" stroke="black" points="74,-109.5 74,-128.5 107,-128.5 107,-109.5 74,-109.5"/>
<text text-anchor="middle" x="90.5" y="-116.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.26,-45.5C46.07,-45.5 55.31,-45.5 63.79,-45.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.95,-49 73.95,-45.5 63.95,-42 63.95,-49"/>
<path fill="none" stroke="midnightblue" d="M38.26,-119C46.07,-119 55.31,-119 63.79,-119"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.95,-122.5 73.95,-119 63.95,-115.5 63.95,-122.5"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69" target="_top" xlink:title="Adds the process to the ready queue if it isn&#39;t already there.">
<polygon fill="white" stroke="black" points="153.5,-55 153.5,-74 254.5,-74 254.5,-55 153.5,-55"/>
<text text-anchor="middle" x="204" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::addProcess</text>
<polygon fill="white" stroke="black" points="153.5,-180.5 153.5,-199.5 254.5,-199.5 254.5,-180.5 153.5,-180.5"/>
<text text-anchor="middle" x="204" y="-187.5" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::addProcess</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M107,-48.14C116.64,-49.78 129.7,-52.01 143.09,-54.29"/>
<polygon fill="midnightblue" stroke="midnightblue" points="142.89,-57.81 153.33,-56.04 144.06,-50.91 142.89,-57.81"/>
<path fill="none" stroke="midnightblue" d="M106.54,-128.58C125.24,-140.49 157.39,-160.95 179.39,-174.97"/>
<polygon fill="midnightblue" stroke="midnightblue" points="177.53,-177.93 187.84,-180.35 181.29,-172.03 177.53,-177.93"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" target="_top" xlink:title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor...">
<polygon fill="white" stroke="black" points="143,-17 143,-36 265,-36 265,-17 143,-17"/>
<text text-anchor="middle" x="204" y="-24" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::scheduleForFcfs</text>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" target="_top" xlink:title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor...">
<polygon fill="white" stroke="black" points="143,-60.5 143,-79.5 265,-79.5 265,-60.5 143,-60.5"/>
<text text-anchor="middle" x="204" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::scheduleForFcfs</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node2&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M107,-42.86C115.2,-41.46 125.87,-39.64 137.11,-37.73"/>
<polygon fill="midnightblue" stroke="midnightblue" points="137.82,-41.16 147.09,-36.03 136.65,-34.26 137.82,-41.16"/>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node2&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M107,-112.19C123.71,-104.84 150.75,-92.96 171.88,-83.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="173.37,-86.85 181.11,-79.62 170.55,-80.44 173.37,-86.85"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="301,-99 301,-118 420,-118 420,-99 301,-99"/>
<text text-anchor="middle" x="360.5" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end#" xlink:title=" ">
<polygon fill="white" stroke="black" points="301,-273.5 301,-292.5 420,-292.5 420,-273.5 301,-273.5"/>
<text text-anchor="middle" x="360.5" y="-280.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M238.52,-74.05C261.3,-80.53 291.64,-89.17 316.24,-96.18"/>
<polygon fill="midnightblue" stroke="midnightblue" points="315.46,-99.6 326.04,-98.97 317.38,-92.87 315.46,-99.6"/>
<path fill="none" stroke="midnightblue" d="M215.11,-199.73C231.77,-215.28 266.57,-245.84 301,-264 305.04,-266.13 309.36,-268.08 313.76,-269.85"/>
<polygon fill="midnightblue" stroke="midnightblue" points="312.84,-273.24 323.44,-273.43 315.28,-266.68 312.84,-273.24"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="311.5,-49.5 311.5,-79.5 409.5,-79.5 409.5,-49.5 311.5,-49.5"/>
<text text-anchor="start" x="319.5" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
<text text-anchor="middle" x="360.5" y="-56.5" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find#" xlink:title=" ">
<polygon fill="white" stroke="black" points="311.5,-224 311.5,-254 409.5,-254 409.5,-224 311.5,-224"/>
<text text-anchor="start" x="319.5" y="-242" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
<text text-anchor="middle" x="360.5" y="-231" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node3&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M254.74,-64.5C269.5,-64.5 285.81,-64.5 301.07,-64.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="301.44,-68 311.44,-64.5 301.44,-61 301.44,-68"/>
<path fill="none" stroke="midnightblue" d="M235.16,-199.56C254.29,-205.63 279.65,-213.68 302.48,-220.92"/>
<polygon fill="midnightblue" stroke="midnightblue" points="301.5,-224.28 312.09,-223.96 303.61,-217.6 301.5,-224.28"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/insert.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="311.5,-0.5 311.5,-30.5 409.5,-30.5 409.5,-0.5 311.5,-0.5"/>
<text text-anchor="start" x="319.5" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
<text text-anchor="middle" x="360.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/insert#" xlink:title=" ">
<polygon fill="white" stroke="black" points="311.5,-175 311.5,-205 409.5,-205 409.5,-175 311.5,-175"/>
<text text-anchor="start" x="319.5" y="-193" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
<text text-anchor="middle" x="360.5" y="-182" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node3&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M235.22,-54.94C244.75,-51.92 255.31,-48.57 265,-45.5 277.04,-41.68 289.94,-37.59 302.22,-33.69"/>
<polygon fill="midnightblue" stroke="midnightblue" points="303.44,-36.98 311.91,-30.61 301.32,-30.3 303.44,-36.98"/>
<path fill="none" stroke="midnightblue" d="M254.74,-190C269.5,-190 285.81,-190 301.07,-190"/>
<polygon fill="midnightblue" stroke="midnightblue" points="301.44,-193.5 311.44,-190 301.44,-186.5 301.44,-193.5"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push#" xlink:title=" ">
<polygon fill="white" stroke="black" points="312,-126 312,-156 409,-156 409,-126 312,-126"/>
<text text-anchor="start" x="320" y="-144" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
<text text-anchor="middle" x="360.5" y="-133" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node3&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M235.16,-180.44C254.29,-174.37 279.65,-166.32 302.48,-159.08"/>
<polygon fill="midnightblue" stroke="midnightblue" points="303.61,-162.4 312.09,-156.04 301.5,-155.72 303.61,-162.4"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty#" xlink:title=" ">
<polygon fill="white" stroke="black" points="312,-77 312,-107 409,-107 409,-77 312,-77"/>
<text text-anchor="start" x="320" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
<text text-anchor="middle" x="360.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge8" class="edge">
<title>Node8&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M265.18,-78.57C277.1,-80.27 289.6,-82.05 301.46,-83.73"/>
<polygon fill="midnightblue" stroke="midnightblue" points="301.28,-87.25 311.68,-85.19 302.27,-80.32 301.28,-87.25"/>
</g>
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop#" xlink:title=" ">
<polygon fill="white" stroke="black" points="301,-38.5 301,-57.5 420,-57.5 420,-38.5 301,-38.5"/>
<text text-anchor="middle" x="360.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node10 -->
<g id="edge9" class="edge">
<title>Node8&#45;&gt;Node10</title>
<path fill="none" stroke="midnightblue" d="M265.18,-61.43C273.58,-60.23 282.27,-59 290.81,-57.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.35,-61.24 300.76,-56.36 290.36,-54.31 291.35,-61.24"/>
</g>
<!-- Node11 -->
<g id="node11" class="node">
<title>Node11</title>
<g id="a_node11"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top#" xlink:title=" ">
<polygon fill="white" stroke="black" points="302.5,-0.5 302.5,-19.5 418.5,-19.5 418.5,-0.5 302.5,-0.5"/>
<text text-anchor="middle" x="360.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node11 -->
<g id="edge10" class="edge">
<title>Node8&#45;&gt;Node11</title>
<path fill="none" stroke="midnightblue" d="M225.76,-60.5C245.05,-51.81 274.7,-38.87 301,-29 306.64,-26.89 312.63,-24.78 318.54,-22.79"/>
<polygon fill="midnightblue" stroke="midnightblue" points="319.96,-26 328.35,-19.54 317.76,-19.36 319.96,-26"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.7 KiB

After

Width:  |  Height:  |  Size: 9.0 KiB