X-Git-Url: https://git.pterodactylus.net/?p=jSite2.git;a=blobdiff_plain;f=src%2Fnet%2Fpterodactylus%2Futil%2Fdata%2FNodeImpl.java;h=0f719c8501ea00614740476b1110640ef04b3122;hp=266cea1f49533e958b57c5101c88abd103cf0160;hb=c63257e8cc0ba1a5aca9364b22171abe7279d479;hpb=55be4a9e8373d72a9e1c25a3c8150651bb19679d

diff --git a/src/net/pterodactylus/util/data/NodeImpl.java b/src/net/pterodactylus/util/data/NodeImpl.java
index 266cea1..0f719c8 100644
--- a/src/net/pterodactylus/util/data/NodeImpl.java
+++ b/src/net/pterodactylus/util/data/NodeImpl.java
@@ -9,7 +9,7 @@ import java.util.List;
 
 /**
  * Implementation of the {@link Node} interface.
- * 
+ *
  * @author David ‘Bombe’ Roden <bombe@freenetproject.org>
  * @param <E>
  *            The type of the element to store
@@ -35,7 +35,7 @@ class NodeImpl<E extends Comparable<E>> implements Node<E> {
 
 	/**
 	 * Creates a new node with the given parent and element.
-	 * 
+	 *
 	 * @param parentNode
 	 *            The parent of this node
 	 * @param element
@@ -90,7 +90,7 @@ class NodeImpl<E extends Comparable<E>> implements Node<E> {
 	 * {@inheritDoc}
 	 */
 	public Node<E> getChild(E element) {
-		for (Node<E> childNode: children) {
+		for (Node<E> childNode : children) {
 			if (childNode.getElement().equals(element)) {
 				return childNode;
 			}
@@ -109,7 +109,7 @@ class NodeImpl<E extends Comparable<E>> implements Node<E> {
 	 * {@inheritDoc}
 	 */
 	public boolean hasChild(E element) {
-		for (Node<E> childNode: children) {
+		for (Node<E> childNode : children) {
 			if (childNode.getElement().equals(element)) {
 				return true;
 			}
@@ -122,7 +122,7 @@ class NodeImpl<E extends Comparable<E>> implements Node<E> {
 	 */
 	public int getIndexOfChild(Node<E> childNode) {
 		int childIndex = 0;
-		for (Node<E> node: children) {
+		for (Node<E> node : children) {
 			if (node.equals(childNode)) {
 				return childIndex;
 			}
@@ -136,7 +136,7 @@ class NodeImpl<E extends Comparable<E>> implements Node<E> {
 	 */
 	public int getIndexOfChild(E element) {
 		int childIndex = 0;
-		for (Node<E> node: children) {
+		for (Node<E> node : children) {
 			if (node.getElement().equals(element)) {
 				return childIndex;
 			}
@@ -156,7 +156,7 @@ class NodeImpl<E extends Comparable<E>> implements Node<E> {
 	 * {@inheritDoc}
 	 */
 	public void removeChild(E child) {
-		for (Node<E> childNode: children) {
+		for (Node<E> childNode : children) {
 			if (child.equals(childNode.getElement())) {
 				children.remove(childNode);
 				break;
@@ -189,7 +189,7 @@ class NodeImpl<E extends Comparable<E>> implements Node<E> {
 	 * {@inheritDoc}
 	 */
 	public Node<E> findChild(E element) {
-		for (Node<E> childNode: children) {
+		for (Node<E> childNode : children) {
 			Node<E> wantedNode = childNode.findChild(element);
 			if (wantedNode != null) {
 				return wantedNode;