Uses of Interface
org.arakhne.afc.math.tree.IterableNode
-
Packages that use IterableNode 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 IterableNode in org.arakhne.afc.gis.tree
Subinterfaces of IterableNode 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 IterableNode 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 IterableNode in org.arakhne.afc.math.tree
Classes in org.arakhne.afc.math.tree with type parameters of type IterableNode Modifier and Type Interface Description interface
IterableNode<N extends IterableNode<?>>
This interface is used to specify the base functions of a tree node which is usable by an tree iterator.Subinterfaces of IterableNode in org.arakhne.afc.math.tree Modifier and Type Interface Description interface
TreeNode<D,N extends TreeNode<D,?>>
This is the generic implementation of a tree node. -
Uses of IterableNode in org.arakhne.afc.math.tree.iterator
Classes in org.arakhne.afc.math.tree.iterator with type parameters of type IterableNode Modifier and Type Class Description class
AbstractBroadFirstTreeIterator<P extends IterableNode<? extends C>,C extends IterableNode<?>>
This class is an iterator on a tree.class
AbstractBroadFirstTreeIterator<P extends IterableNode<? extends C>,C extends IterableNode<?>>
This class is an iterator on a tree.class
AbstractInfixDepthFirstTreeIterator<P extends IterableNode<? extends C>,C extends IterableNode<?>>
This class is an infixed depth-first iterator on a tree.class
AbstractInfixDepthFirstTreeIterator<P extends IterableNode<? extends C>,C extends IterableNode<?>>
This class is an infixed depth-first iterator on a tree.class
AbstractPostfixDepthFirstTreeIterator<P extends IterableNode<? extends C>,C extends IterableNode<?>>
This class is an postfixed iterator on a tree.class
AbstractPostfixDepthFirstTreeIterator<P extends IterableNode<? extends C>,C extends IterableNode<?>>
This class is an postfixed iterator on a tree.class
AbstractPrefixDepthFirstTreeIterator<P extends IterableNode<? extends C>,C extends IterableNode<?>>
This class is an prefixed iterator on a tree.class
AbstractPrefixDepthFirstTreeIterator<P extends IterableNode<? extends C>,C extends IterableNode<?>>
This class is an prefixed iterator on a tree. -
Uses of IterableNode in org.arakhne.afc.math.tree.node
Classes in org.arakhne.afc.math.tree.node that implement IterableNode 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.
-