PriorityQueue

A priority queue implementation. Items with the highest priority (as defined by the supplied predicate) come off the queue first. You can change the order of the queue by supplying a custom predicate, or overriding opCmp on the type being queued.

struct PriorityQueue (

alias Predicate = "a > b"

) {

this(Stuff stuff);

void push(T value);

size_t length [@property getter];

bool empty [@property getter];

inout(T) front();

void pop();

void updateIf();

void updateIf(FindPredicate isItem, UpdateOperation update);

alias greaterThan = binaryFun!Predicate;

}

Constructors

this this(Stuff stuff): Undocumented in source.

Members

Aliases

greaterThan alias greaterThan = binaryFun!Predicate: Undocumented in source.

Functions

front inout(T) front(): Fetches a reference to the highest-priority element in the queue.
pop void pop(): Removes the highest-priority item from the queue. The queue must not be empty.
push void push(T value): Undocumented in source. Be warned that the author may not have intended to support it.
updateIf void updateIf(): Undocumented in source. Be warned that the author may not have intended to support it.
updateIf void updateIf(FindPredicate isItem, UpdateOperation update): Undocumented in source. Be warned that the author may not have intended to support it.

Properties

empty bool empty [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.
length size_t length [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.