---

HierarchicalQueue.h

// HierarchicalQueue.h: interface for the CHierarchicalQueue class.
//

#if !defined(AFX_HIERARCHICALQUEUE_H__2E7CF594_00AC_4542_A133_E8188A04FBAD__INCLUDED_)
#define AFX_HIERARCHICALQUEUE_H__2E7CF594_00AC_4542_A133_E8188A04FBAD__INCLUDED_

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

#include "Queue.h"

class CHierarchicalQueue : public CQueue  
{
  int size;
  deque<LPPIXEL> *hQueue;
  deque<short> *hQparity;
  deque<LPPIXEL> priorityQueue;
  deque<short> priorityQueueParity;

  PIXEL currentLevel;

public:
        CHierarchicalQueue(int sizeQueue=256){
          size = sizeQueue;
          hQueue = new deque<LPPIXEL>[size];
          hQparity = new deque<short>[size];
          currentLevel = 0;
        };
        ~CHierarchicalQueue() {
                priorityQueue.clear();
                priorityQueueParity.clear();
                for (int i=0; i<size; i++) {
                        hQueue[i].clear();
                        hQparity[i].clear();
                }
                delete [] hQueue;
                delete [] hQparity;
        };

        inline bool empty() {
          return (priorityQueue.empty() && hQueue[currentLevel].empty());
        };

        inline void first(LPPIXEL *p) {
          if (!priorityQueue.empty()) {
            *p = priorityQueue.front();
                priorityQueue.pop_front();
            return;
          }
          if (hQueue[currentLevel].empty()) { 
            // We have removed the last element in the level
            do currentLevel++;
            while ((currentLevel<size)
                   && hQueue[currentLevel].empty());
          }
          *p = hQueue[currentLevel].front();
          hQueue[currentLevel].pop_front();
          return;
        };

        inline void first(LPPIXEL *p, short *parity) {
          if (!priorityQueue.empty()) {
            *p = priorityQueue.front();
                priorityQueue.pop_front();
                *parity = priorityQueueParity.front();
                priorityQueueParity.pop_front();
                return;
          }
          if (hQueue[currentLevel].empty()) { 
            // We have removed the last element in the level
            do currentLevel++;
            while ((currentLevel<size)
                   && hQueue[currentLevel].empty());
          }
          *p = hQueue[currentLevel].front();
          hQueue[currentLevel].pop_front();
          *parity = hQparity[currentLevel].front();
          hQparity[currentLevel].pop_front();
          return;
        };

        inline void add(LPPIXEL p) {
          if (*p<currentLevel) {
            priorityQueue.push_front(p);
            return;
          }
          hQueue[*p].push_front(p);
          return;
        };

        inline void add(LPPIXEL p, short parity) {
          if (*p<currentLevel) {
            priorityQueue.push_front(p);
            priorityQueueParity.push_front(parity);
            return;
          }
          hQueue[*p].push_front(p);
          hQparity[*p].push_front(parity);
          return;
        };

        inline void invert() {
                // not possible
        };
};

#endif // !defined(AFX_HIERARCHICALQUEUE_H__2E7CF594_00AC_4542_A133_E8188A04FBAD__INCLUDED_)

---