<!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>Barry: router.h 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.6.2-20100208 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<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>
<li><a href="dirs.html"><span>Directories</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
</ul>
</div>
<div class="navpath"><a class="el" href="dir_65781e9408669bb8d7d9c025fdb5fe86.html">src</a>
</div>
</div>
<div class="contents">
<h1>router.h</h1><a href="router_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">///</span>
<a name="l00002"></a>00002 <span class="comment"></span><span class="comment">/// \file router.h</span>
<a name="l00003"></a>00003 <span class="comment"></span><span class="comment">/// Support classes for the pluggable socket routing system.</span>
<a name="l00004"></a>00004 <span class="comment"></span><span class="comment">///</span>
<a name="l00005"></a>00005 <span class="comment"></span>
<a name="l00006"></a>00006 <span class="comment">/*</span>
<a name="l00007"></a>00007 <span class="comment"> Copyright (C) 2005-2008, Net Direct Inc. (http://www.netdirect.ca/)</span>
<a name="l00008"></a>00008 <span class="comment"></span>
<a name="l00009"></a>00009 <span class="comment"> This program is free software; you can redistribute it and/or modify</span>
<a name="l00010"></a>00010 <span class="comment"> it under the terms of the GNU General Public License as published by</span>
<a name="l00011"></a>00011 <span class="comment"> the Free Software Foundation; either version 2 of the License, or</span>
<a name="l00012"></a>00012 <span class="comment"> (at your option) any later version.</span>
<a name="l00013"></a>00013 <span class="comment"></span>
<a name="l00014"></a>00014 <span class="comment"> This program is distributed in the hope that it will be useful,</span>
<a name="l00015"></a>00015 <span class="comment"> but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00016"></a>00016 <span class="comment"> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.</span>
<a name="l00017"></a>00017 <span class="comment"></span>
<a name="l00018"></a>00018 <span class="comment"> See the GNU General Public License in the COPYING file at the</span>
<a name="l00019"></a>00019 <span class="comment"> root directory of this project for more details.</span>
<a name="l00020"></a>00020 <span class="comment">*/</span>
<a name="l00021"></a>00021
<a name="l00022"></a>00022 <span class="preprocessor">#ifndef __BARRY_ROUTER_H__</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define __BARRY_ROUTER_H__</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span>
<a name="l00025"></a>00025 <span class="preprocessor">#include "<a class="code" href="dll_8h.html" title="Macros for handling DLL/library API visibility.">dll.h</a>"</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include <stdint.h></span>
<a name="l00027"></a>00027 <span class="preprocessor">#include <map></span>
<a name="l00028"></a>00028 <span class="preprocessor">#include <tr1/memory></span>
<a name="l00029"></a>00029 <span class="preprocessor">#include <stdexcept></span>
<a name="l00030"></a>00030 <span class="preprocessor">#include <pthread.h></span>
<a name="l00031"></a>00031 <span class="preprocessor">#include "<a class="code" href="dataqueue_8h.html" title="FIFO queue of Data objects.">dataqueue.h</a>"</span>
<a name="l00032"></a>00032
<a name="l00033"></a><a class="code" href="namespaceUsb.html">00033</a> <span class="keyword">namespace </span>Usb { <span class="keyword">class </span><a class="code" href="classUsb_1_1Device.html">Device</a>; }
<a name="l00034"></a>00034
<a name="l00035"></a>00035 <span class="keyword">namespace </span>Barry {
<a name="l00036"></a>00036
<a name="l00037"></a>00037 <span class="keyword">class </span>DataHandle;
<a name="l00038"></a>00038
<a name="l00039"></a><a class="code" href="classBarry_1_1SocketRoutingQueue.html">00039</a> <span class="keyword">class </span>BXEXPORT <a class="code" href="classBarry_1_1SocketRoutingQueue.html">SocketRoutingQueue</a>
<a name="l00040"></a>00040 {
<a name="l00041"></a>00041 <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classBarry_1_1DataHandle.html" title="std::auto_ptr like class that handles pointers to Data, but instead of freeing them...">DataHandle</a>;
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="keyword">public</span>:
<a name="l00044"></a>00044 <span class="keyword">typedef</span> void (*SocketDataHandler)(<span class="keywordtype">void</span> *ctx, <a class="code" href="classBarry_1_1Data.html">Data</a>*); <span class="comment">//< See RegisterInterest() for information on this callback.</span>
<a name="l00045"></a><a class="code" href="structBarry_1_1SocketRoutingQueue_1_1QueueEntry.html">00045</a> <span class="keyword">struct </span><a class="code" href="structBarry_1_1SocketRoutingQueue_1_1QueueEntry.html">QueueEntry</a>
<a name="l00046"></a>00046 {
<a name="l00047"></a>00047 SocketDataHandler m_handler;
<a name="l00048"></a>00048 <span class="keywordtype">void</span> *m_context;
<a name="l00049"></a>00049 <a class="code" href="classBarry_1_1DataQueue.html" title="This class provides a thread aware fifo queue for Data objects, providing memory...">DataQueue</a> m_queue;
<a name="l00050"></a>00050
<a name="l00051"></a>00051 <a class="code" href="structBarry_1_1SocketRoutingQueue_1_1QueueEntry.html">QueueEntry</a>(SocketDataHandler h, <span class="keywordtype">void</span> *c)
<a name="l00052"></a>00052 : m_handler(h)
<a name="l00053"></a>00053 , m_context(c)
<a name="l00054"></a>00054 {}
<a name="l00055"></a>00055 };
<a name="l00056"></a>00056 <span class="keyword">typedef</span> std::tr1::shared_ptr<QueueEntry> QueueEntryPtr;
<a name="l00057"></a>00057 <span class="keyword">typedef</span> uint16_t SocketId;
<a name="l00058"></a>00058 <span class="keyword">typedef</span> std::map<SocketId, QueueEntryPtr> SocketQueueMap;
<a name="l00059"></a>00059
<a name="l00060"></a>00060 <span class="keyword">private</span>:
<a name="l00061"></a>00061 <a class="code" href="classUsb_1_1Device.html">Usb::Device</a> * <span class="keyword">volatile</span> m_dev;
<a name="l00062"></a>00062 <span class="keyword">volatile</span> <span class="keywordtype">int</span> m_writeEp, m_readEp;
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <span class="keyword">volatile</span> <span class="keywordtype">bool</span> m_interest; <span class="comment">// true if at least one socket has an interest.</span>
<a name="l00065"></a>00065 <span class="comment">// used to optimize the reading</span>
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="keyword">mutable</span> pthread_mutex_t m_mutex;<span class="comment">// controls access to local data, but not</span>
<a name="l00068"></a>00068 <span class="comment">// DataQueues, as they have their own</span>
<a name="l00069"></a>00069 <span class="comment">// locking per queue</span>
<a name="l00070"></a>00070
<a name="l00071"></a>00071 pthread_mutex_t m_readwaitMutex;
<a name="l00072"></a>00072 pthread_cond_t m_readwaitCond;
<a name="l00073"></a>00073
<a name="l00074"></a>00074 <a class="code" href="classBarry_1_1DataQueue.html" title="This class provides a thread aware fifo queue for Data objects, providing memory...">DataQueue</a> m_free;
<a name="l00075"></a>00075 <a class="code" href="classBarry_1_1DataQueue.html" title="This class provides a thread aware fifo queue for Data objects, providing memory...">DataQueue</a> m_default;
<a name="l00076"></a>00076 SocketQueueMap m_socketQueues;
<a name="l00077"></a>00077
<a name="l00078"></a>00078 <span class="comment">// thread state</span>
<a name="l00079"></a>00079 pthread_t m_usb_read_thread;
<a name="l00080"></a>00080 <span class="keyword">volatile</span> <span class="keywordtype">bool</span> m_continue_reading;<span class="comment">// set to true when the thread is created,</span>
<a name="l00081"></a>00081 <span class="comment">// then set to false in the destructor</span>
<a name="l00082"></a>00082 <span class="comment">// to signal the end of the thread</span>
<a name="l00083"></a>00083 <span class="comment">// and handle the join</span>
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="keyword">protected</span>:
<a name="l00086"></a>00086 <span class="comment">// Provides a method of returning a buffer to the free queue</span>
<a name="l00087"></a>00087 <span class="comment">// after processing. The DataHandle class calls this automatically</span>
<a name="l00088"></a>00088 <span class="comment">// from its destructor.</span>
<a name="l00089"></a>00089 <span class="keywordtype">void</span> ReturnBuffer(<a class="code" href="classBarry_1_1Data.html">Data</a> *buf);
<a name="l00090"></a>00090
<a name="l00091"></a>00091 <span class="comment">// Thread function for the simple read behaviour... thread is</span>
<a name="l00092"></a>00092 <span class="comment">// created in the SpinoffSimpleReadThread() member below.</span>
<a name="l00093"></a>00093 <span class="keyword">static</span> <span class="keywordtype">void</span> *SimpleReadThread(<span class="keywordtype">void</span> *userptr);
<a name="l00094"></a>00094
<a name="l00095"></a>00095 <span class="keyword">public</span>:
<a name="l00096"></a>00096 <a class="code" href="classBarry_1_1SocketRoutingQueue.html">SocketRoutingQueue</a>(<span class="keywordtype">int</span> prealloc_buffer_count = 4);
<a name="l00097"></a>00097 ~<a class="code" href="classBarry_1_1SocketRoutingQueue.html">SocketRoutingQueue</a>();
<a name="l00098"></a>00098
<a name="l00099"></a>00099 <span class="comment">//</span>
<a name="l00100"></a>00100 <span class="comment">// data access</span>
<a name="l00101"></a>00101 <span class="comment">//</span>
<a name="l00102"></a>00102 <span class="keywordtype">int</span> GetWriteEp()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> m_writeEp; }
<a name="l00103"></a>00103 <span class="keywordtype">int</span> GetReadEp()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> m_readEp; }
<a name="l00104"></a>00104
<a name="l00105"></a>00105
<a name="l00106"></a>00106 <span class="comment">// These functions connect the router to an external Usb::Device</span>
<a name="l00107"></a>00107 <span class="comment">// object. Normally this is handled automatically by the</span>
<a name="l00108"></a>00108 <span class="comment">// Controller class, but are public here in case they are needed.</span>
<a name="l00109"></a>00109 <span class="keywordtype">void</span> SetUsbDevice(<a class="code" href="classUsb_1_1Device.html">Usb::Device</a> *dev, <span class="keywordtype">int</span> writeEp, <span class="keywordtype">int</span> readEp);
<a name="l00110"></a>00110 <span class="keywordtype">void</span> ClearUsbDevice();
<a name="l00111"></a>00111 <span class="keywordtype">bool</span> UsbDeviceReady();
<a name="l00112"></a>00112 <a class="code" href="classUsb_1_1Device.html">Usb::Device</a>* GetUsbDevice() { <span class="keywordflow">return</span> m_dev; }
<a name="l00113"></a>00113
<a name="l00114"></a>00114 <span class="comment">// This class starts out with no buffers, and will grow one buffer</span>
<a name="l00115"></a>00115 <span class="comment">// at a time if needed. Call this to allocate count buffers</span>
<a name="l00116"></a>00116 <span class="comment">// all at once and place them on the free queue.</span>
<a name="l00117"></a>00117 <span class="keywordtype">void</span> AllocateBuffers(<span class="keywordtype">int</span> count);
<a name="l00118"></a>00118
<a name="l00119"></a>00119 <span class="comment">// Returns the data for the next unregistered socket.</span>
<a name="l00120"></a>00120 <span class="comment">// Blocks until timeout or data is available.</span>
<a name="l00121"></a>00121 <span class="comment">// Returns false (or null pointer) on timeout and no data.</span>
<a name="l00122"></a>00122 <span class="comment">// With the return version of the function, there is no</span>
<a name="l00123"></a>00123 <span class="comment">// copying performed.</span>
<a name="l00124"></a>00124 <span class="keywordtype">bool</span> DefaultRead(Data &receive, <span class="keywordtype">int</span> timeout = -1);
<a name="l00125"></a>00125 DataHandle DefaultRead(<span class="keywordtype">int</span> timeout = -1);
<a name="l00126"></a>00126
<a name="l00127"></a>00127 <span class="comment">// Register an interest in data from a certain socket. To read</span>
<a name="l00128"></a>00128 <span class="comment">// from that socket, use the SocketRead() function from then on.</span>
<a name="l00129"></a>00129 <span class="comment">// Any non-registered socket goes in the default queue</span>
<a name="l00130"></a>00130 <span class="comment">// and must be read by DefaultRead()</span>
<a name="l00131"></a>00131 <span class="comment">// If not null, handler is called when new data is read. It will</span>
<a name="l00132"></a>00132 <span class="comment">// be called in the same thread instance that DoRead() is called from.</span>
<a name="l00133"></a>00133 <span class="comment">// Handler is passed the DataQueue Data pointer, and so no</span>
<a name="l00134"></a>00134 <span class="comment">// copying is done. Once the handler returns, the data is</span>
<a name="l00135"></a>00135 <span class="comment">// considered processed and not added to the interested queue,</span>
<a name="l00136"></a>00136 <span class="comment">// but instead returned to m_free.</span>
<a name="l00137"></a>00137 <span class="keywordtype">void</span> RegisterInterest(SocketId socket, SocketDataHandler handler = 0, <span class="keywordtype">void</span> *context = 0);
<a name="l00138"></a>00138
<a name="l00139"></a>00139 <span class="comment">// Unregisters interest in data from the given socket, and discards</span>
<a name="l00140"></a>00140 <span class="comment">// any existing data in its interest queue. Any new incoming data</span>
<a name="l00141"></a>00141 <span class="comment">// for this socket will be placed in the default queue.</span>
<a name="l00142"></a>00142 <span class="keywordtype">void</span> UnregisterInterest(SocketId socket);
<a name="l00143"></a>00143
<a name="l00144"></a>00144 <span class="comment">// Reads data from the interested socket cache. Can only read</span>
<a name="l00145"></a>00145 <span class="comment">// from sockets that have been previously registered.</span>
<a name="l00146"></a>00146 <span class="comment">// Blocks until timeout or data is available.</span>
<a name="l00147"></a>00147 <span class="comment">// Returns false (or null pointer) on timeout and no data.</span>
<a name="l00148"></a>00148 <span class="comment">// With the return version of the function, there is no</span>
<a name="l00149"></a>00149 <span class="comment">// copying performed.</span>
<a name="l00150"></a>00150 <span class="keywordtype">bool</span> SocketRead(SocketId socket, Data &receive, <span class="keywordtype">int</span> timeout = -1);
<a name="l00151"></a>00151 DataHandle SocketRead(SocketId socket, <span class="keywordtype">int</span> timeout = -1);
<a name="l00152"></a>00152
<a name="l00153"></a>00153 <span class="comment">// Returns true if data is available for that socket.</span>
<a name="l00154"></a>00154 <span class="keywordtype">bool</span> IsAvailable(SocketId socket) <span class="keyword">const</span>;
<a name="l00155"></a>00155
<a name="l00156"></a>00156 <span class="comment">// Called by the application's "read thread" to read the next usb</span>
<a name="l00157"></a>00157 <span class="comment">// packet and route it to the correct queue. Returns after every</span>
<a name="l00158"></a>00158 <span class="comment">// read, even if a handler is associated with a queue.</span>
<a name="l00159"></a>00159 <span class="comment">// Note: this function is safe to call before SetUsbDevice() is</span>
<a name="l00160"></a>00160 <span class="comment">// called... it just doesn't do anything if there is no usb</span>
<a name="l00161"></a>00161 <span class="comment">// device to work with.</span>
<a name="l00162"></a>00162 <span class="comment">//</span>
<a name="l00163"></a>00163 <span class="comment">// Timeout is in milliseconds.</span>
<a name="l00164"></a>00164 <span class="comment">//</span>
<a name="l00165"></a>00165 <span class="comment">// Returns false in the case of USB errors, and puts the error</span>
<a name="l00166"></a>00166 <span class="comment">// message in msg.</span>
<a name="l00167"></a>00167 <span class="keywordtype">bool</span> DoRead(std::string &msg, <span class="keywordtype">int</span> timeout = -1);
<a name="l00168"></a>00168
<a name="l00169"></a>00169 <span class="comment">// Utility function to make it easier for the user to create the</span>
<a name="l00170"></a>00170 <span class="comment">// USB pure-read thread. If the user wants anything more complicated</span>
<a name="l00171"></a>00171 <span class="comment">// in this background thread, he can implement it himself and call</span>
<a name="l00172"></a>00172 <span class="comment">// the above DoRead() in a loop. If only the basics are needed,</span>
<a name="l00173"></a>00173 <span class="comment">// then this makes it easy.</span>
<a name="l00174"></a>00174 <span class="comment">// Throws Barry::ErrnoError on thread creation error.</span>
<a name="l00175"></a>00175 <span class="keywordtype">void</span> SpinoffSimpleReadThread();
<a name="l00176"></a>00176 };
<a name="l00177"></a>00177
<a name="l00178"></a>00178
<a name="l00179"></a>00179 <span class="comment">//</span>
<a name="l00180"></a>00180 <span class="comment">// DataHandle</span>
<a name="l00181"></a>00181 <span class="comment">//</span><span class="comment"></span>
<a name="l00182"></a>00182 <span class="comment">/// std::auto_ptr like class that handles pointers to Data, but instead of</span>
<a name="l00183"></a>00183 <span class="comment">/// freeing them completely, the Data objects are turned to the</span>
<a name="l00184"></a>00184 <span class="comment">/// SocketRoutingQueue from whence they came.</span>
<a name="l00185"></a>00185 <span class="comment">///</span>
<a name="l00186"></a><a class="code" href="classBarry_1_1DataHandle.html">00186</a> <span class="comment"></span><span class="keyword">class </span>BXEXPORT <a class="code" href="classBarry_1_1DataHandle.html" title="std::auto_ptr like class that handles pointers to Data, but instead of freeing them...">DataHandle</a>
<a name="l00187"></a>00187 {
<a name="l00188"></a>00188 <span class="keyword">private</span>:
<a name="l00189"></a>00189 <a class="code" href="classBarry_1_1SocketRoutingQueue.html">SocketRoutingQueue</a> &m_queue;
<a name="l00190"></a>00190 <span class="keyword">mutable</span> <a class="code" href="classBarry_1_1Data.html">Data</a> *m_data;
<a name="l00191"></a>00191
<a name="l00192"></a>00192 <span class="keyword">protected</span>:
<a name="l00193"></a>00193 <span class="keywordtype">void</span> clear()
<a name="l00194"></a>00194 {
<a name="l00195"></a>00195 <span class="keywordflow">if</span>( m_data ) {
<a name="l00196"></a>00196 m_queue.ReturnBuffer(m_data);
<a name="l00197"></a>00197 m_data = 0;
<a name="l00198"></a>00198 }
<a name="l00199"></a>00199 }
<a name="l00200"></a>00200
<a name="l00201"></a>00201 <span class="keyword">public</span>:
<a name="l00202"></a>00202 <a class="code" href="classBarry_1_1DataHandle.html" title="std::auto_ptr like class that handles pointers to Data, but instead of freeing them...">DataHandle</a>(<a class="code" href="classBarry_1_1SocketRoutingQueue.html">SocketRoutingQueue</a> &q, <a class="code" href="classBarry_1_1Data.html">Data</a> *data)
<a name="l00203"></a>00203 : m_queue(q)
<a name="l00204"></a>00204 , m_data(data)
<a name="l00205"></a>00205 {
<a name="l00206"></a>00206 }
<a name="l00207"></a>00207
<a name="l00208"></a>00208 <a class="code" href="classBarry_1_1DataHandle.html" title="std::auto_ptr like class that handles pointers to Data, but instead of freeing them...">DataHandle</a>(<span class="keyword">const</span> <a class="code" href="classBarry_1_1DataHandle.html" title="std::auto_ptr like class that handles pointers to Data, but instead of freeing them...">DataHandle</a> &other)
<a name="l00209"></a>00209 : m_queue(other.m_queue)
<a name="l00210"></a>00210 , m_data(other.m_data)
<a name="l00211"></a>00211 {
<a name="l00212"></a>00212 <span class="comment">// we now own the pointer</span>
<a name="l00213"></a>00213 other.m_data = 0;
<a name="l00214"></a>00214 }
<a name="l00215"></a>00215
<a name="l00216"></a>00216 ~<a class="code" href="classBarry_1_1DataHandle.html" title="std::auto_ptr like class that handles pointers to Data, but instead of freeing them...">DataHandle</a>()
<a name="l00217"></a>00217 {
<a name="l00218"></a>00218 clear();
<a name="l00219"></a>00219 }
<a name="l00220"></a>00220
<a name="l00221"></a>00221 <a class="code" href="classBarry_1_1Data.html">Data</a>* <span class="keyword">get</span>()
<a name="l00222"></a>00222 {
<a name="l00223"></a>00223 <span class="keywordflow">return</span> m_data;
<a name="l00224"></a>00224 }
<a name="l00225"></a>00225
<a name="l00226"></a>00226 <a class="code" href="classBarry_1_1Data.html">Data</a>* release() <span class="comment">// no longer owns the pointer</span>
<a name="l00227"></a>00227 {
<a name="l00228"></a>00228 <a class="code" href="classBarry_1_1Data.html">Data</a> *ret = m_data;
<a name="l00229"></a>00229 m_data = 0;
<a name="l00230"></a>00230 <span class="keywordflow">return</span> ret;
<a name="l00231"></a>00231 }
<a name="l00232"></a>00232
<a name="l00233"></a>00233 <a class="code" href="classBarry_1_1Data.html">Data</a>* operator->()
<a name="l00234"></a>00234 {
<a name="l00235"></a>00235 <span class="keywordflow">return</span> m_data;
<a name="l00236"></a>00236 }
<a name="l00237"></a>00237
<a name="l00238"></a>00238 <span class="keyword">const</span> <a class="code" href="classBarry_1_1Data.html">Data</a>* operator->()<span class="keyword"> const</span>
<a name="l00239"></a>00239 <span class="keyword"> </span>{
<a name="l00240"></a>00240 <span class="keywordflow">return</span> m_data;
<a name="l00241"></a>00241 }
<a name="l00242"></a>00242
<a name="l00243"></a>00243 <a class="code" href="classBarry_1_1DataHandle.html" title="std::auto_ptr like class that handles pointers to Data, but instead of freeing them...">DataHandle</a>& operator=(<span class="keyword">const</span> <a class="code" href="classBarry_1_1DataHandle.html" title="std::auto_ptr like class that handles pointers to Data, but instead of freeing them...">DataHandle</a> &other)
<a name="l00244"></a>00244 {
<a name="l00245"></a>00245 <span class="keywordflow">if</span>( &m_queue != &other.m_queue )
<a name="l00246"></a>00246 <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"Trying to copy DataHandles of different queues!"</span>);
<a name="l00247"></a>00247
<a name="l00248"></a>00248 <span class="comment">// remove our current data</span>
<a name="l00249"></a>00249 clear();
<a name="l00250"></a>00250
<a name="l00251"></a>00251 <span class="comment">// accept the new</span>
<a name="l00252"></a>00252 m_data = other.m_data;
<a name="l00253"></a>00253
<a name="l00254"></a>00254 <span class="comment">// we now own it</span>
<a name="l00255"></a>00255 other.m_data = 0;
<a name="l00256"></a>00256
<a name="l00257"></a>00257 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00258"></a>00258 }
<a name="l00259"></a>00259
<a name="l00260"></a>00260 };
<a name="l00261"></a>00261
<a name="l00262"></a>00262
<a name="l00263"></a>00263 } <span class="comment">// namespace Barry</span>
<a name="l00264"></a>00264
<a name="l00265"></a>00265 <span class="preprocessor">#endif</span>
<a name="l00266"></a>00266 <span class="preprocessor"></span>
</pre></div></div>
<hr class="footer"/><address style="text-align: right;"><small>Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.2-20100208 </small></address>
</body>
</html>
