@fimagine/writeboard
Preparing search index...
ITree
Interface ITree<T>
interface
ITree
<
T
=
any
>
{
get
itemCount
()
:
number
;
get
items
()
:
T
[]
;
get
level
()
:
number
;
get
parent
()
:
undefined
|
ITree
<
T
>
;
insert
(
item
:
T
)
:
ITree
<
T
>
;
remove
(
item
:
T
)
:
boolean
;
split
()
:
void
;
}
Type Parameters
T
=
any
Implemented by
BinaryTree
QuadTree
Index
Accessors
item
Count
items
level
parent
Methods
insert
remove
split
Accessors
item
Count
get
itemCount
()
:
number
Returns
number
items
get
items
()
:
T
[]
Returns
T
[]
level
get
level
()
:
number
Returns
number
parent
get
parent
()
:
undefined
|
ITree
<
T
>
Returns
undefined
|
ITree
<
T
>
Methods
insert
insert
(
item
:
T
)
:
ITree
<
T
>
Parameters
item
:
T
Returns
ITree
<
T
>
remove
remove
(
item
:
T
)
:
boolean
Parameters
item
:
T
Returns
boolean
split
split
()
:
void
Returns
void
Settings
Member Visibility
Protected
Inherited
External
Theme
OS
Light
Dark
On This Page
Accessors
item
Count
items
level
parent
Methods
insert
remove
split
@fimagine/writeboard
Loading...