Uses of Interface
com.semedy.reasoner.edb.persistentstore.bplustree.BPlusKeys

Packages that use BPlusKeys

Package	Description
com.semedy.reasoner.edb.persistentstore.bplustree

Uses of BPlusKeys in com.semedy.reasoner.edb.persistentstore.bplustree

Classes in com.semedy.reasoner.edb.persistentstore.bplustree that implement BPlusKeys

Modifier and Type	Class	Description
class	BPlusKeysFixedLong
class	BPlusKeysVariableBytes	variable number, variable sized byte arrays as keys of a bplus node

Methods in com.semedy.reasoner.edb.persistentstore.bplustree that return BPlusKeys

Modifier and Type	Method	Description
BPlusKeys<KeyType,KeyBufferType>	KeysFactory.createKeys()	create new keys
BPlusKeys<long[],TupleBuffer>	KeysFactoryFixedLong.createKeys()	create new keys for fixed long tuples
BPlusKeys<byte[],ByteBuffer>	KeysFactoryVariableBytes.createKeys()	create new keys for fixed long tuples
BPlusKeys<KeyType,KeyBufferType>	KeysFactory.createLongerKeys()	create new keys with space for one more key
BPlusKeys<long[],TupleBuffer>	KeysFactoryFixedLong.createLongerKeys()
BPlusKeys<byte[],ByteBuffer>	KeysFactoryVariableBytes.createLongerKeys()
BPlusKeys<KeyType,KeyBufferType>	BPlusNode.getKeys()	Returns the array of keys
BPlusKeys<KeyType,KeyBufferType>	BPlusKeys.splitLeft(int number, int n)	returns left number keys n is the resulting capacity for keys
BPlusKeys<long[],TupleBuffer>	BPlusKeysFixedLong.splitLeft(int number, int n)
BPlusKeys<byte[],ByteBuffer>	BPlusKeysVariableBytes.splitLeft(int number, int n)
BPlusKeys<KeyType,KeyBufferType>	BPlusKeys.splitRight(int index, int n)	returns right keys starting at index n is the resulting capacity for keys
BPlusKeys<long[],TupleBuffer>	BPlusKeysFixedLong.splitRight(int index, int n)
BPlusKeys<byte[],ByteBuffer>	BPlusKeysVariableBytes.splitRight(int index, int n)

Methods in com.semedy.reasoner.edb.persistentstore.bplustree with parameters of type BPlusKeys

Modifier and Type	Method	Description
void	BPlusKeys.copy(BPlusKeys<KeyType,KeyBufferType> b, int numKeys)	copy numKeys keys into key container b, starting at left most key
void	BPlusKeysFixedLong.copy(BPlusKeys<long[],TupleBuffer> b, int numKey)
void	BPlusKeysVariableBytes.copy(BPlusKeys<byte[],ByteBuffer> b, int numKey)
BPlusLeaf<KeyType,KeyBufferType>	LeafFactory.createLeaf(BPlusKeys<KeyType,KeyBufferType> keys, long[] records, BPlusTree<KeyType,KeyBufferType> bplustree)	create a new leaf with given records and the offset to the left node
BPlusLeaf<KeyType,KeyBufferType>	LeafFactory.createLeaf(BPlusKeys<KeyType,KeyBufferType> keys, BPlusTree<KeyType,KeyBufferType> bplustree)	create a new leaf
BPlusLeaf<long[],TupleBuffer>	LeafFactoryFixedLong.createLeaf(BPlusKeys<long[],TupleBuffer> keys, long[] records, BPlusTree<long[],TupleBuffer> bplustree)
BPlusLeaf<long[],TupleBuffer>	LeafFactoryFixedLong.createLeaf(BPlusKeys<long[],TupleBuffer> keys, BPlusTree<long[],TupleBuffer> bplustree)	create new leafs
BPlusLeafIndex	LeafFactoryFixedLongIndex.createLeaf(BPlusKeys<long[],TupleBuffer> keys, long[] records, BPlusTree<long[],TupleBuffer> bplustree)
BPlusLeafIndex	LeafFactoryFixedLongIndex.createLeaf(BPlusKeys<long[],TupleBuffer> keys, BPlusTree<long[],TupleBuffer> bplustree)	create new leafs
BPlusLeafRecords<long[],TupleBuffer>	LeafFactoryFixedLongRecords.createLeaf(BPlusKeys<long[],TupleBuffer> keys, long[] records, BPlusTree<long[],TupleBuffer> bplustree)
BPlusLeafRecords<long[],TupleBuffer>	LeafFactoryFixedLongRecords.createLeaf(BPlusKeys<long[],TupleBuffer> keys, BPlusTree<long[],TupleBuffer> bplustree)	create new leafs
BPlusLeaf<byte[],ByteBuffer>	LeafFactoryVariableBytes.createLeaf(BPlusKeys<byte[],ByteBuffer> keys, long[] records, BPlusTree<byte[],ByteBuffer> bplustree)
BPlusLeaf<byte[],ByteBuffer>	LeafFactoryVariableBytes.createLeaf(BPlusKeys<byte[],ByteBuffer> keys, BPlusTree<byte[],ByteBuffer> bplustree)	create new leafs
void	BPlusInternalNode.substitute(BPlusKeys<KeyType,KeyBufferType> key, int[] offsets, BPlusNode<KeyType,KeyBufferType>[] childs, long left)	substitute the data of a bplus node
void	BPlusLeaf.substitute(BPlusKeys<KeyType,KeyBufferType> key, long[] record, long leftOffs)
void	BPlusLeafRecords.substitute(BPlusKeys<KeyType,KeyBufferType> key, long[] record, long leftOffs)

Constructors in com.semedy.reasoner.edb.persistentstore.bplustree with parameters of type BPlusKeys

Modifier	Constructor	Description
	BPlusInternalNode(BPlusKeys<KeyType,KeyBufferType> keys, int[] offsets, int maxSizeInBytes, BPlusTree<KeyType,KeyBufferType> bplustree)	Constructor: sets instance data.
	BPlusInternalNode(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.
	BPlusLeaf(BPlusKeys<KeyType,KeyBufferType> keys, int maxSizeInBytes, BPlusTree<KeyType,KeyBufferType> bplustree)
	BPlusLeaf(BPlusKeys<KeyType,KeyBufferType> keys, long[] records, int maxSizeInBytes, BPlusTree<KeyType,KeyBufferType> bplustree)	Initializes leaf.
	BPlusLeafIndex(BPlusKeys<long[],TupleBuffer> keys, int nodelength, DataFile _bufferFile2, BPlusTree<long[],TupleBuffer> bplustree)
	BPlusLeafIndex(BPlusKeys<long[],TupleBuffer> keys, long[] records, int maxSizeInBytes, DataFile bufferfile, BPlusTree<long[],TupleBuffer> bplustree)
	BPlusLeafRecords(BPlusKeys<KeyType,KeyBufferType> keys, int maxSizeInBytes, BPlusTree<KeyType,KeyBufferType> bplustree)
	BPlusLeafRecords(BPlusKeys<KeyType,KeyBufferType> keys, long[] records, int maxSizeInBytes, BPlusTree<KeyType,KeyBufferType> bplustree)	Initializes leaf.
	BPlusNode(BPlusKeys<KeyType,KeyBufferType> keys, int maxSizeInBytes, BPlusTree<KeyType,KeyBufferType> bplustree)	Constructor for shared data.