亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關于我們
? 蟲蟲下載站

?? arraylist_8h.html

?? 常用的數據結構和算法函數庫
?? HTML
?? 第 1 頁 / 共 2 頁
字號:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>C Algorithms: arraylist.h File Reference</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.4.4 --><div class="qindex"><a class="qindex" href="index.html">Main&nbsp;Page</a> | <a class="qindex" href="annotated.html">Data&nbsp;Structures</a> | <a class="qindex" href="files.html">File&nbsp;List</a> | <a class="qindex" href="functions.html">Data&nbsp;Fields</a> | <a class="qindex" href="globals.html">Globals</a></div><h1>arraylist.h File Reference</h1>Automatically resizing array. <a href="#_details">More...</a><p><table border="0" cellpadding="0" cellspacing="0"><tr><td></td></tr><tr><td colspan="2"><br><h2>Data Structures</h2></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">struct &nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct__ArrayList.html">_ArrayList</a></td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">An ArrayList structure.  <a href="struct__ArrayList.html#_details">More...</a><br></td></tr><tr><td colspan="2"><br><h2>Typedefs</h2></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="struct__ArrayList.html">_ArrayList</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a0">ArrayList</a></td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">An ArrayList structure.  <a href="#a0"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">typedef int(*&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a1">ArrayListEqualFunc</a> )(void *data1, void *data2)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Compare two values in an arraylist to determine if they are equal.  <a href="#a1"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">typedef int(*&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a2">ArrayListCompareFunc</a> )(void *data1, void *data2)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Compare two values in an arraylist.  <a href="#a2"></a><br></td></tr><tr><td colspan="2"><br><h2>Functions</h2></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="struct__ArrayList.html">ArrayList</a> *&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a3">arraylist_new</a> (int length)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Allocate a new ArrayList for use.  <a href="#a3"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a4">arraylist_free</a> (<a class="el" href="struct__ArrayList.html">ArrayList</a> *arraylist)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Destroy an ArrayList and free back the memory it uses.  <a href="#a4"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a5">arraylist_append</a> (<a class="el" href="struct__ArrayList.html">ArrayList</a> *arraylist, void *data)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Append data to the end of an ArrayList.  <a href="#a5"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a6">arraylist_prepend</a> (<a class="el" href="struct__ArrayList.html">ArrayList</a> *arraylist, void *data)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Prepend data to the beginning of an ArrayList.  <a href="#a6"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a7">arraylist_remove</a> (<a class="el" href="struct__ArrayList.html">ArrayList</a> *arraylist, int index)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Remove the entry at the specified location in an ArrayList.  <a href="#a7"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a8">arraylist_remove_range</a> (<a class="el" href="struct__ArrayList.html">ArrayList</a> *arraylist, int index, int length)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Remove a range of entries at the specified location in an ArrayList.  <a href="#a8"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a9">arraylist_insert</a> (<a class="el" href="struct__ArrayList.html">ArrayList</a> *arraylist, int index, void *data)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Insert new data at the specified index in an ArrayList.  <a href="#a9"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a10">arraylist_index_of</a> (<a class="el" href="struct__ArrayList.html">ArrayList</a> *arraylist, <a class="el" href="arraylist_8h.html#a1">ArrayListEqualFunc</a> callback, void *data)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Find the index of a particular pointer in an ArrayList.  <a href="#a10"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a11">arraylist_clear</a> (<a class="el" href="struct__ArrayList.html">ArrayList</a> *arraylist)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Remove all entries from an ArrayList.  <a href="#a11"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="arraylist_8h.html#a12">arraylist_sort</a> (<a class="el" href="struct__ArrayList.html">ArrayList</a> *arraylist, <a class="el" href="arraylist_8h.html#a2">ArrayListCompareFunc</a> compare_func)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Sort the values in an ArrayList.  <a href="#a12"></a><br></td></tr></table><hr><a name="_details"></a><h2>Detailed Description</h2>Automatically resizing array. <p>ArrayLists are arrays of pointers which automatically increase in size.<p>To create an ArrayList, use <a class="el" href="arraylist_8h.html#a3">arraylist_new</a>. To destroy an ArrayList, use <a class="el" href="arraylist_8h.html#a4">arraylist_free</a>.<p>To add data an ArrayList, use <a class="el" href="arraylist_8h.html#a6">arraylist_prepend</a>, <a class="el" href="arraylist_8h.html#a5">arraylist_append</a>, or <a class="el" href="arraylist_8h.html#a9">arraylist_insert</a>.<p>To remove data from an ArrayList, use <a class="el" href="arraylist_8h.html#a7">arraylist_remove</a> or <a class="el" href="arraylist_8h.html#a8">arraylist_remove_range</a>.<hr><h2>Typedef Documentation</h2><a class="anchor" name="a0"></a><!-- doxytag: member="arraylist.h::ArrayList" ref="a0" args="" --><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">typedef struct <a class="el" href="struct__ArrayList.html">_ArrayList</a>  <a class="el" href="struct__ArrayList.html">ArrayList</a>          </td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>An ArrayList structure. <p>New ArrayLists can be created using the arraylist_new function.<p><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="arraylist_8h.html#a3">arraylist_new</a></dd></dl>    </td>  </tr></table><a class="anchor" name="a2"></a><!-- doxytag: member="arraylist.h::ArrayListCompareFunc" ref="a2" args=")(void *data1, void *data2)" --><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">typedef int(* <a class="el" href="arraylist_8h.html#a2">ArrayListCompareFunc</a>)(void *data1, void *data2)          </td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Compare two values in an arraylist. <p>Used by <a class="el" href="arraylist_8h.html#a12">arraylist_sort</a> when sorting values.<p><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>data1</em>&nbsp;</td><td>The first value. </td></tr>    <tr><td valign="top"></td><td valign="top"><em>data2</em>&nbsp;</td><td>The second value. </td></tr>  </table></dl><dl compact><dt><b>Returns:</b></dt><dd>A negative number if data1 should be sorted before data2, a positive number if data2 should be sorted before data1, zero if the two values are equal.</dd></dl>    </td>  </tr></table><a class="anchor" name="a1"></a><!-- doxytag: member="arraylist.h::ArrayListEqualFunc" ref="a1" args=")(void *data1, void *data2)" --><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">typedef int(* <a class="el" href="arraylist_8h.html#a1">ArrayListEqualFunc</a>)(void *data1, void *data2)          </td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Compare two values in an arraylist to determine if they are equal. <p><dl compact><dt><b>Returns:</b></dt><dd>Non-zero if the values are not equal, zero if they are equal.</dd></dl>    </td>  </tr></table><hr><h2>Function Documentation</h2><a class="anchor" name="a5"></a><!-- doxytag: member="arraylist.h::arraylist_append" ref="a5" args="(ArrayList *arraylist, void *data)" --><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">void arraylist_append           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top"><a class="el" href="struct__ArrayList.html">ArrayList</a> *&nbsp;</td>          <td class="mdname" nowrap> <em>arraylist</em>, </td>        </tr>        <tr>          <td class="md" nowrap align="right"></td>          <td class="md"></td>          <td class="md" nowrap>void *&nbsp;</td>          <td class="mdname" nowrap> <em>data</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>Append data to the end of an ArrayList. <p><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>arraylist</em>&nbsp;</td><td>The ArrayList. </td></tr>    <tr><td valign="top"></td><td valign="top"><em>data</em>&nbsp;</td><td>The data to append.</td></tr>  </table></dl>    </td>  </tr></table><a class="anchor" name="a11"></a><!-- doxytag: member="arraylist.h::arraylist_clear" ref="a11" args="(ArrayList *arraylist)" --><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">void arraylist_clear           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top"><a class="el" href="struct__ArrayList.html">ArrayList</a> *&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>arraylist</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>Remove all entries from an ArrayList. <p><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>arraylist</em>&nbsp;</td><td>The ArrayList.</td></tr>  </table></dl>    </td>  </tr></table><a class="anchor" name="a4"></a><!-- doxytag: member="arraylist.h::arraylist_free" ref="a4" args="(ArrayList *arraylist)" --><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">void arraylist_free           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top"><a class="el" href="struct__ArrayList.html">ArrayList</a> *&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>arraylist</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>Destroy an ArrayList and free back the memory it uses. <p><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>arraylist</em>&nbsp;</td><td>The ArrayList to free.</td></tr>  </table></dl>    </td>  </tr></table><a class="anchor" name="a10"></a><!-- doxytag: member="arraylist.h::arraylist_index_of" ref="a10" args="(ArrayList *arraylist, ArrayListEqualFunc callback, void *data)" --><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">int arraylist_index_of           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top"><a class="el" href="struct__ArrayList.html">ArrayList</a> *&nbsp;</td>          <td class="mdname" nowrap> <em>arraylist</em>, </td>        </tr>        <tr>          <td class="md" nowrap align="right"></td>          <td class="md"></td>          <td class="md" nowrap><a class="el" href="arraylist_8h.html#a1">ArrayListEqualFunc</a>&nbsp;</td>          <td class="mdname" nowrap> <em>callback</em>, </td>        </tr>        <tr>          <td class="md" nowrap align="right"></td>          <td class="md"></td>          <td class="md" nowrap>void *&nbsp;</td>          <td class="mdname" nowrap> <em>data</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>

