<!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"/>
<title>SphinxBase: src/libsphinxbase/util/heap.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.3 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">SphinxBase <span id="projectnumber">0.6</span></div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('heap_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libsphinxbase/util/heap.c</h1> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */</span>
<a name="l00002"></a>00002 <span class="comment">/* ====================================================================</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (c) 1999-2004 Carnegie Mellon University. All rights</span>
<a name="l00004"></a>00004 <span class="comment"> * reserved.</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00007"></a>00007 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00008"></a>00008 <span class="comment"> * are met:</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span>
<a name="l00011"></a>00011 <span class="comment"> * notice, this list of conditions and the following disclaimer. </span>
<a name="l00012"></a>00012 <span class="comment"> *</span>
<a name="l00013"></a>00013 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00014"></a>00014 <span class="comment"> * notice, this list of conditions and the following disclaimer in</span>
<a name="l00015"></a>00015 <span class="comment"> * the documentation and/or other materials provided with the</span>
<a name="l00016"></a>00016 <span class="comment"> * distribution.</span>
<a name="l00017"></a>00017 <span class="comment"> *</span>
<a name="l00018"></a>00018 <span class="comment"> * This work was supported in part by funding from the Defense Advanced </span>
<a name="l00019"></a>00019 <span class="comment"> * Research Projects Agency and the National Science Foundation of the </span>
<a name="l00020"></a>00020 <span class="comment"> * United States of America, and the CMU Sphinx Speech Consortium.</span>
<a name="l00021"></a>00021 <span class="comment"> *</span>
<a name="l00022"></a>00022 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span>
<a name="l00023"></a>00023 <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span>
<a name="l00024"></a>00024 <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span>
<a name="l00025"></a>00025 <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span>
<a name="l00026"></a>00026 <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span>
<a name="l00027"></a>00027 <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span>
<a name="l00028"></a>00028 <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span>
<a name="l00029"></a>00029 <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span>
<a name="l00030"></a>00030 <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span>
<a name="l00031"></a>00031 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span>
<a name="l00032"></a>00032 <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00033"></a>00033 <span class="comment"> *</span>
<a name="l00034"></a>00034 <span class="comment"> * ====================================================================</span>
<a name="l00035"></a>00035 <span class="comment"> *</span>
<a name="l00036"></a>00036 <span class="comment"> */</span>
<a name="l00037"></a>00037 <span class="comment">/*</span>
<a name="l00038"></a>00038 <span class="comment"> * heap.c -- Generic heap structure for inserting in any and popping in sorted</span>
<a name="l00039"></a>00039 <span class="comment"> * order.</span>
<a name="l00040"></a>00040 <span class="comment"> *</span>
<a name="l00041"></a>00041 <span class="comment"> * **********************************************</span>
<a name="l00042"></a>00042 <span class="comment"> * CMU ARPA Speech Project</span>
<a name="l00043"></a>00043 <span class="comment"> *</span>
<a name="l00044"></a>00044 <span class="comment"> * Copyright (c) 1999 Carnegie Mellon University.</span>
<a name="l00045"></a>00045 <span class="comment"> * ALL RIGHTS RESERVED.</span>
<a name="l00046"></a>00046 <span class="comment"> * **********************************************</span>
<a name="l00047"></a>00047 <span class="comment"> * </span>
<a name="l00048"></a>00048 <span class="comment"> * HISTORY</span>
<a name="l00049"></a>00049 <span class="comment"> * $Log: heap.c,v $</span>
<a name="l00050"></a>00050 <span class="comment"> * Revision 1.4 2005/06/22 03:05:49 arthchan2003</span>
<a name="l00051"></a>00051 <span class="comment"> * 1, Fixed doxygen documentation, 2, Add keyword.</span>
<a name="l00052"></a>00052 <span class="comment"> *</span>
<a name="l00053"></a>00053 <span class="comment"> * Revision 1.3 2005/03/30 01:22:48 archan</span>
<a name="l00054"></a>00054 <span class="comment"> * Fixed mistakes in last updates. Add</span>
<a name="l00055"></a>00055 <span class="comment"> *</span>
<a name="l00056"></a>00056 <span class="comment"> * </span>
<a name="l00057"></a>00057 <span class="comment"> * 05-Mar-99 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University</span>
<a name="l00058"></a>00058 <span class="comment"> * Fixed bug in heap_destroy() (in while loop exit condition).</span>
<a name="l00059"></a>00059 <span class="comment"> * </span>
<a name="l00060"></a>00060 <span class="comment"> * 23-Dec-96 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University</span>
<a name="l00061"></a>00061 <span class="comment"> * Started.</span>
<a name="l00062"></a>00062 <span class="comment"> */</span>
<a name="l00063"></a>00063
<a name="l00064"></a>00064
<a name="l00065"></a>00065 <span class="preprocessor">#include <stdio.h></span>
<a name="l00066"></a>00066 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00067"></a>00067 <span class="preprocessor">#include <string.h></span>
<a name="l00068"></a>00068 <span class="preprocessor">#include <assert.h></span>
<a name="l00069"></a>00069
<a name="l00070"></a>00070 <span class="preprocessor">#include "sphinxbase/heap.h"</span>
<a name="l00071"></a>00071 <span class="preprocessor">#include "sphinxbase/err.h"</span>
<a name="l00072"></a>00072 <span class="preprocessor">#include "sphinxbase/ckd_alloc.h"</span>
<a name="l00073"></a>00073
<a name="l00077"></a><a class="code" href="structheapnode__s.html">00077</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_s</a> {
<a name="l00078"></a><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb">00078</a> <span class="keywordtype">void</span> *<a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a>;
<a name="l00079"></a><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d">00079</a> int32 <a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a>;
<a name="l00081"></a><a class="code" href="structheapnode__s.html#ab5a21ee1a48ce5359bbcca1d416a51eb">00081</a> int32 nl, <a class="code" href="structheapnode__s.html#ab5a21ee1a48ce5359bbcca1d416a51eb" title="#left/right descendants of this node (for balancing heap)">nr</a>;
<a name="l00082"></a><a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b">00082</a> <span class="keyword">struct </span><a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_s</a> *<a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b" title="Root of left descendant heap.">l</a>;
<a name="l00083"></a><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea">00083</a> <span class="keyword">struct </span><a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_s</a> *<a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a>;
<a name="l00084"></a>00084 } <a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_t</a>;
<a name="l00085"></a>00085
<a name="l00089"></a><a class="code" href="structheap__s.html">00089</a> <span class="keyword">struct </span><a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_s</a> {
<a name="l00090"></a>00090 <a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_t</a> *top;
<a name="l00091"></a>00091 };
<a name="l00092"></a>00092
<a name="l00093"></a>00093
<a name="l00094"></a>00094 <span class="preprocessor">#if 0</span>
<a name="l00095"></a>00095 <span class="preprocessor"></span><span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00096"></a>00096 heap_dump(<a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_t</a> * top, int32 level)
<a name="l00097"></a>00097 {
<a name="l00098"></a>00098 int32 i;
<a name="l00099"></a>00099
<a name="l00100"></a>00100 <span class="keywordflow">if</span> (!top)
<a name="l00101"></a>00101 <span class="keywordflow">return</span>;
<a name="l00102"></a>00102
<a name="l00103"></a>00103 <span class="keywordflow">for</span> (i = 0; i < level; i++)
<a name="l00104"></a>00104 printf(<span class="stringliteral">" "</span>);
<a name="l00105"></a>00105 <span class="comment">/* print top info */</span>
<a name="l00106"></a>00106 heap_dump(top-><a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b" title="Root of left descendant heap.">l</a>, level + 1);
<a name="l00107"></a>00107 heap_dump(top-><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a>, level + 1);
<a name="l00108"></a>00108 }
<a name="l00109"></a>00109 <span class="preprocessor">#endif</span>
<a name="l00110"></a>00110 <span class="preprocessor"></span>
<a name="l00111"></a>00111
<a name="l00112"></a>00112 <a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_t</a> *
<a name="l00113"></a><a class="code" href="heap_8h.html#a9bc21333ce58caaf58e802d8b0190efd">00113</a> <a class="code" href="heap_8h.html#a9bc21333ce58caaf58e802d8b0190efd" title="Allocate a new heap and return handle to it.">heap_new</a>(<span class="keywordtype">void</span>)
<a name="l00114"></a>00114 {
<a name="l00115"></a>00115 <a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_t</a> *h = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(1, <span class="keyword">sizeof</span>(*h));
<a name="l00116"></a>00116 <span class="keywordflow">return</span> h;
<a name="l00117"></a>00117 }
<a name="l00118"></a>00118
<a name="l00119"></a>00119
<a name="l00120"></a>00120 <span class="keyword">static</span> <a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_t</a> *
<a name="l00121"></a>00121 subheap_insert(<a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_t</a> * root, <span class="keywordtype">void</span> *data, int32 val)
<a name="l00122"></a>00122 {
<a name="l00123"></a>00123 <a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_t</a> *h;
<a name="l00124"></a>00124 <span class="keywordtype">void</span> *tmpdata;
<a name="l00125"></a>00125 int32 tmpval;
<a name="l00126"></a>00126
<a name="l00127"></a>00127 <span class="keywordflow">if</span> (!root) {
<a name="l00128"></a>00128 h = (<a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_t</a> *) <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(1, <span class="keyword">sizeof</span>(<a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_t</a>));
<a name="l00129"></a>00129 h-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a> = data;
<a name="l00130"></a>00130 h-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a> = val;
<a name="l00131"></a>00131 h-><a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b" title="Root of left descendant heap.">l</a> = h-><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a> = NULL;
<a name="l00132"></a>00132 h->nl = h-><a class="code" href="structheapnode__s.html#ab5a21ee1a48ce5359bbcca1d416a51eb" title="#left/right descendants of this node (for balancing heap)">nr</a> = 0;
<a name="l00133"></a>00133 <span class="keywordflow">return</span> h;
<a name="l00134"></a>00134 }
<a name="l00135"></a>00135
<a name="l00136"></a>00136 <span class="comment">/* Root already exists; if new value is less, replace root node */</span>
<a name="l00137"></a>00137 <span class="keywordflow">if</span> (root-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a> > val) {
<a name="l00138"></a>00138 tmpdata = root-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a>;
<a name="l00139"></a>00139 tmpval = root-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a>;
<a name="l00140"></a>00140 root-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a> = data;
<a name="l00141"></a>00141 root-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a> = val;
<a name="l00142"></a>00142 data = tmpdata;
<a name="l00143"></a>00143 val = tmpval;
<a name="l00144"></a>00144 }
<a name="l00145"></a>00145
<a name="l00146"></a>00146 <span class="comment">/* Insert new or old (replaced) node in right or left subtree; keep them balanced */</span>
<a name="l00147"></a>00147 <span class="keywordflow">if</span> (root->nl > root-><a class="code" href="structheapnode__s.html#ab5a21ee1a48ce5359bbcca1d416a51eb" title="#left/right descendants of this node (for balancing heap)">nr</a>) {
<a name="l00148"></a>00148 root-><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a> = subheap_insert(root-><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a>, data, val);
<a name="l00149"></a>00149 root-><a class="code" href="structheapnode__s.html#ab5a21ee1a48ce5359bbcca1d416a51eb" title="#left/right descendants of this node (for balancing heap)">nr</a>++;
<a name="l00150"></a>00150 }
<a name="l00151"></a>00151 <span class="keywordflow">else</span> {
<a name="l00152"></a>00152 root-><a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b" title="Root of left descendant heap.">l</a> = subheap_insert(root-><a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b" title="Root of left descendant heap.">l</a>, data, val);
<a name="l00153"></a>00153 root->nl++;
<a name="l00154"></a>00154 }
<a name="l00155"></a>00155
<a name="l00156"></a>00156 <span class="keywordflow">return</span> root;
<a name="l00157"></a>00157 }
<a name="l00158"></a>00158
<a name="l00159"></a>00159
<a name="l00160"></a>00160 <span class="keywordtype">int</span>
<a name="l00161"></a><a class="code" href="heap_8h.html#a64bcded2de5086c5d246ff760caa74a3">00161</a> <a class="code" href="heap_8h.html#a64bcded2de5086c5d246ff760caa74a3" title="Insert a new item into the given heap.">heap_insert</a>(<a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_t</a> *heap, <span class="keywordtype">void</span> *data, int32 val)
<a name="l00162"></a>00162 {
<a name="l00163"></a>00163 heap->top = subheap_insert(heap->top, data, val);
<a name="l00164"></a>00164 <span class="keywordflow">return</span> 0;
<a name="l00165"></a>00165 }
<a name="l00166"></a>00166
<a name="l00167"></a>00167
<a name="l00168"></a>00168 <span class="keyword">static</span> <a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_t</a> *
<a name="l00169"></a>00169 subheap_pop(<a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_t</a> * root)
<a name="l00170"></a>00170 {
<a name="l00171"></a>00171 <a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_t</a> *l, *r;
<a name="l00172"></a>00172
<a name="l00173"></a>00173 <span class="comment">/* Propagate best value from below into root, if any */</span>
<a name="l00174"></a>00174 l = root-><a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b" title="Root of left descendant heap.">l</a>;
<a name="l00175"></a>00175 r = root-><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a>;
<a name="l00176"></a>00176
<a name="l00177"></a>00177 <span class="keywordflow">if</span> (!l) {
<a name="l00178"></a>00178 <span class="keywordflow">if</span> (!r) {
<a name="l00179"></a>00179 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>((<span class="keywordtype">char</span> *) root);
<a name="l00180"></a>00180 <span class="keywordflow">return</span> NULL;
<a name="l00181"></a>00181 }
<a name="l00182"></a>00182 <span class="keywordflow">else</span> {
<a name="l00183"></a>00183 root-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a> = r-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a>;
<a name="l00184"></a>00184 root-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a> = r-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a>;
<a name="l00185"></a>00185 root-><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a> = subheap_pop(r);
<a name="l00186"></a>00186 root-><a class="code" href="structheapnode__s.html#ab5a21ee1a48ce5359bbcca1d416a51eb" title="#left/right descendants of this node (for balancing heap)">nr</a>--;
<a name="l00187"></a>00187 }
<a name="l00188"></a>00188 }
<a name="l00189"></a>00189 <span class="keywordflow">else</span> {
<a name="l00190"></a>00190 <span class="keywordflow">if</span> ((!r) || (l-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a> < r-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a>)) {
<a name="l00191"></a>00191 root-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a> = l-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a>;
<a name="l00192"></a>00192 root-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a> = l-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a>;
<a name="l00193"></a>00193 root-><a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b" title="Root of left descendant heap.">l</a> = subheap_pop(l);
<a name="l00194"></a>00194 root->nl--;
<a name="l00195"></a>00195 }
<a name="l00196"></a>00196 <span class="keywordflow">else</span> {
<a name="l00197"></a>00197 root-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a> = r-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a>;
<a name="l00198"></a>00198 root-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a> = r-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a>;
<a name="l00199"></a>00199 root-><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a> = subheap_pop(r);
<a name="l00200"></a>00200 root-><a class="code" href="structheapnode__s.html#ab5a21ee1a48ce5359bbcca1d416a51eb" title="#left/right descendants of this node (for balancing heap)">nr</a>--;
<a name="l00201"></a>00201 }
<a name="l00202"></a>00202 }
<a name="l00203"></a>00203
<a name="l00204"></a>00204 <span class="keywordflow">return</span> root;
<a name="l00205"></a>00205 }
<a name="l00206"></a>00206
<a name="l00207"></a>00207
<a name="l00208"></a>00208 <span class="keywordtype">int</span>
<a name="l00209"></a><a class="code" href="heap_8h.html#a387c8913b4c62ad1a5c4702a4e6dbdbf">00209</a> <a class="code" href="heap_8h.html#a387c8913b4c62ad1a5c4702a4e6dbdbf" title="Like heap_top but also pop the top item off the heap.">heap_pop</a>(<a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_t</a> *heap, <span class="keywordtype">void</span> **data, int32 * val)
<a name="l00210"></a>00210 {
<a name="l00211"></a>00211 <span class="keywordflow">if</span> (heap->top == NULL)
<a name="l00212"></a>00212 <span class="keywordflow">return</span> 0;
<a name="l00213"></a>00213 *data = heap->top-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a>;
<a name="l00214"></a>00214 *val = heap->top-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a>;
<a name="l00215"></a>00215 heap->top = subheap_pop(heap->top);
<a name="l00216"></a>00216 <span class="keywordflow">return</span> 1;
<a name="l00217"></a>00217 }
<a name="l00218"></a>00218
<a name="l00219"></a>00219
<a name="l00220"></a>00220 <span class="keywordtype">int</span>
<a name="l00221"></a><a class="code" href="heap_8h.html#ae70da6b59215654c2cd5ec177eaf2aec">00221</a> <a class="code" href="heap_8h.html#ae70da6b59215654c2cd5ec177eaf2aec" title="Return the topmost item in the heap.">heap_top</a>(<a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_t</a> *heap, <span class="keywordtype">void</span> **data, int32 * val)
<a name="l00222"></a>00222 {
<a name="l00223"></a>00223 <span class="keywordflow">if</span> (heap->top == NULL)
<a name="l00224"></a>00224 <span class="keywordflow">return</span> 0;
<a name="l00225"></a>00225 *data = heap->top-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a>;
<a name="l00226"></a>00226 *val = heap->top-><a class="code" href="structheapnode__s.html#a02a74be7915860cf3fc436d5fed6fe7d" title="Associated with above application data; according to which heap is sorted (in ascending order)...">val</a>;
<a name="l00227"></a>00227 <span class="keywordflow">return</span> 1;
<a name="l00228"></a>00228 }
<a name="l00229"></a>00229
<a name="l00230"></a>00230 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00231"></a>00231 heap_remove_one(<a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_t</a> *heap, <a class="code" href="structheapnode__s.html" title="One node on the heap.">heapnode_t</a> *top, <span class="keywordtype">void</span> *data)
<a name="l00232"></a>00232 {
<a name="l00233"></a>00233 <span class="keywordflow">if</span> (top == NULL)
<a name="l00234"></a>00234 <span class="keywordflow">return</span> -1;
<a name="l00235"></a>00235 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (top-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a> == data) {
<a name="l00236"></a>00236 assert(top == heap->top);
<a name="l00237"></a>00237 heap->top = subheap_pop(heap->top);
<a name="l00238"></a>00238 <span class="keywordflow">return</span> 0;
<a name="l00239"></a>00239 }
<a name="l00240"></a>00240 <span class="keywordflow">if</span> (top-><a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b" title="Root of left descendant heap.">l</a>) {
<a name="l00241"></a>00241 <span class="keywordflow">if</span> (top-><a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b" title="Root of left descendant heap.">l</a>-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a> == data) {
<a name="l00242"></a>00242 top-><a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b" title="Root of left descendant heap.">l</a> = subheap_pop(top-><a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b" title="Root of left descendant heap.">l</a>);
<a name="l00243"></a>00243 --top->nl;
<a name="l00244"></a>00244 <span class="keywordflow">return</span> 0;
<a name="l00245"></a>00245 }
<a name="l00246"></a>00246 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (heap_remove_one(heap, top-><a class="code" href="structheapnode__s.html#af25b6bfb16162294dd35851e04ad6c6b" title="Root of left descendant heap.">l</a>, data) == 0) {
<a name="l00247"></a>00247 --top->nl;
<a name="l00248"></a>00248 <span class="keywordflow">return</span> 0;
<a name="l00249"></a>00249 }
<a name="l00250"></a>00250 }
<a name="l00251"></a>00251 <span class="keywordflow">if</span> (top-><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a>) {
<a name="l00252"></a>00252 <span class="keywordflow">if</span> (top-><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a>-><a class="code" href="structheapnode__s.html#a2cac1684dd94b922db98de988232efeb" title="Application data at this node.">data</a> == data) {
<a name="l00253"></a>00253 top-><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a> = subheap_pop(top-><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a>);
<a name="l00254"></a>00254 --top-><a class="code" href="structheapnode__s.html#ab5a21ee1a48ce5359bbcca1d416a51eb" title="#left/right descendants of this node (for balancing heap)">nr</a>;
<a name="l00255"></a>00255 <span class="keywordflow">return</span> 0;
<a name="l00256"></a>00256 }
<a name="l00257"></a>00257 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (heap_remove_one(heap, top-><a class="code" href="structheapnode__s.html#a92c30e27e1ccdbaea15f28aa49b0f7ea" title="Root of right descendant heap.">r</a>, data) == 0) {
<a name="l00258"></a>00258 --top-><a class="code" href="structheapnode__s.html#ab5a21ee1a48ce5359bbcca1d416a51eb" title="#left/right descendants of this node (for balancing heap)">nr</a>;
<a name="l00259"></a>00259 <span class="keywordflow">return</span> 0;
<a name="l00260"></a>00260 }
<a name="l00261"></a>00261 }
<a name="l00262"></a>00262 <span class="keywordflow">return</span> -1;
<a name="l00263"></a>00263 }
<a name="l00264"></a>00264
<a name="l00265"></a>00265 <span class="keywordtype">int</span>
<a name="l00266"></a><a class="code" href="heap_8h.html#aa2dbc059f9707e434098694e8c69157e">00266</a> <a class="code" href="heap_8h.html#aa2dbc059f9707e434098694e8c69157e" title="Remove an item from the heap.">heap_remove</a>(<a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_t</a> *heap, <span class="keywordtype">void</span> *data)
<a name="l00267"></a>00267 {
<a name="l00268"></a>00268 <span class="keywordflow">return</span> heap_remove_one(heap, heap->top, data);
<a name="l00269"></a>00269 }
<a name="l00270"></a>00270
<a name="l00271"></a>00271
<a name="l00272"></a>00272 <span class="keywordtype">size_t</span>
<a name="l00273"></a><a class="code" href="heap_8h.html#a1c713d67123e96974505edfa4346cb0f">00273</a> <a class="code" href="heap_8h.html#a1c713d67123e96974505edfa4346cb0f" title="Return the number of items in the heap.">heap_size</a>(<a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_t</a> *heap)
<a name="l00274"></a>00274 {
<a name="l00275"></a>00275 <span class="keywordflow">if</span> (heap->top == NULL)
<a name="l00276"></a>00276 <span class="keywordflow">return</span> 0;
<a name="l00277"></a>00277 <span class="keywordflow">return</span> heap->top->nl + heap->top-><a class="code" href="structheapnode__s.html#ab5a21ee1a48ce5359bbcca1d416a51eb" title="#left/right descendants of this node (for balancing heap)">nr</a> + 1;
<a name="l00278"></a>00278 }
<a name="l00279"></a>00279
<a name="l00280"></a>00280 <span class="keywordtype">int</span>
<a name="l00281"></a><a class="code" href="heap_8h.html#ab12b1efd6392eb574d2da9c981e7320c">00281</a> <a class="code" href="heap_8h.html#ab12b1efd6392eb574d2da9c981e7320c" title="Destroy the given heap; free the heap nodes.">heap_destroy</a>(<a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_t</a> *heap)
<a name="l00282"></a>00282 {
<a name="l00283"></a>00283 <span class="keywordtype">void</span> *data;
<a name="l00284"></a>00284 int32 val;
<a name="l00285"></a>00285
<a name="l00286"></a>00286 <span class="comment">/* Empty the heap and free it */</span>
<a name="l00287"></a>00287 <span class="keywordflow">while</span> (<a class="code" href="heap_8h.html#a387c8913b4c62ad1a5c4702a4e6dbdbf" title="Like heap_top but also pop the top item off the heap.">heap_pop</a>(heap, &data, &val) > 0)
<a name="l00288"></a>00288 ;
<a name="l00289"></a>00289 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(heap);
<a name="l00290"></a>00290
<a name="l00291"></a>00291 <span class="keywordflow">return</span> 0;
<a name="l00292"></a>00292 }
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>heap.c</b> </li>
<li class="footer">Generated on Tue Apr 19 2011 for SphinxBase by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </li>
</ul>
</div>
</body>
</html>
distrib
>
Fedora
>
14
>
x86_64
>
media
>
updates
>
by-pkgid
>
0b420d0fce195cf4115dc6a3be5c2da2
>
files
>
245
