niklas/ki_rwu_java
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Made all variables and parameter final where available

Browse Source
This commit is contained in:
Niklas Birk
2019-04-02 20:34:15 +02:00
parent 4a0b04aefe
commit d4e54493c7
13 changed files with 95 additions and 117 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/Main.java
View File

@ -1,6 +0,0 @@
public class Main
{
public static void main(String[] args)
{
}
}

66
src/search/EightPuzzleNode.java
View File

@ -4,22 +4,21 @@ import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Objects;
import java.util.stream.IntStream;
public class EightPuzzleNode extends Node<int[][]>
{
public EightPuzzleNode(int[][] state)
public EightPuzzleNode(final int[][] state)
{
super(state);
}
private EightPuzzleNode(int[][] value, Node<int[][]> parent)
private EightPuzzleNode(final int[][] value, final Node<int[][]> parent)
{
super(value, parent);
}
@Override
public boolean isTargetReached(Node<int[][]> target)
public boolean isTargetReached(final Node<int[][]> target)
{
return valueEquals(target);
}
@ -27,25 +26,25 @@ public class EightPuzzleNode extends Node<int[][]>
@Override
public List<Node<int[][]>> generateSuccessors()
{
var successors = new ArrayList<Node<int[][]>>();
var emptyPosition = Objects.requireNonNull(detectEmptyPosition());
int x = emptyPosition.getX();
int y = emptyPosition.getY();
final var successors = new ArrayList<Node<int[][]>>();
final var emptyPosition = Objects.requireNonNull(detectEmptyPosition());
final int x = emptyPosition.getX();
final int y = emptyPosition.getY();
for (Direction dir : Direction.values())
for (final Direction dir : Direction.values())
{
var newState = copyOfState();
final var newState = copyOfState();
try
{
var posToSwap = switch (dir) {
final var posToSwap = switch (dir) {
case TOP -> new IntPair(x, y-1);
case RIGHT -> new IntPair(x+1, y);
case DOWN -> new IntPair(x, y+1);
case LEFT -> new IntPair(x-1, y);
};
var successor = this.swapStateField(newState, emptyPosition, posToSwap);
final var successor = this.swapStateField(newState, emptyPosition, posToSwap);
if (!successor.valueEquals(this) && !successor.valueEquals(super.getParent()))
{
@ -53,7 +52,7 @@ public class EightPuzzleNode extends Node<int[][]>
}
}
catch (ArrayIndexOutOfBoundsException ignored)
catch (final ArrayIndexOutOfBoundsException ignored)
{
}
}
@ -61,20 +60,12 @@ public class EightPuzzleNode extends Node<int[][]>
return successors;
}
@Override
protected boolean isValidParameterValue(int[][] state)
{
var numbers = Arrays.stream(state).flatMapToInt(IntStream::of).toArray();
return numbersAreInAllowedRange(numbers) && numbersAreUnique(numbers);
}
@Override
public String toString()
{
StringBuilder builder = new StringBuilder();
final StringBuilder builder = new StringBuilder();
for (int[] row : super.value)
for (final int[] row : super.value)
{
builder.append(Arrays.toString(row)).append("\n");
}
@ -82,7 +73,7 @@ public class EightPuzzleNode extends Node<int[][]>
return builder.toString();
}
private boolean valueEquals(Node<int[][]> node)
private boolean valueEquals(final Node<int[][]> node)
{
if (node == null)
{
@ -103,16 +94,6 @@ public class EightPuzzleNode extends Node<int[][]>
return true;
}
private boolean numbersAreInAllowedRange(int[] numbers)
{
return Arrays.stream(numbers).min().getAsInt() == 0 && Arrays.stream(numbers).max().getAsInt() == 8;
}
private boolean numbersAreUnique(int[] numbers)
{
return Arrays.stream(numbers).count() == Arrays.stream(numbers).distinct().count();
}
private IntPair detectEmptyPosition()
{
for (int row = 0; row < super.value.length; row++)
@ -131,7 +112,7 @@ public class EightPuzzleNode extends Node<int[][]>
private int[][] copyOfState()
{
var copy = new int[3][3];
final var copy = new int[3][3];
for (int y = 0; y < copy.length; y++)
{
@ -141,13 +122,13 @@ public class EightPuzzleNode extends Node<int[][]>
return copy;
}
private EightPuzzleNode swapStateField(int[][] newState, IntPair emptyPos, IntPair posToSwap)
private EightPuzzleNode swapStateField(final int[][] newState, final IntPair emptyPos, final IntPair posToSwap)
{
int posToSwapX = posToSwap.getX();
int postToSwapY = posToSwap.getY();
int emptyX = emptyPos.getX();
int emptyY = emptyPos.getY();
int tmp;
final int posToSwapX = posToSwap.getX();
final int postToSwapY = posToSwap.getY();
final int emptyX = emptyPos.getX();
final int emptyY = emptyPos.getY();
final int tmp;
tmp = newState[postToSwapY][posToSwapX];
newState[postToSwapY][posToSwapX] = newState[emptyY][emptyX];
@ -161,7 +142,7 @@ public class EightPuzzleNode extends Node<int[][]>
private final int x;
private final int y;
public IntPair(int x, int y)
public IntPair(final int x, final int y)
{
this.x = x;
this.y = y;
@ -177,6 +158,7 @@ public class EightPuzzleNode extends Node<int[][]>
}
}
private enum Direction
{
TOP, RIGHT, DOWN, LEFT

14
src/search/Node.java
View File

@ -4,21 +4,16 @@ import java.util.List;
public abstract class Node<T>
{
protected T value;
private Node<T> parent;
protected final T value;
private final Node<T> parent;
protected Node(T value)
protected Node(final T value)
{
this(value, null);
}
protected Node(T value, Node<T> parent)
protected Node(final T value, final Node<T> parent)
{
if (!isValidParameterValue(value))
{
throw new IllegalArgumentException("Illegal node value");
}
this.value = value;
this.parent = parent;
}
@ -33,7 +28,6 @@ public abstract class Node<T>
return this.parent;
}
protected abstract boolean isValidParameterValue(T value);
public abstract boolean isTargetReached(Node<T> target);
public abstract List<Node<T>> generateSuccessors();
}

5
src/search/heuristic/AStar.java Normal file
View File

@ -0,0 +1,5 @@
package search.heuristic;
public class AStar
{
}

6
src/search/uninformed/breadthfirstsearch/BreadthFirstSearch.java
View File

@ -7,11 +7,11 @@ import java.util.List;
public class BreadthFirstSearch
{
public <T> Node<T> breadthFirstSearch(List<Node<T>> nodes, Node<T> target)
public <T> Node<T> breadthFirstSearch(final List<Node<T>> nodes, final Node<T> target)
{
var newNodes = new ArrayList<Node<T>>();
final var newNodes = new ArrayList<Node<T>>();
for (Node<T> node : nodes)
for (final Node<T> node : nodes)
{
if (node.isTargetReached(target))
{

6
src/search/uninformed/depthfirstsearch/DepthFirstSearch.java
View File

@ -4,18 +4,18 @@ import search.Node;
public class DepthFirstSearch
{
public <T> Node<T> depthFirstSearch(Node<T> node, Node<T> target)
public <T> Node<T> depthFirstSearch(final Node<T> node, final Node<T> target)
{
if (node.isTargetReached(target))
{
return node;
}
var newNodes = node.generateSuccessors();
final var newNodes = node.generateSuccessors();
while (!newNodes.isEmpty())
{
var resultNode = depthFirstSearch(newNodes.get(0), target);
final var resultNode = depthFirstSearch(newNodes.get(0), target);
if (resultNode != null)
{

8
src/search/uninformed/iterativedeepening/IterativeDeepening.java
View File

@ -4,7 +4,7 @@ import search.Node;
public class IterativeDeepening
{
public <T> Node<T> iterativeDeepening(Node<T> node, Node<T> target)
public <T> Node<T> iterativeDeepening(final Node<T> node, final Node<T> target)
{
int lowBarrier = 0;
@ -19,18 +19,18 @@ public class IterativeDeepening
return resultNode;
}
private <T> Node<T> depthFirstSearch(Node<T> node, Node<T> target, int depth, int barrier)
private <T> Node<T> depthFirstSearch(final Node<T> node, final Node<T> target, int depth, final int barrier)
{
if (node.isTargetReached(target))
{
return node;
}
var newNodes = node.generateSuccessors();
final var newNodes = node.generateSuccessors();
while (!newNodes.isEmpty() && depth < barrier)
{
var resultNode = depthFirstSearch(newNodes.get(0), target, ++depth, barrier);
final var resultNode = depthFirstSearch(newNodes.get(0), target, ++depth, barrier);
if (resultNode != null)
{