mir-algorithm — Libmir Archive

BinaryHeap.insert

mir container binaryheap BinaryHeap

Inserts value into the store. If the underlying store is a range and length == capacity, throws an AssertException.

struct BinaryHeap(alias less = "a < b", Store)
scope
size_t
insert
(
ElementType!Store value
)
if (
isRandomAccessRange!Store ||
isRandomAccessRange!(typeof(Store.init[]))
)
mir container binaryheap BinaryHeap aliasesconstructorsfunctionspropertiesvariables
Page generated by adrdox