Search
Preparing search index...
The search index is not available
Swim Toolkit
Options
All
Public
Public/Protected
All
Inherited
Externals
Menu
Swim Toolkit
@swim/collections
BTreeLeaf
Class BTreeLeaf<K, V, U>
Type parameters
K
V
U
Hierarchy
BTreePage
<
K
,
V
,
U
>
BTreeLeaf
Index
Constructors
constructor
Properties
fold
slots
Accessors
arity
size
Methods
balanced
drop
entries
first
Entry
for
Each
for
Each
Key
for
Each
Value
get
get
Entry
has
inserted
Slot
is
Empty
keys
last
Entry
lookup
max
Key
min
Key
next
Entry
previous
Entry
reduced
removed
removed
Slot
reverse
Entries
reverse
Keys
reverse
Values
split
split
Left
split
Right
take
updated
updated
Slot
values
empty
Constructors
constructor
new BTree
Leaf<K, V, U>
(
slots
:
readonly
[
K
,
V
]
[]
, fold
:
undefined
|
U
)
:
BTreeLeaf
<
K
,
V
,
U
>
Type parameters
K
V
U
Parameters
slots:
readonly
[
K
,
V
]
[]
fold:
undefined
|
U
Returns
BTreeLeaf
<
K
,
V
,
U
>
Properties
Readonly
fold
fold
:
undefined
|
U
Readonly
slots
slots
:
readonly
[
K
,
V
]
[]
Accessors
arity
get
arity
(
)
:
number
Returns
number
size
get
size
(
)
:
number
Returns
number
Methods
balanced
balanced
(
tree
:
BTreeContext
<
K
,
V
>
)
:
BTreePage
<
K
,
V
,
U
>
Parameters
tree:
BTreeContext
<
K
,
V
>
Returns
BTreePage
<
K
,
V
,
U
>
drop
drop
(
lower
:
number
, tree
:
BTreeContext
<
K
,
V
>
)
:
BTreeLeaf
<
K
,
V
,
U
>
Parameters
lower:
number
tree:
BTreeContext
<
K
,
V
>
Returns
BTreeLeaf
<
K
,
V
,
U
>
entries
entries
(
)
:
Cursor
<
[
K
,
V
]
>
Returns
Cursor
<
[
K
,
V
]
>
first
Entry
first
Entry
(
)
:
undefined
|
[
K
,
V
]
Returns
undefined
|
[
K
,
V
]
for
Each
for
Each<T, S>
(
callback
:
(
key
:
K
, value
:
V
)
=>
void
|
T
, thisArg
:
S
)
:
undefined
|
T
Type parameters
T
S
Parameters
callback:
(
key
:
K
, value
:
V
)
=>
void
|
T
(
key
:
K
, value
:
V
)
:
void
|
T
Parameters
key:
K
value:
V
Returns
void
|
T
thisArg:
S
Returns
undefined
|
T
for
Each
Key
for
Each
Key<T, S>
(
callback
:
(
key
:
K
)
=>
void
|
T
, thisArg
:
S
)
:
undefined
|
T
Type parameters
T
S
Parameters
callback:
(
key
:
K
)
=>
void
|
T
(
key
:
K
)
:
void
|
T
Parameters
key:
K
Returns
void
|
T
thisArg:
S
Returns
undefined
|
T
for
Each
Value
for
Each
Value<T, S>
(
callback
:
(
value
:
V
)
=>
void
|
T
, thisArg
:
S
)
:
undefined
|
T
Type parameters
T
S
Parameters
callback:
(
value
:
V
)
=>
void
|
T
(
value
:
V
)
:
void
|
T
Parameters
value:
V
Returns
void
|
T
thisArg:
S
Returns
undefined
|
T
get
get
(
key
:
K
, tree
:
BTreeContext
<
K
,
V
>
)
:
undefined
|
V
Parameters
key:
K
tree:
BTreeContext
<
K
,
V
>
Returns
undefined
|
V
get
Entry
get
Entry
(
index
:
number
)
:
undefined
|
[
K
,
V
]
Parameters
index:
number
Returns
undefined
|
[
K
,
V
]
has
has
(
key
:
K
, tree
:
BTreeContext
<
K
,
V
>
)
:
boolean
Parameters
key:
K
tree:
BTreeContext
<
K
,
V
>
Returns
boolean
inserted
Slot
inserted
Slot
(
x
:
number
, key
:
K
, newValue
:
V
)
:
BTreeLeaf
<
K
,
V
,
U
>
Parameters
x:
number
key:
K
newValue:
V
Returns
BTreeLeaf
<
K
,
V
,
U
>
is
Empty
is
Empty
(
)
:
boolean
Returns
boolean
keys
keys
(
)
:
Cursor
<
K
>
Returns
Cursor
<
K
>
last
Entry
last
Entry
(
)
:
undefined
|
[
K
,
V
]
Returns
undefined
|
[
K
,
V
]
lookup
lookup
(
key
:
K
, tree
:
BTreeContext
<
K
,
V
>
)
:
number
Parameters
key:
K
tree:
BTreeContext
<
K
,
V
>
Returns
number
max
Key
max
Key
(
)
:
K
Returns
K
min
Key
min
Key
(
)
:
K
Returns
K
next
Entry
next
Entry
(
key
:
K
, tree
:
BTreeContext
<
K
,
V
>
)
:
undefined
|
[
K
,
V
]
Parameters
key:
K
tree:
BTreeContext
<
K
,
V
>
Returns
undefined
|
[
K
,
V
]
previous
Entry
previous
Entry
(
key
:
K
, tree
:
BTreeContext
<
K
,
V
>
)
:
undefined
|
[
K
,
V
]
Parameters
key:
K
tree:
BTreeContext
<
K
,
V
>
Returns
undefined
|
[
K
,
V
]
reduced
reduced
(
identity
:
U
, accumulator
:
(
result
:
U
, element
:
V
)
=>
U
, combiner
:
(
result
:
U
, result2
:
U
)
=>
U
)
:
BTreeLeaf
<
K
,
V
,
U
>
Parameters
identity:
U
accumulator:
(
result
:
U
, element
:
V
)
=>
U
(
result
:
U
, element
:
V
)
:
U
Parameters
result:
U
element:
V
Returns
U
combiner:
(
result
:
U
, result2
:
U
)
=>
U
(
result
:
U
, result2
:
U
)
:
U
Parameters
result:
U
result2:
U
Returns
U
Returns
BTreeLeaf
<
K
,
V
,
U
>
removed
removed
(
key
:
K
, tree
:
BTreeContext
<
K
,
V
>
)
:
BTreeLeaf
<
K
,
V
,
U
>
Parameters
key:
K
tree:
BTreeContext
<
K
,
V
>
Returns
BTreeLeaf
<
K
,
V
,
U
>
removed
Slot
removed
Slot
(
x
:
number
)
:
BTreeLeaf
<
K
,
V
,
U
>
Parameters
x:
number
Returns
BTreeLeaf
<
K
,
V
,
U
>
reverse
Entries
reverse
Entries
(
)
:
Cursor
<
[
K
,
V
]
>
Returns
Cursor
<
[
K
,
V
]
>
reverse
Keys
reverse
Keys
(
)
:
Cursor
<
K
>
Returns
Cursor
<
K
>
reverse
Values
reverse
Values
(
)
:
Cursor
<
V
>
Returns
Cursor
<
V
>
split
split
(
x
:
number
)
:
BTreeNode
<
K
,
V
,
U
>
Parameters
x:
number
Returns
BTreeNode
<
K
,
V
,
U
>
split
Left
split
Left
(
x
:
number
)
:
BTreeLeaf
<
K
,
V
,
U
>
Parameters
x:
number
Returns
BTreeLeaf
<
K
,
V
,
U
>
split
Right
split
Right
(
x
:
number
)
:
BTreeLeaf
<
K
,
V
,
U
>
Parameters
x:
number
Returns
BTreeLeaf
<
K
,
V
,
U
>
take
take
(
upper
:
number
, tree
:
BTreeContext
<
K
,
V
>
)
:
BTreeLeaf
<
K
,
V
,
U
>
Parameters
upper:
number
tree:
BTreeContext
<
K
,
V
>
Returns
BTreeLeaf
<
K
,
V
,
U
>
updated
updated
(
key
:
K
, newValue
:
V
, tree
:
BTreeContext
<
K
,
V
>
)
:
BTreeLeaf
<
K
,
V
,
U
>
Parameters
key:
K
newValue:
V
tree:
BTreeContext
<
K
,
V
>
Returns
BTreeLeaf
<
K
,
V
,
U
>
updated
Slot
updated
Slot
(
x
:
number
, key
:
K
, newValue
:
V
)
:
BTreeLeaf
<
K
,
V
,
U
>
Parameters
x:
number
key:
K
newValue:
V
Returns
BTreeLeaf
<
K
,
V
,
U
>
values
values
(
)
:
Cursor
<
V
>
Returns
Cursor
<
V
>
Static
empty
empty<K, V, U>
(
)
:
BTreeLeaf
<
K
,
V
,
U
>
Type parameters
K
V
U
Returns
BTreeLeaf
<
K
,
V
,
U
>
Modules
@swim/system
@swim/core
@swim/util
@swim/codec
@swim/mapping
@swim/collections
@swim/constraint
@swim/structure
@swim/streamlet
@swim/dataflow
@swim/recon
@swim/uri
@swim/math
@swim/geo
@swim/time
@swim/mesh
@swim/toolkit
BTree
BTree
Context
BTree
Leaf
constructor
fold
slots
arity
size
balanced
drop
entries
first
Entry
for
Each
for
Each
Key
for
Each
Value
get
get
Entry
has
inserted
Slot
is
Empty
keys
last
Entry
lookup
max
Key
min
Key
next
Entry
previous
Entry
reduced
removed
removed
Slot
reverse
Entries
reverse
Keys
reverse
Values
split
split
Left
split
Right
take
updated
updated
Slot
values
empty
BTree
Node
BTree
Node
Cursor
BTree
Page
Keys
Cursor
Node
Cursor
STree
STree
Context
STree
Leaf
STree
Node
STree
Node
Cursor
STree
Page
Values
Cursor
Generated using
TypeDoc