bqueuet.cc

Go to the documentation of this file.

/*--------------------------------------------------------------------
 *
 * (C) Copyright Koninklijke Philips Electronics NV 2006. 
 * All rights reserved. This software is licensed under the terms of
 * version 2.1 of the GNU Lesser General Public License as published 
 * by the Free Software Foundation. For licensing and warranty
 * information, see the file COPYING in the main directory.
 *
 *------------------------------------------------------------------*/

#ifndef BQUEUET_CC
#define BQUEUET_CC

#include <minmax.h>
#include <assert.h>

template<class T> inline
bqueueT<T>::bqueueT(unsigned int sz)
{
  begin = new T [sz];
  end   = begin + sz;
  r = w = begin;
  d = 0;
}

template<class T> inline
bqueueT<T>::~bqueueT()
{
  delete [] begin;
}

template<class T> inline
unsigned int bqueueT<T>::size() const
{
  return end - begin;
}

template<class T> inline
unsigned int bqueueT<T>::data() const
{
  return d;
}

template<class T> inline
unsigned int bqueueT<T>::room() const
{
  return size() - data();
}


template<class T> inline
void bqueueT<T>::put(const T& value)
{
  *w = value;
  if (++w == end) w = begin;
  d++;
}

template<class T> inline
void bqueueT<T>::get(T& value)
{
  value = *r;
  if (++r == end) r = begin;
  d--;
}

template<class T> inline
void bqueueT<T>::put(const T* p, unsigned int n)
{
  unsigned int a = end - w;
  if (n <= a) {
    copy(p, p+n, w);
    w += n;
    if (w == end) w = begin;
  } else {
    unsigned int b = n - a;
    copy(p,   p+a, w);
    copy(p+a, p+n, begin);
    w = begin + b;
  }
  d += n;
}

template<class T> inline
void bqueueT<T>::get(T* p, unsigned int n)
{
  unsigned int a = end - r;
  if (n <= a) {
    copy(r, r+n, p);
    r += n;
    if (r == end) r = begin;
  } else {
    unsigned int b = n - a;
    copy(r,     end,     p);
    copy(begin, begin+b, p+a);
    r = begin + b;
  }
  d -= n;
}

template<class T> inline
void bqueueT<T>::resize(unsigned int sz)
{
  assert(d <= sz);
  T* p = new T [sz];
  unsigned int a = end - r;
  if (d <= a) {
    copy(r, r+d, p);
  } else {
    unsigned int b = d - a;
    copy(r,     end,     p);
    copy(begin, begin+b, p+a);
  }
  delete [] begin;
  begin = p;
  r     = p;
  w     = p + d;
  end   = p + sz;
}

#endif

---