Uses of Class
com.semedy.reasoner.edb.persistentstore.bplustree.BPlusNode
-
Uses of BPlusNode in com.semedy.reasoner.edb.persistentstore.bplustree
Modifier and TypeClassDescriptionclass
BPlusInternalNode<KeyType,
KeyBufferType> Represents an internal node within the B+ tree.class
BPlusLeaf<KeyType,
KeyBufferType> A leaf is the node in a B+ tree containing records.class
This type of bplus leaf contains a cache for the index valuesclass
BPlusLeafRecords<KeyType,
KeyBufferType> A leaf is the node in a B+ tree containing records.Modifier and TypeMethodDescriptionBPlusInternalNode.borrowChild()
Returns a child from the right side.BPlusInternalNode.borrowFirstChild()
BPlusInternalNode.getChild
(int index) BPlusTree.getChild
(int offset, BPlusInternalNode<KeyType, KeyBufferType> node, int index, boolean shadow) BPlusInternalNode.getChildren()
BPlusTree.getNode
(int offset, boolean shadow) BPlusTreeFile.getNode
(byte[] bytes, int offset) get node out of bytes and offsetBPlusTree.getRoot()
BPlusTreeFile.readNode
(int offset, boolean shadow) public method for reading a node at a given file offset.BPlusTree.rightBrother
(BPlusNode<KeyType, KeyBufferType> b, boolean shadow) get the right brother of a nodeBPlusTree.rightSibling
(BPlusNode<KeyType, KeyBufferType> b, boolean shadow) get the right sibling of a nodeModifier and TypeMethodDescriptionint
BPlusInternalNode.add
(KeyType keyToAdd, long childOffset, BPlusNode<KeyType, KeyBufferType> child) Adds a key and its right child to their correct locations within the node.void
BPlusInternalNode.add
(KeyType keyToAdd, long offs, BPlusNode<KeyType, KeyBufferType> child, int indexToInsert) Adds a key and its right child to their correct locations within the node.void
BPlusInternalNode.addFirstChild
(BPlusNode<KeyType, KeyBufferType> childToAdd, int len) Adds a child offset to the beginning of the children (leftmost).void
BPlusInternalNode.appendChild
(BPlusNode<KeyType, KeyBufferType> childToAdd) Adds a child to the end of the children.void
BPlusKeys.getBuffer
(int i, KeyBufferType result, BPlusNode<KeyType, KeyBufferType> node) void
BPlusKeysFixedLong.getBuffer
(int i, TupleBuffer result, BPlusNode<long[], TupleBuffer> node) void
BPlusKeysVariableBytes.getBuffer
(int i, ByteBuffer result, BPlusNode<byte[], ByteBuffer> node) void
BPlusTreeFile.releaseNode
(BPlusNode<KeyType, KeyBufferType> node, boolean shadow) free up disk space for bplus nodeBPlusTree.rightBrother
(BPlusNode<KeyType, KeyBufferType> b, boolean shadow) get the right brother of a nodeBPlusTree.rightSibling
(BPlusNode<KeyType, KeyBufferType> b, boolean shadow) get the right sibling of a nodeBPlusTree.searchFor
(KeyBufferType key, BPlusNode<KeyType, KeyBufferType> sRoot, boolean next, boolean shadow) Search for a key inside treevoid
BPlusInternalNode.substitute
(BPlusKeys<KeyType, KeyBufferType> key, int[] offsets, BPlusNode<KeyType, KeyBufferType>[] childs, long left) substitute the data of a bplus nodeModifierConstructorDescriptionBPlusInternalNode
(BPlusKeys<KeyType, KeyBufferType> keys, int[] offsets, BPlusNode<KeyType, KeyBufferType>[] children, int maxSizeInBytes, BPlusTree<KeyType, KeyBufferType> bplustree) A constructor for when the left and right are known.