kemitix/node
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Node: remove pointless final in parameters in interface

Browse source
This commit is contained in:
Paul Campbell 2016-05-24 14:10:46 +01:00
parent a5c1fc72fd
commit e9c6300ad4
1 changed files with 8 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

16
src/main/java/net/kemitix/node/Node.java
View file

@ -56,7 +56,7 @@ public interface Node<T> {
* *
* @param parent the new parent node * @param parent the new parent node
*/ */
void setParent(final Node<T> parent); void setParent(Node<T> parent);
/** /**
* Fetches the child nodes. * Fetches the child nodes.
@ -70,7 +70,7 @@ public interface Node<T> {
* *
* @param child the node to add * @param child the node to add
*/ */
void addChild(final Node<T> child); void addChild(Node<T> child);
/** /**
* Creates a new node and adds it as a child of the current node. * Creates a new node and adds it as a child of the current node.
@ -79,7 +79,7 @@ public interface Node<T> {
* *
* @return the new child node * @return the new child node
*/ */
Node<T> createChild(final T child); Node<T> createChild(T child);
/** /**
* Populates the tree with the path of nodes, each being a child of the * Populates the tree with the path of nodes, each being a child of the
@ -87,7 +87,7 @@ public interface Node<T> {
* *
* @param descendants the line of descendants from the current node * @param descendants the line of descendants from the current node
*/ */
void createDescendantLine(final List<T> descendants); void createDescendantLine(List<T> descendants);
/** /**
* Looks for a child node and returns it, creating a new child node if one * Looks for a child node and returns it, creating a new child node if one
@ -97,7 +97,7 @@ public interface Node<T> {
* *
* @return the found or created child node * @return the found or created child node
*/ */
Node<T> findOrCreateChild(final T child); Node<T> findOrCreateChild(T child);
/** /**
* Fetches the node for the child if present. * Fetches the node for the child if present.
@ -106,7 +106,7 @@ public interface Node<T> {
* *
* @return an {@link Optional} containing the child node if found * @return an {@link Optional} containing the child node if found
*/ */
Optional<Node<T>> getChild(final T child); Optional<Node<T>> getChild(T child);
/** /**
* Checks if the node is an ancestor. * Checks if the node is an ancestor.
@ -115,7 +115,7 @@ public interface Node<T> {
* *
* @return true if the node is an ancestor * @return true if the node is an ancestor
*/ */
boolean isChildOf(final Node<T> node); boolean isChildOf(Node<T> node);
/** /**
* Walks the node tree using the path to select each child. * Walks the node tree using the path to select each child.
@ -124,7 +124,7 @@ public interface Node<T> {
* *
* @return the child or null * @return the child or null
*/ */
Optional<Node<T>> walkTree(final List<T> path); Optional<Node<T>> walkTree(List<T> path);
/** /**
* Places the node in the tree under by the path. Intervening empty * Places the node in the tree under by the path. Intervening empty