@0b5vr/experimental
Preparing search index...
BinaryHeap
Class BinaryHeap<T>
Type Parameters
T
Index
Constructors
constructor
Properties
array
comparator
element
Index
Map
Accessors
is
Empty
length
root
Methods
delete
pop
push
replace
default
Comparator
Constructors
constructor
new
BinaryHeap
<
T
>
(
init
?:
T
[]
,
comparator
?:
(
a
:
T
,
b
:
T
)
=>
number
,
)
:
BinaryHeap
<
T
>
Type Parameters
T
Parameters
Optional
init
:
T
[]
Optional
comparator
:
(
a
:
T
,
b
:
T
)
=>
number
Returns
BinaryHeap
<
T
>
Properties
Readonly
array
array
:
T
[]
comparator
comparator
:
(
a
:
T
,
b
:
T
)
=>
number
Readonly
element
Index
Map
elementIndexMap
:
Map
<
T
,
number
>
Accessors
is
Empty
get
isEmpty
()
:
boolean
Returns
boolean
length
get
length
()
:
number
Returns
number
root
get
root
()
:
T
Returns
T
Methods
delete
delete
(
i
:
number
)
:
boolean
Parameters
i
:
number
Returns
boolean
pop
pop
()
:
T
|
null
Returns
T
|
null
push
push
(
...
elements
:
T
[]
)
:
void
Parameters
...
elements
:
T
[]
Returns
void
replace
replace
(
i
:
number
,
rep
:
T
)
:
number
|
null
Parameters
i
:
number
rep
:
T
Returns
number
|
null
Static
default
Comparator
defaultComparator
(
a
:
unknown
,
b
:
unknown
)
:
number
Parameters
a
:
unknown
b
:
unknown
Returns
number
Settings
Member Visibility
Protected
Inherited
External
Theme
OS
Light
Dark
On This Page
Constructors
constructor
Properties
array
comparator
element
Index
Map
Accessors
is
Empty
length
root
Methods
delete
pop
push
replace
default
Comparator
@0b5vr/experimental
Loading...