path_planner/bucketedqueue_8h_source.html

 #ifndef _PRIORITYQUEUE2_H_

 #define _PRIORITYQUEUE2_H_


 #define MAXDIST 1000

 #define RESERVE 64


 #include <vector>

 #include <set>

 #include <queue>

 #include <assert.h>

 #include "point.h"


 namespace HybridAStar {


 class BucketPrioQueue {


  public:


   BucketPrioQueue();

   bool empty();

   void push(int prio, INTPOINT t);

   INTPOINT pop();


  private:


   static void initSqrIndices();

   static std::vector<int> sqrIndices;

   static int numBuckets;

   int count;

   int nextBucket;


   std::vector<std::queue<INTPOINT> > buckets;

 };

 }

 #endif

HybridAStar::BucketPrioQueue::BucketPrioQueue
BucketPrioQueue()
Standard constructor.
Definition: bucketedqueue.cpp:13

HybridAStar::BucketPrioQueue::empty
bool empty()
Checks whether the Queue is empty.
Definition: bucketedqueue.cpp:26

HybridAStar::BucketPrioQueue::push
void push(int prio, INTPOINT t)
push an element
Definition: bucketedqueue.cpp:31

HybridAStar::BucketPrioQueue
Priority queue for integer coordinates with squared distances as priority.
Definition: bucketedqueue.h:20

HybridAStar::BucketPrioQueue::pop
INTPOINT pop()
return and pop the element with the lowest squared distance */
Definition: bucketedqueue.cpp:48