BinaryHeap.replaceFront

Replaces the largest element in the store with value.

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

scope

void

replaceFront

(

ElementType!Store value

)

if (

isRandomAccessRange!Store ||

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

)

Meta

Source

See Implementation

mir container binaryheap BinaryHeap aliases

constructors

this

functions

postblits

this(this)

properties

variables