The Open
D
Programming Language
Learn
Language
Library
Contribute
Blog
BinaryHeap.removeFront
std
container
binaryheap
BinaryHeap
Removes the largest element from the heap.
struct
BinaryHeap
(Store, alias less = "a < b")
void
removeFront
(
)
if
(
isRandomAccessRange
!(
Store
) ||
isRandomAccessRange
!(
typeof
(
Store.init
[]))
)
Meta
Source
See Implementation
std
container
binaryheap
BinaryHeap
aliases
popFront
constructors
this
functions
acquire
assume
clear
conditionalInsert
conditionalSwap
insert
release
removeAny
removeFront
replaceFront
properties
capacity
dup
empty
front
length
Removes the largest element from the heap.