<!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>OMPL: src/ompl/datastructures/BinaryHeap.h Source File</title>
<meta name="author" content="Ioan A. Șucan, Mark Moll, Lydia E. Kavraki">
<link rel="stylesheet" href="../css/screen.css" type="text/css" media="screen, projection">
<link rel="stylesheet" href="../css/print.css" type="text/css" media="print">
<!--[if lt IE 7]>
<script type="text/javascript" src="../js/jquery/jquery.js"></script>
<script type="text/javascript" src="../js/jquery/jquery.dropdown.js"></script>
<![endif]-->
<script type="text/javaScript" src="search/search.js"></script>
<script type="text/javascript">
var _gaq = _gaq || [];
_gaq.push(['_setAccount', 'UA-9156598-2']);
_gaq.push(['_trackPageview']);
(function() {
var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true;
ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js';
var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s);
})();
</script>
</head>
<body onload='searchBox.OnSelectItem(0);'>
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'Search API');
--></script>
<div class="navigation" id="top">
<div class="tabs" id="ompltitle">
<ul class="tablist">
<li>The Open Motion Planning Library</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 API" 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>
<ul id="nav" class="dropdown">
<li class="first"><a href="index.html">Home</a></li>
<li><a href="download.html">Download</a></li>
<li><a href="documentation.html">Documentation</a></li>
<li><span class="dir">Code API</span>
<ul>
<li><a href="api_overview.html">API Overview</a></li>
<li><a href="namespaces.html">Namespaces</a></li>
<li><a href="annotated.html">Classes</a></li>
<li><a href="files.html">Files</a></li>
<li><a href="dirs.html">Directories</a></li>
</ul>
</li>
<li><span class="dir">Community</span>
<ul>
<li><a href="developers.html">Developers</a></li>
<li><a href="thirdparty.html">Contributions</a></li>
<li><a href="education.html">Education</a></li>
<li><a href="gallery.html">Gallery</a></li>
</ul>
</li>
<li><span class="dir">About</span>
<ul>
<li><a href="license.html">License</a></li>
<li><a href="citations.html">Citations</a></li>
<li><a href="acknowledgements.html">Acknowledgments</a></li>
<li><a href="contact.html">Contact Us</a></li>
</ul>
</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>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerator</a></div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="" frameborder="0"name="MSearchResults" id="MSearchResults"></iframe>
</div>
<div class="container">
<div class="span-22 push-2 first last">
<div>
<!-- Generated by Doxygen 1.7.4 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'Search');
--></script>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_f5421e52a658cd938113ed6044324834.html">src</a> </li>
<li class="navelem"><a class="el" href="dir_ae92c2ff78847f0cb49b545f9089bbbc.html">ompl</a> </li>
<li class="navelem"><a class="el" href="dir_bcc018587a1660af6e54d7cc713e88f2.html">datastructures</a> </li>
</ul>
</div>
</div>
<div class="header">
<div class="headertitle">
<div class="title">BinaryHeap.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">* Software License Agreement (BSD License)</span>
<a name="l00003"></a>00003 <span class="comment">*</span>
<a name="l00004"></a>00004 <span class="comment">* Copyright (c) 2008, Willow Garage, Inc.</span>
<a name="l00005"></a>00005 <span class="comment">* All rights reserved.</span>
<a name="l00006"></a>00006 <span class="comment">*</span>
<a name="l00007"></a>00007 <span class="comment">* Redistribution and use in source and binary forms, with or without</span>
<a name="l00008"></a>00008 <span class="comment">* modification, are permitted provided that the following conditions</span>
<a name="l00009"></a>00009 <span class="comment">* are met:</span>
<a name="l00010"></a>00010 <span class="comment">*</span>
<a name="l00011"></a>00011 <span class="comment">* * Redistributions of source code must retain the above copyright</span>
<a name="l00012"></a>00012 <span class="comment">* notice, this list of conditions and the following disclaimer.</span>
<a name="l00013"></a>00013 <span class="comment">* * Redistributions in binary form must reproduce the above</span>
<a name="l00014"></a>00014 <span class="comment">* copyright notice, this list of conditions and the following</span>
<a name="l00015"></a>00015 <span class="comment">* disclaimer in the documentation and/or other materials provided</span>
<a name="l00016"></a>00016 <span class="comment">* with the distribution.</span>
<a name="l00017"></a>00017 <span class="comment">* * Neither the name of the Willow Garage nor the names of its</span>
<a name="l00018"></a>00018 <span class="comment">* contributors may be used to endorse or promote products derived</span>
<a name="l00019"></a>00019 <span class="comment">* from this software without specific prior written permission.</span>
<a name="l00020"></a>00020 <span class="comment">*</span>
<a name="l00021"></a>00021 <span class="comment">* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS</span>
<a name="l00022"></a>00022 <span class="comment">* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT</span>
<a name="l00023"></a>00023 <span class="comment">* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS</span>
<a name="l00024"></a>00024 <span class="comment">* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE</span>
<a name="l00025"></a>00025 <span class="comment">* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,</span>
<a name="l00026"></a>00026 <span class="comment">* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,</span>
<a name="l00027"></a>00027 <span class="comment">* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;</span>
<a name="l00028"></a>00028 <span class="comment">* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER</span>
<a name="l00029"></a>00029 <span class="comment">* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT</span>
<a name="l00030"></a>00030 <span class="comment">* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN</span>
<a name="l00031"></a>00031 <span class="comment">* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE</span>
<a name="l00032"></a>00032 <span class="comment">* POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00033"></a>00033 <span class="comment">*********************************************************************/</span>
<a name="l00034"></a>00034
<a name="l00035"></a>00035 <span class="comment">/* Author: Ioan Sucan */</span>
<a name="l00036"></a>00036
<a name="l00037"></a>00037 <span class="preprocessor">#ifndef OMPL_DATASTRUCTURES_BINARY_HEAP_</span>
<a name="l00038"></a>00038 <span class="preprocessor"></span><span class="preprocessor">#define OMPL_DATASTRUCTURES_BINARY_HEAP_</span>
<a name="l00039"></a>00039 <span class="preprocessor"></span>
<a name="l00040"></a>00040 <span class="preprocessor">#include <functional></span>
<a name="l00041"></a>00041 <span class="preprocessor">#include <vector></span>
<a name="l00042"></a>00042 <span class="preprocessor">#include <cassert></span>
<a name="l00043"></a>00043
<a name="l00044"></a>00044 <span class="keyword">namespace </span>ompl
<a name="l00045"></a>00045 {
<a name="l00046"></a>00046
<a name="l00051"></a>00051 <span class="keyword">template</span> <<span class="keyword">typename</span> _T,
<a name="l00052"></a>00052 <span class="keyword">class </span>LessThan = std::less<_T> >
<a name="l00053"></a><a class="code" href="classompl_1_1BinaryHeap.html">00053</a> <span class="keyword">class </span><a class="code" href="classompl_1_1BinaryHeap.html" title="This class provides an implementation of an updatable min-heap. Using it is a bit cumbersome...">BinaryHeap</a>
<a name="l00054"></a>00054 {
<a name="l00055"></a>00055 <span class="keyword">public</span>:
<a name="l00056"></a>00056
<a name="l00061"></a><a class="code" href="classompl_1_1BinaryHeap_1_1Element.html">00061</a> <span class="keyword">class </span><a class="code" href="classompl_1_1BinaryHeap_1_1Element.html" title="When an element is added to the heap, an instance of Element* is created. This instance contains the ...">Element</a>
<a name="l00062"></a>00062 {
<a name="l00063"></a>00063 <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classompl_1_1BinaryHeap.html" title="This class provides an implementation of an updatable min-heap. Using it is a bit cumbersome...">BinaryHeap</a>;
<a name="l00064"></a>00064 <span class="keyword">private</span>:
<a name="l00065"></a>00065 <a class="code" href="classompl_1_1BinaryHeap_1_1Element.html" title="When an element is added to the heap, an instance of Element* is created. This instance contains the ...">Element</a>(<span class="keywordtype">void</span>) { }
<a name="l00066"></a>00066 ~<a class="code" href="classompl_1_1BinaryHeap_1_1Element.html" title="When an element is added to the heap, an instance of Element* is created. This instance contains the ...">Element</a>(<span class="keywordtype">void</span>) { }
<a name="l00068"></a>00068 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> position;
<a name="l00069"></a>00069 <span class="keyword">public</span>:
<a name="l00071"></a><a class="code" href="classompl_1_1BinaryHeap_1_1Element.html#a824930edad6908382484b0aacf62abb4">00071</a> _T <a class="code" href="classompl_1_1BinaryHeap_1_1Element.html#a824930edad6908382484b0aacf62abb4" title="The data of this element.">data</a>;
<a name="l00072"></a>00072 };
<a name="l00073"></a>00073
<a name="l00075"></a><a class="code" href="classompl_1_1BinaryHeap.html#afd217208dc62566489216f0c5a172259">00075</a> <span class="keyword">typedef</span> void (*<a class="code" href="classompl_1_1BinaryHeap.html#afd217208dc62566489216f0c5a172259" title="Event that gets called after an insertion.">EventAfterInsert</a>) (Element*, <span class="keywordtype">void</span>*);
<a name="l00076"></a>00076
<a name="l00078"></a><a class="code" href="classompl_1_1BinaryHeap.html#a35877aaf27acdf33af11defd5ddc3d61">00078</a> <span class="keyword">typedef</span> void (*<a class="code" href="classompl_1_1BinaryHeap.html#a35877aaf27acdf33af11defd5ddc3d61" title="Event that gets called just before a removal.">EventBeforeRemove</a>)(Element*, <span class="keywordtype">void</span>*);
<a name="l00079"></a>00079
<a name="l00080"></a>00080 <a class="code" href="classompl_1_1BinaryHeap.html" title="This class provides an implementation of an updatable min-heap. Using it is a bit cumbersome...">BinaryHeap</a>(<span class="keywordtype">void</span>)
<a name="l00081"></a>00081 {
<a name="l00082"></a>00082 eventAfterInsert_ = NULL;
<a name="l00083"></a>00083 eventBeforeRemove_ = NULL;
<a name="l00084"></a>00084 }
<a name="l00085"></a>00085
<a name="l00086"></a>00086 ~<a class="code" href="classompl_1_1BinaryHeap.html" title="This class provides an implementation of an updatable min-heap. Using it is a bit cumbersome...">BinaryHeap</a>(<span class="keywordtype">void</span>)
<a name="l00087"></a>00087 {
<a name="l00088"></a>00088 <a class="code" href="classompl_1_1BinaryHeap.html#a318edd8b65126de610e0f11138f8c147" title="Clear the heap.">clear</a>();
<a name="l00089"></a>00089 }
<a name="l00090"></a>00090
<a name="l00092"></a><a class="code" href="classompl_1_1BinaryHeap.html#adb5a517c064a3844a47cc873fddea796">00092</a> <span class="keywordtype">void</span> <a class="code" href="classompl_1_1BinaryHeap.html#adb5a517c064a3844a47cc873fddea796" title="Set the event that gets called after insertion.">onAfterInsert</a>(<a class="code" href="classompl_1_1BinaryHeap.html#afd217208dc62566489216f0c5a172259" title="Event that gets called after an insertion.">EventAfterInsert</a> event, <span class="keywordtype">void</span> *arg)
<a name="l00093"></a>00093 {
<a name="l00094"></a>00094 eventAfterInsert_ = event;
<a name="l00095"></a>00095 eventAfterInsertData_ = arg;
<a name="l00096"></a>00096 }
<a name="l00097"></a>00097
<a name="l00099"></a><a class="code" href="classompl_1_1BinaryHeap.html#a5a6368ea8193cdbf545f8a57dbaf02f5">00099</a> <span class="keywordtype">void</span> <a class="code" href="classompl_1_1BinaryHeap.html#a5a6368ea8193cdbf545f8a57dbaf02f5" title="Set the event that gets called before a removal.">onBeforeRemove</a>(<a class="code" href="classompl_1_1BinaryHeap.html#a35877aaf27acdf33af11defd5ddc3d61" title="Event that gets called just before a removal.">EventBeforeRemove</a> event, <span class="keywordtype">void</span> *arg)
<a name="l00100"></a>00100 {
<a name="l00101"></a>00101 eventBeforeRemove_ = event;
<a name="l00102"></a>00102 eventBeforeRemoveData_ = arg;
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104
<a name="l00106"></a><a class="code" href="classompl_1_1BinaryHeap.html#a318edd8b65126de610e0f11138f8c147">00106</a> <span class="keywordtype">void</span> <a class="code" href="classompl_1_1BinaryHeap.html#a318edd8b65126de610e0f11138f8c147" title="Clear the heap.">clear</a>(<span class="keywordtype">void</span>)
<a name="l00107"></a>00107 {
<a name="l00108"></a>00108 <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::vector<Element*>::iterator i = vector_.begin() ;
<a name="l00109"></a>00109 i != vector_.end() ; ++i)
<a name="l00110"></a>00110 <span class="keyword">delete</span> *i;
<a name="l00111"></a>00111 vector_.clear();
<a name="l00112"></a>00112 }
<a name="l00113"></a>00113
<a name="l00115"></a><a class="code" href="classompl_1_1BinaryHeap.html#a4288f352550d26811383a45b2a9fb6e7">00115</a> Element* <a class="code" href="classompl_1_1BinaryHeap.html#a4288f352550d26811383a45b2a9fb6e7" title="Return the top element. NULL for an empty heap.">top</a>(<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00116"></a>00116 <span class="keyword"> </span>{
<a name="l00117"></a>00117 <span class="keywordflow">return</span> vector_.empty() ? NULL : vector_.at(0);
<a name="l00118"></a>00118 }
<a name="l00119"></a>00119
<a name="l00121"></a><a class="code" href="classompl_1_1BinaryHeap.html#a75ced2f3f0f1434045afe4d73ee60482">00121</a> <span class="keywordtype">void</span> <a class="code" href="classompl_1_1BinaryHeap.html#a75ced2f3f0f1434045afe4d73ee60482" title="Remove the top element.">pop</a>(<span class="keywordtype">void</span>)
<a name="l00122"></a>00122 {
<a name="l00123"></a>00123 removePos(0);
<a name="l00124"></a>00124 }
<a name="l00125"></a>00125
<a name="l00127"></a><a class="code" href="classompl_1_1BinaryHeap.html#a56848811174698cd9a907e1128e6ce02">00127</a> <span class="keywordtype">void</span> <span class="keyword">remove</span>(Element* element)
<a name="l00128"></a>00128 {
<a name="l00129"></a>00129 <span class="keywordflow">if</span> (eventBeforeRemove_)
<a name="l00130"></a>00130 eventBeforeRemove_(element, eventBeforeRemoveData_);
<a name="l00131"></a>00131 removePos(element->position);
<a name="l00132"></a>00132 }
<a name="l00133"></a>00133
<a name="l00135"></a><a class="code" href="classompl_1_1BinaryHeap.html#a7712c8909b596a4d12e0080960bd0274">00135</a> Element* <a class="code" href="classompl_1_1BinaryHeap.html#a7712c8909b596a4d12e0080960bd0274" title="Add a new element.">insert</a>(<span class="keyword">const</span> _T& data)
<a name="l00136"></a>00136 {
<a name="l00137"></a>00137 Element* element = <span class="keyword">new</span> Element();
<a name="l00138"></a>00138 element->data = data;
<a name="l00139"></a>00139 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos = vector_.size();
<a name="l00140"></a>00140 element->position = pos;
<a name="l00141"></a>00141 vector_.push_back(element);
<a name="l00142"></a>00142 percolateUp(pos);
<a name="l00143"></a>00143 <span class="keywordflow">if</span> (eventAfterInsert_)
<a name="l00144"></a>00144 eventAfterInsert_(element, eventAfterInsertData_);
<a name="l00145"></a>00145 <span class="keywordflow">return</span> element;
<a name="l00146"></a>00146 }
<a name="l00147"></a>00147
<a name="l00149"></a><a class="code" href="classompl_1_1BinaryHeap.html#a275aa4aab2088b38df1fa2fd2827fffe">00149</a> <span class="keywordtype">void</span> <a class="code" href="classompl_1_1BinaryHeap.html#a7712c8909b596a4d12e0080960bd0274" title="Add a new element.">insert</a>(<span class="keyword">const</span> std::vector<_T>& list)
<a name="l00150"></a>00150 {
<a name="l00151"></a>00151 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n = vector_.size();
<a name="l00152"></a>00152 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m = list.size();
<a name="l00153"></a>00153 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0 ; i < m ; ++i)
<a name="l00154"></a>00154 {
<a name="l00155"></a>00155 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos = i + n;
<a name="l00156"></a>00156 Element* element = newElement(list[i], pos);
<a name="l00157"></a>00157 vector_.push_back(element);
<a name="l00158"></a>00158 percolateUp(pos);
<a name="l00159"></a>00159 <span class="keywordflow">if</span> (eventAfterInsert_)
<a name="l00160"></a>00160 eventAfterInsert_(element, eventAfterInsertData_);
<a name="l00161"></a>00161 }
<a name="l00162"></a>00162 }
<a name="l00163"></a>00163
<a name="l00165"></a><a class="code" href="classompl_1_1BinaryHeap.html#ac8d1b64b5b7d50cd09380bfa14bbc45d">00165</a> <span class="keywordtype">void</span> <a class="code" href="classompl_1_1BinaryHeap.html#ac8d1b64b5b7d50cd09380bfa14bbc45d" title="Clear the heap, add the set of elements list to it and rebuild it.">buildFrom</a>(<span class="keyword">const</span> std::vector<_T>& list)
<a name="l00166"></a>00166 {
<a name="l00167"></a>00167 <a class="code" href="classompl_1_1BinaryHeap.html#a318edd8b65126de610e0f11138f8c147" title="Clear the heap.">clear</a>();
<a name="l00168"></a>00168 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m = list.size();
<a name="l00169"></a>00169 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0 ; i < m ; ++i)
<a name="l00170"></a>00170 vector_.push_back(newElement(list[i], i));
<a name="l00171"></a>00171 build();
<a name="l00172"></a>00172 }
<a name="l00173"></a>00173
<a name="l00175"></a><a class="code" href="classompl_1_1BinaryHeap.html#aa1e483f2aea8cacf7f0ae4587d212eb2">00175</a> <span class="keywordtype">void</span> <a class="code" href="classompl_1_1BinaryHeap.html#aa1e483f2aea8cacf7f0ae4587d212eb2" title="Rebuild the heap.">rebuild</a>(<span class="keywordtype">void</span>)
<a name="l00176"></a>00176 {
<a name="l00177"></a>00177 build();
<a name="l00178"></a>00178 }
<a name="l00179"></a>00179
<a name="l00181"></a><a class="code" href="classompl_1_1BinaryHeap.html#a8114dc53c4239fe0e199106386898ce3">00181</a> <span class="keywordtype">void</span> <a class="code" href="classompl_1_1BinaryHeap.html#a8114dc53c4239fe0e199106386898ce3" title="Update an element in the heap.">update</a>(Element* element)
<a name="l00182"></a>00182 {
<a name="l00183"></a>00183 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos = element->position;
<a name="l00184"></a>00184 assert(vector_[pos] == element);
<a name="l00185"></a>00185 percolateUp(pos);
<a name="l00186"></a>00186 percolateDown(pos);
<a name="l00187"></a>00187 }
<a name="l00188"></a>00188
<a name="l00190"></a><a class="code" href="classompl_1_1BinaryHeap.html#a486a10e941494a63e5dea950e90f39bf">00190</a> <span class="keywordtype">bool</span> <a class="code" href="classompl_1_1BinaryHeap.html#a486a10e941494a63e5dea950e90f39bf" title="Check if the heap is empty.">empty</a>(<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00191"></a>00191 <span class="keyword"> </span>{
<a name="l00192"></a>00192 <span class="keywordflow">return</span> vector_.empty();
<a name="l00193"></a>00193 }
<a name="l00194"></a>00194
<a name="l00196"></a><a class="code" href="classompl_1_1BinaryHeap.html#af04187686dd607db2bca3e8bf45b8d12">00196</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classompl_1_1BinaryHeap.html#af04187686dd607db2bca3e8bf45b8d12" title="Get the number of elements in the heap.">size</a>(<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00197"></a>00197 <span class="keyword"> </span>{
<a name="l00198"></a>00198 <span class="keywordflow">return</span> vector_.size();
<a name="l00199"></a>00199 }
<a name="l00200"></a>00200
<a name="l00202"></a><a class="code" href="classompl_1_1BinaryHeap.html#a47cbd6ea3b6aa270825ed29a850ffc30">00202</a> <span class="keywordtype">void</span> <a class="code" href="classompl_1_1BinaryHeap.html#a47cbd6ea3b6aa270825ed29a850ffc30" title="Get the data stored in this heap.">getContent</a>(std::vector<_T> &content)<span class="keyword"> const</span>
<a name="l00203"></a>00203 <span class="keyword"> </span>{
<a name="l00204"></a>00204 <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::vector<Element*>::const_iterator i = vector_.begin();
<a name="l00205"></a>00205 i != vector_.end() ; ++i)
<a name="l00206"></a>00206 content.push_back((*i)->data);
<a name="l00207"></a>00207 }
<a name="l00208"></a>00208
<a name="l00210"></a><a class="code" href="classompl_1_1BinaryHeap.html#ad782d92c652443841ebc310d778a22f0">00210</a> <span class="keywordtype">void</span> <a class="code" href="classompl_1_1BinaryHeap.html#ad782d92c652443841ebc310d778a22f0" title="Sort an array of elements. This does not affect the content of the heap.">sort</a>(std::vector<_T>& list)
<a name="l00211"></a>00211 {
<a name="l00212"></a>00212 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n = list.size();
<a name="l00213"></a>00213 std::vector<Element*> backup = vector_;
<a name="l00214"></a>00214 vector_.clear();
<a name="l00215"></a>00215 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0 ; i < n ; ++i)
<a name="l00216"></a>00216 vector_.push_back(newElement(list[i], i));
<a name="l00217"></a>00217 build();
<a name="l00218"></a>00218 list.clear();
<a name="l00219"></a>00219 list.reserve(n);
<a name="l00220"></a>00220
<a name="l00221"></a>00221 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0 ; i < n ; ++i)
<a name="l00222"></a>00222 {
<a name="l00223"></a>00223 list.push_back(vector_[0]->data);
<a name="l00224"></a>00224 removePos(0);
<a name="l00225"></a>00225 }
<a name="l00226"></a>00226 vector_ = backup;
<a name="l00227"></a>00227 }
<a name="l00228"></a>00228
<a name="l00229"></a>00229 <span class="keyword">private</span>:
<a name="l00230"></a>00230
<a name="l00231"></a>00231 LessThan lt_;
<a name="l00232"></a>00232
<a name="l00233"></a>00233 std::vector<Element*> vector_;
<a name="l00234"></a>00234
<a name="l00235"></a>00235 <a class="code" href="classompl_1_1BinaryHeap.html#afd217208dc62566489216f0c5a172259" title="Event that gets called after an insertion.">EventAfterInsert</a> eventAfterInsert_;
<a name="l00236"></a>00236 <span class="keywordtype">void</span> *eventAfterInsertData_;
<a name="l00237"></a>00237 <a class="code" href="classompl_1_1BinaryHeap.html#a35877aaf27acdf33af11defd5ddc3d61" title="Event that gets called just before a removal.">EventBeforeRemove</a> eventBeforeRemove_;
<a name="l00238"></a>00238 <span class="keywordtype">void</span> *eventBeforeRemoveData_;
<a name="l00239"></a>00239
<a name="l00240"></a>00240 <span class="keywordtype">void</span> removePos(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos)
<a name="l00241"></a>00241 {
<a name="l00242"></a>00242 <span class="keyword">const</span> <span class="keywordtype">int</span> n = vector_.size() - 1;
<a name="l00243"></a>00243 <span class="keyword">delete</span> vector_[pos];
<a name="l00244"></a>00244 <span class="keywordflow">if</span> ((<span class="keywordtype">int</span>)pos < n)
<a name="l00245"></a>00245 {
<a name="l00246"></a>00246 vector_[pos] = vector_.back();
<a name="l00247"></a>00247 vector_[pos]->position = pos;
<a name="l00248"></a>00248 vector_.pop_back();
<a name="l00249"></a>00249 percolateDown(pos);
<a name="l00250"></a>00250 }
<a name="l00251"></a>00251 <span class="keywordflow">else</span>
<a name="l00252"></a>00252 vector_.pop_back();
<a name="l00253"></a>00253 }
<a name="l00254"></a>00254
<a name="l00255"></a>00255 Element* newElement(_T& data, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos)<span class="keyword"> const</span>
<a name="l00256"></a>00256 <span class="keyword"> </span>{
<a name="l00257"></a>00257 Element* element = <span class="keyword">new</span> Element();
<a name="l00258"></a>00258 element->data = data;
<a name="l00259"></a>00259 element->position = pos;
<a name="l00260"></a>00260 <span class="keywordflow">return</span> element;
<a name="l00261"></a>00261 }
<a name="l00262"></a>00262
<a name="l00263"></a>00263 <span class="keywordtype">void</span> build(<span class="keywordtype">void</span>)
<a name="l00264"></a>00264 {
<a name="l00265"></a>00265 <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = vector_.size() / 2 - 1; i >= 0; --i)
<a name="l00266"></a>00266 percolateDown(i);
<a name="l00267"></a>00267 }
<a name="l00268"></a>00268
<a name="l00269"></a>00269 <span class="keywordtype">void</span> percolateDown(<span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos)
<a name="l00270"></a>00270 {
<a name="l00271"></a>00271 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n = vector_.size();
<a name="l00272"></a>00272 Element* tmp = vector_[pos];
<a name="l00273"></a>00273 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> parent = pos;
<a name="l00274"></a>00274 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> child = (pos + 1) << 1;
<a name="l00275"></a>00275
<a name="l00276"></a>00276 <span class="keywordflow">while</span> (child < n)
<a name="l00277"></a>00277 {
<a name="l00278"></a>00278 <span class="keywordflow">if</span> (lt_(vector_[child - 1]->data, vector_[child]->data)) --child;
<a name="l00279"></a>00279 <span class="keywordflow">if</span> (lt_(vector_[child]->data, tmp->data))
<a name="l00280"></a>00280 {
<a name="l00281"></a>00281 vector_[parent] = vector_[child];
<a name="l00282"></a>00282 vector_[parent]->position = parent;
<a name="l00283"></a>00283 }
<a name="l00284"></a>00284 <span class="keywordflow">else</span>
<a name="l00285"></a>00285 <span class="keywordflow">break</span>;
<a name="l00286"></a>00286 parent = child;
<a name="l00287"></a>00287 child = (child + 1) << 1;
<a name="l00288"></a>00288 }
<a name="l00289"></a>00289 <span class="keywordflow">if</span> (child == n)
<a name="l00290"></a>00290 {
<a name="l00291"></a>00291 --child;
<a name="l00292"></a>00292 <span class="keywordflow">if</span> (lt_(vector_[child]->data, tmp->data))
<a name="l00293"></a>00293 {
<a name="l00294"></a>00294 vector_[parent] = vector_[child];
<a name="l00295"></a>00295 vector_[parent]->position = parent;
<a name="l00296"></a>00296 parent = child;
<a name="l00297"></a>00297 }
<a name="l00298"></a>00298 }
<a name="l00299"></a>00299 <span class="keywordflow">if</span> (parent != pos)
<a name="l00300"></a>00300 {
<a name="l00301"></a>00301 vector_[parent] = tmp;
<a name="l00302"></a>00302 vector_[parent]->position = parent;
<a name="l00303"></a>00303 }
<a name="l00304"></a>00304 }
<a name="l00305"></a>00305
<a name="l00306"></a>00306 <span class="keywordtype">void</span> percolateUp(<span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos)
<a name="l00307"></a>00307 {
<a name="l00308"></a>00308 Element* tmp = vector_[pos];
<a name="l00309"></a>00309 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> child = pos;
<a name="l00310"></a>00310 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> parent = (pos - 1) >> 1;
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <span class="keywordflow">while</span> (child > 0 && lt_(tmp->data, vector_[parent]->data))
<a name="l00313"></a>00313 {
<a name="l00314"></a>00314 vector_[child] = vector_[parent];
<a name="l00315"></a>00315 vector_[child]->position = child;
<a name="l00316"></a>00316 child = parent;
<a name="l00317"></a>00317 parent = (parent - 1) >> 1;
<a name="l00318"></a>00318 }
<a name="l00319"></a>00319 <span class="keywordflow">if</span> (child != pos)
<a name="l00320"></a>00320 {
<a name="l00321"></a>00321 vector_[child] = tmp;
<a name="l00322"></a>00322 vector_[child]->position = child;
<a name="l00323"></a>00323 }
<a name="l00324"></a>00324 }
<a name="l00325"></a>00325 };
<a name="l00326"></a>00326
<a name="l00327"></a>00327 }
<a name="l00328"></a>00328
<a name="l00329"></a>00329 <span class="preprocessor">#endif</span>
</pre></div></div>
</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>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><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>
</div>
<div class="footer span-22 push-2 last">
<a href="http://www.kavrakilab.org">Physical and Biological Computing Group</a> •
<a href="http://www.cs.rice.edu">Department of Computer Science</a> •
<a href="http://www.rice.edu">Rice University</a><br>
<div class="gray">Generated on Sun Oct 9 2011 23:04:40 by <a href="http://www.doxygen.org/index.html">doxygen</a> 1.7.4</div>
</div>
</div>
</body>
</html>
distrib
>
Fedora
>
14
>
x86_64
>
media
>
updates
>
by-pkgid
>
e7618febbb9cbed15bb79e326774c050
>
files
>
136
