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

Run a search trial @param trials the number of trials to run @param rmin the min key value @param rmax the max key value @param unique want unique re

Extra validation on leaf pointers @param prev previous leaf @param split current leaf (split node) @param next next leaf @throws InvalidBTreeStateExc

Write a lookup page overflow to the page index; the node should have the following structure: <p> -- node type -- (2 bytes) -- next pointer -- (8 byte

Default constructor which initializes all settings to the predefined defaults.

Super basic constructor, create everything using their default values... @throws IOException is thrown when we fail to open/create the binary tree fi

Default constructor for single deletes @param key key that values are tied @param value values deleted

This is the only constructor... as we only need to set them @param key the key of (K, V) pair @param value the value of the (K, V) pair

Constructor that instantiates basically our linked list

Constructor for unique queries, hence feed it all the above information @param leaf the leaf which our (K, V) might reside @param index index where f

Class constructor

Create an internal node @param nodeType the node type parameter @param pageIndex the index of the page

Constructor for our Internal node @param nextPagePointer the next leaf pointer @param prevPagePointer the previous leaf pointer @param nodeType the n

Constructor which takes into the node type as well as the page index @param pageIndex the page index in the file

Constructor which takes into the node type as well as the page index @param nodeType the actual node type @param pageIndex the page index in the file

Constructor which takes into the node type as well as the page index @param nextPagePointer the next overflow pointer @param prevPagePointer the prev

Add values to a B+ Tree from a file @param filename file to load @param unique unique values? @param bt tree to add the values @return the list of th

Being deleted flag @return true if the node is marked to be deleted, false otherwise.

Get last element @return return the last key

Max index used (indicates the filesize) @return max number of pages that the file has

Return the current performance class tied to our instance @return the performance class reference

Return the current configuration @return the configuration reference

Helper to print the node @param index index of the node to read and print. @throws IOException is thrown when an I/O operation fails

It reads an date in the form dd/mm/yyyy from standard input and returns it as value.In case of an error it returns null @param message The message th

It reads an negative float from standard input and returns it as value. In case of an error it returns 1 @param message The message that is appeared

It reads an negative integer from standard input and returns it as value. In case of an error it returns 1 @param message The message that is apperad

It reads an positive float, zero included, from standard input and returns it as value. In case of an error it returns -1.0 @param message The messag

It reads a string from standard inputand returns it as value. In case of an error it returns null @param message The message that is apperad to the u

It reads an time in the form h:mm AM or PM from standard input and returns it as value.In case of an error it returns null Example of valid times: 8:3

Set the next pointer of the node @param nextPointer the new next pointer

Update the page index @param pageIndex new page index

This test loads up a massive non-unique key list in random order (10^5) onto trees of the following degrees: - Page sizes: 256, 1024 (1Kb), 2048 (

This test loads up a massive non-unique key list in random order (10^5) onto trees of the following degrees: - Page sizes: 256, 1024 (1Kb), 2048 (

This test loads up a massive unique key list in random order (10^5) onto trees of the following degrees: - Page sizes: 256, 1024 (1Kb), 2048 (2Kb)

This test loads up sequentially a massive key list (10^5) onto trees of the following degrees: - Page sizes: 256, 1024 (1Kb), 2048 (2Kb) with the

This test loads up sequentially a massive key list (10^5) onto trees of the following degrees: - Page sizes: 256, 1024 (1Kb), 2048 (2Kb) with the

Internal node structure is as follows: -- node type -- (2 bytes) -- current capacity -- (4 bytes) -- Key -- (8 bytes max size) -- Pointers (8 b

Write object to file (used for testing certain key-sequences) @param obj Linked list to write @param filename filename to dump the object @throws IOE