---

PriorityQueue.h

// PriorityQueue.h: interface for the CPriorityQueue class.
//

#if !defined(AFX_PRIORITYQUEUE_H__34D82301_A1F5_45A7_A519_566379E66DB4__INCLUDED_)
#define AFX_PRIORITYQUEUE_H__34D82301_A1F5_45A7_A519_566379E66DB4__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#include "Queue.h"
class CPriorityQueue : public CQueue  
{       
        class PriorPix {
        public:
                LPPIXEL p;
                short parity;
        };
        class PixGreater {
        public:
                bool operator()(PriorPix p1, PriorPix p2) const {return *(p1.p)>*(p2.p); }
        };
        priority_queue<PriorPix, vector<PriorPix>, PixGreater > pqueue;

public:
        CPriorityQueue() {
        };
        virtual ~CPriorityQueue() {
                while (!pqueue.empty()) {
                        pqueue.pop();
                }
        };

        inline bool empty() {
                return (pqueue.empty());
        };
        inline void first(LPPIXEL *p) {
                PriorPix pp = pqueue.top();
                *p = pp.p;
                pqueue.pop();
        };
        inline void first(LPPIXEL *p, short *parity) {
                PriorPix pp = pqueue.top();
                *p = pp.p;
                *parity = pp.parity;
                pqueue.pop();
        };
        inline void add(LPPIXEL p) {
                PriorPix pp;
                pp.p = p;
                pp.parity = 0;
                pqueue.push(pp);
        };
        inline void add(LPPIXEL p, short parity) {
                PriorPix pp;
                pp.p = p;
                pp.parity = parity;
                pqueue.push(pp);
        };
        inline void invert() {
                // not possible
        };
};

#endif // !defined(AFX_PRIORITYQUEUE_H__34D82301_A1F5_45A7_A519_566379E66DB4__INCLUDED_)

---