%PDF- %PDF-
Mini Shell

Mini Shell

Direktori : /proc/self/root/usr/share/nagios/html/docs/
Upload File :
Create Path :
Current File : //proc/self/root/usr/share/nagios/html/docs/pqueue_8h.html

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.5"/>
<title>Nagios: pqueue.h File Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Nagios
   &#160;<span id="projectnumber">4.4.3</span>
   </div>
   <div id="projectbrief">Dev docs for Nagios core and neb-module hackers</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.5 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="pages.html"><span>Related&#160;Pages</span></a></li>
      <li><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>Globals</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Data Structures</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Macros</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Pages</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_97aefd0d527b934f1d99a682da8fe6a9.html">lib</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="summary">
<a href="#nested-classes">Data Structures</a>  </div>
  <div class="headertitle">
<div class="title">pqueue.h File Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p>Priority Queue function declarations.  
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;stdio.h&gt;</code><br/>
</div>
<p><a href="pqueue_8h_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Data Structures</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structpqueue__t.html">pqueue_t</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">the priority queue handle  <a href="structpqueue__t.html#details">More...</a><br/></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad8239ddc32134716f57e54bb972f6bf0"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ad8239ddc32134716f57e54bb972f6bf0"></a>
typedef unsigned long long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#ad8239ddc32134716f57e54bb972f6bf0">pqueue_pri_t</a></td></tr>
<tr class="memdesc:ad8239ddc32134716f57e54bb972f6bf0"><td class="mdescLeft">&#160;</td><td class="mdescRight">priority data type (used to be double, but ull is 107 times faster) <br/></td></tr>
<tr class="separator:ad8239ddc32134716f57e54bb972f6bf0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a38084a4351e971e28de23eecceb9d35f"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a38084a4351e971e28de23eecceb9d35f"></a>
typedef <a class="el" href="pqueue_8h.html#ad8239ddc32134716f57e54bb972f6bf0">pqueue_pri_t</a>(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#a38084a4351e971e28de23eecceb9d35f">pqueue_get_pri_f</a> )(void *a)</td></tr>
<tr class="memdesc:a38084a4351e971e28de23eecceb9d35f"><td class="mdescLeft">&#160;</td><td class="mdescRight">callback functions to get/set/compare the priority of an element <br/></td></tr>
<tr class="separator:a38084a4351e971e28de23eecceb9d35f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afce432f97012c37f6ad894c554a89f49"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="afce432f97012c37f6ad894c554a89f49"></a>
typedef void(*&#160;</td><td class="memItemRight" valign="bottom"><b>pqueue_set_pri_f</b> )(void *a, <a class="el" href="pqueue_8h.html#ad8239ddc32134716f57e54bb972f6bf0">pqueue_pri_t</a> pri)</td></tr>
<tr class="separator:afce432f97012c37f6ad894c554a89f49"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aec4dc5f4391c6b429a4e537ca4b6a2a6"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="aec4dc5f4391c6b429a4e537ca4b6a2a6"></a>
typedef int(*&#160;</td><td class="memItemRight" valign="bottom"><b>pqueue_cmp_pri_f</b> )(<a class="el" href="pqueue_8h.html#ad8239ddc32134716f57e54bb972f6bf0">pqueue_pri_t</a> next, <a class="el" href="pqueue_8h.html#ad8239ddc32134716f57e54bb972f6bf0">pqueue_pri_t</a> curr)</td></tr>
<tr class="separator:aec4dc5f4391c6b429a4e537ca4b6a2a6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2a2749e6a768ec390487f98a5e635c2c"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a2a2749e6a768ec390487f98a5e635c2c"></a>
typedef unsigned int(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#a2a2749e6a768ec390487f98a5e635c2c">pqueue_get_pos_f</a> )(void *a)</td></tr>
<tr class="memdesc:a2a2749e6a768ec390487f98a5e635c2c"><td class="mdescLeft">&#160;</td><td class="mdescRight">callback functions to get/set the position of an element <br/></td></tr>
<tr class="separator:a2a2749e6a768ec390487f98a5e635c2c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a73d56ea9bd77e227cb19d20e9c487645"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a73d56ea9bd77e227cb19d20e9c487645"></a>
typedef void(*&#160;</td><td class="memItemRight" valign="bottom"><b>pqueue_set_pos_f</b> )(void *a, unsigned int pos)</td></tr>
<tr class="separator:a73d56ea9bd77e227cb19d20e9c487645"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7783c5555cd76c54e1b47ef0e361452c"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a7783c5555cd76c54e1b47ef0e361452c"></a>
typedef void(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#a7783c5555cd76c54e1b47ef0e361452c">pqueue_print_entry_f</a> )(FILE *out, void *a)</td></tr>
<tr class="memdesc:a7783c5555cd76c54e1b47ef0e361452c"><td class="mdescLeft">&#160;</td><td class="mdescRight">debug callback function to print a entry <br/></td></tr>
<tr class="separator:a7783c5555cd76c54e1b47ef0e361452c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a02a7250504cf9d7171525d712ace44c8"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a02a7250504cf9d7171525d712ace44c8"></a>
typedef struct <a class="el" href="structpqueue__t.html">pqueue_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#a02a7250504cf9d7171525d712ace44c8">pqueue_t</a></td></tr>
<tr class="memdesc:a02a7250504cf9d7171525d712ace44c8"><td class="mdescLeft">&#160;</td><td class="mdescRight">the priority queue handle <br/></td></tr>
<tr class="separator:a02a7250504cf9d7171525d712ace44c8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab2b72569a55517ab868d59217e60699a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="structpqueue__t.html">pqueue_t</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#ab2b72569a55517ab868d59217e60699a">pqueue_init</a> (unsigned int n, pqueue_cmp_pri_f cmppri, <a class="el" href="pqueue_8h.html#a38084a4351e971e28de23eecceb9d35f">pqueue_get_pri_f</a> getpri, pqueue_set_pri_f setpri, <a class="el" href="pqueue_8h.html#a2a2749e6a768ec390487f98a5e635c2c">pqueue_get_pos_f</a> getpos, pqueue_set_pos_f setpos)</td></tr>
<tr class="memdesc:ab2b72569a55517ab868d59217e60699a"><td class="mdescLeft">&#160;</td><td class="mdescRight">initialize the queue  <a href="#ab2b72569a55517ab868d59217e60699a">More...</a><br/></td></tr>
<tr class="separator:ab2b72569a55517ab868d59217e60699a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acceacc4429dd9cd31d5af09f3f473cb0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#acceacc4429dd9cd31d5af09f3f473cb0">pqueue_free</a> (<a class="el" href="structpqueue__t.html">pqueue_t</a> *q)</td></tr>
<tr class="memdesc:acceacc4429dd9cd31d5af09f3f473cb0"><td class="mdescLeft">&#160;</td><td class="mdescRight">free all memory used by the queue  <a href="#acceacc4429dd9cd31d5af09f3f473cb0">More...</a><br/></td></tr>
<tr class="separator:acceacc4429dd9cd31d5af09f3f473cb0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6dcf77d1704e7735db663f4a3e274133"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#a6dcf77d1704e7735db663f4a3e274133">pqueue_size</a> (<a class="el" href="structpqueue__t.html">pqueue_t</a> *q)</td></tr>
<tr class="memdesc:a6dcf77d1704e7735db663f4a3e274133"><td class="mdescLeft">&#160;</td><td class="mdescRight">return the size of the queue.  <a href="#a6dcf77d1704e7735db663f4a3e274133">More...</a><br/></td></tr>
<tr class="separator:a6dcf77d1704e7735db663f4a3e274133"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:addd8cdfbc8c47b8cdd7eb4c4560de7aa"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#addd8cdfbc8c47b8cdd7eb4c4560de7aa">pqueue_insert</a> (<a class="el" href="structpqueue__t.html">pqueue_t</a> *q, void *d)</td></tr>
<tr class="memdesc:addd8cdfbc8c47b8cdd7eb4c4560de7aa"><td class="mdescLeft">&#160;</td><td class="mdescRight">insert an item into the queue.  <a href="#addd8cdfbc8c47b8cdd7eb4c4560de7aa">More...</a><br/></td></tr>
<tr class="separator:addd8cdfbc8c47b8cdd7eb4c4560de7aa"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7dfaa607ca404b915355d4b123c669ee"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#a7dfaa607ca404b915355d4b123c669ee">pqueue_change_priority</a> (<a class="el" href="structpqueue__t.html">pqueue_t</a> *q, <a class="el" href="pqueue_8h.html#ad8239ddc32134716f57e54bb972f6bf0">pqueue_pri_t</a> new_pri, void *d)</td></tr>
<tr class="memdesc:a7dfaa607ca404b915355d4b123c669ee"><td class="mdescLeft">&#160;</td><td class="mdescRight">move an existing entry to a different priority  <a href="#a7dfaa607ca404b915355d4b123c669ee">More...</a><br/></td></tr>
<tr class="separator:a7dfaa607ca404b915355d4b123c669ee"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abec9363c7a9cc89190bf0925a4a1652c"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#abec9363c7a9cc89190bf0925a4a1652c">pqueue_pop</a> (<a class="el" href="structpqueue__t.html">pqueue_t</a> *q)</td></tr>
<tr class="memdesc:abec9363c7a9cc89190bf0925a4a1652c"><td class="mdescLeft">&#160;</td><td class="mdescRight">pop the highest-ranking item from the queue.  <a href="#abec9363c7a9cc89190bf0925a4a1652c">More...</a><br/></td></tr>
<tr class="separator:abec9363c7a9cc89190bf0925a4a1652c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9a509654dacb6be3d34ff7a4958ab4dd"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#a9a509654dacb6be3d34ff7a4958ab4dd">pqueue_remove</a> (<a class="el" href="structpqueue__t.html">pqueue_t</a> *q, void *d)</td></tr>
<tr class="memdesc:a9a509654dacb6be3d34ff7a4958ab4dd"><td class="mdescLeft">&#160;</td><td class="mdescRight">remove an item from the queue.  <a href="#a9a509654dacb6be3d34ff7a4958ab4dd">More...</a><br/></td></tr>
<tr class="separator:a9a509654dacb6be3d34ff7a4958ab4dd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2919d3e817688b81da746d4123f51ba3"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#a2919d3e817688b81da746d4123f51ba3">pqueue_peek</a> (<a class="el" href="structpqueue__t.html">pqueue_t</a> *q)</td></tr>
<tr class="memdesc:a2919d3e817688b81da746d4123f51ba3"><td class="mdescLeft">&#160;</td><td class="mdescRight">access highest-ranking item without removing it.  <a href="#a2919d3e817688b81da746d4123f51ba3">More...</a><br/></td></tr>
<tr class="separator:a2919d3e817688b81da746d4123f51ba3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8c5b724e07dbf478147835a06ed64d42"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a8c5b724e07dbf478147835a06ed64d42"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#a8c5b724e07dbf478147835a06ed64d42">pqueue_print</a> (<a class="el" href="structpqueue__t.html">pqueue_t</a> *q, FILE *out, <a class="el" href="pqueue_8h.html#a7783c5555cd76c54e1b47ef0e361452c">pqueue_print_entry_f</a> print)</td></tr>
<tr class="memdesc:a8c5b724e07dbf478147835a06ed64d42"><td class="mdescLeft">&#160;</td><td class="mdescRight">print the queue <br/></td></tr>
<tr class="separator:a8c5b724e07dbf478147835a06ed64d42"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae438267d8665f75709c9a9248923f32e"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ae438267d8665f75709c9a9248923f32e"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#ae438267d8665f75709c9a9248923f32e">pqueue_dump</a> (<a class="el" href="structpqueue__t.html">pqueue_t</a> *q, FILE *out, <a class="el" href="pqueue_8h.html#a7783c5555cd76c54e1b47ef0e361452c">pqueue_print_entry_f</a> print)</td></tr>
<tr class="memdesc:ae438267d8665f75709c9a9248923f32e"><td class="mdescLeft">&#160;</td><td class="mdescRight">dump the queue and it's internal structure <br/></td></tr>
<tr class="separator:ae438267d8665f75709c9a9248923f32e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aecb92aa04f03ad7866508bc27778d7e9"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="aecb92aa04f03ad7866508bc27778d7e9"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="pqueue_8h.html#aecb92aa04f03ad7866508bc27778d7e9">pqueue_is_valid</a> (<a class="el" href="structpqueue__t.html">pqueue_t</a> *q)</td></tr>
<tr class="memdesc:aecb92aa04f03ad7866508bc27778d7e9"><td class="mdescLeft">&#160;</td><td class="mdescRight">checks that the pq is in the right order, etc <br/></td></tr>
<tr class="separator:aecb92aa04f03ad7866508bc27778d7e9"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Priority Queue function declarations. </p>
<p>This priority queue library was originally written by Volkan Yazici <a href="#" onclick="location.href='mai'+'lto:'+'vol'+'ka'+'n.y'+'az'+'ici'+'@g'+'mai'+'l.'+'com'; return false;">volka<span style="display: none;">.nosp@m.</span>n.ya<span style="display: none;">.nosp@m.</span>zici@<span style="display: none;">.nosp@m.</span>gmai<span style="display: none;">.nosp@m.</span>l.com</a>. It was lated adapted for Nagios by Andreas Ericsson <a href="#" onclick="location.href='mai'+'lto:'+'ae@'+'op'+'5.s'+'e'; return false;">ae@op<span style="display: none;">.nosp@m.</span>5.se</a>. Changes compared to the original version are pretty much limited to changing pqueue_pri_t to be an unsigned long long instead of a double, since ULL comparisons are 107 times faster on my 64-bit laptop. </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a class="anchor" id="a7dfaa607ca404b915355d4b123c669ee"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void pqueue_change_priority </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structpqueue__t.html">pqueue_t</a> *&#160;</td>
          <td class="paramname"><em>q</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="pqueue_8h.html#ad8239ddc32134716f57e54bb972f6bf0">pqueue_pri_t</a>&#160;</td>
          <td class="paramname"><em>new_pri</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">void *&#160;</td>
          <td class="paramname"><em>d</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>move an existing entry to a different priority </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">q</td><td>the queue </td></tr>
    <tr><td class="paramname">new_pri</td><td>the new priority </td></tr>
    <tr><td class="paramname">d</td><td>the entry </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a class="anchor" id="acceacc4429dd9cd31d5af09f3f473cb0"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void pqueue_free </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structpqueue__t.html">pqueue_t</a> *&#160;</td>
          <td class="paramname"><em>q</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>free all memory used by the queue </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">q</td><td>the queue </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a class="anchor" id="ab2b72569a55517ab868d59217e60699a"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="structpqueue__t.html">pqueue_t</a>* pqueue_init </td>
          <td>(</td>
          <td class="paramtype">unsigned int&#160;</td>
          <td class="paramname"><em>n</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">pqueue_cmp_pri_f&#160;</td>
          <td class="paramname"><em>cmppri</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="pqueue_8h.html#a38084a4351e971e28de23eecceb9d35f">pqueue_get_pri_f</a>&#160;</td>
          <td class="paramname"><em>getpri</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">pqueue_set_pri_f&#160;</td>
          <td class="paramname"><em>setpri</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="pqueue_8h.html#a2a2749e6a768ec390487f98a5e635c2c">pqueue_get_pos_f</a>&#160;</td>
          <td class="paramname"><em>getpos</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">pqueue_set_pos_f&#160;</td>
          <td class="paramname"><em>setpos</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>initialize the queue </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">n</td><td>the initial estimate of the number of queue items for which memory should be preallocated </td></tr>
    <tr><td class="paramname">cmppri</td><td>The callback function to run to compare two elements This callback should return 0 for 'lower' and non-zero for 'higher', or vice versa if reverse priority is desired </td></tr>
    <tr><td class="paramname">setpri</td><td>the callback function to run to assign a score to an element </td></tr>
    <tr><td class="paramname">getpri</td><td>the callback function to run to set a score to an element </td></tr>
    <tr><td class="paramname">getpos</td><td>the callback function to get the current element's position </td></tr>
    <tr><td class="paramname">setpos</td><td>the callback function to set the current element's position</td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>the handle or NULL for insufficient memory </dd></dl>

</div>
</div>
<a class="anchor" id="addd8cdfbc8c47b8cdd7eb4c4560de7aa"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int pqueue_insert </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structpqueue__t.html">pqueue_t</a> *&#160;</td>
          <td class="paramname"><em>q</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">void *&#160;</td>
          <td class="paramname"><em>d</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>insert an item into the queue. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">q</td><td>the queue </td></tr>
    <tr><td class="paramname">d</td><td>the item </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>0 on success </dd></dl>

</div>
</div>
<a class="anchor" id="a2919d3e817688b81da746d4123f51ba3"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void* pqueue_peek </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structpqueue__t.html">pqueue_t</a> *&#160;</td>
          <td class="paramname"><em>q</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>access highest-ranking item without removing it. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">q</td><td>the queue </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>NULL on error, otherwise the entry </dd></dl>

</div>
</div>
<a class="anchor" id="abec9363c7a9cc89190bf0925a4a1652c"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void* pqueue_pop </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structpqueue__t.html">pqueue_t</a> *&#160;</td>
          <td class="paramname"><em>q</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>pop the highest-ranking item from the queue. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">q</td><td>the queue </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>NULL on error, otherwise the entry </dd></dl>

</div>
</div>
<a class="anchor" id="a9a509654dacb6be3d34ff7a4958ab4dd"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int pqueue_remove </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structpqueue__t.html">pqueue_t</a> *&#160;</td>
          <td class="paramname"><em>q</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">void *&#160;</td>
          <td class="paramname"><em>d</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>remove an item from the queue. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">q</td><td>the queue </td></tr>
    <tr><td class="paramname">d</td><td>the entry </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>0 on success </dd></dl>

</div>
</div>
<a class="anchor" id="a6dcf77d1704e7735db663f4a3e274133"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">unsigned int pqueue_size </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structpqueue__t.html">pqueue_t</a> *&#160;</td>
          <td class="paramname"><em>q</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>return the size of the queue. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">q</td><td>the queue </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.5
</small></address>
</body>
</html>

Zerion Mini Shell 1.0