The Open
D
Programming Language
Learn
Language
Library
Contribute
Blog
BinaryHeap.assume
mir
container
binaryheap
BinaryHeap
Takes ownership of a store assuming it already was organized as a heap.
struct
BinaryHeap
(alias less = "a < b", Store)
void
assume
(
Store
s
,
size_t
initialSize
=
size_t.max
)
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
Takes ownership of a store assuming it already was organized as a heap.