亚洲欧美第一页_禁久久精品乱码_粉嫩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一区二区三区免费野_久草精品视频
久久午夜老司机| 欧美一区二区三区免费大片 | 日韩av高清在线观看| 国产精品夫妻自拍| 中文字幕av免费专区久久| 国产三级一区二区三区| 欧美激情中文字幕一区二区| 欧美精彩视频一区二区三区| 中文字幕av一区二区三区高| 亚洲欧美日韩在线不卡| 亚洲精品欧美二区三区中文字幕| 136国产福利精品导航| 亚洲四区在线观看| 亚洲国产cao| 美脚の诱脚舐め脚责91| 国产一区二区三区不卡在线观看 | 成人免费观看视频| 粉嫩嫩av羞羞动漫久久久 | 欧美大肚乱孕交hd孕妇| 久久色在线观看| 国产精品超碰97尤物18| 亚洲福利视频三区| 久久aⅴ国产欧美74aaa| 成人app软件下载大全免费| 91黄色免费网站| 精品美女一区二区| 国产精品乱码人人做人人爱| 亚洲国产毛片aaaaa无费看| 久久精品国内一区二区三区| 成人污污视频在线观看| 欧美日韩一卡二卡三卡| 欧美精品一区二区三区蜜桃| 国产欧美日韩激情| 亚洲电影在线播放| 成人午夜激情视频| 日韩欧美中文字幕公布| 日韩一区日韩二区| 蜜桃视频在线一区| 91麻豆免费在线观看| 久久久久久久综合日本| 亚洲人123区| 国产乱人伦偷精品视频免下载| 色欧美88888久久久久久影院| 欧美成人精品1314www| 亚洲黄色片在线观看| 国产精品18久久久久久久久久久久 | 色婷婷综合久久| 精品国产伦理网| 一区二区免费在线| 不卡在线观看av| 日韩三级视频在线观看| 一区二区三区丝袜| 91丨porny丨中文| 久久蜜臀中文字幕| 视频一区二区不卡| 91久久精品网| 国产欧美一区二区在线观看| 久久99热国产| 日韩欧美一级精品久久| 亚洲成人手机在线| 91九色最新地址| 国产精品精品国产色婷婷| 久久99国产乱子伦精品免费| 欧美精品 日韩| 亚洲成人资源网| 欧美日韩一区高清| 亚洲国产一区二区视频| 欧美在线观看18| 一区二区三区在线观看欧美| 91免费国产在线观看| 亚洲三级在线播放| 一本一本久久a久久精品综合麻豆 一本一道波多野结衣一区二区 | 欧美精品在线一区二区| 亚洲午夜久久久久久久久电影网| 成人av小说网| 国产欧美日韩在线视频| 国产在线一区观看| 26uuu国产日韩综合| 美女在线视频一区| 日韩一级片在线观看| 轻轻草成人在线| 日韩免费高清电影| 韩国一区二区视频| 国产亚洲综合在线| 波多野结衣中文字幕一区| 自拍偷拍亚洲激情| 91福利小视频| 男人操女人的视频在线观看欧美| 日韩欧美你懂的| 国产精品 欧美精品| 亚洲天堂久久久久久久| 色一区在线观看| 亚洲高清在线精品| 日韩亚洲欧美在线| 国产99久久久久| 一区二区在线看| 91精品国产综合久久精品| 蜜臀av一级做a爰片久久| 久久综合久色欧美综合狠狠| 国产成a人亚洲精| 亚洲成在线观看| 欧美成人精精品一区二区频| av在线不卡电影| 亚洲国产成人av网| 久久久亚洲精品一区二区三区| 国产伦精品一区二区三区免费| 最新国产の精品合集bt伙计| 欧美性做爰猛烈叫床潮| 精品一区二区三区香蕉蜜桃 | 欧美成人一区二区三区片免费 | 777午夜精品免费视频| 国产高清一区日本| 亚洲小说欧美激情另类| 欧美成人猛片aaaaaaa| 91麻豆6部合集magnet| 久久成人18免费观看| 亚洲综合激情网| 久久久噜噜噜久久人人看| 欧美日韩精品一区二区在线播放| 精品无人码麻豆乱码1区2区| 亚洲男人的天堂网| 久久久久久久久久久黄色| 在线欧美一区二区| 成人av网址在线观看| 蜜臀久久久久久久| 亚洲狠狠爱一区二区三区| 亚洲国产精品传媒在线观看| 欧美高清视频一二三区 | 一区二区三区在线播放| 日本一区二区三区四区在线视频| 欧美猛男男办公室激情| 色就色 综合激情| 成人免费高清在线| 国产999精品久久久久久绿帽| 视频一区二区国产| 亚洲成人资源网| 一区二区三区欧美| 一区二区三区波多野结衣在线观看 | 日本女人一区二区三区| 亚洲黄色av一区| 亚洲欧美韩国综合色| 国产精品国产自产拍高清av王其| 久久精品亚洲一区二区三区浴池| 欧美一卡二卡三卡四卡| 欧美另类videos死尸| 欧美日韩电影在线| 欧美另类一区二区三区| 欧美精品久久久久久久久老牛影院| 99精品国产91久久久久久 | 欧美视频在线一区| 欧美在线色视频| 91精品1区2区| 欧美日韩精品一区二区三区| 在线观看国产精品网站| 欧洲人成人精品| 91麻豆精品国产自产在线| 欧美日韩中文一区| 欧美一区日韩一区| 精品久久99ma| 亚洲国产经典视频| 国产精品久久久久久妇女6080| 欧美激情一区不卡| 亚洲精选在线视频| 亚洲一区在线观看免费 | 国产aⅴ综合色| 99在线精品一区二区三区| 99久久久无码国产精品| 91社区在线播放| 欧洲精品一区二区| 欧美一区二区三区免费大片 | 专区另类欧美日韩| 亚洲精品伦理在线| 日韩成人免费看| 国内精品伊人久久久久影院对白| 国产高清在线观看免费不卡| 99久久99久久精品国产片果冻| 色先锋资源久久综合| 欧美剧在线免费观看网站 | 午夜精品久久久久久不卡8050| 午夜精品福利视频网站| 激情综合色播激情啊| www.色精品| 91精品国产色综合久久| 久久精品亚洲一区二区三区浴池| 亚洲人成7777| 国产自产2019最新不卡| 色哟哟亚洲精品| 日韩欧美在线一区二区三区| ㊣最新国产の精品bt伙计久久| 午夜精品久久久久久久久久| 国产麻豆精品theporn| 一本大道久久a久久精二百| 日韩一区二区精品| 一区二区三区四区不卡在线 | 久久久久久日产精品| 亚洲精品视频在线观看网站| 另类小说综合欧美亚洲| 91色porny在线视频| 欧美一级理论性理论a| 亚洲色图.com|