<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>DTN Reference Implementation: Util.h Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.6 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<h1>Util.h</h1><a href="Util_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * Copyright 2007 Baylor University</span>
<a name="l00003"></a>00003 <span class="comment"> *</span>
<a name="l00004"></a>00004 <span class="comment"> * Licensed under the Apache License, Version 2.0 (the "License");</span>
<a name="l00005"></a>00005 <span class="comment"> * you may not use this file except in compliance with the License.</span>
<a name="l00006"></a>00006 <span class="comment"> * You may obtain a copy of the License at</span>
<a name="l00007"></a>00007 <span class="comment"> *</span>
<a name="l00008"></a>00008 <span class="comment"> * http://www.apache.org/licenses/LICENSE-2.0</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * Unless required by applicable law or agreed to in writing, software</span>
<a name="l00011"></a>00011 <span class="comment"> * distributed under the License is distributed on an "AS IS" BASIS,</span>
<a name="l00012"></a>00012 <span class="comment"> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span>
<a name="l00013"></a>00013 <span class="comment"> * See the License for the specific language governing permissions and</span>
<a name="l00014"></a>00014 <span class="comment"> * limitations under the License.</span>
<a name="l00015"></a>00015 <span class="comment"> */</span>
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="preprocessor">#ifndef _PROPHET_UTIL_H_</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="preprocessor">#define _PROPHET_UTIL_H_</span>
<a name="l00019"></a>00019 <span class="preprocessor"></span>
<a name="l00020"></a>00020 <span class="preprocessor">#include <string></span>
<a name="l00021"></a>00021 <span class="preprocessor">#include <algorithm></span>
<a name="l00022"></a>00022 <span class="preprocessor">#include <vector></span>
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="keyword">namespace </span>prophet
<a name="l00025"></a>00025 {
<a name="l00026"></a>00026
<a name="l00027"></a><a class="code" href="Util_8h.html#10fb10f052238243f08749f41a8374a6">00027</a> <span class="preprocessor">#define FOUR_BYTE_ALIGN(x) (((x) % 4) != 0) ? ((x) + (4 - ((x) % 4))) : (x)</span>
<a name="l00028"></a>00028 <span class="preprocessor"></span>
<a name="l00029"></a><a class="code" href="structprophet_1_1less__string.html">00029</a> <span class="keyword">struct </span><a class="code" href="structprophet_1_1less__string.html">less_string</a> : <span class="keyword">public</span> std::less<std::string>
<a name="l00030"></a>00030 {
<a name="l00031"></a><a class="code" href="structprophet_1_1less__string.html#c2c7aa08be315963837737c0cdfb40d9">00031</a> <span class="keywordtype">bool</span> <a class="code" href="structprophet_1_1less__string.html#c2c7aa08be315963837737c0cdfb40d9">operator() </a>(<span class="keyword">const</span> std::string& a, <span class="keyword">const</span> std::string& b)<span class="keyword"> const</span>
<a name="l00032"></a>00032 <span class="keyword"> </span>{
<a name="l00033"></a>00033 <span class="keywordflow">return</span> (a.compare(b) < 0);
<a name="l00034"></a>00034 }
<a name="l00035"></a>00035 };
<a name="l00036"></a>00036
<a name="l00037"></a>00037 <span class="keyword">template</span><<span class="keyword">typename</span> T,<span class="keyword">typename</span> <span class="keywordtype">size_t</span>ype=<span class="keywordtype">size_t</span>>
<a name="l00038"></a><a class="code" href="structprophet_1_1DoNothing.html">00038</a> <span class="keyword">struct </span><a class="code" href="structprophet_1_1DoNothing.html">DoNothing</a>
<a name="l00039"></a>00039 {
<a name="l00040"></a><a class="code" href="structprophet_1_1DoNothing.html#34cfc73a2f2912deb51cba3d798e99de">00040</a> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="structprophet_1_1DoNothing.html#34cfc73a2f2912deb51cba3d798e99de">operator()</a>(T& t, size_type pos)
<a name="l00041"></a>00041 {
<a name="l00042"></a>00042 (void)t;
<a name="l00043"></a>00043 (void)pos;
<a name="l00044"></a>00044 }
<a name="l00045"></a>00045 };
<a name="l00046"></a>00046
<a name="l00047"></a><a class="code" href="Util_8h.html#ddad2d752d349051fa9b495f8cb87c2f">00047</a> <span class="preprocessor">#define PARENT(_x) (((_x) - 1) >> 1)</span>
<a name="l00048"></a><a class="code" href="Util_8h.html#7e1a7cb458c1bf33e1f4db98f6554378">00048</a> <span class="preprocessor"></span><span class="preprocessor">#define LEFT(_x) (((_x) << 1) + 1)</span>
<a name="l00049"></a>00049 <span class="preprocessor"></span>
<a name="l00050"></a>00050 <span class="keyword">template</span> <<span class="keyword">typename</span> UnitType,
<a name="l00051"></a>00051 <span class="keyword">typename</span> Sequence=std::vector<UnitType>,
<a name="l00052"></a>00052 <span class="keyword">typename</span> Compare=std::less<typename Sequence::value_type>,
<a name="l00053"></a>00053 <span class="keyword">typename</span> UpdateElem=DoNothing<UnitType,typename Sequence::size_type> >
<a name="l00054"></a><a class="code" href="classprophet_1_1Heap.html">00054</a> <span class="keyword">class </span><a class="code" href="classprophet_1_1Heap.html">Heap</a>
<a name="l00055"></a>00055 {
<a name="l00056"></a>00056 <span class="keyword">public</span>:
<a name="l00057"></a><a class="code" href="classprophet_1_1Heap.html#b4a24ec4259b8cf494c9a19dcbcb3fe8">00057</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> Sequence::value_type <a class="code" href="classprophet_1_1Heap.html#b4a24ec4259b8cf494c9a19dcbcb3fe8">value_type</a>;
<a name="l00058"></a><a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">00058</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> Sequence::size_type <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a>;
<a name="l00059"></a><a class="code" href="classprophet_1_1Heap.html#a08eed0d1757ada8dc3560a57a843787">00059</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> Sequence::iterator <a class="code" href="classprophet_1_1Heap.html#a08eed0d1757ada8dc3560a57a843787">iterator</a>;
<a name="l00060"></a><a class="code" href="classprophet_1_1Heap.html#5a63f2790438bad51ba92215577dc14a">00060</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> Sequence::const_reference <a class="code" href="classprophet_1_1Heap.html#5a63f2790438bad51ba92215577dc14a">const_reference</a>;
<a name="l00061"></a>00061
<a name="l00065"></a><a class="code" href="classprophet_1_1Heap.html#99cd69953c33bf7dea6b7e4a2b647e99">00065</a> <a class="code" href="classprophet_1_1Heap.html#99cd69953c33bf7dea6b7e4a2b647e99" title="Default constructor.">Heap</a>()
<a name="l00066"></a>00066 {
<a name="l00067"></a>00067 <a class="code" href="classprophet_1_1Heap.html#eb0d3cc41b7524e9c1cdb96b0ed0c4ac">comp_</a> = <span class="keyword">new</span> Compare();
<a name="l00068"></a>00068 }
<a name="l00069"></a>00069
<a name="l00073"></a><a class="code" href="classprophet_1_1Heap.html#69d1dac4f386f55ab7b50e61f797e8e2">00073</a> <a class="code" href="classprophet_1_1Heap.html#99cd69953c33bf7dea6b7e4a2b647e99" title="Default constructor.">Heap</a>(Compare* comp)
<a name="l00074"></a>00074 : <a class="code" href="classprophet_1_1Heap.html#eb0d3cc41b7524e9c1cdb96b0ed0c4ac">comp_</a>(comp)
<a name="l00075"></a>00075 {
<a name="l00076"></a>00076 }
<a name="l00077"></a>00077
<a name="l00081"></a><a class="code" href="classprophet_1_1Heap.html#96edb72184fea9ff0f98d485b5e16225">00081</a> <span class="keyword">virtual</span> <a class="code" href="classprophet_1_1Heap.html#96edb72184fea9ff0f98d485b5e16225" title="Destructor.">~Heap</a>() { <span class="keyword">delete</span> <a class="code" href="classprophet_1_1Heap.html#eb0d3cc41b7524e9c1cdb96b0ed0c4ac">comp_</a>; }
<a name="l00082"></a>00082
<a name="l00086"></a>00086 <span class="keyword">inline</span>
<a name="l00087"></a><a class="code" href="classprophet_1_1Heap.html#dbc1b4c6e50504567b744ada78ba7986">00087</a> <span class="keyword">const</span> Compare* <a class="code" href="classprophet_1_1Heap.html#dbc1b4c6e50504567b744ada78ba7986" title="Constant reference to current compare.">compare</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classprophet_1_1Heap.html#eb0d3cc41b7524e9c1cdb96b0ed0c4ac">comp_</a>; }
<a name="l00088"></a>00088
<a name="l00092"></a>00092 <span class="keyword">inline</span>
<a name="l00093"></a><a class="code" href="classprophet_1_1Heap.html#f9671b4c827e23c90f944a9f9970f4a3">00093</a> <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Heap.html#f9671b4c827e23c90f944a9f9970f4a3" title="Change to new compare and reorder heap.">set_compare</a>(Compare* comp) {
<a name="l00094"></a>00094 <span class="keyword">delete</span> <a class="code" href="classprophet_1_1Heap.html#eb0d3cc41b7524e9c1cdb96b0ed0c4ac">comp_</a>;
<a name="l00095"></a>00095 <a class="code" href="classprophet_1_1Heap.html#eb0d3cc41b7524e9c1cdb96b0ed0c4ac">comp_</a> = comp;
<a name="l00096"></a>00096 <a class="code" href="classprophet_1_1Heap.html#008f313cbc6615f66a6c51ce070bfd7b" title="Begin with last node (a leaf, therefore a subtree of size 1, therefore a heap) and...">make_heap</a>(0);
<a name="l00097"></a>00097 <a class="code" href="classprophet_1_1Heap.html#af6153f28572f09a0add721db23f97ba" title="Pass over entire sequence to ensure each element&#39;s heap pointer.">update_elements</a>();
<a name="l00098"></a>00098 }
<a name="l00099"></a>00099
<a name="l00103"></a>00103 <span class="keyword">inline</span>
<a name="l00104"></a><a class="code" href="classprophet_1_1Heap.html#62defdf63c3648950958952d92bc1223">00104</a> <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code" href="classprophet_1_1Heap.html#62defdf63c3648950958952d92bc1223" title="Verify heap order.">is_heap</a>(<span class="keyword">const</span> Sequence& list, Compare& comp) {
<a name="l00105"></a>00105 <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> <a class="code" href="num2sdnv_8c.html#fed088663f8704004425cdae2120b9b3">len</a> = list.size();
<a name="l00106"></a>00106 <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> parent = 0;
<a name="l00107"></a>00107 <span class="keywordflow">for</span> (<a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> child = 1; child < len; child++) {
<a name="l00108"></a>00108 <span class="keywordflow">if</span> ((comp)(list[parent],list[child]))
<a name="l00109"></a>00109 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00110"></a>00110 <span class="keywordflow">if</span> ((child & 1) == 0)
<a name="l00111"></a>00111 parent++;
<a name="l00112"></a>00112 }
<a name="l00113"></a>00113 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00114"></a>00114 }
<a name="l00115"></a>00115
<a name="l00119"></a>00119 <span class="keyword">inline</span>
<a name="l00120"></a><a class="code" href="classprophet_1_1Heap.html#af6153f28572f09a0add721db23f97ba">00120</a> <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Heap.html#af6153f28572f09a0add721db23f97ba" title="Pass over entire sequence to ensure each element&#39;s heap pointer.">update_elements</a>() {
<a name="l00121"></a>00121 <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> pos = <a class="code" href="classprophet_1_1Heap.html#24f75e9aa275c8a12feea2c630603bd6" title="Return number of elements in underlying sequence.">size</a>();
<a name="l00122"></a>00122 <span class="keywordflow">while</span> (pos-- > 0)
<a name="l00123"></a>00123 (<a class="code" href="classprophet_1_1Heap.html#cf9a097600f517dcc5fd3fd9858e16ae">upd_</a>)(<a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[pos],pos);
<a name="l00124"></a>00124 }
<a name="l00125"></a>00125
<a name="l00129"></a><a class="code" href="classprophet_1_1Heap.html#f9153c0d26efbd93362cc4a572437ee7">00129</a> <span class="keywordtype">bool</span> <a class="code" href="classprophet_1_1Heap.html#f9153c0d26efbd93362cc4a572437ee7" title="Return true if underlying sequence is empty.">empty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>.empty(); }
<a name="l00130"></a>00130
<a name="l00134"></a><a class="code" href="classprophet_1_1Heap.html#24f75e9aa275c8a12feea2c630603bd6">00134</a> <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> <a class="code" href="classprophet_1_1Heap.html#24f75e9aa275c8a12feea2c630603bd6" title="Return number of elements in underlying sequence.">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>.size(); }
<a name="l00135"></a>00135
<a name="l00139"></a><a class="code" href="classprophet_1_1Heap.html#ed8c35bf71920dcca199adc8f869a8eb">00139</a> <a class="code" href="classprophet_1_1Heap.html#5a63f2790438bad51ba92215577dc14a">const_reference</a> <a class="code" href="classprophet_1_1Heap.html#ed8c35bf71920dcca199adc8f869a8eb" title="Return read-only reference to top of heap.">top</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>.front(); }
<a name="l00140"></a>00140
<a name="l00144"></a>00144 <span class="keyword">inline</span>
<a name="l00145"></a><a class="code" href="classprophet_1_1Heap.html#c80802c5b5edf1998b023b6323ae8b3d">00145</a> <span class="keywordtype">void</span> <span class="keyword">add</span>(<a class="code" href="classprophet_1_1Heap.html#b4a24ec4259b8cf494c9a19dcbcb3fe8">value_type</a> x) {
<a name="l00146"></a>00146 <span class="comment">// first add value to end of underlying sequence</span>
<a name="l00147"></a>00147 <a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>.push_back(x);
<a name="l00148"></a>00148 <span class="comment">// re-order sequence into heap</span>
<a name="l00149"></a>00149 <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> pos = <a class="code" href="classprophet_1_1Heap.html#2e04da181c192f5d3fa1fca52ff8f52d" title="Assuming tree is heap order above last, bubble up last until the tree is in heap...">heap_up</a>(<a class="code" href="classprophet_1_1Heap.html#24f75e9aa275c8a12feea2c630603bd6" title="Return number of elements in underlying sequence.">size</a>() - 1);
<a name="l00150"></a>00150 <span class="comment">// update element with new heap position</span>
<a name="l00151"></a>00151 (<a class="code" href="classprophet_1_1Heap.html#cf9a097600f517dcc5fd3fd9858e16ae">upd_</a>)(<a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[pos],pos);
<a name="l00152"></a>00152 }
<a name="l00153"></a>00153
<a name="l00158"></a>00158 <span class="keyword">inline</span>
<a name="l00159"></a><a class="code" href="classprophet_1_1Heap.html#20d319981c5585b49f388b5a9d6afadb">00159</a> <span class="keywordtype">void</span> <span class="keyword">remove</span>(<span class="keywordtype">size_t</span> pos) {
<a name="l00160"></a>00160 <span class="comment">// overwrite victim with last element</span>
<a name="l00161"></a>00161 <a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[pos] = <a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[<a class="code" href="classprophet_1_1Heap.html#24f75e9aa275c8a12feea2c630603bd6" title="Return number of elements in underlying sequence.">size</a>()-1];
<a name="l00162"></a>00162 (<a class="code" href="classprophet_1_1Heap.html#cf9a097600f517dcc5fd3fd9858e16ae">upd_</a>)(<a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[pos],pos);
<a name="l00163"></a>00163 <span class="comment">// remove last element</span>
<a name="l00164"></a>00164 <a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>.pop_back();
<a name="l00165"></a>00165 <span class="comment">// reheap everything down from pos</span>
<a name="l00166"></a>00166 <a class="code" href="classprophet_1_1Heap.html#aac5e8b183884ec9d8cbd1c706d8c7df" title="Assuming left and right subtrees are in heap order, push hole down the tree until...">heap_down</a>(pos);
<a name="l00167"></a>00167 }
<a name="l00168"></a>00168
<a name="l00172"></a><a class="code" href="classprophet_1_1Heap.html#29f17eeee1c6569552023e544073031c">00172</a> <span class="keyword">const</span> Sequence& <a class="code" href="classprophet_1_1Heap.html#29f17eeee1c6569552023e544073031c" title="Constant reference to underlying sequence.">sequence</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>; }
<a name="l00173"></a>00173
<a name="l00174"></a>00174 <span class="keyword">protected</span>:
<a name="l00179"></a>00179 <span class="keyword">inline</span>
<a name="l00180"></a><a class="code" href="classprophet_1_1Heap.html#aac5e8b183884ec9d8cbd1c706d8c7df">00180</a> <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> <a class="code" href="classprophet_1_1Heap.html#aac5e8b183884ec9d8cbd1c706d8c7df" title="Assuming left and right subtrees are in heap order, push hole down the tree until...">heap_down</a>(<a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> hole) {
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> <a class="code" href="classprophet_1_1Heap.html#ed8c35bf71920dcca199adc8f869a8eb" title="Return read-only reference to top of heap.">top</a> = hole;
<a name="l00183"></a>00183 <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> left = <a class="code" href="Util_8h.html#7e1a7cb458c1bf33e1f4db98f6554378">LEFT</a>(top);
<a name="l00184"></a>00184 <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> right = left + 1;
<a name="l00185"></a>00185
<a name="l00186"></a>00186 <span class="keywordflow">while</span> (left < <a class="code" href="classprophet_1_1Heap.html#24f75e9aa275c8a12feea2c630603bd6" title="Return number of elements in underlying sequence.">size</a>()) {
<a name="l00187"></a>00187
<a name="l00188"></a>00188 <span class="keywordflow">if</span> ((*<a class="code" href="classprophet_1_1Heap.html#eb0d3cc41b7524e9c1cdb96b0ed0c4ac">comp_</a>)(<a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[hole],<a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[left]))
<a name="l00189"></a>00189 top = left;
<a name="l00190"></a>00190
<a name="l00191"></a>00191 <span class="keywordflow">if</span> (right < <a class="code" href="classprophet_1_1Heap.html#24f75e9aa275c8a12feea2c630603bd6" title="Return number of elements in underlying sequence.">size</a>() && (*<a class="code" href="classprophet_1_1Heap.html#eb0d3cc41b7524e9c1cdb96b0ed0c4ac">comp_</a>)(<a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[top],<a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[right]))
<a name="l00192"></a>00192 top = right;
<a name="l00193"></a>00193
<a name="l00194"></a>00194 <span class="comment">// heap order throughout, we're done</span>
<a name="l00195"></a>00195 <span class="keywordflow">if</span> (top == hole)
<a name="l00196"></a>00196 <span class="keywordflow">break</span>;
<a name="l00197"></a>00197
<a name="l00198"></a>00198 <span class="comment">// swap top and hole</span>
<a name="l00199"></a>00199 <a class="code" href="classprophet_1_1Heap.html#5d2bdf1ea6e819c4ee95c776d3ea85f1" title="Swap function used by heap_up, heap_down.">swap</a>(top,hole);
<a name="l00200"></a>00200
<a name="l00201"></a>00201 <span class="comment">// reset values for next iteration</span>
<a name="l00202"></a>00202 hole = top;
<a name="l00203"></a>00203 left = <a class="code" href="Util_8h.html#7e1a7cb458c1bf33e1f4db98f6554378">LEFT</a>(top);
<a name="l00204"></a>00204 right = left + 1;
<a name="l00205"></a>00205 }
<a name="l00206"></a>00206 <span class="keywordflow">return</span> top;
<a name="l00207"></a>00207 }
<a name="l00208"></a>00208
<a name="l00213"></a>00213 <span class="keyword">inline</span>
<a name="l00214"></a><a class="code" href="classprophet_1_1Heap.html#2e04da181c192f5d3fa1fca52ff8f52d">00214</a> <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> <a class="code" href="classprophet_1_1Heap.html#2e04da181c192f5d3fa1fca52ff8f52d" title="Assuming tree is heap order above last, bubble up last until the tree is in heap...">heap_up</a>(<a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> last) {
<a name="l00215"></a>00215
<a name="l00216"></a>00216 <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> parent = <a class="code" href="Util_8h.html#ddad2d752d349051fa9b495f8cb87c2f">PARENT</a>(last);
<a name="l00217"></a>00217
<a name="l00218"></a>00218 <span class="keywordflow">while</span> (last > 0) {
<a name="l00219"></a>00219
<a name="l00220"></a>00220 <span class="comment">// check for heap order</span>
<a name="l00221"></a>00221 <span class="keywordflow">if</span> (!(*<a class="code" href="classprophet_1_1Heap.html#eb0d3cc41b7524e9c1cdb96b0ed0c4ac">comp_</a>)(<a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[parent],<a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[last]))
<a name="l00222"></a>00222 <span class="keywordflow">break</span>;
<a name="l00223"></a>00223
<a name="l00224"></a>00224 <a class="code" href="classprophet_1_1Heap.html#5d2bdf1ea6e819c4ee95c776d3ea85f1" title="Swap function used by heap_up, heap_down.">swap</a>(parent,last);
<a name="l00225"></a>00225
<a name="l00226"></a>00226 last = parent;
<a name="l00227"></a>00227 parent = <a class="code" href="Util_8h.html#ddad2d752d349051fa9b495f8cb87c2f">PARENT</a>(last);
<a name="l00228"></a>00228 }
<a name="l00229"></a>00229 <span class="keywordflow">return</span> last;
<a name="l00230"></a>00230 }
<a name="l00231"></a>00231
<a name="l00236"></a>00236 <span class="keyword">inline</span>
<a name="l00237"></a><a class="code" href="classprophet_1_1Heap.html#008f313cbc6615f66a6c51ce070bfd7b">00237</a> <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Heap.html#008f313cbc6615f66a6c51ce070bfd7b" title="Begin with last node (a leaf, therefore a subtree of size 1, therefore a heap) and...">make_heap</a>(<a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> first) {
<a name="l00238"></a>00238
<a name="l00239"></a>00239 <span class="comment">// first scan down to a leaf node from first</span>
<a name="l00240"></a>00240 <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> left = <a class="code" href="Util_8h.html#7e1a7cb458c1bf33e1f4db98f6554378">LEFT</a>(first);
<a name="l00241"></a>00241 <span class="keywordflow">while</span> (left < <a class="code" href="classprophet_1_1Heap.html#24f75e9aa275c8a12feea2c630603bd6" title="Return number of elements in underlying sequence.">size</a>() - 1)
<a name="l00242"></a>00242 left = <a class="code" href="Util_8h.html#7e1a7cb458c1bf33e1f4db98f6554378">LEFT</a>(left);
<a name="l00243"></a>00243
<a name="l00244"></a>00244 <span class="comment">// now work back up towards first</span>
<a name="l00245"></a>00245 <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> parent = <a class="code" href="Util_8h.html#ddad2d752d349051fa9b495f8cb87c2f">PARENT</a>(left);
<a name="l00246"></a>00246 <span class="keywordflow">while</span> (<span class="keyword">true</span>) {
<a name="l00247"></a>00247 <a class="code" href="classprophet_1_1Heap.html#aac5e8b183884ec9d8cbd1c706d8c7df" title="Assuming left and right subtrees are in heap order, push hole down the tree until...">heap_down</a>(parent);
<a name="l00248"></a>00248 <span class="keywordflow">if</span> (parent == first) <span class="keywordflow">break</span>;
<a name="l00249"></a>00249 parent--;
<a name="l00250"></a>00250 }
<a name="l00251"></a>00251 }
<a name="l00252"></a>00252
<a name="l00256"></a>00256 <span class="keyword">inline</span>
<a name="l00257"></a><a class="code" href="classprophet_1_1Heap.html#5d2bdf1ea6e819c4ee95c776d3ea85f1">00257</a> <span class="keywordtype">void</span> <a class="code" href="classprophet_1_1Heap.html#5d2bdf1ea6e819c4ee95c776d3ea85f1" title="Swap function used by heap_up, heap_down.">swap</a>(<a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> a, <a class="code" href="classprophet_1_1Heap.html#d4ba3e967311000a3c3e06b40b2f34f8">size_type</a> b) {
<a name="l00258"></a>00258 std::iter_swap<iterator>(
<a name="l00259"></a>00259 <a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>.begin() + a,
<a name="l00260"></a>00260 <a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>.begin() + b);
<a name="l00261"></a>00261 (<a class="code" href="classprophet_1_1Heap.html#cf9a097600f517dcc5fd3fd9858e16ae">upd_</a>)(<a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[a],a);
<a name="l00262"></a>00262 (<a class="code" href="classprophet_1_1Heap.html#cf9a097600f517dcc5fd3fd9858e16ae">upd_</a>)(<a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>[b],b);
<a name="l00263"></a>00263 }
<a name="l00264"></a>00264
<a name="l00265"></a><a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">00265</a> Sequence <a class="code" href="classprophet_1_1Heap.html#305b5e34923105dd374002f8af690b3e">seq_</a>;
<a name="l00266"></a><a class="code" href="classprophet_1_1Heap.html#eb0d3cc41b7524e9c1cdb96b0ed0c4ac">00266</a> Compare* <a class="code" href="classprophet_1_1Heap.html#eb0d3cc41b7524e9c1cdb96b0ed0c4ac">comp_</a>;
<a name="l00267"></a><a class="code" href="classprophet_1_1Heap.html#cf9a097600f517dcc5fd3fd9858e16ae">00267</a> UpdateElem <a class="code" href="classprophet_1_1Heap.html#cf9a097600f517dcc5fd3fd9858e16ae">upd_</a>;
<a name="l00268"></a>00268 }; <span class="comment">//template<> class Heap</span>
<a name="l00269"></a>00269
<a name="l00270"></a>00270 }; <span class="comment">//namespace prophet</span>
<a name="l00271"></a>00271
<a name="l00272"></a>00272 <span class="preprocessor">#endif // _PROPHET_UTIL_H_</span>
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Mon Jul 21 14:09:47 2008 for DTN Reference Implementation by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address>
</body>
</html>
