Removed some warnings for the whole code

Signed-off-by: Immanuel Alvaro Bhirawa <u7280427@anu.edu.au>
This commit is contained in:
Immanuel Alvaro Bhirawa 2023-05-10 19:21:52 +10:00
parent bad42dd8e8
commit a19f6e371c

View File

@ -175,7 +175,7 @@ public class State {
// Create a temporary array to store the shuffled stone circles // Create a temporary array to store the shuffled stone circles
Coord[] tempStoneCircleRandom = new Coord[32]; Coord[] tempStoneCircleRandom = new Coord[32];
// Create a list to store the used cords (to avoid duplicates) // Create a list to store the used cords (to avoid duplicates)
List<Coord> usedCords = new ArrayList<Coord>(); List<Coord> usedCords = new ArrayList<>();
// Shuffle the array // Shuffle the array
for (int j = 0; j < 32; j++) { for (int j = 0; j < 32; j++) {
@ -553,8 +553,7 @@ public class State {
public int scoreLinks(int playerID) { public int scoreLinks(int playerID) {
Coord[] playerCoords = players[playerID].getPieces(); Coord[] playerCoords = players[playerID].getPieces();
Set<Coord> playerCoordsSet = new HashSet<>(Arrays.asList(playerCoords)); Set<Coord> playerCoordsSet = new HashSet<>(Arrays.asList(playerCoords));
int maxScore = findLongestLinkScore(playerCoordsSet, islands); return findLongestLinkScore(playerCoordsSet, islands);
return maxScore;
} }
/** /**