26#ifndef vtkPriorityQueue_h 
   27#define vtkPriorityQueue_h 
   29#include "vtkCommonCoreModule.h"  
   34VTK_ABI_NAMESPACE_BEGIN
 
  137    this->
Pop(loc, priority);
 
  162    return this->
Array[location].
id;
 
  174    return this->
Array[location].
id;
 
vtkIdType GetMaxId() const
What is the maximum id currently in the array.
 
dynamic, self-adjusting array of vtkIdType
 
a simple class to control print indentation
 
abstract base class for most VTK objects
 
a list of ids arranged in priority order
 
static vtkPriorityQueue * New()
Instantiate priority queue with default size and extension size of 1000.
 
double GetPriority(vtkIdType id)
Get the priority of an entry in the queue with specified id.
 
void Insert(double priority, vtkIdType id)
Insert id with priority specified.
 
Item * Resize(vtkIdType sz)
 
void Reset()
Empty the queue but without releasing memory.
 
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
 
vtkIdType GetNumberOfItems()
Return the number of items in this queue.
 
~vtkPriorityQueue() override
 
vtkIdType Pop(vtkIdType location=0)
Same as above but simplified for easier wrapping into interpreted languages.
 
vtkIdType Peek(vtkIdType location, double &priority)
Peek into the queue without actually removing anything.
 
vtkIdTypeArray * ItemLocation
 
vtkIdType Pop(vtkIdType location, double &priority)
Removes item at specified location from tree; then reorders and balances tree.
 
void Allocate(vtkIdType sz, vtkIdType ext=1000)
Allocate initial space for priority queue.
 
double DeleteId(vtkIdType id)
Delete entry in queue with specified id.