BucketPrioQueue< T > Class Template Reference

Priority queue for integer coordinates with squared distances as priority. More...

#include <bucketedqueue.h>

List of all members.

Public Member Functions
	BucketPrioQueue ()
	Standard constructor.
void	clear ()
bool	empty ()
	Checks whether the Queue is empty.
int	getNumBuckets ()
T	pop ()
	return and pop the element with the lowest squared distance */
void	push (int prio, T t)
	push an element
int	size ()
Private Types
typedef std::map< int, std::queue< T > >	BucketType
Private Attributes
BucketType	buckets
int	count
BucketType::iterator	nextPop

---

Detailed Description

template<typename T>
class BucketPrioQueue< T >

Priority queue for integer coordinates with squared distances as priority.

dynamicEDT3D: A library for incrementally updatable Euclidean distance transforms in 3D.

Author:

C. Sprunk, B. Lau, W. Burgard, University of Freiburg, Copyright (C) 2011.

See also:

http://octomap.sourceforge.net/ License: New BSD License A priority queue that uses buckets to group elements with the same priority. The individual buckets are unsorted, which increases efficiency if these groups are large. The elements are assumed to be integer coordinates, and the priorities are assumed to be squared euclidean distances (integers).

Definition at line 57 of file bucketedqueue.h.

---

Member Typedef Documentation

template<typename T>

typedef std::map< int, std::queue<T> > BucketPrioQueue< T >::BucketType [private]

Definition at line 82 of file bucketedqueue.h.

---

Constructor & Destructor Documentation

template<typename T>

BucketPrioQueue< T >::BucketPrioQueue

(

)

Standard constructor.

Standard constructor. When called for the first time it creates a look up table that maps square distanes to bucket numbers, which might take some time...

---

Member Function Documentation

template<typename T>

void BucketPrioQueue< T >::clear

(

)

[inline]

Definition at line 66 of file bucketedqueue.h.

template<typename T>

bool BucketPrioQueue< T >::empty

(

)

Checks whether the Queue is empty.

template<typename T>

int BucketPrioQueue< T >::getNumBuckets

(

)

[inline]

Definition at line 76 of file bucketedqueue.h.

template<typename T>

T BucketPrioQueue< T >::pop

(

)

return and pop the element with the lowest squared distance */

template<typename T>

void BucketPrioQueue< T >::push	(	int	prio,
		T	t
	)

push an element

template<typename T>

int BucketPrioQueue< T >::size

(

)

[inline]

Definition at line 75 of file bucketedqueue.h.

---

Member Data Documentation

template<typename T>

BucketType BucketPrioQueue< T >::buckets [private]

Definition at line 83 of file bucketedqueue.h.

template<typename T>

int BucketPrioQueue< T >::count [private]

Definition at line 80 of file bucketedqueue.h.

template<typename T>

BucketType::iterator BucketPrioQueue< T >::nextPop [private]

Definition at line 84 of file bucketedqueue.h.

---

The documentation for this class was generated from the following file:

• bucketedqueue.h