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

📄 glib-trash-stacks.html

📁 glid编写实例
💻 HTML
字号:
<html xmlns:cf="http://docbook.sourceforge.net/xmlns/chunkfast/1.0"><head><meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"><title>Trash Stacks</title><meta name="generator" content="DocBook XSL Stylesheets V1.69.0"><link rel="start" href="index.html" title="GLib Reference Manual"><link rel="up" href="glib-data-types.html" title="GLib Data Types"><link rel="prev" href="glib-Double-ended-Queues.html" title="Double-ended Queues"><link rel="next" href="glib-Hash-Tables.html" title="Hash Tables"><meta name="generator" content="GTK-Doc V1.4 (XML mode)"><link rel="stylesheet" href="style.css" type="text/css"><link rel="chapter" href="glib.html" title="GLib Overview"><link rel="chapter" href="glib-fundamentals.html" title="GLib Fundamentals"><link rel="chapter" href="glib-core.html" title="GLib Core Application Support"><link rel="chapter" href="glib-utilities.html" title="GLib Utilities"><link rel="chapter" href="glib-data-types.html" title="GLib Data Types"><link rel="chapter" href="tools.html" title="GLib Tools"><link rel="index" href="ix01.html" title="Index"><link rel="index" href="ix02.html" title="Index of deprecated symbols"><link rel="index" href="ix03.html" title="Index of new symbols in 2.2"><link rel="index" href="ix04.html" title="Index of new symbols in 2.4"><link rel="index" href="ix05.html" title="Index of new symbols in 2.6"></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><table class="navigation" width="100%" summary="Navigation header" cellpadding="2" cellspacing="2"><tr valign="middle"><td><a accesskey="p" href="glib-Double-ended-Queues.html"><img src="left.png" width="24" height="24" border="0" alt="Prev"></a></td><td><a accesskey="u" href="glib-data-types.html"><img src="up.png" width="24" height="24" border="0" alt="Up"></a></td><td><a accesskey="h" href="index.html"><img src="home.png" width="24" height="24" border="0" alt="Home"></a></td><th width="100%" align="center">GLib Reference Manual</th><td><a accesskey="n" href="glib-Hash-Tables.html"><img src="right.png" width="24" height="24" border="0" alt="Next"></a></td></tr></table><div class="refentry" lang="en"><a name="glib-Trash-Stacks"></a><div class="titlepage"></div><div class="refnamediv"><table width="100%"><tr><td valign="top"><h2><span class="refentrytitle">Trash Stacks</span></h2><p>Trash Stacks &#8212; maintain a stack of unused allocated memory chunks.</p></td><td valign="top" align="right"></td></tr></table></div><div class="refsynopsisdiv"><h2>Synopsis</h2><pre class="synopsis">#include &lt;glib.h&gt;            <a href="glib-Trash-Stacks.html#GTrashStack">GTrashStack</a>;void        <a href="glib-Trash-Stacks.html#g-trash-stack-push">g_trash_stack_push</a>              (<a href="glib-Trash-Stacks.html#GTrashStack">GTrashStack</a> **stack_p,                                             <a href="glib-Basic-Types.html#gpointer">gpointer</a> data_p);<a href="glib-Basic-Types.html#gpointer">gpointer</a>    <a href="glib-Trash-Stacks.html#g-trash-stack-pop">g_trash_stack_pop</a>               (<a href="glib-Trash-Stacks.html#GTrashStack">GTrashStack</a> **stack_p);<a href="glib-Basic-Types.html#gpointer">gpointer</a>    <a href="glib-Trash-Stacks.html#g-trash-stack-peek">g_trash_stack_peek</a>              (<a href="glib-Trash-Stacks.html#GTrashStack">GTrashStack</a> **stack_p);<a href="glib-Basic-Types.html#guint">guint</a>       <a href="glib-Trash-Stacks.html#g-trash-stack-height">g_trash_stack_height</a>            (<a href="glib-Trash-Stacks.html#GTrashStack">GTrashStack</a> **stack_p);</pre></div><div class="refsect1" lang="en"><a name="id3135447"></a><h2>Description</h2><p>A <a href="glib-Trash-Stacks.html#GTrashStack"><span class="type">GTrashStack</span></a> is an efficient way to keep a stack of unused allocatedmemory chunks. Each memory chunk is required to be large enough to holda <a href="glib-Basic-Types.html#gpointer"><span class="type">gpointer</span></a>. This allows the stack to be maintained without any spaceoverhead, since the stack pointers can be stored inside the memory chunks.</p><p>There is no function to create a <a href="glib-Trash-Stacks.html#GTrashStack"><span class="type">GTrashStack</span></a>. A <code class="literal">NULL</code> <a href="glib-Trash-Stacks.html#GTrashStack"><span class="type">GTrashStack</span></a>* is a perfectly valid empty stack.</p></div><div class="refsect1" lang="en"><a name="id3135503"></a><h2>Details</h2><div class="refsect2" lang="en"><a name="id3135509"></a><h3><a name="GTrashStack"></a>GTrashStack</h3><a class="indexterm" name="id3135518"></a><pre class="programlisting">typedef struct {  GTrashStack *next;} GTrashStack;</pre><p>Each piece of memory that is pushed onto the stackis cast to a <span class="structname">GTrashStack*</span>.</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><a href="glib-Trash-Stacks.html#GTrashStack">GTrashStack</a>&#160;*<em class="structfield"><code>next</code></em>;</span></td><td>pointer to the previous element of the stack,gets stored in the first <code class="literal">sizeof (gpointer)</code>bytes of the element.</td></tr></tbody></table></div></div><hr><div class="refsect2" lang="en"><a name="id3135571"></a><h3><a name="g-trash-stack-push"></a>g_trash_stack_push ()</h3><a class="indexterm" name="id3135582"></a><pre class="programlisting">void        g_trash_stack_push              (<a href="glib-Trash-Stacks.html#GTrashStack">GTrashStack</a> **stack_p,                                             <a href="glib-Basic-Types.html#gpointer">gpointer</a> data_p);</pre><p>Pushes a piece of memory onto a <a href="glib-Trash-Stacks.html#GTrashStack"><span class="type">GTrashStack</span></a>.</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><em class="parameter"><code>stack_p</code></em>&#160;:</span></td><td>a pointer to a <a href="glib-Trash-Stacks.html#GTrashStack"><span class="type">GTrashStack</span></a>.</td></tr><tr><td><span class="term"><em class="parameter"><code>data_p</code></em>&#160;:</span></td><td>the piece of memory to push on the stack.</td></tr></tbody></table></div></div><hr><div class="refsect2" lang="en"><a name="id3135666"></a><h3><a name="g-trash-stack-pop"></a>g_trash_stack_pop ()</h3><a class="indexterm" name="id3135676"></a><pre class="programlisting"><a href="glib-Basic-Types.html#gpointer">gpointer</a>    g_trash_stack_pop               (<a href="glib-Trash-Stacks.html#GTrashStack">GTrashStack</a> **stack_p);</pre><p>Pops a piece of memory off a <a href="glib-Trash-Stacks.html#GTrashStack"><span class="type">GTrashStack</span></a>.</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><em class="parameter"><code>stack_p</code></em>&#160;:</span></td><td>a pointer to a <a href="glib-Trash-Stacks.html#GTrashStack"><span class="type">GTrashStack</span></a>.</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span>&#160;:</span></td><td>the element at the top of the stack.</td></tr></tbody></table></div></div><hr><div class="refsect2" lang="en"><a name="id3135750"></a><h3><a name="g-trash-stack-peek"></a>g_trash_stack_peek ()</h3><a class="indexterm" name="id3135761"></a><pre class="programlisting"><a href="glib-Basic-Types.html#gpointer">gpointer</a>    g_trash_stack_peek              (<a href="glib-Trash-Stacks.html#GTrashStack">GTrashStack</a> **stack_p);</pre><p>Returns the element at the top of a <a href="glib-Trash-Stacks.html#GTrashStack"><span class="type">GTrashStack</span></a>.</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><em class="parameter"><code>stack_p</code></em>&#160;:</span></td><td>a pointer to a <a href="glib-Trash-Stacks.html#GTrashStack"><span class="type">GTrashStack</span></a>.</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span>&#160;:</span></td><td>the element at the top of the stack.</td></tr></tbody></table></div></div><hr><div class="refsect2" lang="en"><a name="id3135834"></a><h3><a name="g-trash-stack-height"></a>g_trash_stack_height ()</h3><a class="indexterm" name="id3135844"></a><pre class="programlisting"><a href="glib-Basic-Types.html#guint">guint</a>       g_trash_stack_height            (<a href="glib-Trash-Stacks.html#GTrashStack">GTrashStack</a> **stack_p);</pre><p>Returns the height of a <a href="glib-Trash-Stacks.html#GTrashStack"><span class="type">GTrashStack</span></a>.</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><em class="parameter"><code>stack_p</code></em>&#160;:</span></td><td>a pointer to a <a href="glib-Trash-Stacks.html#GTrashStack"><span class="type">GTrashStack</span></a>.</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span>&#160;:</span></td><td>the height of the stack.</td></tr></tbody></table></div></div></div></div><table class="navigation" width="100%" summary="Navigation footer" cellpadding="2" cellspacing="0"><tr valign="middle"><td align="left"><a accesskey="p" href="glib-Double-ended-Queues.html"><b>&lt;&lt;&#160;Double-ended Queues</b></a></td><td align="right"><a accesskey="n" href="glib-Hash-Tables.html"><b>Hash Tables&#160;&gt;&gt;</b></a></td></tr></table></body></html>

⌨️ 快捷键说明

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