⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 group__gdsl__perm.html

📁 一个通用的C语言实现的数据结构
💻 HTML
📖 第 1 页 / 共 5 页
字号:
        </tr>        <tr>          <td class="md" nowrap align="right"></td>          <td class="md"></td>          <td class="md" nowrap>const <a class="el" href="group__gdsl__types.html#g9c34ac44da309b004570530c8cec8a0e">ulong</a>&nbsp;</td>          <td class="mdname" nowrap> <em>INDIX</em></td>        </tr>        <tr>          <td class="md"></td>          <td class="md">)&nbsp;</td>          <td class="md" colspan="2"></td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Get the (INDIX+1)-th element from a permutation. <p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( 1 ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>P must be a valid gdsl_perm_t &amp; &lt;= 0 INDIX &lt; |P| </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>P</em>&nbsp;</td><td>The permutation to use. </td></tr>    <tr><td valign="top"></td><td valign="top"><em>INDIX</em>&nbsp;</td><td>The indix of the value to get. </td></tr>  </table></dl><dl compact><dt><b>Returns:</b></dt><dd>the value at the INDIX-th position in the permutation P. </dd></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__perm.html#gc9b83edf2f8ec8ad479586219881cc93">gdsl_perm_get_size()</a> <p><a class="el" href="group__gdsl__perm.html#ga5e0d0afabe6d79d5ce04da174b8667b">gdsl_perm_get_elements_array()</a> </dd></dl>    </td>  </tr></table><a class="anchor" name="ga5e0d0afabe6d79d5ce04da174b8667b"></a><!-- doxytag: member="gdsl_perm.h::gdsl_perm_get_elements_array" ref="ga5e0d0afabe6d79d5ce04da174b8667b" args="(const gdsl_perm_t P)" --><p><table class="mdTable" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" nowrap valign="top"><a class="el" href="group__gdsl__types.html#g9c34ac44da309b004570530c8cec8a0e">ulong</a>* gdsl_perm_get_elements_array           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top">const <a class="el" href="group__gdsl__perm.html#gd6fc9c69f61c5703242070522910bea8">gdsl_perm_t</a>&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>P</em>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap></td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Get the array elements of a permutation. <p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( 1 ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>P must be a valid gdsl_perm_t </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>P</em>&nbsp;</td><td>The permutation to get datas from. </td></tr>  </table></dl><dl compact><dt><b>Returns:</b></dt><dd>the values array of the permutation P. </dd></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__perm.html#g6b88e7e20a9942a1da01c23d2ef8936c">gdsl_perm_get_element()</a> <p><a class="el" href="group__gdsl__perm.html#gb6a8108d042d230f0838e975d439656a">gdsl_perm_set_elements_array()</a> </dd></dl>    </td>  </tr></table><a class="anchor" name="g9e3960e0cbaba7b0a1821742651f26ce"></a><!-- doxytag: member="gdsl_perm.h::gdsl_perm_linear_inversions_count" ref="g9e3960e0cbaba7b0a1821742651f26ce" args="(const gdsl_perm_t P)" --><p><table class="mdTable" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" nowrap valign="top"><a class="el" href="group__gdsl__types.html#g9c34ac44da309b004570530c8cec8a0e">ulong</a> gdsl_perm_linear_inversions_count           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top">const <a class="el" href="group__gdsl__perm.html#gd6fc9c69f61c5703242070522910bea8">gdsl_perm_t</a>&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>P</em>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap></td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Count the inversions number into a linear permutation. <p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( |P| ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>P must be a valid linear gdsl_perm_t </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>P</em>&nbsp;</td><td>The linear permutation to use. </td></tr>  </table></dl><dl compact><dt><b>Returns:</b></dt><dd>the number of inversions into the linear permutation P. </dd></dl>    </td>  </tr></table><a class="anchor" name="g84ccaeabf3ffbc6143be37b3de6c53e3"></a><!-- doxytag: member="gdsl_perm.h::gdsl_perm_linear_cycles_count" ref="g84ccaeabf3ffbc6143be37b3de6c53e3" args="(const gdsl_perm_t P)" --><p><table class="mdTable" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" nowrap valign="top"><a class="el" href="group__gdsl__types.html#g9c34ac44da309b004570530c8cec8a0e">ulong</a> gdsl_perm_linear_cycles_count           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top">const <a class="el" href="group__gdsl__perm.html#gd6fc9c69f61c5703242070522910bea8">gdsl_perm_t</a>&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>P</em>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap></td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Count the cycles number into a linear permutation. <p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( |P| ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>P must be a valid linear gdsl_perm_t </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>P</em>&nbsp;</td><td>The linear permutation to use. </td></tr>  </table></dl><dl compact><dt><b>Returns:</b></dt><dd>the number of cycles into the linear permutation P. </dd></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__perm.html#g4f851d54782568685ae55b964ea94ef7">gdsl_perm_canonical_cycles_count()</a> </dd></dl>    </td>  </tr></table><a class="anchor" name="g4f851d54782568685ae55b964ea94ef7"></a><!-- doxytag: member="gdsl_perm.h::gdsl_perm_canonical_cycles_count" ref="g4f851d54782568685ae55b964ea94ef7" args="(const gdsl_perm_t P)" --><p><table class="mdTable" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" nowrap valign="top"><a class="el" href="group__gdsl__types.html#g9c34ac44da309b004570530c8cec8a0e">ulong</a> gdsl_perm_canonical_cycles_count           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top">const <a class="el" href="group__gdsl__perm.html#gd6fc9c69f61c5703242070522910bea8">gdsl_perm_t</a>&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>P</em>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap></td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Count the cycles number into a canonical permutation. <p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( |P| ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>P must be a valid canonical gdsl_perm_t </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>P</em>&nbsp;</td><td>The canonical permutation to use. </td></tr>  </table></dl><dl compact><dt><b>Returns:</b></dt><dd>the number of cycles into the canonical permutation P. </dd></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__perm.html#g84ccaeabf3ffbc6143be37b3de6c53e3">gdsl_perm_linear_cycles_count()</a> </dd></dl>    </td>  </tr></table><a class="anchor" name="gceca0436e5a36d5d18f660ac095b1c3e"></a><!-- doxytag: member="gdsl_perm.h::gdsl_perm_set_name" ref="gceca0436e5a36d5d18f660ac095b1c3e" args="(gdsl_perm_t P, const char *NEW_NAME)" --><p><table class="mdTable" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" nowrap valign="top"><a class="el" href="group__gdsl__perm.html#gd6fc9c69f61c5703242070522910bea8">gdsl_perm_t</a> gdsl_perm_set_name           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top"><a class="el" href="group__gdsl__perm.html#gd6fc9c69f61c5703242070522910bea8">gdsl_perm_t</a>&nbsp;</td>          <td class="mdname" nowrap> <em>P</em>, </td>        </tr>        <tr>          <td class="md" nowrap align="right"></td>          <td class="md"></td>          <td class="md" nowrap>const char *&nbsp;</td>          <td class="mdname" nowrap> <em>NEW_NAME</em></td>        </tr>        <tr>          <td class="md"></td>          <td class="md">)&nbsp;</td>          <td class="md" colspan="2"></td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -