PriorityQueue.h

Go to the documentation of this file.

// -*- C++ -*-

#if !defined(__ads_PriorityQueue_h__)
#define __ads_PriorityQueue_h__

#include "../functor/Dereference.h"

#include <vector>

BEGIN_NAMESPACE_ADS


template < typename T, 
           typename Key = typename std::iterator_traits<T>::value_type,
           class GetKey = Dereference<T>,
           class CompareKeys = std::greater<Key>, 
           class Sequence = std::vector<T> >
class PriorityQueue
{
 public:

  typedef T element_type;
  typedef const element_type& const_reference;

  typedef Key key_type;

  typedef GetKey get_key_functor;

  typedef CompareKeys compare_keys_functor;

  typedef Sequence sequence_type;

  typedef typename sequence_type::value_type value_type;
  typedef typename sequence_type::iterator iterator;
  typedef typename sequence_type::difference_type difference_type;
  typedef int size_type;

  // I don't currently use the virtual function capability.
  // It does not affect the performance much either way.
  // The FM method is a little better without virtual functions.

  /*
    public:

    //
    // Accessors
    //

    virtual
    size_type
    size() const = 0;

    virtual
    bool
    empty() const = 0;

    //
    // Manipulators
    //

    virtual
    void 
    push( element_type x ) = 0;

    virtual
    void
    pop() = 0;
  */
};

END_NAMESPACE_ADS

#endif

---