Author: UprightPath (posted 2012-06-16 17:27:09, viewed 125 times)
| 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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
| import java.util.List;
import java.util.Random;
public class SemiRandomIteratorDirectionalUprightPath implements RandomIterator {
private static int[] primes = new int[] { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,
157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367,
373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541 };
private int startIndex;
private int rangeStart;
private int rangeEnd;
private int currIndex;
private int currLoopIndex;
private int step;
private boolean up;
private boolean move;
private final List<Integer> collection;
private final Random random;
private final long seed;
private final int collectionSize;
public SemiRandomIteratorDirectionalUprightPath(List<Integer> collection, Random random, long seed) {
this.collection = collection;
this.random = random;
this.seed = seed;
this.collectionSize = collection.size();
this.rangeStart = 0;
int range = collection.size();
this.rangeEnd = this.rangeStart + range;
this.startIndex = this.rangeStart + random.nextInt(range);
this.currIndex = startIndex;
this.currLoopIndex = this.currIndex;
this.step = getStep(range);
this.up = random.nextBoolean();
this.move = random.nextBoolean();
}
public SemiRandomIteratorDirectionalUprightPath(int collectionSize, Random random, long seed) {
this.collection = null;
this.random = random;
this.seed = seed;
this.collectionSize = collectionSize;
this.rangeStart = 0;
int range = collectionSize;
this.rangeEnd = this.rangeStart + range;
this.startIndex = this.rangeStart + random.nextInt(range);
this.currIndex = startIndex;
this.currLoopIndex = this.currIndex;
this.step = getStep(range);
this.up = random.nextBoolean();
this.move = random.nextBoolean();
}
public static int getStep(int range) {
for (int i = 99; i >= 0; i--) {
if (range > primes[i]) {
if (range % primes[i] == 0) {
return primes[i];
}
}
}
return 1;
}
public Integer getNext() {
if (currIndex >= collectionSize) {
calculateNextIndex();
return getNext();
}
Integer o = collection.get(currIndex);
calculateNextIndex();
return o;
}
private void calculateNextIndex() {
if (up) {
currIndex += step;
if (currIndex >= rangeEnd) {
currIndex = rangeStart + (currIndex - rangeEnd);
}
} else {
currIndex -= step;
if (currIndex < rangeStart) {
currIndex = rangeEnd - (rangeStart - currIndex);
}
}
if (currLoopIndex == currIndex) {
currIndex += move ? 1 : -1;
if (currIndex >= rangeEnd) {
currIndex = rangeStart + (currIndex - rangeEnd);
} else if (currIndex < rangeStart) {
currIndex = rangeEnd - (rangeStart - currIndex);
}
currLoopIndex = currIndex;
}
}
public int getNextIndex() {
if (currIndex >= collectionSize) {
calculateNextIndex();
return getNextIndex();
}
int returnIndex = currIndex;
calculateNextIndex();
return returnIndex;
}
public String getStatus() {
return "no status";
}
public String getName() {
return "Directional by UprightPath";
}
} |
Special syntax:
- To highlight a line (yellow background), prefix it with '@@'
- To indicate that a line should be removed (red background), prefix it with '-'
- To indicate that a line should be added (green background), prefix it with '+'
- To post multiple snippets, seperate them by '~~~~'
|
Add your game by posting it in the WIP section,
or publish it in Showcase.
The first screenshot will be displayed as a thumbnail.
|
|
