| com.jofti.btree |
|
| Java Source File Name | Type | Comment |
| AbstractLeafNode.java | Class | |
| BTOperations.java | Class | Provides the group of low level operations that can be performed on the BTree. |
| BTree.java | Class | A B*Tree variation based on the paper by Lehman and Yao [Efficient concurrent operations on b-trees - 1981] on concurrent BTree design.
Following on from this paper the tree also adopts the recommendations of not coalesing nodes when half full. |
| EntrySplitWrapper.java | Class |
A convenience wrapper used in the split operation to return the objects the split node is divided into. |
| IndexNode.java | Class |
The internal nodes in the BTree. |
| IndexNodeEntry.java | Class | |
| INode.java | Interface | |
| IPage.java | Interface |
Defines the operations for a disk page. |
| IResultNode.java | Interface | The node returned from the tree that contains the data from the real node that was a result of the search. |
| KeyValueObject.java | Class | Represents a valueObject that stores a key in the cache. |
| Leaf.java | Interface | |
| LeafNode.java | Class | The Implementation of a LeafNode. |
| LeafNodeEntry.java | Class | The leaf node entry contains a value, qand a set of uniqueIds that are the ids passed into the node for that value. |
| MaxComparableValue.java | Class | This is a special object in the tree and is used to represent an absolute maximum value for a dimension. |
| MaxLeafNodeEntry.java | Class | This is a special object in the tree and is used to represent an absolute maximum leaf entry for the whole tree. |
| MinComparableValue.java | Class | This is a special object in the tree and is used to represent an absolute minimum value for a dimension. |
| MinLeafNodeEntry.java | Class | This is a special object in the tree and is used to represent an absolute minimum leaf entry for the whole tree. |
| Node.java | Class | |
| NodeEntry.java | Interface | |
| NodeFactory.java | Class | |
| NodeLink.java | Class | A wrapper for a node that allows us distinguish between sibling right nodes and child nodes of nodes. |
| PagedLeafNode.java | Class |
A version of a
LeafNode that pages its entries to and from disk. |
| ResultNode.java | Class | The implementation class for the IResultNode. |
| ResultNodeLink.java | Class | A wrapper for a nodelink in the result node to make the nodelink immutable. |
| ValueObject.java | Class | This is used to wrap all values put into the Tree. |