asynchronous ~master (2018-06-27T00:00:59Z)

PriorityQueue

asynchronous queues

A subclass of $(D_PSYMBOL Queue); retrieves entries in priority order (largest first).

Entries are typically tuples of the form: (priority number, data).

class PriorityQueue : Queue!(T, maxSize)(
T
size_t maxSize = 0
alias less = "a < b"
) {
import std.container : BinaryHeap;;
this(EventLoop eventLoop);
T get_();
void put_(T item);
}

Constructors

this
this(EventLoop eventLoop)
Undocumented in source.

Members

Functions

get_
T get_()
Undocumented in source. Be warned that the author may not have intended to support it.
put_
void put_(T item)
Undocumented in source. Be warned that the author may not have intended to support it.

Meta

Source

See Implementation

asynchronous queues classes

Page generated by adrdox