PriorityQueue

Implementation of priority queue

struct PriorityQueue {

this(size_t capacity);

void push(OutboundItem item);

OutboundItem top [@property getter];

bool empty [@property getter];

size_t length [@property getter];

int opApply(int delegate(OutboundItem ob) del);

int opApply(int delegate(const OutboundItem ob) del);

static int compare(OutboundItem lhs, OutboundItem rhs);

}

Constructors

this this(size_t capacity): Undocumented in source.

Members

Functions

free void free(): Deallocates any resources allocated. All stored items are freed by this function.
opApply int opApply(int delegate(OutboundItem ob) del): Iterates over each item in the PriorityQueue and reorders it
opApply int opApply(int delegate(const OutboundItem ob) del): Iterates over each item in the PriorityQueue
pop void pop(): Undocumented in source. Be warned that the author may not have intended to support it.
push void push(OutboundItem item): Adds |item| to the priority queue

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.
top OutboundItem top [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.

Static functions

compare int compare(OutboundItem lhs, OutboundItem rhs): Undocumented in source. Be warned that the author may not have intended to support it.

Meta

Source

See Implementation

libhttp2 priority_queue structs

PriorityQueue