Search
Preparing search index...
The search index is not available
tstruct
Options
All
Public
Public/Protected
All
Inherited
Externals
Only exported
Menu
Globals
"Heap/Heap"
Heap
Class Heap<T>
Type parameters
T
Hierarchy
Heap
MaxHeap
MinHeap
Implements
IHeap
<
T
>
Index
Constructors
constructor
Properties
_data
compare
Function
Accessors
size
Methods
[
Symbol.iterator]
_check
OnChildren
_check
OnParent
_rearrange
add
extract
Root
get
Children
Index
get
Parent
Index
get
Root
rearrange
remove
to
Array
Constructors
constructor
new
Heap
(
compareFunction
?:
(
e1
:
T
, e2
:
T
)
=>
-1
|
0
|
1
)
:
Heap
Parameters
Default value
compareFunction:
(
e1
:
T
, e2
:
T
)
=>
-1
|
0
|
1
= descendingCompareFunction
(
e1
:
T
, e2
:
T
)
:
-1
|
0
|
1
Parameters
e1:
T
e2:
T
Returns
-1
|
0
|
1
Returns
Heap
Properties
Private
_data
_data
:
T
[]
Private
compare
Function
compare
Function
:
(
e1
:
T
, e2
:
T
)
=>
-1
|
0
|
1
Type declaration
(
e1
:
T
, e2
:
T
)
:
-1
|
0
|
1
Parameters
e1:
T
e2:
T
Returns
-1
|
0
|
1
Accessors
size
get
size
(
)
:
number
Returns
number
Methods
[
Symbol.iterator]
[
Symbol.iterator]
(
)
:
Iterator
<
T
,
any
,
undefined
>
Returns
Iterator
<
T
,
any
,
undefined
>
Private
_check
OnChildren
_check
OnChildren
(
index
:
number
)
:
number
Parameters
index:
number
Returns
number
Private
_check
OnParent
_check
OnParent
(
index
:
number
)
:
number
Parameters
index:
number
Returns
number
_rearrange
_rearrange
(
index
:
number
)
:
void
Parameters
index:
number
Returns
void
add
add
(
value
:
T
)
:
void
Parameters
value:
T
Returns
void
extract
Root
extract
Root
(
)
:
T
Returns
T
Private
get
Children
Index
get
Children
Index
(
index
:
number
)
:
number
[]
Parameters
index:
number
Returns
number
[]
Private
get
Parent
Index
get
Parent
Index
(
index
:
number
)
:
number
Parameters
index:
number
Returns
number
get
Root
get
Root
(
)
:
T
Returns
T
rearrange
rearrange
(
)
:
void
Returns
void
remove
remove
(
value
:
T
)
:
void
Parameters
value:
T
Returns
void
to
Array
to
Array
(
)
:
T
[]
Returns
T
[]
Globals
"
Binary
Tree/AVLTree"
"
Binary
Tree/
Binary
Search
Tree"
"
Binary
Tree/
Binary
Tree"
"
Common/
Common"
"
Compare
Function"
"
Graph/
Graph"
"
Heap/
Heap"
"
Linked
List/
Linked
List"
"
Queue/
Priority
Queue"
"
Queue/
Queue"
"
Sorting
Algorithms/
Sorting
Algorithms"
"
Stack/
Stack"
"
Trie/
Trie"
"
Union
Find/
Union
Find"
Heap
constructor
_data
compare
Function
size
[
Symbol.iterator]
_check
OnChildren
_check
OnParent
_rearrange
add
extract
Root
get
Children
Index
get
Parent
Index
get
Root
rearrange
remove
to
Array
Max
Heap
Min
Heap
IHeap
IMax
Heap
IMin
Heap
Generated using
TypeDoc