The OpenD Programming Language

BinaryHeap.removeFront

Removes the largest element from the heap.

struct BinaryHeap(alias less = "a < b", Store)

scope

void

removeFront

()

if (

isRandomAccessRange!Store ||

isRandomAccessRange!(typeof(Store.init[]))

)

Meta

Source

See Implementation

mir container binaryheap BinaryHeap aliases

popFront

constructors

this

functions

properties

variables