mir-algorithm — Libmir Archive
← Libmir Archive
Dlang.org
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 return scope
ElementType
!
Store
front
(
)
if
(
isRandomAccessRange
!
Store
||
isRandomAccessRange
!(
typeof
(
Store.init
[]))
)
mir
container
binaryheap
BinaryHeap
aliases
popFront
constructors
this
functions
acquire
assume
conditionalInsert
conditionalSwap
insert
removeAny
removeFront
replaceFront
properties
capacity
empty
front
length
variables
_length
_store
Returns a front of the heap, which is the largest element according to less.