mir-algorithm ~master (2021-09-24T13:11:04Z)

BinaryHeap.removeFront

mir container binaryheap BinaryHeap

Removes the largest element from the heap.

  1. void removeFront()
    struct BinaryHeap(alias less = "a < b", Store)
    scope
    void
    removeFront
    ()
    if (
    isRandomAccessRange!Store ||
    isRandomAccessRange!(typeof(Store.init[]))
    )
  2. alias popFront = removeFront

Meta

Source

See Implementation

mir container binaryheap BinaryHeap aliasesconstructorsfunctionspostblitspropertiesvariables

Page generated by adrdox