<!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>FIFE: engine/core/util/structures/priorityqueue.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<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 onload='searchBox.OnSelectItem(0);'>
<!-- Generated by Doxygen 1.7.4 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'Search');
--></script>
<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">FIFE <span id="projectnumber">2008.0</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="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>
<li><a href="dirs.html"><span>Directories</span></a></li>
<li><a href="examples.html"><span>Examples</span></a></li>
<li id="searchli">
<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 List</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('priorityqueue_8h.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">priorityqueue.h</div> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/***************************************************************************</span>
<a name="l00002"></a>00002 <span class="comment"> * Copyright (C) 2005-2008 by the FIFE team *</span>
<a name="l00003"></a>00003 <span class="comment"> * http://www.fifengine.de *</span>
<a name="l00004"></a>00004 <span class="comment"> * This file is part of FIFE. *</span>
<a name="l00005"></a>00005 <span class="comment"> * *</span>
<a name="l00006"></a>00006 <span class="comment"> * FIFE is free software; you can redistribute it and/or *</span>
<a name="l00007"></a>00007 <span class="comment"> * modify it under the terms of the GNU Lesser General Public *</span>
<a name="l00008"></a>00008 <span class="comment"> * License as published by the Free Software Foundation; either *</span>
<a name="l00009"></a>00009 <span class="comment"> * version 2.1 of the License, or (at your option) any later version. *</span>
<a name="l00010"></a>00010 <span class="comment"> * *</span>
<a name="l00011"></a>00011 <span class="comment"> * This library is distributed in the hope that it will be useful, *</span>
<a name="l00012"></a>00012 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of *</span>
<a name="l00013"></a>00013 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *</span>
<a name="l00014"></a>00014 <span class="comment"> * Lesser General Public License for more details. *</span>
<a name="l00015"></a>00015 <span class="comment"> * *</span>
<a name="l00016"></a>00016 <span class="comment"> * You should have received a copy of the GNU Lesser General Public *</span>
<a name="l00017"></a>00017 <span class="comment"> * License along with this library; if not, write to the *</span>
<a name="l00018"></a>00018 <span class="comment"> * Free Software Foundation, Inc., *</span>
<a name="l00019"></a>00019 <span class="comment"> * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *</span>
<a name="l00020"></a>00020 <span class="comment"> ***************************************************************************/</span>
<a name="l00021"></a>00021
<a name="l00022"></a>00022 <span class="preprocessor">#ifndef FIFE_SOLVER_INDEXEDPQ_H</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define FIFE_SOLVER_INDEXEDPQ_H</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span>
<a name="l00025"></a>00025 <span class="preprocessor">#include <cassert></span>
<a name="l00026"></a>00026 <span class="preprocessor">#include <list></span>
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="keyword">namespace </span>FIFE {
<a name="l00029"></a>00029
<a name="l00035"></a>00035 <span class="keyword">template</span><<span class="keyword">typename</span> index_type, <span class="keyword">typename</span> priority_type>
<a name="l00036"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html">00036</a> <span class="keyword">class </span><a class="code" href="class_f_i_f_e_1_1_priority_queue.html">PriorityQueue</a> {
<a name="l00037"></a>00037 <span class="keyword">public</span>:
<a name="l00041"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a8295fbc9eac28a0375b376014b2019e4">00041</a> <span class="keyword">enum</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a8295fbc9eac28a0375b376014b2019e4">Ordering</a> {
<a name="l00042"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a8295fbc9eac28a0375b376014b2019e4a3a232b254966d365f41f228325cd038b">00042</a> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a8295fbc9eac28a0375b376014b2019e4a3a232b254966d365f41f228325cd038b" title="lowest priority first.">Ascending</a>,
<a name="l00043"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a8295fbc9eac28a0375b376014b2019e4a7328ea595895248e6377ff73452e1bb7">00043</a> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a8295fbc9eac28a0375b376014b2019e4a7328ea595895248e6377ff73452e1bb7" title="highest priority first.">Descending</a>
<a name="l00044"></a>00044 };
<a name="l00045"></a>00045
<a name="l00046"></a>00046 <span class="keyword">typedef</span> std::pair<index_type, priority_type> value_type;
<a name="l00047"></a>00047
<a name="l00051"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html#aed6286f47b1ea00aba0349f34fbd4e30">00051</a> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#aed6286f47b1ea00aba0349f34fbd4e30">PriorityQueue</a>(<span class="keywordtype">void</span>) : m_ordering(<a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a8295fbc9eac28a0375b376014b2019e4a3a232b254966d365f41f228325cd038b" title="lowest priority first.">Ascending</a>) {
<a name="l00052"></a>00052 }
<a name="l00053"></a>00053
<a name="l00058"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a68d91c6ab6de6425df311748cd8839a2">00058</a> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a68d91c6ab6de6425df311748cd8839a2">PriorityQueue</a>(<span class="keyword">const</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a8295fbc9eac28a0375b376014b2019e4">Ordering</a> ordering) : m_ordering(ordering) {
<a name="l00059"></a>00059 }
<a name="l00060"></a>00060
<a name="l00068"></a>00068 <span class="keywordtype">void</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#ae4e86eb305da8400662ceae56306ce5d">pushElement</a>(<span class="keyword">const</span> value_type& element);
<a name="l00069"></a>00069
<a name="l00074"></a>00074 <span class="keywordtype">void</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a587429cfc6b404502482c05eb114e782">popElement</a>(<span class="keywordtype">void</span>);
<a name="l00075"></a>00075
<a name="l00085"></a>00085 <span class="keywordtype">bool</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a7279513ecba97e661940106bdade009e">changeElementPriority</a>(<span class="keyword">const</span> index_type& index, <span class="keyword">const</span> priority_type& newPriority);
<a name="l00086"></a>00086
<a name="l00090"></a>00090 <span class="keywordtype">void</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a6a5badad0991c27c1e03e7c6246ac706">clear</a>(<span class="keywordtype">void</span>);
<a name="l00091"></a>00091
<a name="l00099"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a43bd3fb3653061f7c34737bd01a32799">00099</a> <span class="keyword">const</span> value_type <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a43bd3fb3653061f7c34737bd01a32799">getPriorityElement</a>(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{
<a name="l00100"></a>00100
<a name="l00101"></a>00101 assert(!<a class="code" href="class_f_i_f_e_1_1_priority_queue.html#ae9da617f624a61ae956be979357adf32">empty</a>());
<a name="l00102"></a>00102
<a name="l00103"></a>00103 <span class="keywordflow">return</span> m_elements.front();
<a name="l00104"></a>00104
<a name="l00105"></a>00105 }
<a name="l00106"></a>00106
<a name="l00111"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html#ae9da617f624a61ae956be979357adf32">00111</a> <span class="keywordtype">bool</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#ae9da617f624a61ae956be979357adf32">empty</a>(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{
<a name="l00112"></a>00112 <span class="keywordflow">return</span> m_elements.empty();
<a name="l00113"></a>00113 }
<a name="l00114"></a>00114
<a name="l00118"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a5d5e01b797c44ea81f93ff440b352c85">00118</a> <span class="keywordtype">size_t</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a5d5e01b797c44ea81f93ff440b352c85">size</a>(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{
<a name="l00119"></a>00119 <span class="keywordflow">return</span> m_elements.size();
<a name="l00120"></a>00120 }
<a name="l00121"></a>00121 <span class="keyword">private</span>:
<a name="l00122"></a>00122 <span class="keyword">typedef</span> std::list<value_type> ElementList;
<a name="l00123"></a>00123 <span class="keyword">typedef</span> <span class="keyword">typename</span> ElementList::iterator ElementListIt;
<a name="l00124"></a>00124 <span class="keyword">typedef</span> <span class="keyword">typename</span> ElementList::const_iterator ElementListConstIt;
<a name="l00125"></a>00125
<a name="l00126"></a>00126 <span class="comment">//A list of valuetype pairs that represents the pq. </span>
<a name="l00127"></a>00127 ElementList m_elements;
<a name="l00128"></a>00128
<a name="l00129"></a>00129 <span class="comment">//The order to use when sorting the pq.</span>
<a name="l00130"></a>00130 <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a8295fbc9eac28a0375b376014b2019e4">Ordering</a> m_ordering;
<a name="l00131"></a>00131
<a name="l00136"></a>00136 <span class="keywordtype">void</span> orderUp(ElementListIt i);
<a name="l00142"></a>00142 <span class="keywordtype">void</span> orderUp(<span class="keyword">const</span> value_type& entry);
<a name="l00143"></a>00143
<a name="l00148"></a>00148 <span class="keywordtype">void</span> orderDown(ElementListIt i);
<a name="l00149"></a>00149
<a name="l00154"></a>00154 ElementListIt getElementIterator(<span class="keyword">const</span> index_type& index) {
<a name="l00155"></a>00155
<a name="l00156"></a>00156 <span class="keywordflow">for</span>(ElementListIt i = m_elements.begin(); i != m_elements.end(); ++i) {
<a name="l00157"></a>00157 <span class="keywordflow">if</span>(i->first == index) {
<a name="l00158"></a>00158 <span class="keywordflow">return</span> i;
<a name="l00159"></a>00159 }
<a name="l00160"></a>00160 }
<a name="l00161"></a>00161
<a name="l00162"></a>00162 <span class="keywordflow">return</span> m_elements.end();
<a name="l00163"></a>00163
<a name="l00164"></a>00164 }
<a name="l00165"></a>00165
<a name="l00173"></a>00173 <span class="keywordtype">int</span> compare(<span class="keyword">const</span> value_type& a, <span class="keyword">const</span> value_type& b);
<a name="l00174"></a>00174 };
<a name="l00175"></a>00175 }
<a name="l00176"></a>00176
<a name="l00177"></a>00177 <span class="keyword">template</span><<span class="keyword">typename</span> index_type, <span class="keyword">typename</span> priority_type>
<a name="l00178"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html#ae4e86eb305da8400662ceae56306ce5d">00178</a> <span class="keywordtype">void</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#ae4e86eb305da8400662ceae56306ce5d">FIFE::PriorityQueue<index_type, priority_type>::pushElement</a>(<span class="keyword">const</span> value_type& element) {
<a name="l00179"></a>00179 <span class="keywordflow">if</span>(empty()) {
<a name="l00180"></a>00180 m_elements.push_front(element);
<a name="l00181"></a>00181 }
<a name="l00182"></a>00182 <span class="keywordflow">else</span> {
<a name="l00183"></a>00183 orderUp(element);
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185 }
<a name="l00186"></a>00186
<a name="l00187"></a>00187 <span class="keyword">template</span><<span class="keyword">typename</span> index_type, <span class="keyword">typename</span> priority_type>
<a name="l00188"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a587429cfc6b404502482c05eb114e782">00188</a> <span class="keywordtype">void</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a587429cfc6b404502482c05eb114e782">FIFE::PriorityQueue<index_type, priority_type>::popElement</a>(<span class="keywordtype">void</span>) {
<a name="l00189"></a>00189
<a name="l00190"></a>00190 <span class="keywordflow">if</span>(!empty()) {
<a name="l00191"></a>00191 m_elements.pop_front();
<a name="l00192"></a>00192 }
<a name="l00193"></a>00193
<a name="l00194"></a>00194 }
<a name="l00195"></a>00195
<a name="l00196"></a>00196 <span class="keyword">template</span><<span class="keyword">typename</span> index_type, <span class="keyword">typename</span> priority_type>
<a name="l00197"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a7279513ecba97e661940106bdade009e">00197</a> <span class="keywordtype">bool</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a7279513ecba97e661940106bdade009e">FIFE::PriorityQueue<index_type, priority_type>::changeElementPriority</a>(<span class="keyword">const</span> index_type& index, <span class="keyword">const</span> priority_type& newPriority) {
<a name="l00198"></a>00198
<a name="l00199"></a>00199 ElementListIt i = getElementIterator(index);
<a name="l00200"></a>00200
<a name="l00201"></a>00201 <span class="keywordflow">if</span>(i == m_elements.end()) {
<a name="l00202"></a>00202 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00203"></a>00203 }
<a name="l00204"></a>00204
<a name="l00205"></a>00205 <span class="keywordtype">int</span> compare_res = compare(value_type(index, newPriority), (*i));
<a name="l00206"></a>00206
<a name="l00207"></a>00207 i->second = newPriority;
<a name="l00208"></a>00208
<a name="l00209"></a>00209 <span class="keywordflow">if</span>(compare_res > 0 && i != m_elements.begin()) {
<a name="l00210"></a>00210 orderDown(i);
<a name="l00211"></a>00211 } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(compare_res < 0) {
<a name="l00212"></a>00212 orderUp(i);
<a name="l00213"></a>00213 }
<a name="l00214"></a>00214
<a name="l00215"></a>00215 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00216"></a>00216
<a name="l00217"></a>00217 }
<a name="l00218"></a>00218
<a name="l00219"></a>00219 <span class="keyword">template</span><<span class="keyword">typename</span> index_type, <span class="keyword">typename</span> priority_type>
<a name="l00220"></a><a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a6a5badad0991c27c1e03e7c6246ac706">00220</a> <span class="keywordtype">void</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html#a6a5badad0991c27c1e03e7c6246ac706">FIFE::PriorityQueue<index_type, priority_type>::clear</a>(<span class="keywordtype">void</span>) {
<a name="l00221"></a>00221
<a name="l00222"></a>00222 m_elements.clear();
<a name="l00223"></a>00223
<a name="l00224"></a>00224 }
<a name="l00225"></a>00225
<a name="l00226"></a>00226 <span class="keyword">template</span><<span class="keyword">typename</span> index_type, <span class="keyword">typename</span> priority_type>
<a name="l00227"></a>00227 <span class="keywordtype">void</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html">FIFE::PriorityQueue<index_type, priority_type>::orderUp</a>(ElementListIt i) {
<a name="l00228"></a>00228
<a name="l00229"></a>00229 assert(i != m_elements.end() && L<span class="stringliteral">"Invalid iterator passed to function"</span>);
<a name="l00230"></a>00230
<a name="l00231"></a>00231 value_type vt = (*i);
<a name="l00232"></a>00232
<a name="l00233"></a>00233 i = m_elements.erase(i);
<a name="l00234"></a>00234
<a name="l00235"></a>00235 <span class="keywordflow">while</span>(i != m_elements.end()) {
<a name="l00236"></a>00236
<a name="l00237"></a>00237 <span class="keywordflow">if</span>(compare(vt, (*i)) > 0) {
<a name="l00238"></a>00238
<a name="l00239"></a>00239 m_elements.insert(i, vt);
<a name="l00240"></a>00240
<a name="l00241"></a>00241 <span class="keywordflow">return</span>;
<a name="l00242"></a>00242 }
<a name="l00243"></a>00243
<a name="l00244"></a>00244 ++i;
<a name="l00245"></a>00245 }
<a name="l00246"></a>00246
<a name="l00247"></a>00247 m_elements.push_back(vt);
<a name="l00248"></a>00248
<a name="l00249"></a>00249 }
<a name="l00250"></a>00250
<a name="l00251"></a>00251 <span class="keyword">template</span><<span class="keyword">class</span> index_type, <span class="keyword">class</span> priority_type>
<a name="l00252"></a>00252 <span class="keywordtype">void</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html">FIFE::PriorityQueue<index_type, priority_type>::orderUp</a>(<span class="keyword">const</span> value_type& val)
<a name="l00253"></a>00253 {
<a name="l00254"></a>00254 <span class="keywordflow">for</span>(ElementListIt i = m_elements.begin(); i != m_elements.end(); ++i)
<a name="l00255"></a>00255 {
<a name="l00256"></a>00256 assert(val.first != i->first);
<a name="l00257"></a>00257
<a name="l00258"></a>00258 <span class="keywordflow">if</span>(compare(val, (*i)) > 0)
<a name="l00259"></a>00259 {
<a name="l00260"></a>00260 assert(val.first != i->first);
<a name="l00261"></a>00261
<a name="l00262"></a>00262 m_elements.insert(i, val);
<a name="l00263"></a>00263
<a name="l00264"></a>00264 <span class="keywordflow">return</span>;
<a name="l00265"></a>00265 }
<a name="l00266"></a>00266 }
<a name="l00267"></a>00267
<a name="l00268"></a>00268 m_elements.push_back(val);
<a name="l00269"></a>00269 }
<a name="l00270"></a>00270
<a name="l00271"></a>00271 <span class="keyword">template</span><<span class="keyword">typename</span> index_type, <span class="keyword">typename</span> priority_type>
<a name="l00272"></a>00272 <span class="keywordtype">void</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html">FIFE::PriorityQueue<index_type, priority_type>::orderDown</a>(ElementListIt i) {
<a name="l00273"></a>00273
<a name="l00274"></a>00274 assert(i != m_elements.end());
<a name="l00275"></a>00275
<a name="l00276"></a>00276 value_type vt = (*i);
<a name="l00277"></a>00277
<a name="l00278"></a>00278 i = m_elements.erase(i);
<a name="l00279"></a>00279
<a name="l00280"></a>00280 <span class="keywordflow">if</span>(i == m_elements.end()) {
<a name="l00281"></a>00281 --i;
<a name="l00282"></a>00282 }
<a name="l00283"></a>00283
<a name="l00284"></a>00284 ElementListIt j = i;
<a name="l00285"></a>00285
<a name="l00286"></a>00286 ++j;
<a name="l00287"></a>00287
<a name="l00288"></a>00288 <span class="keywordflow">while</span>(i != m_elements.begin()) {
<a name="l00289"></a>00289 <span class="keywordflow">if</span>(compare(vt, (*i)) < 0) {
<a name="l00290"></a>00290
<a name="l00291"></a>00291 m_elements.insert(j, vt);
<a name="l00292"></a>00292
<a name="l00293"></a>00293 <span class="keywordflow">return</span>;
<a name="l00294"></a>00294 }
<a name="l00295"></a>00295
<a name="l00296"></a>00296 --i;
<a name="l00297"></a>00297 --j;
<a name="l00298"></a>00298 }
<a name="l00299"></a>00299
<a name="l00300"></a>00300 m_elements.push_front(vt);
<a name="l00301"></a>00301 }
<a name="l00302"></a>00302
<a name="l00303"></a>00303 <span class="keyword">template</span><<span class="keyword">typename</span> index_type, <span class="keyword">typename</span> priority_type>
<a name="l00304"></a>00304 <span class="keywordtype">int</span> <a class="code" href="class_f_i_f_e_1_1_priority_queue.html">FIFE::PriorityQueue<index_type, priority_type>::compare</a>(<span class="keyword">const</span> value_type& a, <span class="keyword">const</span> value_type& b) {
<a name="l00305"></a>00305
<a name="l00306"></a>00306 <span class="keywordflow">if</span>(m_ordering == Descending) {
<a name="l00307"></a>00307
<a name="l00308"></a>00308 <span class="keywordflow">if</span>(a.second > b.second) {
<a name="l00309"></a>00309 <span class="keywordflow">return</span> 1;
<a name="l00310"></a>00310 } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(b.second > a.second) {
<a name="l00311"></a>00311 <span class="keywordflow">return</span> -1;
<a name="l00312"></a>00312 }
<a name="l00313"></a>00313
<a name="l00314"></a>00314 } <span class="keywordflow">else</span> {
<a name="l00315"></a>00315
<a name="l00316"></a>00316 <span class="keywordflow">if</span>(a.second < b.second) {
<a name="l00317"></a>00317 <span class="keywordflow">return</span> 1;
<a name="l00318"></a>00318 } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(b.second < a.second) {
<a name="l00319"></a>00319 <span class="keywordflow">return</span> -1;
<a name="l00320"></a>00320 }
<a name="l00321"></a>00321 }
<a name="l00322"></a>00322
<a name="l00323"></a>00323 <span class="keywordflow">return</span> 0;
<a name="l00324"></a>00324 }
<a name="l00325"></a>00325
<a name="l00326"></a>00326 <span class="preprocessor">#endif</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>priorityqueue.h</b> </li>
<li class="footer">Generated on Sun Jul 10 2011 for FIFE by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </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"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerator</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>
</body>
</html>
