utilities-library
Search
Preparing search index...
BTreeNode
Class BTreeNode<T>
Clase que representa el nodo de un arbol m-way.
Type Parameters
T
Hierarchy (
View Summary
)
MWayTreeNode
<
T
>
BTreeNode
Index
Constructors
constructor
Methods
clear
count
Children
count
Data
count
Empty
Children
count
Empty
Data
displace
Childs
To
Left
displace
Childs
To
Right
displace
Datas
To
Left
displace
Datas
To
Right
find
Greater
Key
Index
get
Child
get
Childrens
Array
get
Data
get
Data
Array
get
Grade
get
Index
Of
Child
get
Index
Of
Data
has
Child
To
After
has
Child
To
Before
has
Data
Space
For
Insert
has
Data
To
After
has
Data
To
Before
insert
Data
Ordered
is
Empty
Child
is
Full
Children
Node
is
Full
Data
Node
is
Leaf
set
Child
set
Childrens
Array
set
Data
set
Data
Array
Constructors
constructor
new
BTreeNode
<
T
>
(
degree
?:
number
)
:
BTreeNode
<
T
>
Type Parameters
T
Parameters
degree
:
number
= DEFAULT_GRADE
Returns
BTreeNode
<
T
>
Methods
clear
clear
()
:
BTreeNode
<
T
>
Returns
BTreeNode
<
T
>
count
Children
countChildren
()
:
number
Returns
number
count
Data
countData
()
:
number
Returns
number
count
Empty
Children
countEmptyChildren
()
:
number
Returns
number
count
Empty
Data
countEmptyData
()
:
number
Returns
number
displace
Childs
To
Left
displaceChildsToLeft
(
positionChild
:
number
)
:
BTreeNode
<
T
>
Parameters
positionChild
:
number
Returns
BTreeNode
<
T
>
displace
Childs
To
Right
displaceChildsToRight
(
positionChild
:
number
)
:
BTreeNode
<
T
>
Parameters
positionChild
:
number
Returns
BTreeNode
<
T
>
displace
Datas
To
Left
displaceDatasToLeft
(
positionData
:
number
)
:
BTreeNode
<
T
>
Parameters
positionData
:
number
Returns
BTreeNode
<
T
>
displace
Datas
To
Right
displaceDatasToRight
(
positionData
:
number
)
:
BTreeNode
<
T
>
Parameters
positionData
:
number
Returns
BTreeNode
<
T
>
find
Greater
Key
Index
findGreaterKeyIndex
(
keyToCompare
:
number
)
:
number
Parameters
keyToCompare
:
number
Returns
number
get
Child
getChild
(
position
:
number
)
:
MWayTreeNode
<
T
>
|
null
Parameters
position
:
number
Returns
MWayTreeNode
<
T
>
|
null
get
Childrens
Array
getChildrensArray
()
:
(
MWayTreeNode
<
T
>
|
null
)
[]
Returns (
MWayTreeNode
<
T
>
|
null
)
[]
get
Data
getData
(
position
:
number
)
:
Data
<
T
>
|
null
Parameters
position
:
number
Returns
Data
<
T
>
|
null
get
Data
Array
getDataArray
()
:
(
Data
<
T
>
|
null
)
[]
Returns (
Data
<
T
>
|
null
)
[]
get
Grade
getGrade
()
:
number
Returns
number
get
Index
Of
Child
getIndexOfChild
(
childNode
:
MWayTreeNode
<
T
>
)
:
number
Parameters
childNode
:
MWayTreeNode
<
T
>
Returns
number
get
Index
Of
Data
getIndexOfData
(
key
:
number
)
:
number
Parameters
key
:
number
Returns
number
has
Child
To
After
hasChildToAfter
(
initPosition
:
number
)
:
boolean
Parameters
initPosition
:
number
Returns
boolean
has
Child
To
Before
hasChildToBefore
(
initPosition
:
number
)
:
boolean
Parameters
initPosition
:
number
Returns
boolean
has
Data
Space
For
Insert
hasDataSpaceForInsert
()
:
boolean
Returns
boolean
has
Data
To
After
hasDataToAfter
(
initPosition
:
number
)
:
boolean
Parameters
initPosition
:
number
Returns
boolean
has
Data
To
Before
hasDataToBefore
(
initPosition
:
number
)
:
boolean
Parameters
initPosition
:
number
Returns
boolean
insert
Data
Ordered
insertDataOrdered
(
data
:
Data
<
T
>
)
:
BTreeNode
<
T
>
Parameters
data
:
Data
<
T
>
Returns
BTreeNode
<
T
>
is
Empty
Child
isEmptyChild
(
position
:
number
)
:
boolean
Parameters
position
:
number
Returns
boolean
is
Full
Children
Node
isFullChildrenNode
()
:
boolean
Returns
boolean
is
Full
Data
Node
isFullDataNode
()
:
boolean
Returns
boolean
is
Leaf
isLeaf
()
:
boolean
Returns
boolean
set
Child
setChild
(
positon
:
number
,
newNodo
:
MWayTreeNode
<
T
>
|
null
)
:
BTreeNode
<
T
>
Parameters
positon
:
number
newNodo
:
MWayTreeNode
<
T
>
|
null
Returns
BTreeNode
<
T
>
set
Childrens
Array
setChildrensArray
(
childrensArray
:
(
MWayTreeNode
<
T
>
|
null
)
[]
)
:
BTreeNode
<
T
>
Parameters
childrensArray
: (
MWayTreeNode
<
T
>
|
null
)
[]
Returns
BTreeNode
<
T
>
set
Data
setData
(
position
:
number
,
newData
:
Data
<
T
>
|
null
)
:
BTreeNode
<
T
>
Parameters
position
:
number
newData
:
Data
<
T
>
|
null
Returns
BTreeNode
<
T
>
set
Data
Array
setDataArray
(
arrayData
:
(
Data
<
T
>
|
null
)
[]
)
:
BTreeNode
<
T
>
Parameters
arrayData
: (
Data
<
T
>
|
null
)
[]
Returns
BTreeNode
<
T
>
Settings
Member Visibility
Protected
Inherited
External
Theme
OS
Light
Dark
On This Page
Constructors
constructor
Methods
clear
countChildren
countData
countEmptyChildren
countEmptyData
displaceChildsToLeft
displaceChildsToRight
displaceDatasToLeft
displaceDatasToRight
findGreaterKeyIndex
getChild
getChildrensArray
getData
getDataArray
getGrade
getIndexOfChild
getIndexOfData
hasChildToAfter
hasChildToBefore
hasDataSpaceForInsert
hasDataToAfter
hasDataToBefore
insertDataOrdered
isEmptyChild
isFullChildrenNode
isFullDataNode
isLeaf
setChild
setChildrensArray
setData
setDataArray
AVLTree
AVLTreeNode
BinarySearchTree
BinarySearchTreeNode
BTree
BTreeNode
Cadena
Extra
ListaCircular
ListaDoblementeEnlazada
ListaEnlazada
Matriz
MWayTree
MWayTreeNode
NAryTree
NAryTreeNode
Numero
Queue
Stack
Tensor
Vector
NodoListaCircular
NodoListaDoblementeEnlazada
NodoListaEnlazada
Clase que representa el nodo de un arbol m-way.