PriorityQueue

Priority Queue. P is Priority Type. Lower priority means higher precedence in queue. V is Value Type.

struct PriorityQueue (

P

V

alias pred = "a > b"

) {

import std.container : Array, BinaryHeap;;

import std.container : Array, BinaryHeap;;

import std.typecons : Tuple;;

alias E = Tuple!(P, V);

alias A = Array!E;

bool empty [@property getter];

auto ref front [@property getter];

auto length [@property getter];

void insert(E ins);

void insert(P priority, V value);

void popFront();

}

Postblit

this(this) this(this): Undocumented in source.

Members

Aliases

A alias A = Array!E: Undocumented in source.
E alias E = Tuple!(P, V): Undocumented in source.

Functions

insert void insert(E ins): Undocumented in source. Be warned that the author may not have intended to support it.
insert void insert(P priority, V value): Undocumented in source. Be warned that the author may not have intended to support it.
popFront void popFront(): 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.
front auto ref front [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.
length auto length [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.

Meta

Source

See Implementation

nxt priority_queue aliases

PrioQ

structs

PriorityQueue