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

Class BTreeSet<T extends Comparable<T>>

java.lang.Object

net.thevpc.nuts.runtime.standalone.util.collections.BTreeSet<T>

public class BTreeSet<T extends Comparable<T>>
extends Object

This is based on the excellent work at: https://github.com/phishman3579/java-algorithms-implementation/blob/master/src/com/jwetherell/algorithms/data_structures/BTree.java

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	BTreeSet.JavaCompatibleBTree<T extends Comparable<T>>

Constructor Summary

Constructors

Constructor and Description
BTreeSet() Constructor for B-Tree which defaults to a 2-3 B-Tree.
BTreeSet(int order) Constructor for B-Tree of ordered parameter.

Method Summary

Modifier and Type	Method and Description
boolean	add(T value)
void	clear()
boolean	contains(T value)
T	getCurrentValue(T value) Get the node with value.
T	remove(T value)
int	size()
Collection<T>	toCollection()
String	toString()
boolean	validate()

Methods inherited from class java.lang.Object

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

Constructor Detail

BTreeSet

public BTreeSet()

Constructor for B-Tree which defaults to a 2-3 B-Tree.

BTreeSet

public BTreeSet(int order)

Constructor for B-Tree of ordered parameter. Order here means minimum number of keys in a non-root node.

Parameters:

order - of the B-Tree.

Method Detail

add

public boolean add(T value)

remove

public T remove(T value)

clear

public void clear()

contains

public boolean contains(T value)

getCurrentValue

public T getCurrentValue(T value)

Get the node with value.

Parameters:

value - to find in the tree.

Returns:

T with value.

size

public int size()

validate

public boolean validate()

toCollection

public Collection<T> toCollection()

toString

public String toString()

Overrides:

toString in class Object