root / trunk / docs / libwireless / queue_8h.html @ 192
History | View | Annotate | Download (4.88 KB)
1 |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
---|---|
2 |
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"> |
3 |
<title>libwireless: queue.h File Reference</title> |
4 |
<link href="doxygen.css" rel="stylesheet" type="text/css"> |
5 |
<link href="tabs.css" rel="stylesheet" type="text/css"> |
6 |
</head><body> |
7 |
<!-- Generated by Doxygen 1.4.6 -->
|
8 |
<div class="tabs"> |
9 |
<ul>
|
10 |
<li><a href="index.html"><span>Main Page</span></a></li> |
11 |
<li><a href="modules.html"><span>Modules</span></a></li> |
12 |
<li><a href="annotated.html"><span>Data Structures</span></a></li> |
13 |
<li id="current"><a href="files.html"><span>Files</span></a></li> |
14 |
</ul></div> |
15 |
<div class="tabs"> |
16 |
<ul>
|
17 |
<li><a href="files.html"><span>File List</span></a></li> |
18 |
<li><a href="globals.html"><span>Globals</span></a></li> |
19 |
</ul></div> |
20 |
<h1>queue.h File Reference</h1>A queue implementation. <a href="#_details">More...</a> |
21 |
<p>
|
22 |
|
23 |
<p>
|
24 |
<a href="queue_8h-source.html">Go to the source code of this file.</a><table border="0" cellpadding="0" cellspacing="0"> |
25 |
<tr><td></td></tr> |
26 |
<tr><td colspan="2"><br><h2>Data Structures</h2></td></tr> |
27 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="structQueue.html">Queue</a></td></tr> |
28 |
|
29 |
<tr><td colspan="2"><br><h2>Functions</h2></td></tr> |
30 |
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="structQueue.html">Queue</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="group__queue.html#gd79af6a8d562cb911d93f35b8825e148">queue_create</a> (void)</td></tr> |
31 |
|
32 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Create a new queue. <a href="group__queue.html#gd79af6a8d562cb911d93f35b8825e148"></a><br></td></tr> |
33 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="group__queue.html#gd21ee75924298937673e2b8d66665466">queue_destroy</a> (<a class="el" href="structQueue.html">Queue</a> *q)</td></tr> |
34 |
|
35 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Destroy a queue. <a href="group__queue.html#gd21ee75924298937673e2b8d66665466"></a><br></td></tr> |
36 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="group__queue.html#gcdb01f4d0c861c4981829920d3973b77">queue_add</a> (<a class="el" href="structQueue.html">Queue</a> *q, void *item)</td></tr> |
37 |
|
38 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Add an element to a queue. <a href="group__queue.html#gcdb01f4d0c861c4981829920d3973b77"></a><br></td></tr> |
39 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">void * </td><td class="memItemRight" valign="bottom"><a class="el" href="group__queue.html#gef91e5f119b77101f6c2e23eb1803059">queue_remove</a> (<a class="el" href="structQueue.html">Queue</a> *q)</td></tr> |
40 |
|
41 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Remove an element from a queue. <a href="group__queue.html#gef91e5f119b77101f6c2e23eb1803059"></a><br></td></tr> |
42 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="group__queue.html#gbfe7f6f65eaffa1ee166811f259807e4">queue_remove_all</a> (<a class="el" href="structQueue.html">Queue</a> *q, void *item)</td></tr> |
43 |
|
44 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Remove all instances of a given element from a queue. <a href="group__queue.html#gbfe7f6f65eaffa1ee166811f259807e4"></a><br></td></tr> |
45 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="group__queue.html#g97ae0b085c41d49c8a24e1e506967f9b">queue_size</a> (<a class="el" href="structQueue.html">Queue</a> *q)</td></tr> |
46 |
|
47 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Get the size of a queue. <a href="group__queue.html#g97ae0b085c41d49c8a24e1e506967f9b"></a><br></td></tr> |
48 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="group__queue.html#ga67a7f9940e9bbf21320a6f41e60998e">queue_is_empty</a> (<a class="el" href="structQueue.html">Queue</a> *q)</td></tr> |
49 |
|
50 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Check if the queue is empty. <a href="group__queue.html#ga67a7f9940e9bbf21320a6f41e60998e"></a><br></td></tr> |
51 |
</table>
|
52 |
<hr><a name="_details"></a><h2>Detailed Description</h2> |
53 |
A queue implementation. |
54 |
<p>
|
55 |
Implements a queue, a first in, first out data structure.<p>
|
56 |
<dl compact><dt><b>Author:</b></dt><dd>Brian Coltin, Colony Project </dd></dl> |
57 |
<hr size="1"><address style="align: right;"><small>Generated on Wed Oct 31 17:54:43 2007 for libwireless by |
58 |
<a href="http://www.doxygen.org/index.html"> |
59 |
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.6 </small></address> |
60 |
</body>
|
61 |
</html>
|