Uses of Interface
org.arakhne.afc.math.tree.TreeNode
-
Packages that use TreeNode Package Description org.arakhne.afc.gis.tree org.arakhne.afc.math.tree org.arakhne.afc.math.tree.iterator org.arakhne.afc.math.tree.node -
-
Uses of TreeNode in org.arakhne.afc.gis.tree
Classes in org.arakhne.afc.gis.tree with type parameters of type TreeNode Modifier and Type Interface Description (package private) interface
GISTreeSetNodeFactory<P extends GISPrimitive,N extends TreeNode<P,N>>
Builder for GIS tree nodes.Subinterfaces of TreeNode in org.arakhne.afc.gis.tree Modifier and Type Interface Description interface
GISTreeNode<P extends GISPrimitive,N extends GISTreeNode<P,N>>
This interfaces defines a tree node for aGISTreeSet
.Classes in org.arakhne.afc.gis.tree that implement TreeNode Modifier and Type Class Description (package private) class
AbstractGISTreeSetNode<P extends GISPrimitive,N extends AbstractGISTreeSetNode<P,N>>
A node inside aStandardGISTreeSet
.(package private) class
GISTreeSetNode<P extends GISPrimitive>
A node inside aStandardGISTreeSet
.(package private) class
WeakGISTreeSetNode<P extends GISPrimitive>
A node inside aWeakGISTreeSet
. -
Uses of TreeNode in org.arakhne.afc.math.tree
Classes in org.arakhne.afc.math.tree with type parameters of type TreeNode Modifier and Type Class Description class
AbstractTree<D,N extends TreeNode<D,N>>
This is the generic implementation of a tree based on linked lists.interface
BroadFirstIterableTree<D,N extends TreeNode<D,?>>
This is the generic implementation of a tree service that permits to iterate with a broad-first approach.interface
DepthFirstIterableTree<D,N extends TreeNode<D,?>>
This is the generic implementation of a tree service that permits to iterator with a depth-first approach.interface
IcosepTreeNodeContainer<N extends TreeNode<?,N>>
This interfaces permits to define a tree node container which is containing an icosep tree node.class
LinkedTree<D,N extends TreeNode<D,N>>
This is the generic implementation of a tree based on linked lists.interface
Tree<D,N extends TreeNode<D,?>>
This is the generic implementation of a tree.interface
TreeNode<D,N extends TreeNode<D,?>>
This is the generic implementation of a tree node.Methods in org.arakhne.afc.math.tree that return TreeNode Modifier and Type Method Description TreeNode<?,?>
TreeNodeAddedEvent. getChild()
Replies the child node that changed.TreeNode<?,?>
TreeNodeRemovedEvent. getChild()
Replies the child node that changed.TreeNode<?,?>
TreeNodeParentChangedEvent. getChildNode()
Replies the node that fire the event.N[]
TreeNode. getChildren(Class<N> type)
Replies the child nodes of this node.TreeNode<?,?>
TreeNodeParentChangedEvent. getNewParent()
Replies the new parent node.TreeNode<?,?>
TreeDataEvent. getNode()
Replies the node on which the event occurs.TreeNode<?,?>
TreeNodeParentChangedEvent. getOldParent()
Replies the old parent node.TreeNode<?,?>
TreeNodeAddedEvent. getParentNode()
Replies the node that fire the event.TreeNode<?,?>
TreeNodeRemovedEvent. getParentNode()
Replies the node that fire the event.Methods in org.arakhne.afc.math.tree that return types with arguments of type TreeNode Modifier and Type Method Description Iterator<TreeNode<D,?>>
AbstractForest. broadFirstIterator()
Iterator<TreeNode<D,?>>
Forest. broadFirstIterator()
Replies a broad first iterator on nodes.Iterator<TreeNode<D,?>>
AbstractForest. depthFirstIterator()
Iterator<TreeNode<D,?>>
AbstractForest. depthFirstIterator(DepthFirstNodeOrder nodeOrder)
Iterator<TreeNode<D,?>>
Forest. depthFirstIterator()
Replies a depth-first iterator on nodes.Iterator<TreeNode<D,?>>
Forest. depthFirstIterator(DepthFirstNodeOrder nodeOrder)
Replies a depth-first iterator on nodes.Constructors in org.arakhne.afc.math.tree with parameters of type TreeNode Constructor Description TreeDataEvent(TreeNode<?,?> node1, int delta1, Collection<?> allValues1)
Construct an event.TreeDataEvent(TreeNode<?,?> node1, Collection<?> oldValues1, Collection<?> newValues1, Collection<?> allValues1)
Construct an event.TreeNodeAddedEvent(TreeNode<?,?> source1, int childIndex1, TreeNode<?,?> child1)
Construct the event.TreeNodeParentChangedEvent(TreeNode<?,?> child, TreeNode<?,?> oldParent1, TreeNode<?,?> newParent1)
Constructor.TreeNodeRemovedEvent(TreeNode<?,?> source1, int childIndex1, TreeNode<?,?> child1)
Constructor. -
Uses of TreeNode in org.arakhne.afc.math.tree.iterator
Classes in org.arakhne.afc.math.tree.iterator with type parameters of type TreeNode Modifier and Type Class Description class
AbstractDataTreeIterator<D,N extends TreeNode<D,?>>
This class is an iterator on a tree that replies the user data.class
BroadFirstTreeIterator<N extends TreeNode<?,N>>
This class is an iterator on a tree.class
DataBroadFirstTreeIterator<D,N extends TreeNode<D,N>>
This class is an iterator on a tree that replies the user data.interface
DataSelectionTreeIterator<D,N extends TreeNode<D,?>>
This interface is used to represent an iterator on the tree's data with selection.class
InfixDataDepthFirstTreeIterator<D,N extends TreeNode<D,N>>
This class is an infixed depth-first iterator on a tree data.class
InfixDepthFirstTreeIterator<N extends TreeNode<?,N>>
This class is an infixed depth-first iterator on a tree.interface
NodeSelectionTreeIterator<N extends TreeNode<?,?>>
This interface is used to represent an iterator on the tree's data with selection.interface
NodeSelector<N extends TreeNode<?,?>>
This interface is used to select the nodes to treat by a Data*TreeIterator.class
PostfixDataDepthFirstTreeIterator<D,N extends TreeNode<D,N>>
This class is an postfixed iterator on a tree data.class
PostfixDepthFirstTreeIterator<N extends TreeNode<?,N>>
This class is an postfixed iterator on a tree.class
PrefixDataDepthFirstTreeIterator<D,N extends TreeNode<D,N>>
This class is an prefixed iterator on a tree data.class
PrefixDepthFirstTreeIterator<N extends TreeNode<?,N>>
This class is an prefixed iterator on a tree.Methods in org.arakhne.afc.math.tree.iterator that return TreeNode Modifier and Type Method Description TreeNode<D,?>
BroadFirstForestIterator. next()
TreeNode<D,?>
DepthFirstForestIterator. next()
-
Uses of TreeNode in org.arakhne.afc.math.tree.node
Classes in org.arakhne.afc.math.tree.node with type parameters of type TreeNode Modifier and Type Class Description class
UnsupportedOperationTreeNode<D,N extends TreeNode<D,N>>
Generic implementation of a tree node that throwsUnsupportedOperationException
for all its operation.Classes in org.arakhne.afc.math.tree.node that implement TreeNode Modifier and Type Class Description class
AbstractParentlessTreeNode<D,N extends AbstractParentlessTreeNode<D,N>>
This is the very generic implementation of a tree node which does not made any implementation choice about how this node is related to its parent node.class
AbstractTreeNode<D,N extends AbstractTreeNode<D,N>>
This is the generic implementation of a tree tree with a weak reference to its parent node.class
BinaryTreeNode<D,N extends BinaryTreeNode<D,N>>
This is the generic implementation of a binary tree.static class
BinaryTreeNode.DefaultBinaryTreeNode<D>
This is the generic implementation of a ternary tree.class
ConstantNaryTreeNode<D,N extends ConstantNaryTreeNode<D,N>>
This is the generic implementation of a n-ary tree.static class
ConstantNaryTreeNode.DefaultConstantNaryTreeNode<D>
This is the generic implementation of a n-ary tree.class
IcosepBinaryTreeNode<D,N extends IcosepBinaryTreeNode<D,N>>
This is the generic implementation of a tree for which each node has two children and that implements the Icosep heuristic.static class
IcosepBinaryTreeNode.DefaultIcosepBinaryTreeNode<D>
This is the generic implementation of a quad tree with icosep heuristic.class
IcosepOctTreeNode<D,N extends IcosepOctTreeNode<D,N>>
This is the generic implementation of a tree for which each node has height children and that implements the Icosep heuristic.static class
IcosepOctTreeNode.DefaultIcosepOctTreeNode<D>
This is the generic implementation of a quad tree with icosep heuristic.class
IcosepQuadTreeNode<D,N extends IcosepQuadTreeNode<D,N>>
This is the generic implementation of a tree for which each node has four children and that implements the Icosep heuristic.static class
IcosepQuadTreeNode.DefaultIcosepQuadTreeNode<D>
This is the generic implementation of a quad tree with icosep heuristic.class
NaryTreeNode<D,N extends NaryTreeNode<D,N>>
This is the generic implementation of a n-ary tree.static class
NaryTreeNode.DefaultNaryTreeNode<D>
This is the generic implementation of a n-ary tree.class
OctTreeNode<D,N extends OctTreeNode<D,N>>
This is the generic implementation of a tree for which each node has eight children.static class
OctTreeNode.DefaultOctTreeNode<D>
This is the generic implementation of a oct tree.class
PentaTreeNode<D,N extends PentaTreeNode<D,N>>
This is the generic implementation of a tree for which each node has five children.static class
PentaTreeNode.DefaultPentaTreeNode<D>
This is the generic implementation of a quad tree.class
QuadTreeNode<D,N extends QuadTreeNode<D,N>>
This is the generic implementation of a tree for which each node has four children.static class
QuadTreeNode.DefaultQuadTreeNode<D>
This is the generic implementation of a quad tree.class
TernaryTreeNode<D,N extends TernaryTreeNode<D,N>>
This is the generic implementation of a ternary tree.static class
TernaryTreeNode.DefaultTernaryTreeNode<D>
This is the generic implementation of a ternary tree.class
UnsupportedOperationTreeNode<D,N extends TreeNode<D,N>>
Generic implementation of a tree node that throwsUnsupportedOperationException
for all its operation.Methods in org.arakhne.afc.math.tree.node that return TreeNode Modifier and Type Method Description N[]
UnsupportedOperationTreeNode. getChildren(Class<N> type)
-