PairingHeap

A sequential Pairing Heap implementation of a priority queue of elements T using allocator Alloc.

struct PairingHeap (

T

Alloc

) {

enum size_t NodeSize;

bool empty [@property getter];

size_t length [@property getter];

void insert(T t);

public import std.typecons : Nullable;;

Nullable!T deleteMin();

Nullable!T peekMin [@property getter];

void mergeSteal(PairingHeap other);

}

Public Imports

std.typecons public import std.typecons : Nullable;

Members

Functions

deleteMin Nullable!T deleteMin(): Removes the element with the minimum value. Complexity: O(log n)
insert void insert(T t): Inserts t into the container. Complexity: O(1)
mergeSteal void mergeSteal(PairingHeap other): Steals the elements of other and inserts them (in bulk) into this container.

Properties

empty bool empty [@property getter]: Property returning true if and only if the container has no elements. Complexity: O(1)
length size_t length [@property getter]: Returns the number of elements in the container. Complexity: O(1)
peekMin Nullable!T peekMin [@property getter]: Returns the minimum element of the container. Complexity: O(1)

Variables

NodeSize enum size_t NodeSize;: The number of bytes allocated per element inserted.

Meta

Source

See Implementation

mergearray seqpq pairingheap structs

PairingHeap