<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>edelib: edelib/List.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">edelib
 <span id="projectnumber">2.0.0</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- Generated by Doxygen 1.7.6.1 -->
<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="modules.html"><span>Modules</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>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
</ul>
</div>
</div>
<div class="header">
<div class="headertitle">
<div class="title">edelib/List.h</div> </div>
</div><!--header-->
<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"> * $Id: List.h 3250 2012-04-15 15:26:53Z karijes $</span>
<a name="l00003"></a>00003 <span class="comment"> *</span>
<a name="l00004"></a>00004 <span class="comment"> * STL-like list class</span>
<a name="l00005"></a>00005 <span class="comment"> * Copyright (c) 2005-2007 edelib authors</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * This library is free software; you can redistribute it and/or</span>
<a name="l00008"></a>00008 <span class="comment"> * modify it under the terms of the GNU Lesser General Public</span>
<a name="l00009"></a>00009 <span class="comment"> * License as published by the Free Software Foundation; either</span>
<a name="l00010"></a>00010 <span class="comment"> * version 2 of the License, or (at your option) any later version.</span>
<a name="l00011"></a>00011 <span class="comment"> *</span>
<a name="l00012"></a>00012 <span class="comment"> * This library is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00015"></a>00015 <span class="comment"> * Lesser General Public License for more details.</span>
<a name="l00016"></a>00016 <span class="comment"> *</span>
<a name="l00017"></a>00017 <span class="comment"> * You should have received a copy of the GNU Lesser General Public License</span>
<a name="l00018"></a>00018 <span class="comment"> * along with this library. If not, see <http://www.gnu.org/licenses/>.</span>
<a name="l00019"></a>00019 <span class="comment"> */</span>
<a name="l00020"></a>00020
<a name="l00021"></a>00021 <span class="preprocessor">#ifndef __EDELIB_LIST_H__</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define __EDELIB_LIST_H__</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include "Debug.h"</span>
<a name="l00025"></a>00025
<a name="l00026"></a>00026 EDELIB_NS_BEGIN
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="preprocessor">#ifndef SKIP_DOCS</span>
<a name="l00029"></a>00029 <span class="preprocessor"></span>
<a name="l00030"></a>00030 <span class="keyword">struct </span>ListNode {
<a name="l00031"></a>00031 <span class="keywordtype">void</span>* value;
<a name="l00032"></a>00032 ListNode* next;
<a name="l00033"></a>00033 ListNode* prev;
<a name="l00034"></a>00034 ListNode() : value(0), next(0), prev(0) { }
<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>
<a name="l00038"></a>00038 <span class="keyword">struct </span>ListIterator {
<a name="l00039"></a>00039 <span class="keyword">typedef</span> ListNode NodeType;
<a name="l00040"></a>00040 NodeType* node;
<a name="l00041"></a>00041
<a name="l00042"></a>00042 ListIterator(NodeType* n) : node(n) { }
<a name="l00043"></a>00043 ListIterator() : node(0) { }
<a name="l00044"></a>00044
<a name="l00045"></a>00045 T& operator*(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{
<a name="l00046"></a>00046 <a class="code" href="group__macros.html#ga06190892c613d62224455b01c5459c15">E_ASSERT</a>(node != 0 && <span class="stringliteral">"Bad code! Access to zero node!!!"</span>);
<a name="l00047"></a>00047 <a class="code" href="group__macros.html#ga06190892c613d62224455b01c5459c15">E_ASSERT</a>(node->value != 0 && <span class="stringliteral">"Bad code! Dereferencing NULL value!!!"</span>);
<a name="l00048"></a>00048 <span class="keywordflow">return</span> *(T*)node->value;
<a name="l00049"></a>00049 }
<a name="l00050"></a>00050
<a name="l00051"></a>00051 T* operator->(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{
<a name="l00052"></a>00052 <a class="code" href="group__macros.html#ga06190892c613d62224455b01c5459c15">E_ASSERT</a>(node != 0 && <span class="stringliteral">"Bad code! Access to zero node!!!"</span>);
<a name="l00053"></a>00053 <a class="code" href="group__macros.html#ga06190892c613d62224455b01c5459c15">E_ASSERT</a>(node->value != 0 && <span class="stringliteral">"Bad code! Dereferencing NULL value!!!"</span>);
<a name="l00054"></a>00054 <span class="keywordflow">return</span> (T*)node->value;
<a name="l00055"></a>00055 }
<a name="l00056"></a>00056
<a name="l00057"></a>00057 <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> ListIterator& other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> node != other.node; }
<a name="l00058"></a>00058 <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> ListIterator& other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> node == other.node; }
<a name="l00059"></a>00059 ListIterator& operator++(<span class="keywordtype">void</span>) { node = node->next; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00060"></a>00060 ListIterator& operator--(<span class="keywordtype">void</span>) { node = node->prev; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00061"></a>00061 };
<a name="l00062"></a>00062
<a name="l00063"></a>00063 <span class="preprocessor">#ifndef USE_SMALL_LIST</span>
<a name="l00064"></a>00064 <span class="preprocessor"></span><span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00065"></a>00065 <span class="keyword">struct </span>ListConstIterator {
<a name="l00066"></a>00066 <span class="keyword">typedef</span> ListNode NodeType;
<a name="l00067"></a>00067 NodeType* node;
<a name="l00068"></a>00068
<a name="l00069"></a>00069 ListConstIterator(NodeType* n) : node(n) { }
<a name="l00070"></a>00070 ListConstIterator() : node(0) { }
<a name="l00071"></a>00071
<a name="l00072"></a>00072 <span class="comment">// stupid language constructs !!!</span>
<a name="l00073"></a>00073 ListConstIterator(<span class="keyword">const</span> ListIterator<T>& i) : node(i.node) { }
<a name="l00074"></a>00074
<a name="l00075"></a>00075 <span class="keyword">const</span> T& operator*(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{
<a name="l00076"></a>00076 <a class="code" href="group__macros.html#ga06190892c613d62224455b01c5459c15">E_ASSERT</a>(node != 0 && <span class="stringliteral">"Bad code! Access to zero node!!!"</span>);
<a name="l00077"></a>00077 <a class="code" href="group__macros.html#ga06190892c613d62224455b01c5459c15">E_ASSERT</a>(node->value != 0 && <span class="stringliteral">"Bad code! Dereferencing NULL value!!!"</span>);
<a name="l00078"></a>00078 <span class="keywordflow">return</span> *(T*)node->value;
<a name="l00079"></a>00079 }
<a name="l00080"></a>00080
<a name="l00081"></a>00081 <span class="keyword">const</span> T* operator->(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{
<a name="l00082"></a>00082 <a class="code" href="group__macros.html#ga06190892c613d62224455b01c5459c15">E_ASSERT</a>(node != 0 && <span class="stringliteral">"Bad code! Access to zero node!!!"</span>);
<a name="l00083"></a>00083 <a class="code" href="group__macros.html#ga06190892c613d62224455b01c5459c15">E_ASSERT</a>(node->value != 0 && <span class="stringliteral">"Bad code! Dereferencing NULL value!!!"</span>);
<a name="l00084"></a>00084 <span class="keywordflow">return</span> (T*)node->value;
<a name="l00085"></a>00085 }
<a name="l00086"></a>00086
<a name="l00087"></a>00087 <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> ListConstIterator& other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> node != other.node; }
<a name="l00088"></a>00088 <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> ListConstIterator& other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> node == other.node; }
<a name="l00089"></a>00089 ListConstIterator& operator++(<span class="keywordtype">void</span>) { node = node->next; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00090"></a>00090 ListConstIterator& operator--(<span class="keywordtype">void</span>) { node = node->prev; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00091"></a>00091 };
<a name="l00092"></a>00092 <span class="preprocessor">#endif</span>
<a name="l00093"></a>00093 <span class="preprocessor"></span>
<a name="l00094"></a>00094 <span class="preprocessor">#endif</span>
<a name="l00095"></a>00095 <span class="preprocessor"></span>
<a name="l00159"></a>00159 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00160"></a><a class="code" href="classedelib_1_1list.html">00160</a> <span class="keyword">class </span><a class="code" href="classedelib_1_1list.html" title="Linked list class.">list</a> {
<a name="l00161"></a>00161 <span class="keyword">public</span>:
<a name="l00162"></a>00162 <span class="preprocessor">#ifndef SKIP_DOCS</span>
<a name="l00163"></a>00163 <span class="preprocessor"></span> <span class="keyword">typedef</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> size_type;
<a name="l00164"></a>00164 <span class="preprocessor">#endif</span>
<a name="l00165"></a>00165 <span class="preprocessor"></span><span class="keyword">private</span>:
<a name="l00166"></a>00166 <span class="keyword">typedef</span> ListNode Node;
<a name="l00167"></a>00167 <span class="keyword">typedef</span> bool (SortCmp)(<span class="keyword">const</span> T& val1, <span class="keyword">const</span> T& val2);
<a name="l00168"></a>00168
<a name="l00169"></a>00169 size_type sz;
<a name="l00170"></a>00170 Node* tail;
<a name="l00171"></a>00171
<a name="l00172"></a>00172 <a class="code" href="group__macros.html#gaef9b2427c1dfe072bc563a6051cc385c">E_DISABLE_CLASS_COPY</a>(<a class="code" href="classedelib_1_1list.html" title="Linked list class.">list</a>)
<a name="l00173"></a>00173
<a name="l00174"></a>00174 <span class="keyword">static</span> <span class="keywordtype">bool</span> default_sort_cmp(<span class="keyword">const</span> T& val1, <span class="keyword">const</span> T& val2) { <span class="keywordflow">return</span> val1 < val2; }
<a name="l00175"></a>00175
<a name="l00176"></a>00176 Node* merge_nodes(Node* a, Node* b, SortCmp* cmp) {
<a name="l00177"></a>00177 Node head;
<a name="l00178"></a>00178 Node* c = &head;
<a name="l00179"></a>00179 Node* cprev = 0;
<a name="l00180"></a>00180
<a name="l00181"></a>00181 <span class="keywordflow">while</span>(a != 0 && b != 0) {
<a name="l00182"></a>00182 <span class="comment">// compare values</span>
<a name="l00183"></a>00183 <span class="keywordflow">if</span>(cmp(*(T*)a->value, *(T*)b->value)) {
<a name="l00184"></a>00184 c->next = a;
<a name="l00185"></a>00185 a = a->next;
<a name="l00186"></a>00186 } <span class="keywordflow">else</span> {
<a name="l00187"></a>00187 c->next = b;
<a name="l00188"></a>00188 b = b->next;
<a name="l00189"></a>00189 }
<a name="l00190"></a>00190
<a name="l00191"></a>00191 c = c->next;
<a name="l00192"></a>00192 c->prev = cprev;
<a name="l00193"></a>00193 cprev = c;
<a name="l00194"></a>00194 }
<a name="l00195"></a>00195
<a name="l00196"></a>00196 <span class="keywordflow">if</span>(a == 0)
<a name="l00197"></a>00197 c->next = b;
<a name="l00198"></a>00198 <span class="keywordflow">else</span>
<a name="l00199"></a>00199 c->next = a;
<a name="l00200"></a>00200
<a name="l00201"></a>00201 c->next->prev = c;
<a name="l00202"></a>00202 <span class="keywordflow">return</span> head.next;
<a name="l00203"></a>00203 }
<a name="l00204"></a>00204
<a name="l00205"></a>00205 Node* mergesort(Node* c, SortCmp* cmp) {
<a name="l00206"></a>00206 Node* a, *b;
<a name="l00207"></a>00207 <span class="keywordflow">if</span>(c->next == 0)
<a name="l00208"></a>00208 <span class="keywordflow">return</span> c;
<a name="l00209"></a>00209 a = c;
<a name="l00210"></a>00210 b = c->next;
<a name="l00211"></a>00211
<a name="l00212"></a>00212 <span class="keywordflow">while</span>((b != 0) && (b->next != 0)) {
<a name="l00213"></a>00213 c = c->next;
<a name="l00214"></a>00214 b = b->next->next;
<a name="l00215"></a>00215 }
<a name="l00216"></a>00216
<a name="l00217"></a>00217 b = c->next;
<a name="l00218"></a>00218 c->next = 0;
<a name="l00219"></a>00219 <span class="keywordflow">return</span> merge_nodes(mergesort(a, cmp), mergesort(b, cmp), cmp);
<a name="l00220"></a>00220 }
<a name="l00221"></a>00221
<a name="l00222"></a>00222 <span class="keyword">public</span>:
<a name="l00223"></a>00223 <span class="comment">/*</span>
<a name="l00224"></a>00224 <span class="comment"> * This comment is not part of documentation, and in short explains</span>
<a name="l00225"></a>00225 <span class="comment"> * implementation details.</span>
<a name="l00226"></a>00226 <span class="comment"> *</span>
<a name="l00227"></a>00227 <span class="comment"> * List is implemented as circular doubly linked list, which means</span>
<a name="l00228"></a>00228 <span class="comment"> * that last node is pointing back to the first one (and reverse). </span>
<a name="l00229"></a>00229 <span class="comment"> * Due the nature of traversing in circular lists, additional node </span>
<a name="l00230"></a>00230 <span class="comment"> * (dummy node) is created so traversal (first != last) can be done.</span>
<a name="l00231"></a>00231 <span class="comment"> *</span>
<a name="l00232"></a>00232 <span class="comment"> * As you can see, only one node (tail) is used; it always pointing</span>
<a name="l00233"></a>00233 <span class="comment"> * to dummy node (which is always latest node). To get first element node, </span>
<a name="l00234"></a>00234 <span class="comment"> * tail->first is used, and to get last (user visible), tail->prev is used. </span>
<a name="l00235"></a>00235 <span class="comment"> * This implementation is needed so cases like --end() can return valid </span>
<a name="l00236"></a>00236 <span class="comment"> * iterator to last element in the list.</span>
<a name="l00237"></a>00237 <span class="comment"> *</span>
<a name="l00238"></a>00238 <span class="comment"> * I tried to avoid dummy node creation, but implementing circular list</span>
<a name="l00239"></a>00239 <span class="comment"> * will be pain in the ass. Also, contrary popular std::list implementations I could</span>
<a name="l00240"></a>00240 <span class="comment"> * find, this node will be created only when insert()/push_back()/push_front()</span>
<a name="l00241"></a>00241 <span class="comment"> * are called; without those calls, list will not allocate it.</span>
<a name="l00242"></a>00242 <span class="comment"> */</span>
<a name="l00243"></a>00243 <span class="preprocessor">#ifndef SKIP_DOCS</span>
<a name="l00244"></a>00244 <span class="preprocessor"></span> <span class="keyword">typedef</span> ListIterator<T> iterator;
<a name="l00245"></a>00245 <span class="preprocessor">#ifndef USE_SMALL_LIST</span>
<a name="l00246"></a>00246 <span class="preprocessor"></span> <span class="keyword">typedef</span> ListConstIterator<T> const_iterator;
<a name="l00247"></a>00247 <span class="preprocessor">#else</span>
<a name="l00248"></a>00248 <span class="preprocessor"></span> <span class="keyword">typedef</span> ListIterator<T> const_iterator;
<a name="l00249"></a>00249 <span class="preprocessor">#endif</span>
<a name="l00250"></a>00250 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00251"></a>00251 <span class="preprocessor"></span>
<a name="l00255"></a><a class="code" href="classedelib_1_1list.html#a635cee6ce0ca514b13a5e5a9030e5ca8">00255</a> <a class="code" href="classedelib_1_1list.html#a635cee6ce0ca514b13a5e5a9030e5ca8">list</a>() : sz(0), tail(0) { }
<a name="l00256"></a>00256
<a name="l00260"></a><a class="code" href="classedelib_1_1list.html#acd09aafa8fbdf1a0d3a629c7bf8bc8c5">00260</a> <a class="code" href="classedelib_1_1list.html#acd09aafa8fbdf1a0d3a629c7bf8bc8c5">~list</a>() { clear(); }
<a name="l00261"></a>00261
<a name="l00265"></a><a class="code" href="classedelib_1_1list.html#ae683fe63c33c388e9ba1c6392dd477eb">00265</a> <span class="keywordtype">void</span> <a class="code" href="classedelib_1_1list.html#ae683fe63c33c388e9ba1c6392dd477eb">clear</a>(<span class="keywordtype">void</span>) {
<a name="l00266"></a>00266 <span class="keywordflow">if</span>(!tail) {
<a name="l00267"></a>00267 <a class="code" href="group__macros.html#ga06190892c613d62224455b01c5459c15">E_ASSERT</a>(sz == 0 && <span class="stringliteral">"Internal error! size() != 0, but list is empty !?!!"</span>);
<a name="l00268"></a>00268 <span class="keywordflow">return</span>;
<a name="l00269"></a>00269 }
<a name="l00270"></a>00270
<a name="l00271"></a>00271 Node* p = tail->next;
<a name="l00272"></a>00272 Node* t;
<a name="l00273"></a>00273 <span class="keywordflow">while</span>(p != tail) {
<a name="l00274"></a>00274 t = p->next;
<a name="l00275"></a>00275 <span class="keyword">delete</span> (T*)p->value;
<a name="l00276"></a>00276 <span class="keyword">delete</span> p;
<a name="l00277"></a>00277 p = t;
<a name="l00278"></a>00278 }
<a name="l00279"></a>00279
<a name="l00280"></a>00280 <span class="comment">// delete dummy node</span>
<a name="l00281"></a>00281 <span class="keyword">delete</span> tail;
<a name="l00282"></a>00282
<a name="l00283"></a>00283 tail = 0;
<a name="l00284"></a>00284 sz = 0;
<a name="l00285"></a>00285 }
<a name="l00286"></a>00286
<a name="l00295"></a><a class="code" href="classedelib_1_1list.html#af04b2a96886fa6284aee89caf5627d65">00295</a> iterator <a class="code" href="classedelib_1_1list.html#af04b2a96886fa6284aee89caf5627d65">insert</a>(iterator it, <span class="keyword">const</span> T& val) {
<a name="l00296"></a>00296 <span class="comment">// [23.2.2.3] insert() does not affect validity of iterators</span>
<a name="l00297"></a>00297 Node* tmp = <span class="keyword">new</span> Node;
<a name="l00298"></a>00298 tmp->value = <span class="keyword">new</span> T(val);
<a name="l00299"></a>00299
<a name="l00300"></a>00300 <span class="keywordflow">if</span>(!tail) {
<a name="l00301"></a>00301 <span class="comment">// dummy node first</span>
<a name="l00302"></a>00302 tail = <span class="keyword">new</span> Node;
<a name="l00303"></a>00303 tail->next = tail->prev = tmp;
<a name="l00304"></a>00304 tmp->next = tmp->prev = tail;
<a name="l00305"></a>00305 } <span class="keywordflow">else</span> {
<a name="l00306"></a>00306 tmp->next = it.node;
<a name="l00307"></a>00307 tmp->prev = it.node->prev;
<a name="l00308"></a>00308 it.node->prev->next = tmp;
<a name="l00309"></a>00309 it.node->prev = tmp;
<a name="l00310"></a>00310 }
<a name="l00311"></a>00311
<a name="l00312"></a>00312 sz++;
<a name="l00313"></a>00313 <span class="keywordflow">return</span> iterator(tmp);
<a name="l00314"></a>00314 }
<a name="l00315"></a>00315
<a name="l00322"></a><a class="code" href="classedelib_1_1list.html#ad7adac82317fc7926555f5ca40a5fa7b">00322</a> iterator <a class="code" href="classedelib_1_1list.html#ad7adac82317fc7926555f5ca40a5fa7b">erase</a>(iterator it) {
<a name="l00323"></a>00323 <span class="comment">// do not allow erase(l.end())</span>
<a name="l00324"></a>00324 <a class="code" href="group__macros.html#ga06190892c613d62224455b01c5459c15">E_ASSERT</a>(it.node != tail && <span class="stringliteral">"Bad code! erase() on end()!!!"</span>);
<a name="l00325"></a>00325
<a name="l00326"></a>00326 <span class="comment">// [23.2.2.3] erase() invalidates only the iterators</span>
<a name="l00327"></a>00327 it.node->prev->next = it.node->next;
<a name="l00328"></a>00328 it.node->next->prev = it.node->prev;
<a name="l00329"></a>00329
<a name="l00330"></a>00330 iterator ret(it.node);
<a name="l00331"></a>00331 ++ret;
<a name="l00332"></a>00332 sz--;
<a name="l00333"></a>00333
<a name="l00334"></a>00334 <span class="keyword">delete</span> (T*)it.node->value;
<a name="l00335"></a>00335 <span class="keyword">delete</span> it.node;
<a name="l00336"></a>00336
<a name="l00337"></a>00337 <span class="keywordflow">return</span> ret;
<a name="l00338"></a>00338 }
<a name="l00339"></a>00339
<a name="l00344"></a><a class="code" href="classedelib_1_1list.html#aa212f884f1d546a284420c4b752933a7">00344</a> <span class="keywordtype">void</span> <a class="code" href="classedelib_1_1list.html#aa212f884f1d546a284420c4b752933a7">push_back</a>(<span class="keyword">const</span> T& val) { insert(end(), val); }
<a name="l00345"></a>00345
<a name="l00350"></a><a class="code" href="classedelib_1_1list.html#aca93e7bede9587c4397fd7e25ed56c06">00350</a> <span class="keywordtype">void</span> <a class="code" href="classedelib_1_1list.html#aca93e7bede9587c4397fd7e25ed56c06">push_front</a>(<span class="keyword">const</span> T& val) { insert(begin(), val); }
<a name="l00351"></a>00351
<a name="l00355"></a><a class="code" href="classedelib_1_1list.html#a2b63029948b37148ad32c4c6d56193d0">00355</a> iterator <a class="code" href="classedelib_1_1list.html#a2b63029948b37148ad32c4c6d56193d0">begin</a>(<span class="keywordtype">void</span>) { <span class="keywordflow">return</span> iterator(tail ? tail->next : 0); }
<a name="l00356"></a>00356
<a name="l00360"></a><a class="code" href="classedelib_1_1list.html#ab24dc66b35f5f89fbeb32c3f480eebfe">00360</a> const_iterator <a class="code" href="classedelib_1_1list.html#ab24dc66b35f5f89fbeb32c3f480eebfe">begin</a>(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> const_iterator(tail ? tail->next : 0); }
<a name="l00361"></a>00361
<a name="l00367"></a><a class="code" href="classedelib_1_1list.html#aede6a0071c1deeeb9112ffe69bcf9413">00367</a> iterator <a class="code" href="classedelib_1_1list.html#aede6a0071c1deeeb9112ffe69bcf9413">end</a>(<span class="keywordtype">void</span>) { <span class="keywordflow">return</span> iterator(tail); }
<a name="l00368"></a>00368
<a name="l00374"></a><a class="code" href="classedelib_1_1list.html#a1fdea499eccff93779dc205242f788f7">00374</a> const_iterator <a class="code" href="classedelib_1_1list.html#a1fdea499eccff93779dc205242f788f7">end</a>(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> const_iterator(tail); }
<a name="l00375"></a>00375
<a name="l00379"></a><a class="code" href="classedelib_1_1list.html#a098e2963a1b06fea574415348cd64345">00379</a> T& <a class="code" href="classedelib_1_1list.html#a098e2963a1b06fea574415348cd64345">front</a>(<span class="keywordtype">void</span>) { <span class="keywordflow">return</span> *(begin()); }
<a name="l00380"></a>00380
<a name="l00384"></a><a class="code" href="classedelib_1_1list.html#af055e52cc1745a44c0463ff0b08a02b8">00384</a> <span class="keyword">const</span> T& <a class="code" href="classedelib_1_1list.html#af055e52cc1745a44c0463ff0b08a02b8">front</a>(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> *(begin()); }
<a name="l00385"></a>00385
<a name="l00389"></a><a class="code" href="classedelib_1_1list.html#a81fe479f51ab2203828ba4547abd01ea">00389</a> T& <a class="code" href="classedelib_1_1list.html#a81fe479f51ab2203828ba4547abd01ea">back</a>(<span class="keywordtype">void</span>) { <span class="keywordflow">return</span> *(--end()); }
<a name="l00390"></a>00390
<a name="l00394"></a><a class="code" href="classedelib_1_1list.html#a1acba7c4168530c0ed7a2ccfc3fef639">00394</a> <span class="keyword">const</span> T& <a class="code" href="classedelib_1_1list.html#a1acba7c4168530c0ed7a2ccfc3fef639">back</a>(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> *(--end()); }
<a name="l00395"></a>00395
<a name="l00399"></a><a class="code" href="classedelib_1_1list.html#af4c7e15ecf2e409e5189633fc661cdba">00399</a> size_type <a class="code" href="classedelib_1_1list.html#af4c7e15ecf2e409e5189633fc661cdba">size</a>(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> sz; }
<a name="l00400"></a>00400
<a name="l00404"></a><a class="code" href="classedelib_1_1list.html#a8f26081fc8698ecb3276704a7fa715f1">00404</a> <span class="keywordtype">bool</span> <a class="code" href="classedelib_1_1list.html#a8f26081fc8698ecb3276704a7fa715f1">empty</a>(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> sz == 0; }
<a name="l00405"></a>00405
<a name="l00409"></a><a class="code" href="classedelib_1_1list.html#a0275038a394e4d4fc9704153389e8146">00409</a> <span class="keywordtype">bool</span> <a class="code" href="classedelib_1_1list.html#a0275038a394e4d4fc9704153389e8146">operator==</a>(<a class="code" href="classedelib_1_1list.html" title="Linked list class.">list<T></a>& other) {
<a name="l00410"></a>00410 <span class="keywordflow">if</span>(size() != other.<a class="code" href="classedelib_1_1list.html#af4c7e15ecf2e409e5189633fc661cdba">size</a>())
<a name="l00411"></a>00411 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00412"></a>00412
<a name="l00413"></a>00413 iterator it = begin(), it_end = end(), it2 = other.<a class="code" href="classedelib_1_1list.html#a2b63029948b37148ad32c4c6d56193d0">begin</a>();
<a name="l00414"></a>00414 <span class="keywordflow">for</span>(; it != it_end; ++it, ++it2) {
<a name="l00415"></a>00415 <span class="keywordflow">if</span>((*it) != (*it2))
<a name="l00416"></a>00416 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00417"></a>00417 }
<a name="l00418"></a>00418
<a name="l00419"></a>00419 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00420"></a>00420 }
<a name="l00421"></a>00421
<a name="l00425"></a><a class="code" href="classedelib_1_1list.html#a6163c9ee84c21917f9c01a19dd025660">00425</a> <span class="keywordtype">bool</span> <a class="code" href="classedelib_1_1list.html#a6163c9ee84c21917f9c01a19dd025660">operator!=</a>(<a class="code" href="classedelib_1_1list.html" title="Linked list class.">list<T></a>& other) { <span class="keywordflow">return</span> !operator==(other); }
<a name="l00426"></a>00426
<a name="l00431"></a><a class="code" href="classedelib_1_1list.html#a99a110f4b3f16555a842e9c20932991c">00431</a> <span class="keywordtype">void</span> <a class="code" href="classedelib_1_1list.html#a99a110f4b3f16555a842e9c20932991c">sort</a>(SortCmp* cmp = default_sort_cmp) {
<a name="l00432"></a>00432 <span class="keywordflow">if</span>(size() <= 1)
<a name="l00433"></a>00433 <span class="keywordflow">return</span>;
<a name="l00434"></a>00434
<a name="l00435"></a>00435 <span class="comment">// unlink nodes first making first->prev and last->next zero</span>
<a name="l00436"></a>00436 tail->prev->next = 0;
<a name="l00437"></a>00437
<a name="l00438"></a>00438 Node* nn = mergesort(tail->next, cmp);
<a name="l00439"></a>00439
<a name="l00440"></a>00440 tail->next = nn;
<a name="l00441"></a>00441 nn->prev = tail;
<a name="l00442"></a>00442
<a name="l00443"></a>00443 <span class="comment">/* </span>
<a name="l00444"></a>00444 <span class="comment"> * Search last node and let tail points to it. </span>
<a name="l00445"></a>00445 <span class="comment"> * Althought this looks like overhead, this sort is still twice faster that std::list sort.</span>
<a name="l00446"></a>00446 <span class="comment"> * Alternative optimization would be that __mergesort() returns end node.</span>
<a name="l00447"></a>00447 <span class="comment"> */</span>
<a name="l00448"></a>00448 <span class="keywordflow">while</span>(1) {
<a name="l00449"></a>00449 <span class="keywordflow">if</span>(nn->next)
<a name="l00450"></a>00450 nn = nn->next;
<a name="l00451"></a>00451 <span class="keywordflow">else</span> {
<a name="l00452"></a>00452 nn->next = tail;
<a name="l00453"></a>00453 tail->prev = nn;
<a name="l00454"></a>00454 <span class="keywordflow">break</span>;
<a name="l00455"></a>00455 }
<a name="l00456"></a>00456 }
<a name="l00457"></a>00457 }
<a name="l00458"></a>00458 };
<a name="l00459"></a>00459
<a name="l00460"></a>00460 <span class="preprocessor">#if 0</span>
<a name="l00461"></a>00461 <span class="preprocessor"></span><span class="comment">// list specialization for pointers</span>
<a name="l00462"></a>00462 <span class="preprocessor">#ifndef SKIP_DOCS</span>
<a name="l00463"></a>00463 <span class="preprocessor"></span><span class="preprocessor">#ifndef NO_LIST_SPECIALIZATION</span>
<a name="l00464"></a>00464 <span class="preprocessor"></span>
<a name="l00465"></a>00465 <span class="comment">// explicit instantation</span>
<a name="l00466"></a>00466 <span class="keyword">template</span> <span class="keyword">class </span>list<void*>;
<a name="l00467"></a>00467 <span class="keyword">template</span> <span class="keyword">class </span>ListIterator<void*>;
<a name="l00468"></a>00468
<a name="l00469"></a>00469 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00470"></a>00470 <span class="keyword">struct </span>ListIterator<T*> {
<a name="l00471"></a>00471 <span class="keyword">private</span>:
<a name="l00472"></a>00472 ListIterator<void*> impl;
<a name="l00473"></a>00473
<a name="l00474"></a>00474 <span class="keyword">public</span>:
<a name="l00475"></a>00475 <span class="comment">// implicit conversion; some magic. Yuck !</span>
<a name="l00476"></a>00476 operator ListIterator<void*> () { <span class="keywordflow">return</span> impl; }
<a name="l00477"></a>00477
<a name="l00478"></a>00478 ListIterator(<span class="keyword">const</span> ListIterator<void*>& b) : impl(b) { }
<a name="l00479"></a>00479 <span class="keyword">typedef</span> ListNode NodeType;
<a name="l00480"></a>00480
<a name="l00481"></a>00481 ListIterator() { }
<a name="l00482"></a>00482 ListIterator(NodeType* n) : impl(n) { }
<a name="l00483"></a>00483
<a name="l00484"></a>00484 T* operator*(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (T*)*impl; }
<a name="l00485"></a>00485
<a name="l00486"></a>00486 <span class="keywordtype">bool</span> <a class="code" href="classedelib_1_1String.html#aaae40a07b88bda9062df26fd704ecdb1">operator!=</a>(<span class="keyword">const</span> ListIterator& other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> impl != other.impl; }
<a name="l00487"></a>00487 <span class="keywordtype">bool</span> <a class="code" href="classedelib_1_1String.html#ae618933f8842a34d047c78073c1cab9c">operator==</a>(<span class="keyword">const</span> ListIterator& other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> impl == other.impl; }
<a name="l00488"></a>00488
<a name="l00489"></a>00489 ListIterator& operator++(<span class="keywordtype">void</span>) { ++impl; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00490"></a>00490 ListIterator& operator--(<span class="keywordtype">void</span>) { --impl; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00491"></a>00491 };
<a name="l00492"></a>00492
<a name="l00493"></a>00493 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00494"></a>00494 <span class="keyword">class </span>list<T*> {
<a name="l00495"></a>00495 <span class="keyword">private</span>:
<a name="l00496"></a>00496 list<void*> impl;
<a name="l00497"></a>00497 <span class="keyword">static</span> <span class="keywordtype">bool</span> default_sort_cmp(<span class="keyword">const</span> T* val1, <span class="keyword">const</span> T* val2) { <span class="keywordflow">return</span> *val1 < *val2; }
<a name="l00498"></a>00498
<a name="l00499"></a>00499 <span class="keyword">public</span>:
<a name="l00500"></a>00500 <span class="keyword">typedef</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> size_type;
<a name="l00501"></a>00501
<a name="l00502"></a>00502 <span class="keyword">typedef</span> T* value_type;
<a name="l00503"></a>00503 <span class="keyword">typedef</span> <span class="keyword">const</span> value_type& const_reference;
<a name="l00504"></a>00504 <span class="keyword">typedef</span> value_type& reference;
<a name="l00505"></a>00505 <span class="keyword">typedef</span> value_type* pointer;
<a name="l00506"></a>00506 <span class="keyword">typedef</span> <span class="keyword">const</span> value_type* const_pointer;
<a name="l00507"></a>00507
<a name="l00508"></a>00508 <span class="keyword">typedef</span> bool (SortCmp)(const_reference val1, const_reference val2);
<a name="l00509"></a>00509
<a name="l00510"></a>00510 <span class="keyword">typedef</span> ListIterator<T*> iterator;
<a name="l00511"></a>00511 <span class="keyword">typedef</span> ListIterator<T*> const_iterator;
<a name="l00512"></a>00512
<a name="l00513"></a>00513 <span class="keywordtype">void</span> clear(<span class="keywordtype">void</span>) { impl.clear(); }
<a name="l00514"></a>00514
<a name="l00515"></a>00515 iterator insert(iterator it, const_reference val) { <span class="keywordflow">return</span> impl.insert(it, val); }
<a name="l00516"></a>00516 iterator erase(iterator it) { <span class="keywordflow">return</span> impl.erase(it); }
<a name="l00517"></a>00517
<a name="l00518"></a>00518 <span class="keywordtype">void</span> push_back(const_reference val) { impl.push_back((<span class="keywordtype">void</span>*)val); }
<a name="l00519"></a>00519 <span class="keywordtype">void</span> push_front(const_reference val) { impl.push_front((<span class="keywordtype">void</span>*)val); }
<a name="l00520"></a>00520
<a name="l00521"></a>00521 iterator begin(<span class="keywordtype">void</span>) { <span class="keywordflow">return</span> impl.begin(); }
<a name="l00522"></a>00522 const_iterator begin(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> impl.begin(); }
<a name="l00523"></a>00523
<a name="l00524"></a>00524 iterator end(<span class="keywordtype">void</span>) { <span class="keywordflow">return</span> impl.end(); }
<a name="l00525"></a>00525 const_iterator end(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> impl.end(); }
<a name="l00526"></a>00526
<a name="l00527"></a>00527 pointer front(<span class="keywordtype">void</span>) { <span class="keywordflow">return</span> impl.front(); }
<a name="l00528"></a>00528 const_pointer front(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> impl.front(); }
<a name="l00529"></a>00529
<a name="l00530"></a>00530 pointer back(<span class="keywordtype">void</span>) { <span class="keywordflow">return</span> impl.back(); }
<a name="l00531"></a>00531 const_pointer back(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> impl.back(); }
<a name="l00532"></a>00532
<a name="l00533"></a>00533 size_type size(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> impl.size(); }
<a name="l00534"></a>00534 <span class="keywordtype">bool</span> empty(<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> impl.empty(); }
<a name="l00535"></a>00535
<a name="l00536"></a>00536 <span class="keywordtype">bool</span> <a class="code" href="classedelib_1_1String.html#ae618933f8842a34d047c78073c1cab9c">operator==</a>(list<T*>& other) { <span class="keywordflow">return</span> impl.operator==(other); }
<a name="l00537"></a>00537 <span class="keywordtype">bool</span> <a class="code" href="classedelib_1_1String.html#aaae40a07b88bda9062df26fd704ecdb1">operator!=</a>(list<T*>& other) { <span class="keywordflow">return</span> impl.operator!=(other); }
<a name="l00538"></a>00538
<a name="l00539"></a>00539 <span class="comment">//void sort(SortCmp* cmp = default_sort_cmp) { impl.sort( (bool (*)(void* const&, void* const&)) cmp); }</span>
<a name="l00540"></a>00540 <span class="keywordtype">void</span> sort(SortCmp* cmp) { impl.sort((<span class="keywordtype">bool</span> (*)(<span class="keywordtype">void</span>* <span class="keyword">const</span>&, <span class="keywordtype">void</span>* <span class="keyword">const</span>&)) cmp); }
<a name="l00541"></a>00541 };
<a name="l00542"></a>00542
<a name="l00543"></a>00543 <span class="preprocessor">#endif // NO_LIST_SPECIALIZATION</span>
<a name="l00544"></a>00544 <span class="preprocessor"></span><span class="preprocessor">#endif // SKIP_DOCS</span>
<a name="l00545"></a>00545 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00546"></a>00546 <span class="preprocessor"></span>
<a name="l00547"></a>00547 EDELIB_NS_END
<a name="l00548"></a>00548 <span class="preprocessor">#endif</span>
</pre></div></div><!-- contents -->
<hr class="footer"/><address class="footer"><small>
Generated on Tue Jun 5 2012 17:49:02 for edelib by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.6.1
</small></address>
</body>
</html>
