void |
BTreeNode.clear(BTreeIndex<Key,Value> index) |
boolean |
BTreeNode.contains(BTreeIndex<Key,Value> index,
Key key) |
Value |
BTreeNode.get(BTreeIndex<Key,Value> index,
Key key) |
Map.Entry<Key,Value> |
BTreeNode.getFirst(BTreeIndex<Key,Value> index) |
BTreeNode<Key,Value> |
BTreeNode.getFirstLeafNode(BTreeIndex<Key,Value> index) |
Map.Entry<Key,Value> |
BTreeNode.getLast(BTreeIndex<Key,Value> index) |
int |
BTreeNode.getMaxLeafDepth(BTreeIndex<Key,Value> index,
int depth) |
int |
BTreeNode.getMinLeafDepth(BTreeIndex<Key,Value> index,
int depth) |
boolean |
BTreeNode.isEmpty(BTreeIndex<Key,Value> index) |
Iterator<Map.Entry<Key,Value>> |
BTreeNode.iterator(BTreeIndex<Key,Value> index) |
Iterator<Map.Entry<Key,Value>> |
BTreeNode.iterator(BTreeIndex<Key,Value> index,
Key startKey) |
Iterator<Map.Entry<Key,Value>> |
BTreeNode.iterator(BTreeIndex<Key,Value> index,
Predicate<Key> predicate) |
void |
BTreeNode.printStructure(BTreeIndex<Key,Value> index,
PrintWriter out,
String firstLinePrefix,
String prefix) |
Value |
BTreeNode.put(BTreeIndex<Key,Value> index,
Key key,
Value value) |
Value |
BTreeNode.putIfAbsent(BTreeIndex<Key,Value> index,
Key key,
Value value) |
Value |
BTreeNode.remove(BTreeIndex<Key,Value> index,
Key key) |
int |
BTreeNode.size(BTreeIndex<Key,Value> index) |
void |
BTreeNode.visit(BTreeIndex<Key,Value> index,
IndexVisitor<Key,Value> visitor) |