From e9c6300ad41b7670987dc6329121da651ab1a421 Mon Sep 17 00:00:00 2001
From: Paul Campbell <pcampbell@kemitix.net>
Date: Tue, 24 May 2016 14:10:46 +0100
Subject: [PATCH] Node: remove pointless final in parameters in interface

---
 src/main/java/net/kemitix/node/Node.java | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/src/main/java/net/kemitix/node/Node.java b/src/main/java/net/kemitix/node/Node.java
index a8dccdf..9c432dc 100644
--- a/src/main/java/net/kemitix/node/Node.java
+++ b/src/main/java/net/kemitix/node/Node.java
@@ -56,7 +56,7 @@ public interface Node<T> {
      *
      * @param parent the new parent node
      */
-    void setParent(final Node<T> parent);
+    void setParent(Node<T> parent);
 
     /**
      * Fetches the child nodes.
@@ -70,7 +70,7 @@ public interface Node<T> {
      *
      * @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.
@@ -79,7 +79,7 @@ public interface Node<T> {
      *
      * @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
@@ -87,7 +87,7 @@ public interface Node<T> {
      *
      * @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
@@ -97,7 +97,7 @@ public interface Node<T> {
      *
      * @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.
@@ -106,7 +106,7 @@ public interface Node<T> {
      *
      * @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.
@@ -115,7 +115,7 @@ public interface Node<T> {
      *
      * @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.
@@ -124,7 +124,7 @@ public interface Node<T> {
      *
      * @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