-
Notifications
You must be signed in to change notification settings - Fork 62
Expand file tree
/
Copy pathReservedPositionGenerator.java
More file actions
50 lines (36 loc) · 1.45 KB
/
ReservedPositionGenerator.java
File metadata and controls
50 lines (36 loc) · 1.45 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
package model;
import java.util.*;
import java.util.stream.*;
public class ReservedPositionGenerator {
private static final Random random = new Random();
public static List<Set<Integer>> generate(int width, int height) {
List<Set<Integer>> reserved = initializeReservedList(height);
List<Integer> positions = createShuffledPositions(width);
assignPositions(reserved, positions);
return reserved;
}
private static List<Set<Integer>> initializeReservedList(int height) {
return IntStream.range(0, height)
.mapToObj(i -> new HashSet<Integer>())
.collect(Collectors.toList());
}
private static List<Integer> createShuffledPositions(int width) {
List<Integer> positions = IntStream.range(0, width)
.boxed()
.collect(Collectors.toList());
positions.add(random.nextInt(width));
do {
Collections.shuffle(positions, random);
} while (isSequence(positions));
return positions;
}
private static boolean isSequence(List<Integer> numbers) {
return IntStream.range(0, numbers.size() - 1)
.anyMatch(i -> numbers.get(i).equals(numbers.get(i + 1)));
}
private static void assignPositions(List<Set<Integer>> reserved, List<Integer> positions) {
for (int i = 0; i < reserved.size(); i++) {
reserved.get(i).add(positions.get(i));
}
}
}