This is a priority queue for border points. More...
#include <route.h>
Collaboration diagram for a2dRouteData::BorderQueue:
Classes | |
| struct | AllocBlock |
| Memory allocation block. More... | |
Public Member Functions | |
| BorderQueue () | |
| constructor | |
| ~BorderQueue () | |
| destructor | |
| void | Add (const BorderPoint &brdr) |
| Add a border object. | |
| const BorderPoint & | GetBest () |
| Get the best border point. | |
| void | RmvBest () |
| Remove the best border point. | |
| bool | IsNotEmpty () |
| Check if the queue is empty. | |
Protected Types | |
| enum | { m_ncost = 1024, m_costmask = 1023 } |
| some constants More... | |
Protected Attributes | |
| unsigned | m_mincostindex |
| ring index of the current minimum cost (starting point or ring buffer ) | |
| BorderPoint * | m_costring [m_ncost] |
| The starting points of the cost lists. | |
| BorderPoint * | m_freelist |
| The starting point of the free list. | |
| AllocBlock * | m_memory |
| Current memory allocation block. | |
| int | m_freememory |
| Number of free elements in memory allocation block. | |
Detailed Description
This is a priority queue for border points.
This queue makes use of the following facts:
- The priorities (costs) are discrete
- As the relative cost from one point to its next is limited, there can only be priorities from the current min-priority to min-priority + max-dist in the queue, so a ring buffer can be used
- priorities added to the list are always larger than the smallest priority in the list (step cost is >0).
Member Enumeration Documentation
|
protected |
The documentation for this class was generated from the following files: