ArRingQueue.h

/*
ActivMedia Robotics Interface for Applications (ARIA)
Copyright (C) 2004,2005 ActivMedia Robotics, LLC


     This program is free software; you can redistribute it and/or modify
     it under the terms of the GNU General Public License as published by
     the Free Software Foundation; either version 2 of the License, or
     (at your option) any later version.

     This program is distributed in the hope that it will be useful,
     but WITHOUT ANY WARRANTY; without even the implied warranty of
     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
     GNU General Public License for more details.

     You should have received a copy of the GNU General Public License
     along with this program; if not, write to the Free Software
     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

If you wish to redistribute ARIA under different terms, contact 
ActivMedia Robotics for information about a commercial version of ARIA at 
robots@activmedia.com or 
ActivMedia Robotics, 19 Columbia Drive, Amherst, NH 03031; 800-639-9481

*/



#ifndef _AR_RING_QUEUE_H_
#define _AR_RING_QUEUE_H_

#include <iostream>
#include <list>
#include <ariaTypedefs.h>

template<class T> 
class ArRingQueue {
public:
  ArRingQueue(int capacity, T init_value)
    : ring(capacity, init_value), curSize(0), initval(init_value)
  {
    back_it = ring.begin(); 
    front_it = ring.end();// signals empty state
  }


  typename std::list<T>::iterator front() {
    if(empty())
      return nil();
    return front_it;
  }

  typename std::list<T>::iterator back() {
    if(front_it == back_it)
    {
      std::cerr << "ArRingQueue: back(): 0-capacity or full, returning nil.\n";
      return nil();
    }
    return back_it;
  }

  void advance_front() {
    if(front_it == ring.end())  // initial or  empty state.
      front_it = ring.begin();
    else if(++front_it == ring.end()) 
      front_it = ring.begin();
    if(front_it == back_it) { // it's now empty (not full)
      front_it = ring.end();
      back_it = ring.begin();
    }
    curSize--;
  }


  void advance_back() {
    if(front_it == back_it) // full or 0-capacity
    {
      std::cerr << "ArRingQueue: advance_back(): queue is full, can't advance back.\n";
      return;
    }
    if(++back_it == ring.end())
      back_it = ring.begin();
    if(front_it == ring.end())
      front_it = ring.begin();  // no longer empty.
    curSize++;
  }

  void push(const T& item) {
    if(full()) {
      back_it = ring.insert(back_it, item);
    } else {
      *back_it = item;
    }
    advance_back();
  }

  void push_back(const T& item) { push(item); }

  void push_without_expanding(const T& item) {
    if(full())
      advance_front();
    push(item);
  }

  T pop() {
    typename std::list<T>::iterator thing = front();
    if(front() != nil())
      advance_front();
    return (*thing);
  }

  T pop_front() { return pop(); }

  void print() {
    for(typename std::list<T>::const_iterator i = ring.begin(); i != ring.end(); i++) {
      if(i == back_it)
        std::cerr << "]";
      if(i == front_it || (i == ring.begin() && front_it == ring.end()) )
        std::cerr << "[";
      std::cerr << (*i) << "," ;
    }
    std::cerr << std::endl;
  }

  size_t size() {
    return curSize;
  }

  size_t capacity() {
    return ring.size();
  }

  bool empty() {
    return (front_it == ring.end());
  }

  void reset() {
    front_it = ring.end();
    back_it = ring.begin();
    curSize = 0;
  }

  bool full() {
    return (back_it == front_it);
  }

  typename std::list<T>::iterator nil() {
    return ring.end();
  }

protected:
  std::list<T> ring;
  typename std::list<T>::iterator front_it, back_it;   
  // push to back, pop from front; front will point to first item, 
  // back to one past last. 

  size_t curSize;
  T initval;

};



#endif

---