Function that commits the allocation pool to the file; this can be done after each deletion or more unsafely before committing the file changes at the

This function is responsible handling the creation of overflow pages. We have generally two distinct cases which are the following: Create an overfl

This function initializes the look-up page; in the simple case that it does not already exist it just creates an empty page by witting -1L all over it

This function is inspired from the one given in CLRS for inserting a key to a B-Tree but as splitTreeNode has been (heavily) modified in order to be u

Check if the node in question is a lookup page overflow node @return true if the node is a lookup page overflow node, false otherwise

Check if the node has the specified parent @param node node can be internal or leaf @param parent parent is always internal node @param pindex index

Check if the internal node fulfills the B+ Tree invariant after removing <code>remove</code> number of elements @param node node to check @param remo

@param left left node @param right right node @param cap max capacity of the node @throws InvalidBTreeStateException is thrown when there are incon

@param left left leaf @param right right leaf @param cap max capacity of the leaf @throws InvalidBTreeStateException is thrown when there are incon

Function to parse the overflow pages specifically for the range queries @param l leaf which contains the key with the overflow page @param index inde

Run default trial set @param trials number of trials to run @param vmin min key value @param vmax max key value @param qrange range of range queries

This function is based on the similar function prototype that is given by CLRS for B-Tree but is altered (quite a bit) to be able to be used for B+ Tr

Commit the page count and the max offset in the file @param conf B+ configuration reference @throws IOException is thrown when an I/O operation fails

Function that validates the node capacity invariants based on the current configuration instance. @param conf configuration instance for validating t

Binary search implementation for tree blocks. @param n node to search @param l left (lower-part) array index @param r right (upper-part) arr

Little function that checks if we have any degree < 2 (which is not allowed)

This function adjust the file length by purging the high index pages that are used. Low index pages are purged last by design. @throws IOException is

Condition the given string to match the entry size. -- in case of length being greater than entry size, it is trimmed -- in case of length being le

Function that initially creates the tree. Here we always create a Leaf that acts as our Root, until we split it. @return the initial (leaf) tree root.

Function to delete a key from our tree... this function is again adopted from CLRS delete method but this was basically written from scratch and is lo

Get the next pointer of the node @return the next pointer value

Map the short value to an actual node type enumeration value. This paradoxically is the opposite of that we do in the similarly named function in each

Handle the selected user option @param choice the user choice @param sin the input class @param bPerf performance class ties to a B+ Tree instance @t

Handle the internal node redistribution/merging @param mnode node to process @param parent the parent node @param parentPointerIndex parent pointer i

Handle the leaf section of the redistribution/merging @param mnode node to process @param parent the parent node @param parentPointerIndex parent poi

Handle the root node cases (leaf and internal node) @param mnode root node @return the root node @throws IOException is thrown when an I/O operation

Check if the node is an overflow page @param nt nodeType of the node we want to check @return return true if it's an overflow page, false if it's not

Check if we have to condition the file @return if it's time for conditioning

Load linked list object from file (used for testing certain key-sequences) @param filename file to load the object from @return the object itself. @t

Display menu choices and grab the user selection @param sin input class @return a valid user option selection

This function handles the merging or redistribution of the nodes depending on their capacity; usually we just redistribute, if not we merge. @param m

Prints the current configuration to stdout.

Each class must implement it's own printing method.

Handle range search queries with a bit of twist on how we handle duplicate keys. We have two basic cases depending duplicate keys, which is basicall

Reads an existing file and generates a B+ configuration based on the stored values @param r file to read from @param generateConf generate configurat

Run the test interface @param bPerf performance class tied to a B+ Tree instance @throws IOException is thrown when an I/O operation fails

Silently just run the default trials using the default values @param bPerf performance class tied to a B+ Tree instance @throws IOException is thrown

Run deletion @param sin input class @param bPerf performance class tied to a B+ Tree instance @throws IOException is thrown when an I/O operation fai

Run a deletion trial @param trials number of trials to run @param rmin the min key value @param rmax the max key value @param unique delete the first

Run a insertion trial @param trials the number of trials to run @param rmin the min key value @param rmax the max key value @param value value to tie

Run insertion @param sin input class @param bPerf performance class tied to a B+ Tree instance @throws IOException is thrown when an I/O operation fa

Run a range query instance @param sin input class @param bPerf performance class tied to a B+ Tree instance @throws IOException is thrown when an I/O

Run a range query trial @param trials the number of trials to run @param rmin the min key value @param rmax the max key value @param range value to t