mir-algorithm ~master (2021-09-24T13:11:04Z)
Dub
Repo
BinaryHeap.front
mir
container
binaryheap
BinaryHeap
Returns a front of the heap, which is the largest element according to
less
.
struct
BinaryHeap
(alias less = "a < b", Store)
@
property
ref scope return
ElementType
!
Store
front
(
)
if
(
isRandomAccessRange
!
Store
||
isRandomAccessRange
!(
typeof
(
Store.init
[]))
)
Meta
Source
See Implementation
mir
container
binaryheap
BinaryHeap
aliases
Range
buildHeap
percolate
popFront
siftDown
constructors
this
functions
acquire
assume
conditionalInsert
conditionalSwap
insert
removeAny
removeFront
replaceFront
postblits
this(this)
properties
capacity
empty
front
length
variables
_length
_store
Returns a front of the heap, which is the largest element according to less.