Project

General

Profile

Statistics
| Revision:

root / trunk / docs / libwireless / queue_8h.html @ 1427

History | View | Annotate | Download (5.8 KB)

1 19 bcoltin 
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
2 241 bcoltin 
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
3 19 bcoltin 
<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 241 bcoltin 
<!-- Generated by Doxygen 1.5.3 -->
8 19 bcoltin 
<div class="tabs">
9 
  <ul>
10 
    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
11 
    <li><a href="modules.html"><span>Modules</span></a></li>
12 
    <li><a href="annotated.html"><span>Data&nbsp;Structures</span></a></li>
13 241 bcoltin 
    <li class="current"><a href="files.html"><span>Files</span></a></li>
14 
  </ul>
15 
</div>
16 19 bcoltin 
<h1>queue.h File Reference</h1>A queue implementation. <a href="#_details">More...</a>
17 
<p>
18 

      

      

        19
        
        
        
        
        
<p>


      

      

        20
        
        
        
        
        
<a href="queue_8h-source.html">Go to the source code of this file.</a><table border="0" cellpadding="0" cellspacing="0">


      

      

        21
        
        
        
        
        
<tr><td></td></tr>


      

      

        22
        
        
        
        
        
<tr><td colspan="2"><br><h2>Data Structures</h2></td></tr>


      

      

        23
        
        
        
        
        
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct &nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="structQueue.html">Queue</a></td></tr>


      

      

        24
        
        
        
        
        

      

      

        25
        
        
        
        
        
<tr><td colspan="2"><br><h2>Functions</h2></td></tr>


      

      

        26
        
        
        
        
        
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="structQueue.html">Queue</a> *&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="group__queue.html#gd79af6a8d562cb911d93f35b8825e148">queue_create</a> (void)</td></tr>


      

      

        27
        
        
        
        
        

      

      

        28
        
        
        
        
        
<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Create a new queue.  <a href="group__queue.html#gd79af6a8d562cb911d93f35b8825e148"></a><br></td></tr>


      

      

        29
        
        
        
        
        
<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</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>


      

      

        30
        
        
        
        
        

      

      

        31
        
        
        
        
        
<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Destroy a queue.  <a href="group__queue.html#gd21ee75924298937673e2b8d66665466"></a><br></td></tr>


      

      

        32
        
        
        
        
        
<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</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>


      

      

        33
        
        
        
        
        

      

      

        34
        
        
        
        
        
<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Add an element to a queue.  <a href="group__queue.html#gcdb01f4d0c861c4981829920d3973b77"></a><br></td></tr>


      

      

        35
        
        
        
        
        
<tr><td class="memItemLeft" nowrap align="right" valign="top">void *&nbsp;</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>


      

      

        36
        
        
        
        
        

      

      

        37
        
        
        
        
        
<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Remove an element from a queue.  <a href="group__queue.html#gef91e5f119b77101f6c2e23eb1803059"></a><br></td></tr>


      

      

        38
        
        
        
        
        
<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</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>


      

      

        39
        
        
        
        
        

      

      

        40
        
        
        
        
        
<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Remove all instances of a given element from a queue.  <a href="group__queue.html#gbfe7f6f65eaffa1ee166811f259807e4"></a><br></td></tr>


      

      

        41
        
        
        
        
        
<tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</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>


      

      

        42
        
        
        
        
        

      

      

        43
        
        
        
        
        
<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Get the size of a queue.  <a href="group__queue.html#g97ae0b085c41d49c8a24e1e506967f9b"></a><br></td></tr>


      

      

        44
        
        
        
        
        
<tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</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>


      

      

        45
        
        
        
        
        

      

      

        46
        
        
        
        
        
<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Check if the queue is empty.  <a href="group__queue.html#ga67a7f9940e9bbf21320a6f41e60998e"></a><br></td></tr>


      

      

        47
        
        
        
        
        
</table>


      

      

        48
        
        
        
        
        
<hr><a name="_details"></a><h2>Detailed Description</h2>


      

      

        49
        
        
        
        
        
A queue implementation.


      

      

        50
        
        
        
        
        
<p>


      

      

        51
        
            242
        
        
            bcoltin
        
        
Copyright (c) 2007 Colony Project<p>


      

      

        52
        
        
        
        
        
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:<p>


      

      

        53
        
        
        
        
        
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.<p>


      

      

        54
        
        
        
        
        
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.<p>


      

      

        55
        
            19
        
        
            bcoltin
        
        
Implements a queue, a first in, first out data structure.<p>


      

      

        56
        
            242
        
        
            bcoltin
        
        
<dl class="author" compact><dt><b>Author:</b></dt><dd>Brian Coltin, Colony Project, CMU Robotics Club </dd></dl>


      

      

        57
        
        
        
        
        
<hr size="1"><address style="text-align: right;"><small>Generated on Thu Nov 8 23:27:22 2007 for libwireless by&nbsp;


      

      

        58
        
            19
        
        
            bcoltin
        
        
<a href="http://www.doxygen.org/index.html">


      

      

        59
        
            241
        
        
            bcoltin
        
        
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.3 </small></address>


      

      

        60
        
            19
        
        
            bcoltin
        
        
</body>


      

      

        61
        
        
        
        
        
</html>