template <class T>
queueRingBuffer<T>::queueRingBuffer( unsigned int max )
{
+ count = 0;
// constructor for queues based on ring buffers
// create the first link
T initialvalue;
// first check for potential overflow
if( lastFilled->nextLink == lastFree )
{
- eDebug("increase size %d", count);
+// eDebug("increase size %d", count);
link<T> * newLink = new link<T>( val );
newLink->prevLink = lastFilled;
newLink->nextLink = lastFilled->nextLink;