?? 快捷鍵說明

復制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
日本vs亚洲vs韩国一区三区| 亚洲精品成人精品456| 麻豆精品新av中文字幕| 欧美剧情片在线观看| 天天色综合成人网| 欧美一卡在线观看| 久久精品国产一区二区| 精品91自产拍在线观看一区| 国产乱码精品一品二品| 国产精品欧美一级免费| 91亚洲精品乱码久久久久久蜜桃| 亚洲欧美日韩国产手机在线| 欧美在线综合视频| 免费成人结看片| 国产日本欧美一区二区| 99精品欧美一区二区蜜桃免费 | 国产精品一区专区| 欧美激情资源网| 色菇凉天天综合网| 奇米一区二区三区av| 久久久久88色偷偷免费| 在线免费亚洲电影| 精油按摩中文字幕久久| 国产精品国产三级国产aⅴ无密码| 欧美在线制服丝袜| 国产一区二区免费看| 综合电影一区二区三区| 欧美高清你懂得| 成人性视频免费网站| 亚洲自拍与偷拍| 久久色在线视频| 欧美在线观看一区二区| 国模娜娜一区二区三区| 亚洲日本中文字幕区| 91精品国产综合久久福利| 国产成人精品综合在线观看 | 亚洲欧美另类小说| 欧美大片一区二区| eeuss国产一区二区三区| 日韩电影一区二区三区| 国产精品国产自产拍高清av| 91精品国产色综合久久不卡电影 | 国产精品久久一卡二卡| 欧美男人的天堂一二区| 国产ts人妖一区二区| 亚洲成人午夜电影| 亚洲欧洲99久久| 2023国产精品| 91精品国产综合久久福利| 91丨国产丨九色丨pron| 国产精品综合在线视频| 日本欧美一区二区在线观看| 麻豆国产精品一区二区三区| 亚洲女与黑人做爰| 久久精品欧美日韩精品| 在线不卡免费欧美| 精品视频在线免费观看| 91免费看片在线观看| 国产福利精品一区| 国产一区二区在线观看视频| 青青草原综合久久大伊人精品优势 | 日韩欧美国产电影| 欧美日韩国产乱码电影| 91香蕉视频黄| 91碰在线视频| caoporm超碰国产精品| 国产黄色精品网站| 国产美女精品人人做人人爽| 久久成人久久爱| 日韩av一区二| 奇米一区二区三区av| 日韩**一区毛片| 亚洲成精国产精品女| 香蕉影视欧美成人| 亚洲午夜久久久久久久久电影网 | 国模娜娜一区二区三区| 卡一卡二国产精品| 奇米色一区二区| 日韩av成人高清| 首页亚洲欧美制服丝腿| 午夜不卡在线视频| 日韩精品高清不卡| 美女精品自拍一二三四| 激情成人午夜视频| 国产福利一区二区| 成人激情图片网| 色综合天天综合狠狠| 欧美日韩一二三| 91精品国产高清一区二区三区| 欧美丰满高潮xxxx喷水动漫| 欧美一区二区二区| 久久久不卡网国产精品一区| 国产欧美日韩视频在线观看| 日本一区二区在线不卡| 日韩理论片在线| 亚洲尤物视频在线| 免费观看日韩电影| 国产老妇另类xxxxx| 成人激情图片网| 在线视频综合导航| 91精品国产色综合久久久蜜香臀| 日韩免费一区二区三区在线播放| 久久精品视频免费观看| 国产精品免费视频一区| 一区二区三区四区av| 免费高清视频精品| 高清不卡一区二区| 欧美四级电影网| 26uuu精品一区二区三区四区在线| 日本一区二区三区在线不卡| 一区二区三区在线观看国产| 青青草一区二区三区| 成人午夜av电影| 欧美日韩国产乱码电影| 久久青草欧美一区二区三区| 亚洲图片你懂的| 久久不见久久见免费视频1| 成人中文字幕合集| 欧美剧在线免费观看网站| 国产欧美视频一区二区| 亚洲影视在线播放| 国产精品白丝av| 在线观看国产精品网站| 久久综合网色—综合色88| 国产精品一区二区视频| 色综合激情久久| 精品动漫一区二区三区在线观看| 亚洲视频电影在线| 激情欧美一区二区三区在线观看| 99久久精品国产网站| 日韩欧美国产综合| 国产精品福利av| 免费欧美高清视频| 91麻豆精东视频| 久久精品免费在线观看| 天天色图综合网| 色视频成人在线观看免| 欧美国产97人人爽人人喊| 日韩成人精品视频| 在线区一区二视频| 国产精品美女久久久久久久网站| 麻豆91精品视频| 欧美综合天天夜夜久久| 中文一区在线播放| 日韩和的一区二区| 欧美视频一区二区在线观看| 亚洲欧洲精品一区二区三区| 国产一区二区不卡| 日韩一区二区三区在线| 亚洲国产精品一区二区www在线| eeuss鲁一区二区三区| 久久精品欧美日韩精品 | 精品久久久影院| 丝袜脚交一区二区| 色婷婷久久一区二区三区麻豆| 久久久高清一区二区三区| 麻豆91在线看| 欧美一级二级三级蜜桃| 亚洲1区2区3区4区| 欧美在线观看视频一区二区| 亚洲日本中文字幕区| 成人看片黄a免费看在线| 久久久久99精品一区| 日本91福利区| 欧美二区三区的天堂| 无吗不卡中文字幕| 91精品欧美一区二区三区综合在| 亚洲综合免费观看高清完整版在线 | 热久久免费视频| 欧美一级电影网站| 成人精品免费看| 亚洲国产精品精华液2区45| 成人免费毛片高清视频| 国产欧美一区二区精品仙草咪| 国产成a人无v码亚洲福利| 日本一区二区三区视频视频| 国产成人无遮挡在线视频| 国产视频911| a级精品国产片在线观看| 综合欧美一区二区三区| 色女孩综合影院| 亚洲成人免费影院| 欧美电视剧在线观看完整版| 久草这里只有精品视频| 久久久久综合网| 91视视频在线观看入口直接观看www | 蜜桃在线一区二区三区| 精品国产免费视频| eeuss鲁片一区二区三区在线观看 eeuss鲁片一区二区三区在线看 | 色天天综合色天天久久| 亚洲午夜免费福利视频| 欧美一区二区三区视频在线| 激情图片小说一区| 国产精品国产精品国产专区不蜜| 一本在线高清不卡dvd| 午夜视黄欧洲亚洲| 精品国产一区久久| av在线免费不卡| 天堂一区二区在线| 欧美国产精品中文字幕|