backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 06:12:11 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 0931d530ae

Browse Source
This commit is contained in:
github-actions
2023-01-22 19:44:10 +00:00
parent a448f64699
commit b48f6e8671
2457 changed files with 9513 additions and 8691 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
d9/d14/array__left__rotation_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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: operations_on_datastructures/array_left_rotation.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -128,36 +128,36 @@ 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:a6109193567a5b7e36a27f2b4865fce20"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;array)</td></tr>
<tr class="memdesc:a6109193567a5b7e36a27f2b4865fce20"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the values of a vector sequentially, ending with a newline character. <a href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">More...</a><br /></td></tr>
<tr class="memdesc:a6109193567a5b7e36a27f2b4865fce20"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the values of a vector sequentially, ending with a newline character. <br /></td></tr>
<tr class="separator:a6109193567a5b7e36a27f2b4865fce20"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afce39cf843989a39811a49ebe29dd6d8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8">operations_on_datastructures::shift_left</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;array, size_t shift)</td></tr>
<tr class="memdesc:afce39cf843989a39811a49ebe29dd6d8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Shifts the given vector to the left by the shift amount and returns a new vector with the result. The original vector is not mutated. <a href="../../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8">More...</a><br /></td></tr>
<tr class="memdesc:afce39cf843989a39811a49ebe29dd6d8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Shifts the given vector to the left by the shift amount and returns a new vector with the result. The original vector is not mutated. <br /></td></tr>
<tr class="separator:afce39cf843989a39811a49ebe29dd6d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a167c24bd817469ae47358d12e034f2d5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a> ()</td></tr>
<tr class="memdesc:a167c24bd817469ae47358d12e034f2d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an simple case. <a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">More...</a><br /></td></tr>
<tr class="memdesc:a167c24bd817469ae47358d12e034f2d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an simple case. <br /></td></tr>
<tr class="separator:a167c24bd817469ae47358d12e034f2d5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abdd77344d4af8fd56d14a5cabbf2f669"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a> ()</td></tr>
<tr class="memdesc:abdd77344d4af8fd56d14a5cabbf2f669"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an empty vector. <a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">More...</a><br /></td></tr>
<tr class="memdesc:abdd77344d4af8fd56d14a5cabbf2f669"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an empty vector. <br /></td></tr>
<tr class="separator:abdd77344d4af8fd56d14a5cabbf2f669"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa515639572647508b94986489aab6d76"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a> ()</td></tr>
<tr class="memdesc:aa515639572647508b94986489aab6d76"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an invalid shift value. <a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">More...</a><br /></td></tr>
<tr class="memdesc:aa515639572647508b94986489aab6d76"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an invalid shift value. <br /></td></tr>
<tr class="separator:aa515639572647508b94986489aab6d76"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2b9769e44683dcb67fe1083ad91e134d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a> ()</td></tr>
<tr class="memdesc:a2b9769e44683dcb67fe1083ad91e134d"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check a very large input. <a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">More...</a><br /></td></tr>
<tr class="memdesc:a2b9769e44683dcb67fe1083ad91e134d"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check a very large input. <br /></td></tr>
<tr class="separator:a2b9769e44683dcb67fe1083ad91e134d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af7b81d7a1534216af6a36a80135beb86"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a> ()</td></tr>
<tr class="memdesc:af7b81d7a1534216af6a36a80135beb86"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check a shift of zero. <a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">More...</a><br /></td></tr>
<tr class="memdesc:af7b81d7a1534216af6a36a80135beb86"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check a shift of zero. <br /></td></tr>
<tr class="separator:af7b81d7a1534216af6a36a80135beb86"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test the correctness of shift_left() function. <a href="../../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test the correctness of shift_left() function. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">main function <a href="../../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">main function <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Implementation for the <a href="https://www.javatpoint.com/program-to-left-rotate-the-elements-of-an-array" target="_blank">Array Left Rotation</a> algorithm. </p>
<p >Shifting an array to the left involves moving each element of the array so that it occupies a position of a certain shift value before its current one. This implementation uses a result vector and does not mutate the input. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/polarvoid" target="_blank">Alvin</a> </dd></dl>
<div class="textblock"><p>Implementation for the <a href="https://www.javatpoint.com/program-to-left-rotate-the-elements-of-an-array" target="_blank">Array Left Rotation</a> algorithm. </p>
<p>Shifting an array to the left involves moving each element of the array so that it occupies a position of a certain shift value before its current one. This implementation uses a result vector and does not mutate the input. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/polarvoid" target="_blank">Alvin</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -243,7 +243,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_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../d9/d14/array__left__rotation_8cpp.html">array_left_rotation.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.5 </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.6 </li>
</ul>
</div>
</body>