//  $Id$
// 
//  Pingus - A free Lemmings clone
//  Copyright (C) 2000 Ingo Ruhnke <grumbel@gmx.de>
//
//  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 PRIORITYQUEUE_HH
#define PRIORITYQUEUE_HH

#include <algorithm>
#include <deque>

template<class Ty,
	 class Container = std::vector<T>,
	 class Pr = less<typename Container::value_type> >
class PriorityQueue
{
private:
  typedef Container container_type;
  typedef typename Container::value_type value_type;
  typedef typename Container::size_type size_type;

  Container seq;

public:
  PriorityQueue ();
  ~PriorityQueue ();

  bool empty () const {
    return seq.empty ();
  }

  size_type size () {
    return seq.size ();
  }

  void push (const value_type& value)
  {
    seq.push_back (value);
    stable_sort (seq, Pr);
  }

  void pop () {
    seq.pop_back ();
  }
};

#endif

/* EOF */