public class NBPlusTreeStoreMem<K extends Comparable<K>,V> extends Object implements net.thevpc.nuts.util.NBPlusTreeStore<K,V>
| Modifier and Type | Field and Description |
|---|---|
protected boolean |
allowDuplicates |
protected net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> |
firstLeaf |
protected int |
m |
protected net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> |
root |
protected long |
size |
| Constructor and Description |
|---|
NBPlusTreeStoreMem() |
NBPlusTreeStoreMem(int m,
boolean allowDuplicates) |
| Modifier and Type | Method and Description |
|---|---|
void |
addChild(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node,
net.thevpc.nuts.util.NBPlusTree.Node<K,V> pointer,
int index) |
void |
addEntries(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node,
Map.Entry<K,V>[] orderedElements) |
void |
addEntry(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node,
K k,
V v) |
void |
close() |
net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> |
createInternalNode() |
net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> |
createLeafNode(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> parent) |
int |
findIndexOfChild(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node,
net.thevpc.nuts.util.NBPlusTree.Node<K,V> child) |
net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> |
firstLeaf() |
void |
free(net.thevpc.nuts.util.NBPlusTree.Node<K,V> node) |
void |
incSize(long sizeDiff) |
int |
indexOfKey(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node,
K key) |
boolean |
isAllowDuplicates() |
int |
m() |
void |
removeChildAt(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node,
int index) |
void |
removeChildAt(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node,
int index)
Given an index, this method sets the dictionary pair at that index within
the dictionary to null.
|
net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> |
root() |
void |
save() |
long |
size() |
void |
updateChildAt(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node,
int index,
K key,
net.thevpc.nuts.util.NBPlusTree.Node<K,V> child) |
void |
updateFirstLeaf(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node) |
void |
updateLeftSibling(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node,
net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> value) |
void |
updateLeftSibling(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node,
net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> value) |
void |
updateParent(net.thevpc.nuts.util.NBPlusTree.Node<K,V> root,
net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> parent) |
void |
updateRightSibling(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node,
net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> value) |
void |
updateRightSibling(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node,
net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> value) |
void |
updateRoot(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node) |
V |
updateValueAt(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node,
int index,
V value) |
protected boolean allowDuplicates
protected int m
protected long size
protected net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K extends Comparable<K>,V> root
protected net.thevpc.nuts.util.NBPlusTree.LeafNode<K extends Comparable<K>,V> firstLeaf
public NBPlusTreeStoreMem()
public NBPlusTreeStoreMem(int m,
boolean allowDuplicates)
public boolean isAllowDuplicates()
isAllowDuplicates in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void updateParent(net.thevpc.nuts.util.NBPlusTree.Node<K,V> root, net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> parent)
updateParent in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void save()
save in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> createLeafNode(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> parent)
createLeafNode in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> createInternalNode()
createInternalNode in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public long size()
size in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void incSize(long sizeDiff)
incSize in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> root()
root in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> firstLeaf()
firstLeaf in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public int m()
m in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void updateRoot(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node)
updateRoot in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void updateFirstLeaf(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node)
updateFirstLeaf in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void free(net.thevpc.nuts.util.NBPlusTree.Node<K,V> node)
free in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void updateLeftSibling(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node, net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> value)
updateLeftSibling in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void updateRightSibling(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node, net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> value)
updateRightSibling in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void updateLeftSibling(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node, net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> value)
updateLeftSibling in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void updateRightSibling(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node, net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> value)
updateRightSibling in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void addEntry(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node, K k, V v)
addEntry in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void addEntries(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node, Map.Entry<K,V>[] orderedElements)
addEntries in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public int findIndexOfChild(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node, net.thevpc.nuts.util.NBPlusTree.Node<K,V> child)
findIndexOfChild in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void addChild(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node, net.thevpc.nuts.util.NBPlusTree.Node<K,V> pointer, int index)
addChild in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void updateChildAt(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node, int index, K key, net.thevpc.nuts.util.NBPlusTree.Node<K,V> child)
updateChildAt in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public V updateValueAt(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node, int index, V value)
updateValueAt in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void removeChildAt(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node, int index)
removeChildAt in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>index: - the location within the dictionary to be set to nullpublic int indexOfKey(net.thevpc.nuts.util.NBPlusTree.LeafNode<K,V> node, K key)
indexOfKey in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void removeChildAt(net.thevpc.nuts.util.NBPlusTree.IntermediateNode<K,V> node, int index)
removeChildAt in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>public void close()
close in interface AutoCloseableclose in interface net.thevpc.nuts.util.NBPlusTreeStore<K extends Comparable<K>,V>Copyright © 2026 vpc open source initiative. All rights reserved.