The Open
D
Programming Language
Learn
Language
Library
Contribute
Blog
BinaryHeap.replaceFront
mir
container
binaryheap
BinaryHeap
Replaces the largest element in the store with
value
.
struct
BinaryHeap
(alias less = "a < b", Store)
scope
void
replaceFront
(
ElementType
!
Store
value
)
if
(
isRandomAccessRange
!
Store
||
isRandomAccessRange
!(
typeof
(
Store.init
[]))
)
Meta
Source
See Implementation
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
Replaces the largest element in the store with value.