@__haoyang__/erwin
Preparing search index...
dataStructor
PriorityQueue
Class PriorityQueue<T>
Priority Queue Data Structure
Type Parameters
T
Index
Constructors
constructor
Properties
compare
heap
Methods
pop
push
size
top
Constructors
constructor
new
PriorityQueue
<
T
>
(
compare
:
(
a
:
T
,
b
:
T
)
=>
number
)
:
PriorityQueue
<
T
>
Type Parameters
T
Parameters
compare
:
(
a
:
T
,
b
:
T
)
=>
number
Returns
PriorityQueue
<
T
>
Properties
compare
compare
:
(
a
:
T
,
b
:
T
)
=>
number
heap
heap
:
T
[]
Methods
pop
pop
()
:
undefined
|
T
Returns
undefined
|
T
push
push
(
value
:
T
)
:
void
Parameters
value
:
T
Returns
void
size
size
()
:
number
Returns
number
top
top
()
:
T
Returns
T
Settings
Member Visibility
Protected
Inherited
External
Theme
OS
Light
Dark
On This Page
Constructors
constructor
Properties
compare
heap
Methods
pop
push
size
top
@__haoyang__/erwin
Loading...
Priority Queue Data Structure