BinaryHeap.replaceFront

Replaces the largest element in the store with value.

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

void

replaceFront

(

ElementType!Store value

)

if (

isRandomAccessRange!(Store) ||

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

)

Meta

Source

See Implementation

std container binaryheap BinaryHeap aliases

popFront

constructors

this

functions

properties