Package kieker.analysis.generic.clustering.mtree.nodes

Class AbstractNode<T>

java.lang.Object

kieker.analysis.generic.clustering.mtree.nodes.IndexItem<T>

kieker.analysis.generic.clustering.mtree.nodes.AbstractNode<T>

Type Parameters:

T - data element type

Direct Known Subclasses:

InternalNode, LeafNode, RootLeafNode, RootNode

public abstract class AbstractNode<T>
extends IndexItem<T>

Since:

2.0.0

Author:

Eduardo R. D'Avila

Field Summary

Fields

Modifier and Type	Field	Description
protected ILeafness<T>	leafness
protected IRootness	rootness

Fields inherited from class kieker.analysis.generic.clustering.mtree.nodes.IndexItem

radius

Constructor Summary

Constructors

Modifier	Constructor	Description
protected	AbstractNode(MTree<T> mtree, T data)

Method Summary

Modifier and Type	Method	Description
void	addChild(IndexItem<T> child, double distance)
void	addData(T data, double distance)
int	check()
protected void	checkDistanceToParent()
void	checkMinCapacity()
protected void	doAddData(T data, double distance)
protected boolean	doRemoveData(T data, double distance)
java.util.Map<T,IndexItem<T>>	getChildren()
protected int	getMinCapacity()
MTree<T>	getMTree()
boolean	isMaxCapacityExceeded()
boolean	isNodeUnderCapacity()
protected AbstractNode<T>	newSplitNodeReplacement(T data)
boolean	removeData(T data, double distance)
Pair<AbstractNode<T>>	splitNodes()
void	updateMetrics(IndexItem<T> child, double distance)
void	updateRadius(IndexItem<T> child)

Methods inherited from class kieker.analysis.generic.clustering.mtree.nodes.IndexItem

getData, getDistanceToParent, getRadius, setDistanceToParent

Methods inherited from class java.lang.Object

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

Field Details

rootness

protected IRootness rootness

leafness

protected ILeafness<T> leafness

Constructor Details

AbstractNode

protected AbstractNode(MTree<T> mtree, T data)

Method Details

getChildren

public java.util.Map<T,IndexItem<T>> getChildren()

addData

public final void addData(T data, double distance) throws InternalErrorException

Throws:

InternalErrorException

check

public int check()

doAddData

protected void doAddData(T data, double distance) throws InternalErrorException

Throws:

InternalErrorException

doRemoveData

protected boolean doRemoveData(T data, double distance) throws InternalErrorException

Throws:

InternalErrorException

isMaxCapacityExceeded

public final boolean isMaxCapacityExceeded() throws InternalErrorException

Throws:

InternalErrorException

splitNodes

public final Pair<AbstractNode<T>> splitNodes() throws InternalErrorException

Throws:

InternalErrorException

newSplitNodeReplacement

protected AbstractNode<T> newSplitNodeReplacement(T data)

addChild

public void addChild(IndexItem<T> child, double distance) throws InternalErrorException

Throws:

InternalErrorException

removeData

public boolean removeData(T data, double distance) throws InternalErrorException

Throws:

InternalErrorException

isNodeUnderCapacity

public boolean isNodeUnderCapacity() throws InternalErrorException

Throws:

InternalErrorException

getMinCapacity

protected int getMinCapacity() throws InternalErrorException

Throws:

InternalErrorException

updateMetrics

public void updateMetrics(IndexItem<T> child, double distance)

updateRadius

public void updateRadius(IndexItem<T> child)

checkMinCapacity

public void checkMinCapacity()

checkDistanceToParent

protected void checkDistanceToParent()

Overrides:

checkDistanceToParent in class IndexItem<T>

getMTree

public MTree<T> getMTree()