net.thevpc.nuts.runtime.standalone.util.collections

Class NBPlusTreeHelper

java.lang.Object

net.thevpc.nuts.runtime.standalone.util.collections.NBPlusTreeHelper

public class NBPlusTreeHelper
extends Object

Author:

vpc

Constructor Summary

Constructors

Constructor and Description
NBPlusTreeHelper()

Method Summary

Modifier and Type	Method and Description
static <K extends Comparable<K>> int	binarySearchKeys(List<K> a, int numPairs, K key)
static <K extends Comparable<K>,V> int	compareEntries(Map.Entry<K,V> o1, Map.Entry<K,V> o2)
static <K extends Comparable<K>> int	compareKey(K k1, K k2)
static boolean	eq(Object a, Object b)
static <K extends Comparable<K>,V> boolean	isDeficient(NBPlusTree.Node<K,V> node) This simple method determines if the LeafNode is deficient, i.e.
static <K extends Comparable<K>,V> boolean	isEmpty(NBPlusTree.Node<K,V> node)
static <K extends Comparable<K>,V> boolean	isFull(NBPlusTree.LeafNode<K,V> node) This simple method determines if the LeafNode is full, i.e.
static <K extends Comparable<K>,V> boolean	isLendable(NBPlusTree.Node<K,V> node) This simple method determines if the LeafNode object is capable of lending a dictionary pair to a deficient leaf node.
static <K extends Comparable<K>,V> boolean	isMergeable(NBPlusTree.IntermediateNode<K,V> node) This simple method determines if the InternalNode is capable of being merged with.
static <K extends Comparable<K>,V> boolean	isMergeable(NBPlusTree.LeafNode<K,V> node) This simple method determines if the LeafNode object is capable of being merged with, which occurs when the number of pairs within the LeafNode object is equal to the minimum number of pairs it can hold.
static <K extends Comparable<K>,V> boolean	isOverfull(NBPlusTree.IntermediateNode<K,V> node) This simple method determines if the InternalNode is considered overfull, i.e.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

NBPlusTreeHelper

public NBPlusTreeHelper()

Method Detail

compareEntries

public static <K extends Comparable<K>,V> int compareEntries(Map.Entry<K,V> o1,
                                                             Map.Entry<K,V> o2)

compareKey

public static <K extends Comparable<K>> int compareKey(K k1,
                                                       K k2)

isDeficient

public static <K extends Comparable<K>,V> boolean isDeficient(NBPlusTree.Node<K,V> node)

This simple method determines if the LeafNode is deficient, i.e. the numPairs within the LeafNode object is below minNumPairs.

Returns:

a boolean indicating whether or not the LeafNode is deficient

isEmpty

public static <K extends Comparable<K>,V> boolean isEmpty(NBPlusTree.Node<K,V> node)

isFull

public static <K extends Comparable<K>,V> boolean isFull(NBPlusTree.LeafNode<K,V> node)

This simple method determines if the LeafNode is full, i.e. the numPairs within the LeafNode is equal to the maximum number of pairs.

Returns:

a boolean indicating whether or not the LeafNode is full

isLendable

public static <K extends Comparable<K>,V> boolean isLendable(NBPlusTree.Node<K,V> node)

This simple method determines if the LeafNode object is capable of lending a dictionary pair to a deficient leaf node. The LeafNode object can lend a dictionary pair if its numPairs is greater than the minimum number of pairs it can hold.

Returns:

a boolean indicating whether or not the LeafNode object can give a dictionary pair to a deficient leaf node

isMergeable

public static <K extends Comparable<K>,V> boolean isMergeable(NBPlusTree.LeafNode<K,V> node)

This simple method determines if the LeafNode object is capable of being merged with, which occurs when the number of pairs within the LeafNode object is equal to the minimum number of pairs it can hold.

Returns:

a boolean indicating whether or not the LeafNode object can be merged with

isMergeable

public static <K extends Comparable<K>,V> boolean isMergeable(NBPlusTree.IntermediateNode<K,V> node)

This simple method determines if the InternalNode is capable of being merged with. An InternalNode can be merged with if it has the minimum degree of children.

Returns:

a boolean indicating whether or not the InternalNode can be merged with

isOverfull

public static <K extends Comparable<K>,V> boolean isOverfull(NBPlusTree.IntermediateNode<K,V> node)

This simple method determines if the InternalNode is considered overfull, i.e. the InternalNode object's current degree is one more than the specified maximum.

Returns:

a boolean indicating if the InternalNode is overfull

eq

public static boolean eq(Object a,
                         Object b)

binarySearchKeys

public static <K extends Comparable<K>> int binarySearchKeys(List<K> a,
                                                             int numPairs,
                                                             K key)