Modifier and Type | Method and Description |
---|---|
<E,N extends OpenNode<E,N>,R> |
QuerierImpl.partialReduce(N node,
BiFunction<N,Collection<R>,ReductionResult<R>> reducer) |
<E,N extends OpenNode<E,N>> |
QuerierImpl.pathsToLeaves(N node) |
Modifier and Type | Interface and Description |
---|---|
interface |
BalancingTree<E,N extends OpenNode<E,N>>
A mutable, self-balancing tree.
|
Modifier and Type | Method and Description |
---|---|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
Rebalancer.rebalance(T tree) |
Modifier and Type | Class and Description |
---|---|
class |
ImmutableNode<E,N extends OpenNode<E,? extends N>> |
class |
NonSettableNode<E,N extends OpenNode<E,? extends N>>
Abstract implementation of non-settable node.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractSettableNode<E,N extends OpenSettableNode<E,? extends N>>
Abstract settable node implementation.
|
class |
ImmutableNode<E,N extends OpenNode<E,? extends N>> |
class |
NonSettableNode<E,N extends OpenNode<E,? extends N>>
Abstract implementation of non-settable node.
|
Modifier and Type | Interface and Description |
---|---|
interface |
BinaryTreeNode<E>
A binary tree node.
|
interface |
MutableBinaryTreeNode<E>
A mutable, binary tree node.
|
interface |
OpenBinaryTreeNode<E,N extends OpenBinaryTreeNode<E,N>>
A binary tree node.
|
interface |
OpenMutableBinaryTreeNode<E,N extends OpenMutableBinaryTreeNode<E,N>>
A mutable binary tree node.
|
Modifier and Type | Class and Description |
---|---|
class |
BinaryTreeNodeImpl<E>
Binary tree node implementation.
|
Modifier and Type | Method and Description |
---|---|
<S extends OpenNode<E,S>> |
BinaryTreeConverter.build(Tree<E,S> sourceTree) |
Modifier and Type | Method and Description |
---|---|
Class<? extends OpenNode> |
BinaryTreeWrapper.NodeConverter.forClass() |
Modifier and Type | Class and Description |
---|---|
class |
MutableBinaryTreeNodeImpl<E>
Mutable binary tree node implementation.
|
Modifier and Type | Method and Description |
---|---|
<S extends OpenNode<E,S>> |
Converter.build(Tree<E,S> sourceTree) |
Modifier and Type | Class and Description |
---|---|
class |
WrappedBinaryNode<E>
Wrap a
MutableBinaryTreeNode as a BinaryTreeNode . |
Modifier and Type | Interface and Description |
---|---|
interface |
BaseTreeBuilder<E,N extends OpenNode<E,N>,B extends Tree<E,N>>
Base implementation of all tree builders.
|
interface |
BottomUpTreeBuilder<E,N extends OpenNode<E,N>>
Builder used to create the an empty tree or a non-empty tree.
|
interface |
TopDownTreeRootBuilder<E,N extends OpenNode<E,N>>
Builder used to create the root of a new tree or an empty tree.
|
static interface |
TopDownTreeRootBuilder.TopDownTreeBuilder<S,U extends OpenNode<S,U>>
Builder used to create a non-empty tree.
|
Modifier and Type | Method and Description |
---|---|
<E,N extends OpenNode<E,N>> |
TreeBuilderFactory.bottomUpBuilder()
Obtain a
BottomUpTreeBuilder . |
<E,N extends OpenNode<E,N>> |
TreeBuilderFactory.sortedTreeBuilder(Comparator<E> comparator,
SortingAlgorithm algorithm)
Obtain an
OrganisedTreeBuilder that creates sorted trees. |
<E extends Comparable<E>,N extends OpenNode<E,N>> |
TreeBuilderFactory.sortedTreeBuilder(SortingAlgorithm algorithm)
Obtain an
OrganisedTreeBuilder that creates sorted trees. |
<E extends Comparable<E>,N extends OpenNode<E,N>> |
TreeBuilderFactory.sortingTreeBuilder()
Obtain an
OrganisedTreeBuilder that creates sorting trees. |
<E,N extends OpenNode<E,N>> |
TreeBuilderFactory.sortingTreeBuilder(Comparator<E> comparator)
Obtain an
OrganisedTreeBuilder that creates sorting trees. |
<E,N extends OpenNode<E,N>> |
TreeBuilderFactory.topDownBuilder()
Obtain a
TopDownTreeRootBuilder . |
Modifier and Type | Class and Description |
---|---|
class |
TreeNodeImpl<E>
Immutable tree and tree node implementation.
|
Modifier and Type | Method and Description |
---|---|
<S extends OpenNode<E,S>> |
Converter.build(Tree<E,S> sourceTree) |
Modifier and Type | Method and Description |
---|---|
Class<? extends OpenNode> |
NodeConverter.forClass() |
Modifier and Type | Class and Description |
---|---|
class |
SortingTreeBuilderImpl<E,N extends OpenNode<E,N>> |
Modifier and Type | Method and Description |
---|---|
<E,N extends OpenNode<E,N>> |
TreeBuilderFactoryImpl.bottomUpBuilder() |
<E,N extends OpenNode<E,N>> |
TreeIteratorFactoryImpl.breadthFirstElementsIterator(Tree<E,N> tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeIteratorFactoryImpl.breadthFirstIterator(T tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
NodeStreamFactoryImpl.breadthFirstStream(T tree) |
<E,N extends OpenNode<E,N>> |
TreeIteratorFactoryImpl.inOrderElementsIterator(Tree<E,N> tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeIteratorFactoryImpl.inOrderIterator(T tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
NodeStreamFactoryImpl.inOrderStream(T tree) |
<E,N extends OpenNode<E,N>> |
TreeIteratorFactoryImpl.postOrderElementsIterator(Tree<E,N> tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeIteratorFactoryImpl.postOrderIterator(T tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
NodeStreamFactoryImpl.postOrderStream(T tree) |
<E,N extends OpenNode<E,N>> |
TreeIteratorFactoryImpl.preOrderElementsIterator(Tree<E,N> tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeIteratorFactoryImpl.preOrderIterator(T tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
NodeStreamFactoryImpl.preOrderStream(T tree) |
<E,N extends OpenNode<E,N>,T extends SortingTree<E,N>> |
NodeStreamFactoryImpl.sortedStream(T tree) |
<E,N extends OpenNode<E,N>> |
TreeBuilderFactoryImpl.sortedTreeBuilder(Comparator<E> comparator,
SortingAlgorithm algorithm) |
<E extends Comparable<E>,N extends OpenNode<E,N>> |
TreeBuilderFactoryImpl.sortedTreeBuilder(SortingAlgorithm algorithm) |
<E extends Comparable<E>,N extends OpenNode<E,N>> |
TreeBuilderFactoryImpl.sortingTreeBuilder() |
<E,N extends OpenNode<E,N>> |
TreeBuilderFactoryImpl.sortingTreeBuilder(Comparator<E> comparator) |
<E,N extends OpenNode<E,N>> |
TreeBuilderFactoryImpl.topDownBuilder() |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactoryImpl.walkBreadthFirst(T tree,
Walker<N> walker) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactoryImpl.walkElementsBreadthFirst(T tree,
Walker<E> walker) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactoryImpl.walkElementsInOrder(T tree,
Walker<E> walker) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactoryImpl.walkElementsPostOrder(T tree,
Walker<E> walker) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactoryImpl.walkElementsPreOrder(T tree,
TreeWalker<E> walker) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactoryImpl.walkElementsPreOrder(T tree,
Walker<E> walker) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactoryImpl.walkInOrder(T tree,
Walker<N> walker) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactoryImpl.walkPostOrder(T tree,
Walker<N> walker) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactoryImpl.walkPreOrder(T tree,
TreeWalker<N> walker) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactoryImpl.walkPreOrder(T tree,
Walker<N> walker) |
Modifier and Type | Method and Description |
---|---|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
EmptySortedTreeConstructorSupplier.get(Class<T> klass) |
Modifier and Type | Method and Description |
---|---|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
EmptyTreeConstructorSupplier.get(Class<T> klass) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeConverterSupplier.get(Class<T> klass) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeConstructorSupplier.get(Class<T> klass) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
EmptySortedTreeConstructorSupplierImpl.get(Class<T> klass) |
<E,N extends OpenNode<E,? extends N>,T extends Tree<E,? extends N>> |
NodeToRelatedTreeConverterSupplier.get(N node) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
IteratorRemoveHandlerSupplier.get(T tree) |
Modifier and Type | Class and Description |
---|---|
class |
LinkedTree<E>
A simple tree implementation.
|
Modifier and Type | Method and Description |
---|---|
<S extends OpenNode<E,S>> |
Converter.build(Tree<E,S> sourceTree) |
Modifier and Type | Method and Description |
---|---|
Class<? extends OpenNode> |
NodeConverter.forClass() |
Modifier and Type | Method and Description |
---|---|
static <E> Predicate<OpenNode<? extends E,?>> |
NeverMatcher.create() |
static <E> Predicate<OpenNode<? extends E,?>> |
AlwaysMatcher.create() |
static <E> Predicate<OpenNode<? extends E,?>> |
EqualsToMatcher.create(Comparator<E> comparator,
E value)
Create matcher using comparator.
|
static <E> Predicate<OpenNode<? extends E,?>> |
GreaterThanMatcher.create(Comparator<E> comparator,
E value)
Create matcher using comparator.
|
static <E> Predicate<OpenNode<? extends E,?>> |
LessThanMatcher.create(Comparator<E> comparator,
E value)
Create matcher using comparator.
|
static <E extends Comparable<E>> |
EqualsToMatcher.create(E value)
Create matcher using comparable.
|
static <E extends Comparable<E>> |
GreaterThanMatcher.create(E value)
Create matcher using comparable.
|
static <E extends Comparable<E>> |
LessThanMatcher.create(E value)
Create matcher using comparable.
|
Modifier and Type | Method and Description |
---|---|
boolean |
NeverMatcher.test(OpenNode<? extends E,?> node) |
boolean |
EqualsToMatcher.test(OpenNode<? extends E,?> openNode) |
boolean |
GreaterThanMatcher.test(OpenNode<? extends E,?> openNode) |
boolean |
IdentityMatcher.test(OpenNode<? extends E,?> node) |
boolean |
EqualityMatcher.test(OpenNode<? extends E,?> node) |
boolean |
LessThanMatcher.test(OpenNode<? extends E,?> openNode) |
boolean |
AlwaysMatcher.test(OpenNode<? extends E,?> node) |
boolean |
TypeMatcher.test(OpenNode<? extends Object,?> node) |
Modifier and Type | Interface and Description |
---|---|
interface |
MutableNode<E>
Represents a mutable node of a tree.
|
interface |
MutableSettableNode<E>
Represents a mutable node of a tree.
|
interface |
MutableSettableStructuredNode<E>
Mutable, settable, structural node.
|
interface |
OpenMutableNode<E,N extends OpenMutableNode<E,N>>
Represents a mutable node of a tree.
|
interface |
OpenMutableStructuralNode<E,N extends OpenMutableStructuralNode<E,N>>
Mutable structural node.
|
interface |
OpenSettableNode<E,N extends OpenSettableNode<E,? extends N>>
A node that allows the element it contains to be modified without changing the structure of the tree.
|
interface |
SettableNode<E>
A node that allows the element it contains to be modified without changing the structure of the tree.
|
Modifier and Type | Class and Description |
---|---|
class |
MutableTreeImpl<E>
Initial attempt at thread safety is base on copy on mutation.
|
Modifier and Type | Method and Description |
---|---|
<S extends OpenNode<E,S>> |
Converter.build(Tree<E,S> sourceTree) |
Modifier and Type | Interface and Description |
---|---|
interface |
MutableOrganisedTree<E,N extends OpenNode<E,N>>
A tree that determines the placement of its elements.
|
interface |
OrganisedTreeBuilder<E,N extends OpenNode<E,N>,T extends Tree<E,N>>
Builder used to create trees that determine the placement of their own elements.
|
Modifier and Type | Class and Description |
---|---|
class |
PathCopyNode<E>
Path copy node that uses holders to propagate changes up.
|
Modifier and Type | Method and Description |
---|---|
<S extends OpenNode<E,S>> |
Converter.build(Tree<E,S> sourceTree) |
Modifier and Type | Method and Description |
---|---|
default <E,N extends OpenNode<E,N>> |
Querier.height(N node)
Find the height of a node.
|
default <E,N extends OpenNode<E,N>> |
Querier.height(Tree<E,N> tree)
Find the height of the root node of a tree.
|
<E,N extends OpenNode<E,N>,R> |
Querier.partialReduce(N node,
BiFunction<N,Collection<R>,ReductionResult<R>> reducer)
Reduce the subtree starting at a node.
|
default <E,N extends OpenNode<E,N>,R> |
Querier.partialReduce(Tree<E,N> tree,
BiFunction<N,Collection<R>,ReductionResult<R>> reducer)
Reduce the subtree starting at a node.
|
<E,N extends OpenNode<E,N>> |
Querier.pathsToLeaves(N node)
Find all the paths to leaf nodes from the provided node.
|
default <E,N extends OpenNode<E,N>> |
Querier.pathsToLeaves(Tree<E,N> tree)
Find all the paths to leaf nodes from the root node of the tree.
|
default <E,N extends OpenNode<E,N>,R> |
Querier.reduce(N node,
BiFunction<N,Collection<R>,R> reducer)
Reduce the subtree starting at a node.
|
default <E,N extends OpenNode<E,N>,R> |
Querier.reduce(Tree<E,N> tree,
BiFunction<N,Collection<R>,R> reducer)
Reduce the subtree starting at a node.
|
Modifier and Type | Method and Description |
---|---|
<N extends OpenNode<E,? extends N>,T extends Tree<E,? extends N>> |
TreeSelector.select(T tree) |
<N extends OpenNode<E,? extends N>,T extends Tree<E,? extends N>,O extends OpenNode<E,O>,U extends Tree<E,O>> |
TreeSelector.select(T tree,
Class<U> newTreeType) |
<N extends OpenNode<E,? extends N>,T extends Tree<E,? extends N>,O extends OpenNode<E,O>,U extends Tree<E,O>> |
TreeSelector.select(T tree,
Class<U> newTreeType) |
<N extends OpenNode<E,? extends N>> |
NodeSelector.select(Tree<E,? extends N> tree) |
Modifier and Type | Method and Description |
---|---|
<E> NodeSelector<E> |
NodeSelectorFactory.newSelector(NodeSelector<E> selector,
Predicate<OpenNode<? extends E,?>> predicate)
Create a node selector for the children of another node selector.
|
<E> TreeSelector<E> |
TreeSelectorFactory.newSelector(Predicate<OpenNode<? extends E,?>> predicate)
Create a tree selector for the root node (entire tree).
|
<E> NodeSelector<E> |
NodeSelectorFactory.newSelector(Predicate<OpenNode<? extends E,?>> predicate)
Create a node selector for the root node.
|
<E> TreeSelector<E> |
TreeSelectorFactory.newSelector(TreeSelector<E> selector,
Predicate<OpenNode<? extends E,?>> predicate)
Create a tree selector for the children of another tree selector.
|
Modifier and Type | Method and Description |
---|---|
protected abstract <N extends OpenNode<E,? extends N>> |
ExtendingNodeSelector.getExtendingIterator(N nodeToExtendFrom)
Abstract method that is used to take one node returned by the base selector and return an iterator over the
extended selection.
|
protected <N extends OpenNode<E,? extends N>> |
ChildSelector.getExtendingIterator(N nodeToExtendFrom) |
<N extends OpenNode<E,? extends N>> |
NextNodeSelector.select(Tree<E,? extends N> tree) |
<N extends OpenNode<E,? extends N>> |
ExtendingNodeSelector.select(Tree<E,? extends N> tree) |
<N extends OpenNode<E,? extends N>> |
RootMatcherSelector.select(Tree<E,? extends N> tree) |
<N extends OpenNode<E,? extends N>> |
SelectorNodeSelector.select(Tree<E,? extends N> tree) |
Constructor and Description |
---|
NextNodeSelector(NodeSelector<E> selector,
Predicate<OpenNode<? extends E,?>> predicate) |
RootMatcherSelector(Predicate<OpenNode<? extends E,?>> predicate) |
Modifier and Type | Interface and Description |
---|---|
interface |
SortedTreeBuilder<E,N extends OpenNode<E,N>>
Builder use to create sorted trees.
|
interface |
SortingTree<E,N extends OpenNode<E,N>>
A mutable, organised tree that sorts the elements passed to it.
|
interface |
SortingTreeBuilder<E,N extends OpenNode<E,N>>
Builder used to create sorting trees.
|
Modifier and Type | Class and Description |
---|---|
class |
DefaultRemovalHandler<E,N extends OpenNode<E,N>,T extends Tree<E,N>>
Default handler for removal operations through an iterator.
|
interface |
EmptySortedTreeConstructor<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
interface |
EmptyTreeConstructor<E,N extends OpenNode<E,N>,T extends Tree<E,N>>
Used to create empty trees.
|
interface |
IteratorRemoveHandler<E,N extends OpenNode<E,N>,T extends Tree<E,N>>
Handle the removal of a node through an iterator.
|
interface |
NodeToRelatedTreeConverter<E,N extends OpenNode<E,? extends N>,T extends Tree<E,? extends N>>
Takes a node and creates a subtree with the node as the root.
|
interface |
ParentReferenceFactory<E,O extends OpenNode<E,O>>
Factory for
ParentReference objects. |
interface |
Rotator<E,N extends OpenNode<E,N>>
Rotator SPI component.
|
interface |
TreeConstructor<E,N extends OpenNode<E,? extends N>,T extends Tree<E,? extends N>>
Used to create trees from the bottom up.
|
interface |
TreeConverter<E,N extends OpenNode<E,N>,T extends Tree<E,N>>
Converts a tree of one type to another.
|
Modifier and Type | Method and Description |
---|---|
<S extends OpenNode<E,S>> |
TreeConverter.build(Tree<E,S> sourceTree) |
Modifier and Type | Method and Description |
---|---|
OpenNode<?,?> |
TreeRestructurer.setRoot(OpenNode<?,?> newRoot) |
Modifier and Type | Method and Description |
---|---|
Class<? extends OpenNode> |
NodeKeyedSPIComponent.forClass() |
Modifier and Type | Method and Description |
---|---|
void |
TreeRestructurer.moveNode(OpenNode<?,?> node,
OpenNode<?,?> newParent) |
void |
TreeRestructurer.moveNode(OpenNode<?,?> node,
OpenNode<?,?> newParent) |
OpenNode<?,?> |
TreeRestructurer.setRoot(OpenNode<?,?> newRoot) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractNodeToRelatedTreeConverter<E,N extends OpenNode<E,N>,T extends Tree<E,N>>
Abstract implementation for converting a node to a tree by copying the subtree.
|
Modifier and Type | Method and Description |
---|---|
boolean |
RegexMatcher.test(OpenNode<? extends String,?> node) |
Modifier and Type | Class and Description |
---|---|
class |
DefaultNodeWalker<E,N extends OpenNode<E,? extends N>>
Default node walker implementation that can be extended.
|
Modifier and Type | Method and Description |
---|---|
<E,N extends OpenNode<E,N>> |
TreeIteratorFactory.breadthFirstElementsIterator(Tree<E,N> tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeIteratorFactory.breadthFirstIterator(T tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
NodeStreamFactory.breadthFirstStream(T tree)
Create a stream of nodes from a tree.
|
<E,N extends OpenNode<E,N>> |
TreeIteratorFactory.inOrderElementsIterator(Tree<E,N> tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeIteratorFactory.inOrderIterator(T tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
NodeStreamFactory.inOrderStream(T tree)
Create a stream of nodes from a tree.
|
<E,N extends OpenNode<E,N>> |
TreeIteratorFactory.postOrderElementsIterator(Tree<E,N> tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeIteratorFactory.postOrderIterator(T tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
NodeStreamFactory.postOrderStream(T tree)
Create a stream of nodes from a tree.
|
<E,N extends OpenNode<E,N>> |
TreeIteratorFactory.preOrderElementsIterator(Tree<E,N> tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeIteratorFactory.preOrderIterator(T tree) |
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
NodeStreamFactory.preOrderStream(T tree)
Create a stream of nodes from a tree.
|
<E,N extends OpenNode<E,N>,T extends SortingTree<E,N>> |
NodeStreamFactory.sortedStream(T tree)
Create a sorted stream of nodes from a sorting tree.
|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactory.walkBreadthFirst(T tree,
Walker<N> walker)
Traverse the tree in breadth first order.
|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactory.walkElementsBreadthFirst(T tree,
Walker<E> walker)
Traverse the tree elements in breadth first order.
|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactory.walkElementsInOrder(T tree,
Walker<E> walker)
Traverse the tree elements in order.
|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactory.walkElementsPostOrder(T tree,
Walker<E> walker)
Traverse the tree elements in post order.
|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactory.walkElementsPreOrder(T tree,
TreeWalker<E> walker)
Traverse the tree elements in preorder.
|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactory.walkElementsPreOrder(T tree,
Walker<E> walker)
Traverse the tree elements in preorder.
|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactory.walkInOrder(T tree,
Walker<N> walker)
Traverse the tree in order.
|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactory.walkPostOrder(T tree,
Walker<N> walker)
Traverse the tree in post order.
|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactory.walkPreOrder(T tree,
TreeWalker<N> walker)
Traverse the tree in preorder.
|
<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
TreeWalkerFactory.walkPreOrder(T tree,
Walker<N> walker)
Traverse the tree in preorder.
|
Modifier and Type | Class and Description |
---|---|
class |
BreadthFirstIterator<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
class |
InOrderIterator<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
class |
NodeToElementIterators<E,N extends OpenNode<E,N>>
An element iterator that delegates to a Node iterator and unwraps the return to an element.
|
class |
PostOrderIterator<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
class |
PreOrderIterator<E,N extends OpenNode<E,N>,T extends Tree<E,N>> |
class |
RemoveHandlerIterator<E,N extends OpenNode<E,N>,T extends Tree<E,N>>
Iterator that provides support for removing elements from trees.
|
class |
TraversalState<E,N extends OpenNode<E,N>>
Traversal state.
|
Modifier and Type | Interface and Description |
---|---|
interface |
OpenNode<E,N extends OpenNode<E,? extends N>>
Represents a node of the tree.
|
interface |
Tree<E,N extends OpenNode<E,? extends N>>
Represents a tree.
|
Modifier and Type | Interface and Description |
---|---|
interface |
Node<E>
Represents a node of the tree.
|
interface |
OpenStructuralNode<E,N extends OpenStructuralNode<E,N>>
Node that has children in specific places.
|
Modifier and Type | Method and Description |
---|---|
static <E,N extends OpenNode<E,N>> |
Tree.typeKey()
Construct a TypeKey for a specific element type.
|
Modifier and Type | Class and Description |
---|---|
class |
NodeToElementTreeWalker<E,N extends OpenNode<E,N>>
A Node tree walker that unwraps the elements and passes them to a delegated element tree walker.
|
class |
NodeToElementWalker<E,N extends OpenNode<E,N>>
A Node walker that unwraps the elements and passes them to a delegated element walker.
|
Modifier and Type | Method and Description |
---|---|
<E,N extends OpenNode<E,N>> |
PreOrderTreeTraversalDriver.traverseTree(Tree<E,N> tree,
TreeWalker<N> walker) |
<E,N extends OpenNode<E,N>> |
TraversalDriver.traverseTree(Tree<E,N> tree,
Walker<N> walker)
Traverse the tree.
|
<E,N extends OpenNode<E,N>> |
PostOrderWalkerDriver.traverseTree(Tree<E,N> tree,
Walker<N> walker) |
<E,N extends OpenNode<E,N>> |
PreOrderTraversalDriver.traverseTree(Tree<E,N> tree,
Walker<N> walker) |
<E,N extends OpenNode<E,N>> |
InOrderTraversalDriver.traverseTree(Tree<E,N> tree,
Walker<N> walker) |
<E,N extends OpenNode<E,N>> |
BreadthFirstTraversalDriver.traverseTree(Tree<E,N> tree,
Walker<N> walker) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractTreeWrapper<E,N extends OpenNode<E,? extends N>>
Abstract implementation of a tree wrapper.
|
class |
SimpleTreeWrapper<E,N extends OpenNode<E,? extends N>>
Simple implementation of a tree wrapper.
|
Copyright © 2014–2016. All rights reserved.