org.dllearner.utilities.datastructures

Class AbstractSearchTree<T extends AbstractSearchTreeNode>

java.lang.Object

org.dllearner.utilities.datastructures.AbstractSearchTree<T>

Direct Known Subclasses:

SearchTree, SynchronizedSearchTree

public class AbstractSearchTree<T extends AbstractSearchTreeNode>
extends Object

Constructor Summary

Constructors

Constructor and Description
AbstractSearchTree(Heuristic<T> heuristic) create a new search tree

Method Summary

Modifier and Type	Method and Description
void	addNode(T parentNode, T node) add node to the search tree
T	best()
Iterator<T>	descendingIterator()
SortedSet<T>	descendingSet()
Heuristic<T>	getHeuristic()
Set<T>	getNodeSet()
T	getRoot()
void	notifyNode(T node) internally used by tree<->node contract to notify a tree about an added node
void	setRoot(T node) set the tree root to a node
int	size()
void	updateDone(T node) must be called after modifying a node, to support immutable set element pattern
void	updatePrepare(T node) must be called before modifying a node, to support immutable set element pattern

Methods inherited from class java.lang.Object

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

Constructor Detail

AbstractSearchTree

public AbstractSearchTree(Heuristic<T> heuristic)

create a new search tree

Parameters:

heuristic - the comparator to use for the nodes

Method Detail

addNode

public void addNode(T parentNode,
                    T node)

add node to the search tree

Parameters:

parentNode - the parent node or null if root

node - the node to add

notifyNode

public final void notifyNode(T node)

internally used by tree<->node contract to notify a tree about an added node

Parameters:

node - the node

setRoot

public void setRoot(T node)

set the tree root to a node

Parameters:

node - the node

updatePrepare

public final void updatePrepare(T node)

must be called before modifying a node, to support immutable set element pattern

Parameters:

node - the node

updateDone

public final void updateDone(T node)

must be called after modifying a node, to support immutable set element pattern

descendingIterator

public Iterator<T> descendingIterator()

Returns:

an iterator over the elements in this search tree in descending comparison order

descendingSet

public SortedSet<T> descendingSet()

Returns:

a set of the nodes in the search tree ordered in descending comparison order

best

public T best()

Returns:

best node according to comparator

getNodeSet

public Set<T> getNodeSet()

Returns:

the underlying set of all tree nodes

size

public int size()

Returns:

the tree size

getRoot

public T getRoot()

Returns:

the tree root node

getHeuristic

public Heuristic<T> getHeuristic()