Woolz Image Processing  Version 1.8.3
Data Fields
_AlcCPQQueue Struct Reference
AlcCPQ

An \(O(1)\) priority queue based on the Calendar Priority Queue data structure. Typedef: AlcCPQQueue. More...

Data Fields

int nItem
 
int nBucket
 
int nItemIncThr
 
int nItemDecThr
 
int lastIdx
 
int itemBlockSz
 
int bucketBase
 
int maxBucket
 
int resizable
 
float lastPriority
 
double bucketWidth
 
double bucketMin
 
struct _AlcCPQItem ** buckets
 
struct _AlcCPQItem * freeItem
 
struct _AlcBlockStack * freeStack
 

Detailed Description

An \(O(1)\) priority queue based on the Calendar Priority Queue data structure. Typedef: AlcCPQQueue.

Field Documentation

◆ nItem

int _AlcCPQQueue::nItem

Number of items in the queue.

Referenced by AlcCPQItemInsert(), AlcCPQItemUnlink(), and AlcCPQQueueNew().

◆ nBucket

int _AlcCPQQueue::nBucket

Number of buckets for items.

Referenced by AlcCPQItemUnlink(), and AlcCPQQueueNew().

◆ nItemIncThr

int _AlcCPQQueue::nItemIncThr

Threshold number of items, at which the number of buckets is increased.

Referenced by AlcCPQItemInsert(), and AlcCPQQueueNew().

◆ nItemDecThr

int _AlcCPQQueue::nItemDecThr

Threshold number of items, at which the number of buckets is decreased.

Referenced by AlcCPQQueueNew().

◆ lastIdx

int _AlcCPQQueue::lastIdx

The index (offset by bucketBase) of the last bucket from which an item was dequeued or the index of a top priority item that has been inserted. A negative value is used to indicate that the index is invalid.

Referenced by AlcCPQItemUnlink(), and AlcCPQQueueNew().

◆ itemBlockSz

int _AlcCPQQueue::itemBlockSz

Number of items allocated in each block by AlcBlockStackNew().

Referenced by AlcCPQQueueNew().

◆ bucketBase

int _AlcCPQQueue::bucketBase

The offset into the allocated buckets of the current buckets.

Referenced by AlcCPQItemUnlink(), and AlcCPQQueueNew().

◆ maxBucket

int _AlcCPQQueue::maxBucket

The total number of buckets that have been allocated.

Referenced by AlcCPQQueueNew().

◆ resizable

int _AlcCPQQueue::resizable

Non-zero if the queue is resizable.

Referenced by AlcCPQItemInsert(), and AlcCPQQueueNew().

◆ lastPriority

float _AlcCPQQueue::lastPriority

The priority of either the last item dequeued or of the top priority item that has been inserted.

Referenced by AlcCPQQueueNew().

◆ bucketWidth

double _AlcCPQQueue::bucketWidth

The width of each bucket.

Referenced by AlcCPQItemUnlink(), and AlcCPQQueueNew().

◆ bucketMin

double _AlcCPQQueue::bucketMin

The minimum priority for the bucket with (offset) index lastIdx. A negative value is used to indicate that the minimum priority is invalid.

Referenced by AlcCPQItemUnlink(), and AlcCPQQueueNew().

◆ buckets

struct _AlcCPQItem** _AlcCPQQueue::buckets

Contiguous array of buckets.

Referenced by AlcCPQItemUnlink(), AlcCPQQueueFree(), and AlcCPQQueueNew().

◆ freeItem

struct _AlcCPQItem* _AlcCPQQueue::freeItem

List of items available for use in the priority queue.

Referenced by AlcCPQItemFree(), and AlcCPQItemNew().

◆ freeStack

struct _AlcBlockStack* _AlcCPQQueue::freeStack

Free stack used to efficiently allocate and free blocks of queue items.

Referenced by AlcCPQQueueFree().

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