mir-algorithm ~master (2021-09-24T13:11:04Z)
Dub
Repo
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
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
Takes ownership of a store assuming it already was organized as a heap.