| Modifier and Type | Class and Description |
|---|---|
static class |
BTreeMap.DirNode |
static class |
BTreeMap.LeafNode |
| Modifier and Type | Field and Description |
|---|---|
protected Serializer<BTreeMap.BNode> |
BTreeMap.nodeSerializer |
| Modifier and Type | Method and Description |
|---|---|
abstract BTreeMap.BNode |
BTreeMap.BNode.copyAddKey(BTreeKeySerializer keyser,
Serializer valser,
int pos,
Object newKey,
long newChild,
Object newValue) |
abstract BTreeMap.BNode |
BTreeMap.BNode.copySplitLeft(BTreeKeySerializer keyser,
Serializer valser,
int splitPos,
long newNext) |
abstract BTreeMap.BNode |
BTreeMap.BNode.copySplitRight(BTreeKeySerializer keyser,
Serializer valser,
int splitPos) |
BTreeMap.BNode |
BTreeMap.NodeSerializer.deserialize(DataInput in,
int available) |
| Modifier and Type | Method and Description |
|---|---|
protected Fun.Pair<Integer,BTreeMap.BNode> |
BTreeMap.findSmallerNode(K key,
boolean inclusive) |
protected Fun.Pair<Integer,BTreeMap.BNode> |
BTreeMap.findSmallerNodeRecur(BTreeMap.BNode n,
K key,
boolean inclusive) |
| Modifier and Type | Method and Description |
|---|---|
int |
BTreeKeySerializer.findChildren(BTreeMap.BNode node,
Object key)
Find the first children node with a key equal or greater than the given key.
|
int |
BTreeKeySerializer.Compress.findChildren(BTreeMap.BNode node,
Object key) |
int |
BTreeKeySerializer.findChildren2(BTreeMap.BNode node,
Object key) |
int |
BTreeKeySerializer.Compress.findChildren2(BTreeMap.BNode node,
Object key) |
protected Fun.Pair<Integer,BTreeMap.BNode> |
BTreeMap.findSmallerNodeRecur(BTreeMap.BNode n,
K key,
boolean inclusive) |
void |
BTreeMap.NodeSerializer.serialize(DataOutput out,
BTreeMap.BNode value) |
Copyright © 2015. All Rights Reserved.