public class NBPlusTreeStoreMemLeafNode<K extends Comparable<K>,V> extends NBPlusTreeStoreMemNode<K,V> implements NBPlusTree.LeafNode<K,V>
| Constructor and Description |
|---|
NBPlusTreeStoreMemLeafNode(int m,
NBPlusTree.IntermediateNode<K,V> parent)
Constructor
|
| Modifier and Type | Method and Description |
|---|---|
void |
delete(int index)
Given an index, this method sets the dictionary pair at that index
within the dictionary to null.
|
Map.Entry<K,V> |
entryAt(int index) |
K |
firstKey() |
boolean |
isLeaf() |
K |
keyAt(int index) |
List<K> |
keys() |
NBPlusTree.LeafNode<K,V> |
leftSibling() |
NBPlusTree.LeafNode<K,V> |
rightSibling() |
V |
setValueAt(int index,
V value) |
String |
toString() |
V |
valueAt(int index) |
maxSize, minSize, parent, sizeclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitmaxSize, minSize, parent, sizepublic NBPlusTreeStoreMemLeafNode(int m,
NBPlusTree.IntermediateNode<K,V> parent)
m: - order of B+ tree that is used to calculate maxNumPairs and
minNumPairsparent: - parent of newly created child LeafNodepublic void delete(int index)
index: - the location within the dictionary to be set to nullpublic K firstKey()
firstKey in interface NBPlusTree.Node<K extends Comparable<K>,V>public boolean isLeaf()
isLeaf in interface NBPlusTree.Node<K extends Comparable<K>,V>public List<K> keys()
keys in interface NBPlusTree.LeafNode<K extends Comparable<K>,V>public V valueAt(int index)
valueAt in interface NBPlusTree.LeafNode<K extends Comparable<K>,V>public K keyAt(int index)
keyAt in interface NBPlusTree.LeafNode<K extends Comparable<K>,V>public Map.Entry<K,V> entryAt(int index)
entryAt in interface NBPlusTree.LeafNode<K extends Comparable<K>,V>public NBPlusTree.LeafNode<K,V> leftSibling()
leftSibling in interface NBPlusTree.LeafNode<K extends Comparable<K>,V>public NBPlusTree.LeafNode<K,V> rightSibling()
rightSibling in interface NBPlusTree.LeafNode<K extends Comparable<K>,V>Copyright © 2026 vpc open source initiative. All rights reserved.