<!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>RAUL: ListImpl.hpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.1 -->
<div class="navigation" id="top">
<div class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</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 class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
</ul>
</div>
<div class="header">
<div class="headertitle">
<h1>ListImpl.hpp</h1> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* This file is part of Raul.</span>
<a name="l00002"></a>00002 <span class="comment"> * Copyright (C) 2007-2009 David Robillard <http://drobilla.net></span>
<a name="l00003"></a>00003 <span class="comment"> *</span>
<a name="l00004"></a>00004 <span class="comment"> * Raul is free software; you can redistribute it and/or modify it under the</span>
<a name="l00005"></a>00005 <span class="comment"> * terms of the GNU General Public License as published by the Free Software</span>
<a name="l00006"></a>00006 <span class="comment"> * Foundation; either version 2 of the License, or (at your option) any later</span>
<a name="l00007"></a>00007 <span class="comment"> * version.</span>
<a name="l00008"></a>00008 <span class="comment"> *</span>
<a name="l00009"></a>00009 <span class="comment"> * Raul is distributed in the hope that it will be useful, but WITHOUT ANY</span>
<a name="l00010"></a>00010 <span class="comment"> * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS</span>
<a name="l00011"></a>00011 <span class="comment"> * FOR A PARTICULAR PURPOSE. See the GNU General Public License for details.</span>
<a name="l00012"></a>00012 <span class="comment"> *</span>
<a name="l00013"></a>00013 <span class="comment"> * You should have received a copy of the GNU General Public License along</span>
<a name="l00014"></a>00014 <span class="comment"> * with this program; if not, write to the Free Software Foundation, Inc.,</span>
<a name="l00015"></a>00015 <span class="comment"> * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA</span>
<a name="l00016"></a>00016 <span class="comment"> */</span>
<a name="l00017"></a>00017
<a name="l00018"></a>00018 <span class="preprocessor">#ifndef RAUL_LIST_IMPL_HPP</span>
<a name="l00019"></a>00019 <span class="preprocessor"></span><span class="preprocessor">#define RAUL_LIST_IMPL_HPP</span>
<a name="l00020"></a>00020 <span class="preprocessor"></span>
<a name="l00021"></a>00021 <span class="keyword">namespace </span>Raul {
<a name="l00022"></a>00022
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00025"></a>00025 List<T>::~List<T>()
<a name="l00026"></a>00026 {
<a name="l00027"></a>00027 clear();
<a name="l00028"></a>00028 }
<a name="l00029"></a>00029
<a name="l00030"></a>00030
<a name="l00035"></a>00035 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00036"></a>00036 <span class="keywordtype">void</span>
<a name="l00037"></a><a class="code" href="classRaul_1_1List.html#a96cb220e9d0bc81a5a40669f9f0a793b">00037</a> <a class="code" href="classRaul_1_1List.html#a96cb220e9d0bc81a5a40669f9f0a793b" title="Clear the list, deleting all Nodes contained (but NOT their contents!).">List<T>::clear</a>()
<a name="l00038"></a>00038 {
<a name="l00039"></a>00039 <a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">Node</a>* node = _head.get();
<a name="l00040"></a>00040 <a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">Node</a>* next = NULL;
<a name="l00041"></a>00041
<a name="l00042"></a>00042 <span class="keywordflow">while</span> (node) {
<a name="l00043"></a>00043 next = node->next();
<a name="l00044"></a>00044 <span class="keyword">delete</span> node;
<a name="l00045"></a>00045 node = next;
<a name="l00046"></a>00046 }
<a name="l00047"></a>00047
<a name="l00048"></a>00048 _head = 0;
<a name="l00049"></a>00049 _tail = 0;
<a name="l00050"></a>00050 _size = 0;
<a name="l00051"></a>00051 }
<a name="l00052"></a>00052
<a name="l00053"></a>00053
<a name="l00059"></a>00059 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00060"></a>00060 <span class="keywordtype">void</span>
<a name="l00061"></a><a class="code" href="classRaul_1_1List.html#a20d904c950f9eb4208b19e6ebb690371">00061</a> <a class="code" href="classRaul_1_1List.html#a20d904c950f9eb4208b19e6ebb690371" title="Realtime Safe.">List<T>::push_back</a>(<a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">Node</a>* <span class="keyword">const</span> ln)
<a name="l00062"></a>00062 {
<a name="l00063"></a>00063 assert(ln);
<a name="l00064"></a>00064
<a name="l00065"></a>00065 ln->next(NULL);
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="keywordflow">if</span> ( ! _head.get()) { <span class="comment">// empty</span>
<a name="l00068"></a>00068 ln->prev(NULL);
<a name="l00069"></a>00069 _tail = ln;
<a name="l00070"></a>00070 _head = ln;
<a name="l00071"></a>00071 } <span class="keywordflow">else</span> {
<a name="l00072"></a>00072 ln->prev(_tail.get());
<a name="l00073"></a>00073 _tail.get()->next(ln);
<a name="l00074"></a>00074 _tail = ln;
<a name="l00075"></a>00075 }
<a name="l00076"></a>00076 ++_size;
<a name="l00077"></a>00077 }
<a name="l00078"></a>00078
<a name="l00079"></a>00079
<a name="l00085"></a>00085 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00086"></a>00086 <span class="keywordtype">void</span>
<a name="l00087"></a><a class="code" href="classRaul_1_1List.html#a937d7ce5da9552f8b1cfd71f5c7cb5e6">00087</a> <a class="code" href="classRaul_1_1List.html#a20d904c950f9eb4208b19e6ebb690371" title="Realtime Safe.">List<T>::push_back</a>(T& elem)
<a name="l00088"></a>00088 {
<a name="l00089"></a>00089 <a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">Node</a>* <span class="keyword">const</span> ln = <span class="keyword">new</span> <a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">Node</a>(elem);
<a name="l00090"></a>00090
<a name="l00091"></a>00091 assert(ln);
<a name="l00092"></a>00092
<a name="l00093"></a>00093 ln->next(NULL);
<a name="l00094"></a>00094
<a name="l00095"></a>00095 <span class="keywordflow">if</span> ( ! _head.get()) { <span class="comment">// empty</span>
<a name="l00096"></a>00096 ln->prev(NULL);
<a name="l00097"></a>00097 _tail = ln;
<a name="l00098"></a>00098 _head = ln;
<a name="l00099"></a>00099 } <span class="keywordflow">else</span> {
<a name="l00100"></a>00100 ln->prev(_tail.get());
<a name="l00101"></a>00101 _tail.get()->next(ln);
<a name="l00102"></a>00102 _tail = ln;
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104 ++_size;
<a name="l00105"></a>00105 }
<a name="l00106"></a>00106
<a name="l00107"></a>00107
<a name="l00117"></a>00117 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00118"></a>00118 <span class="keywordtype">void</span>
<a name="l00119"></a><a class="code" href="classRaul_1_1List.html#ae37d799cafbab461d145bbf0f5aa8401">00119</a> <a class="code" href="classRaul_1_1List.html#ae37d799cafbab461d145bbf0f5aa8401" title="Append a list to this list.">List<T>::append</a>(<a class="code" href="classRaul_1_1List.html" title="A realtime safe, (partially) thread safe doubly-linked list.">List<T></a>& list)
<a name="l00120"></a>00120 {
<a name="l00121"></a>00121 <a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">Node</a>* <span class="keyword">const</span> my_head = _head.get();
<a name="l00122"></a>00122 <a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">Node</a>* <span class="keyword">const</span> my_tail = _tail.get();
<a name="l00123"></a>00123 <a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">Node</a>* <span class="keyword">const</span> other_head = list._head.get();
<a name="l00124"></a>00124 <a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">Node</a>* <span class="keyword">const</span> other_tail = list._tail.get();
<a name="l00125"></a>00125
<a name="l00126"></a>00126 assert((my_head && my_tail) || (!my_head && !my_tail));
<a name="l00127"></a>00127 assert((other_head && other_tail) || (!other_head && !other_tail));
<a name="l00128"></a>00128
<a name="l00129"></a>00129 <span class="comment">// Appending to an empty list</span>
<a name="l00130"></a>00130 <span class="keywordflow">if</span> (my_head == NULL && my_tail == NULL) {
<a name="l00131"></a>00131 _head = other_head;
<a name="l00132"></a>00132 _tail = other_tail;
<a name="l00133"></a>00133 _size = list._size;
<a name="l00134"></a>00134 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (other_head != NULL && other_tail != NULL) {
<a name="l00135"></a>00135
<a name="l00136"></a>00136 other_head->prev(my_tail);
<a name="l00137"></a>00137
<a name="l00138"></a>00138 <span class="comment">// FIXME: atomicity an issue? _size < true size is probably fine...</span>
<a name="l00139"></a>00139 <span class="comment">// no gurantee an iteration runs exactly size times though. verify/document this.</span>
<a name="l00140"></a>00140 <span class="comment">// assuming comment above that says tail is writer only, this is fine</span>
<a name="l00141"></a>00141 my_tail->next(other_head);
<a name="l00142"></a>00142 _tail = other_tail;
<a name="l00143"></a>00143 _size += list.<a class="code" href="classRaul_1_1List.html#a8e77fcf7bff6532771334c067acc5977" title="Valid only in the write thread.">size</a>();
<a name="l00144"></a>00144 }
<a name="l00145"></a>00145
<a name="l00146"></a>00146 list._head = NULL;
<a name="l00147"></a>00147 list._tail = NULL;
<a name="l00148"></a>00148 list._size = 0;
<a name="l00149"></a>00149 }
<a name="l00150"></a>00150
<a name="l00151"></a>00151
<a name="l00157"></a>00157 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00158"></a>00158 <span class="keyword">typename</span> <a class="code" href="classRaul_1_1List_1_1iterator.html" title="Realtime safe iterator for a List.">List<T>::iterator</a>
<a name="l00159"></a><a class="code" href="classRaul_1_1List.html#a534f9df684480b3bb74173e36f0cd2e9">00159</a> <a class="code" href="classRaul_1_1List.html#a534f9df684480b3bb74173e36f0cd2e9" title="Find an element in the list.">List<T>::find</a>(<span class="keyword">const</span> T& val)
<a name="l00160"></a>00160 {
<a name="l00161"></a>00161 <span class="keywordflow">for</span> (<a class="code" href="classRaul_1_1List_1_1iterator.html" title="Realtime safe iterator for a List.">iterator</a> i = begin(); i != end(); ++i)
<a name="l00162"></a>00162 <span class="keywordflow">if</span> (*i == val)
<a name="l00163"></a>00163 <span class="keywordflow">return</span> i;
<a name="l00164"></a>00164
<a name="l00165"></a>00165 <span class="keywordflow">return</span> end();
<a name="l00166"></a>00166 }
<a name="l00167"></a>00167
<a name="l00168"></a>00168
<a name="l00176"></a>00176 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00177"></a>00177 <span class="keyword">typename</span> <a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">List<T>::Node</a>*
<a name="l00178"></a><a class="code" href="classRaul_1_1List.html#adeb74758cc7641b414907f792e276155">00178</a> <a class="code" href="classRaul_1_1List.html#adeb74758cc7641b414907f792e276155" title="Remove an element from the list using an iterator.">List<T>::erase</a>(<span class="keyword">const</span> <a class="code" href="classRaul_1_1List_1_1iterator.html" title="Realtime safe iterator for a List.">iterator</a> iter)
<a name="l00179"></a>00179 {
<a name="l00180"></a>00180 <a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">Node</a>* <span class="keyword">const</span> n = iter._listnode;
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="keywordflow">if</span> (n) {
<a name="l00183"></a>00183 <a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">Node</a>* <span class="keyword">const</span> prev = n->prev();
<a name="l00184"></a>00184 <a class="code" href="classRaul_1_1List_1_1Node.html" title="A node in a List.">Node</a>* <span class="keyword">const</span> next = n->next();
<a name="l00185"></a>00185
<a name="l00186"></a>00186 <span class="comment">// Removing the head (or the only element)</span>
<a name="l00187"></a>00187 <span class="keywordflow">if</span> (n == _head.get())
<a name="l00188"></a>00188 _head = next;
<a name="l00189"></a>00189
<a name="l00190"></a>00190 <span class="comment">// Removing the tail (or the only element)</span>
<a name="l00191"></a>00191 <span class="keywordflow">if</span> (n == _tail.get())
<a name="l00192"></a>00192 _tail = _tail.get()->prev();
<a name="l00193"></a>00193
<a name="l00194"></a>00194 <span class="keywordflow">if</span> (prev)
<a name="l00195"></a>00195 n->prev()->next(next);
<a name="l00196"></a>00196
<a name="l00197"></a>00197 <span class="keywordflow">if</span> (next)
<a name="l00198"></a>00198 n->next()->prev(prev);
<a name="l00199"></a>00199
<a name="l00200"></a>00200 --_size;
<a name="l00201"></a>00201 }
<a name="l00202"></a>00202
<a name="l00203"></a>00203 assert((_head.get() && _tail.get()) || (!_head.get() && !_tail.get()));
<a name="l00204"></a>00204 <span class="keywordflow">return</span> n;
<a name="l00205"></a>00205 }
<a name="l00206"></a>00206
<a name="l00207"></a>00207
<a name="l00208"></a>00208 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00209"></a>00209 <span class="keywordtype">void</span>
<a name="l00210"></a>00210 <a class="code" href="classRaul_1_1List.html" title="A realtime safe, (partially) thread safe doubly-linked list.">List<T>::chop_front</a>(<a class="code" href="classRaul_1_1List.html" title="A realtime safe, (partially) thread safe doubly-linked list.">List<T></a>& front, <span class="keywordtype">size_t</span> front_size, Node* new_head)
<a name="l00211"></a>00211 {
<a name="l00212"></a>00212 assert(new_head != _head.get());
<a name="l00213"></a>00213 assert((front._head.get() && front._tail.get()) || (!front._head.get() && !front._tail.get()));
<a name="l00214"></a>00214 assert((_head.get() && _tail.get()) || (!_head.get() && !_tail.get()));
<a name="l00215"></a>00215 <span class="keywordflow">if</span> (!new_head) {
<a name="l00216"></a>00216 assert(front_size == static_cast<size_t>(_size.get()));
<a name="l00217"></a>00217 front._size = _size;
<a name="l00218"></a>00218 front._head = _head;
<a name="l00219"></a>00219 front._tail = _tail;
<a name="l00220"></a>00220 _size = 0;
<a name="l00221"></a>00221 _head = NULL;
<a name="l00222"></a>00222 _tail = NULL;
<a name="l00223"></a>00223 } <span class="keywordflow">else</span> {
<a name="l00224"></a>00224 front._size = front_size;
<a name="l00225"></a>00225 front._head = _head;
<a name="l00226"></a>00226 front._tail = new_head->prev();
<a name="l00227"></a>00227 <span class="keywordflow">if</span> (new_head->prev())
<a name="l00228"></a>00228 new_head->prev()->next(NULL);
<a name="l00229"></a>00229 _head = new_head;
<a name="l00230"></a>00230 new_head->prev(NULL);
<a name="l00231"></a>00231 _size -= front_size;
<a name="l00232"></a>00232 }
<a name="l00233"></a>00233 assert((front._head.get() && front._tail.get()) || (!front._head.get() && !front._tail.get()));
<a name="l00234"></a>00234 assert((_head.get() && _tail.get()) || (!_head.get() && !_tail.get()));
<a name="l00235"></a>00235 }
<a name="l00236"></a>00236
<a name="l00237"></a>00237
<a name="l00239"></a>00239
<a name="l00240"></a>00240 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00241"></a>00241 List<T>::iterator::iterator(List<T>* list)
<a name="l00242"></a>00242 : _list(list),
<a name="l00243"></a>00243 _listnode(NULL)
<a name="l00244"></a>00244 {
<a name="l00245"></a>00245 }
<a name="l00246"></a>00246
<a name="l00247"></a>00247
<a name="l00248"></a>00248 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00249"></a>00249 T&
<a name="l00250"></a>00250 List<T>::iterator::operator*()
<a name="l00251"></a>00251 {
<a name="l00252"></a>00252 assert(_listnode);
<a name="l00253"></a>00253 <span class="keywordflow">return</span> _listnode->elem();
<a name="l00254"></a>00254 }
<a name="l00255"></a>00255
<a name="l00256"></a>00256
<a name="l00257"></a>00257 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00258"></a>00258 T*
<a name="l00259"></a>00259 List<T>::iterator::operator->()
<a name="l00260"></a>00260 {
<a name="l00261"></a>00261 assert(_listnode);
<a name="l00262"></a>00262 <span class="keywordflow">return</span> &_listnode->elem();
<a name="l00263"></a>00263 }
<a name="l00264"></a>00264
<a name="l00265"></a>00265
<a name="l00266"></a>00266 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00267"></a>00267 <span class="keyword">inline</span> <span class="keyword">typename</span> List<T>::iterator&
<a name="l00268"></a>00268 List<T>::iterator::operator++()
<a name="l00269"></a>00269 {
<a name="l00270"></a>00270 assert(_listnode);
<a name="l00271"></a>00271 _listnode = _listnode->next();
<a name="l00272"></a>00272
<a name="l00273"></a>00273 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00274"></a>00274 }
<a name="l00275"></a>00275
<a name="l00276"></a>00276
<a name="l00277"></a>00277 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00278"></a>00278 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00279"></a>00279 List<T>::iterator::operator!=(<span class="keyword">const</span> iterator& iter)<span class="keyword"> const</span>
<a name="l00280"></a>00280 <span class="keyword"></span>{
<a name="l00281"></a>00281 <span class="keywordflow">return</span> (_listnode != iter._listnode);
<a name="l00282"></a>00282 }
<a name="l00283"></a>00283
<a name="l00284"></a>00284
<a name="l00285"></a>00285 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00286"></a>00286 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00287"></a>00287 List<T>::iterator::operator!=(<span class="keyword">const</span> const_iterator& iter)<span class="keyword"> const</span>
<a name="l00288"></a>00288 <span class="keyword"></span>{
<a name="l00289"></a>00289 <span class="keywordflow">return</span> (_listnode != iter._listnode);
<a name="l00290"></a>00290 }
<a name="l00291"></a>00291
<a name="l00292"></a>00292
<a name="l00293"></a>00293 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00294"></a>00294 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00295"></a>00295 List<T>::iterator::operator==(<span class="keyword">const</span> iterator& iter)<span class="keyword"> const</span>
<a name="l00296"></a>00296 <span class="keyword"></span>{
<a name="l00297"></a>00297 <span class="keywordflow">return</span> (_listnode == iter._listnode);
<a name="l00298"></a>00298 }
<a name="l00299"></a>00299
<a name="l00300"></a>00300
<a name="l00301"></a>00301 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00302"></a>00302 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00303"></a>00303 List<T>::iterator::operator==(<span class="keyword">const</span> const_iterator& iter)<span class="keyword"> const</span>
<a name="l00304"></a>00304 <span class="keyword"></span>{
<a name="l00305"></a>00305 <span class="keywordflow">return</span> (_listnode == iter._listnode);
<a name="l00306"></a>00306 }
<a name="l00307"></a>00307
<a name="l00308"></a>00308
<a name="l00309"></a>00309 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00310"></a>00310 <span class="keyword">inline</span> <span class="keyword">typename</span> List<T>::iterator
<a name="l00311"></a>00311 List<T>::begin()
<a name="l00312"></a>00312 {
<a name="l00313"></a>00313 <span class="keyword">typename</span> List<T>::iterator iter(<span class="keyword">this</span>);
<a name="l00314"></a>00314
<a name="l00315"></a>00315 iter._listnode = _head.get();
<a name="l00316"></a>00316
<a name="l00317"></a>00317 <span class="keywordflow">return</span> iter;
<a name="l00318"></a>00318 }
<a name="l00319"></a>00319
<a name="l00320"></a>00320
<a name="l00321"></a>00321 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00322"></a>00322 <span class="keyword">inline</span> <span class="keyword">const</span> <span class="keyword">typename</span> List<T>::iterator
<a name="l00323"></a>00323 List<T>::end()<span class="keyword"> const</span>
<a name="l00324"></a>00324 <span class="keyword"></span>{
<a name="l00325"></a>00325 <span class="keywordflow">return</span> _end_iter;
<a name="l00326"></a>00326 }
<a name="l00327"></a>00327
<a name="l00328"></a>00328
<a name="l00329"></a>00329
<a name="l00331"></a>00331
<a name="l00332"></a>00332
<a name="l00333"></a>00333 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00334"></a><a class="code" href="classRaul_1_1List_1_1const__iterator.html#a371181e310dc14d0e6e6d432c9f2a79b">00334</a> <a class="code" href="classRaul_1_1List_1_1const__iterator.html#a371181e310dc14d0e6e6d432c9f2a79b" title="const_iterator stuff ///">List<T>::const_iterator::const_iterator</a>(<span class="keyword">const</span> <a class="code" href="classRaul_1_1List.html" title="A realtime safe, (partially) thread safe doubly-linked list.">List<T></a>* <span class="keyword">const</span> list)
<a name="l00335"></a>00335 : _list(list),
<a name="l00336"></a>00336 _listnode(NULL)
<a name="l00337"></a>00337 {
<a name="l00338"></a>00338 }
<a name="l00339"></a>00339
<a name="l00340"></a>00340
<a name="l00341"></a>00341 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00342"></a>00342 <span class="keyword">const</span> T&
<a name="l00343"></a>00343 <a class="code" href="classRaul_1_1List.html" title="A realtime safe, (partially) thread safe doubly-linked list.">List<T>::const_iterator::operator*</a>()
<a name="l00344"></a>00344 {
<a name="l00345"></a>00345 assert(_listnode);
<a name="l00346"></a>00346 <span class="keywordflow">return</span> _listnode->elem();
<a name="l00347"></a>00347 }
<a name="l00348"></a>00348
<a name="l00349"></a>00349
<a name="l00350"></a>00350 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00351"></a>00351 <span class="keyword">const</span> T*
<a name="l00352"></a>00352 <a class="code" href="classRaul_1_1List.html" title="A realtime safe, (partially) thread safe doubly-linked list.">List<T>::const_iterator::operator-></a>()
<a name="l00353"></a>00353 {
<a name="l00354"></a>00354 assert(_listnode);
<a name="l00355"></a>00355 <span class="keywordflow">return</span> &_listnode->elem();
<a name="l00356"></a>00356 }
<a name="l00357"></a>00357
<a name="l00358"></a>00358
<a name="l00359"></a>00359 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00360"></a>00360 <span class="keyword">inline</span> <span class="keyword">typename</span> List<T>::const_iterator&
<a name="l00361"></a>00361 List<T>::const_iterator::operator++()
<a name="l00362"></a>00362 {
<a name="l00363"></a>00363 assert(_listnode);
<a name="l00364"></a>00364 _listnode = _listnode->next();
<a name="l00365"></a>00365
<a name="l00366"></a>00366 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00367"></a>00367 }
<a name="l00368"></a>00368
<a name="l00369"></a>00369
<a name="l00370"></a>00370 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00371"></a>00371 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00372"></a>00372 List<T>::const_iterator::operator!=(<span class="keyword">const</span> const_iterator& iter)<span class="keyword"> const</span>
<a name="l00373"></a>00373 <span class="keyword"></span>{
<a name="l00374"></a>00374 <span class="keywordflow">return</span> (_listnode != iter._listnode);
<a name="l00375"></a>00375 }
<a name="l00376"></a>00376
<a name="l00377"></a>00377
<a name="l00378"></a>00378 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00379"></a>00379 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00380"></a>00380 List<T>::const_iterator::operator!=(<span class="keyword">const</span> iterator& iter)<span class="keyword"> const</span>
<a name="l00381"></a>00381 <span class="keyword"></span>{
<a name="l00382"></a>00382 <span class="keywordflow">return</span> (_listnode != iter._listnode);
<a name="l00383"></a>00383 }
<a name="l00384"></a>00384
<a name="l00385"></a>00385
<a name="l00386"></a>00386 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00387"></a>00387 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00388"></a>00388 List<T>::const_iterator::operator==(<span class="keyword">const</span> const_iterator& iter)<span class="keyword"> const</span>
<a name="l00389"></a>00389 <span class="keyword"></span>{
<a name="l00390"></a>00390 <span class="keywordflow">return</span> (_listnode == iter._listnode);
<a name="l00391"></a>00391 }
<a name="l00392"></a>00392
<a name="l00393"></a>00393
<a name="l00394"></a>00394 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00395"></a>00395 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00396"></a>00396 List<T>::const_iterator::operator==(<span class="keyword">const</span> iterator& iter)<span class="keyword"> const</span>
<a name="l00397"></a>00397 <span class="keyword"></span>{
<a name="l00398"></a>00398 <span class="keywordflow">return</span> (_listnode == iter._listnode);
<a name="l00399"></a>00399 }
<a name="l00400"></a>00400
<a name="l00401"></a>00401 <span class="keyword">template</span> <<span class="keyword">typename</span> T>
<a name="l00402"></a>00402 <span class="keyword">inline</span> <span class="keyword">typename</span> List<T>::const_iterator
<a name="l00403"></a>00403 List<T>::begin()<span class="keyword"> const</span>
<a name="l00404"></a>00404 <span class="keyword"></span>{
<a name="l00405"></a>00405 <span class="keyword">typename</span> List<T>::const_iterator iter(<span class="keyword">this</span>);
<a name="l00406"></a>00406 iter._listnode = _head.get();
<a name="l00407"></a>00407 <span class="keywordflow">return</span> iter;
<a name="l00408"></a>00408 }
<a name="l00409"></a>00409
<a name="l00410"></a>00410
<a name="l00411"></a>00411 } <span class="comment">// namespace Raul</span>
<a name="l00412"></a>00412
<a name="l00413"></a>00413
<a name="l00414"></a>00414 <span class="preprocessor">#endif // RAUL_LIST_IMPL_HPP</span>
</pre></div></div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Wed Oct 6 2010 for RAUL by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.1 </small></address>
</body>
</html>
distrib
>
Fedora
>
14
>
x86_64
>
media
>
updates
>
by-pkgid
>
88959ca903fe50462ea99715ead18944
>
files
>
57
