///
///  Copyright (C) 2009 Ziga Lenarcic <zigalenarcic@users.sourceforge.net>
///
///  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
///


#ifndef EVALUATIONQUEUE_H_
#define EVALUATIONQUEUE_H_

#include "GroupCell.h"

class EvaluationQueueElement {
  public:
    EvaluationQueueElement(GroupCell* gr);
    ~EvaluationQueueElement() {
    }
    GroupCell* group;
    EvaluationQueueElement* next;
};

// A simple FIFO queue with manual removal of elements
class EvaluationQueue
{
  public:
    EvaluationQueue();
    ~EvaluationQueue() {};

    bool IsInQueue(GroupCell* gr);

    void AddToQueue(GroupCell* gr);
    void RemoveFirst();
    GroupCell* GetFirst();
  private:
    EvaluationQueueElement* m_queue;
    EvaluationQueueElement* m_last;
};


#endif /* EVALUATIONQUEUE_H_ */
