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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
|
/* ========================================================================
* PlantUML : a free UML diagram generator
* ========================================================================
*
* (C) Copyright 2009-2017, Arnaud Roques
*
* Project Info: http://plantuml.com
*
* If you like this project or if you find it useful, you can support us at:
*
* http://plantuml.com/patreon (only 1$ per month!)
* http://plantuml.com/paypal
*
* This file is part of PlantUML.
*
* PlantUML is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* PlantUML distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
* License for more details.
*
* You should have received a copy of the GNU General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
* USA.
*
*
* Original Author: Arnaud Roques
*
*
*/
package net.sourceforge.plantuml.oregon;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Random;
import net.sourceforge.plantuml.Log;
public class MagicTable {
static enum Oc {
USED, NEAR
}
private final Oc number[] = new Oc[10000];
private static ArrayList<int[]> neighbours;
static {
neighbours = new ArrayList<int[]>();
for (int i = 0; i < 10000; i++) {
neighbours.add(null);
}
}
public static int[] getNeighbours(final int nb) {
if (neighbours.get(nb) == null) {
neighbours.set(nb, getNeighboursSlow(nb));
}
return neighbours.get(nb);
}
public static int[] getNeighboursSlow(final int nb) {
final int result[] = new int[36];
final int v1 = nb % 10;
int root = nb - v1;
int cpt = 0;
for (int i = 0; i < 10; i++) {
final int candidate = root + i;
if (candidate == nb) {
continue;
}
result[cpt++] = candidate;
}
final int v2 = (nb / 10) % 10;
root = nb - v2 * 10;
for (int i = 0; i < 10; i++) {
final int candidate = root + i * 10;
if (candidate == nb) {
continue;
}
result[cpt++] = candidate;
}
final int v3 = (nb / 100) % 10;
root = nb - v3 * 100;
for (int i = 0; i < 10; i++) {
final int candidate = root + i * 100;
if (candidate == nb) {
continue;
}
result[cpt++] = candidate;
}
final int v4 = nb / 1000;
root = nb - v4 * 1000;
for (int i = 0; i < 10; i++) {
final int candidate = root + i * 1000;
if (candidate == nb) {
continue;
}
result[cpt++] = candidate;
}
return result;
}
public List<Integer> getAllFree() {
final List<Integer> result = new ArrayList<Integer>(10000);
for (int i = 0; i < number.length; i++) {
if (number[i] == null) {
result.add(i);
}
}
return result;
}
public List<Integer> getAllUsed() {
final List<Integer> result = new ArrayList<Integer>(10000);
for (int i = 0; i < number.length; i++) {
if (number[i] == Oc.USED) {
result.add(i);
}
}
return result;
}
public boolean isUsuable(int nb) {
if (number[nb] != null) {
return false;
}
for (int near : getNeighbours(nb)) {
if (number[near] != null) {
return false;
}
}
return true;
}
public void burnNumber(int nb) {
if (number[nb] != null) {
throw new IllegalArgumentException();
}
number[nb] = Oc.USED;
for (int near : getNeighbours(nb)) {
number[near] = Oc.NEAR;
}
}
public int getRandomFree(Random rnd) {
final List<Integer> frees = getAllFree();
// final int size = frees.size();
// for (int i = 0; i < size; i++) {
// final int pos = rnd.nextInt(frees.size());
// final int nb = frees.get(pos);
// frees.remove(pos);
// if (isUsuable(nb)) {
// return nb;
// }
// }
Collections.shuffle(frees, rnd);
for (int nb : frees) {
if (isUsuable(nb)) {
return nb;
}
}
return -1;
}
public static int size(Random rnd, MagicTable mt) {
int i = 0;
while (true) {
final int candidate = mt.getRandomFree(rnd);
if (candidate == -1) {
break;
}
mt.burnNumber(candidate);
i++;
}
return i;
}
public static void main(String[] args) {
int max = 0;
final long start = System.currentTimeMillis();
final Random rnd = new Random(49);
final int nb = 200000;
for (int i = 0; i < nb; i++) {
if (i == 100) {
long dur = (System.currentTimeMillis() - start) / 1000L;
dur = dur * nb / 100;
dur = dur / 3600;
Log.println("Estimated duration = " + dur + " h");
}
final MagicTable mt = new MagicTable();
final int v = MagicTable.size(rnd, mt);
if (v > max) {
Log.println("v="+v);
Log.println("mt="+mt.getAllUsed());
max = v;
}
}
final long duration = System.currentTimeMillis() - start;
Log.println("Duration = " + duration / 1000L / 60);
}
public static void main2(String[] args) {
int max = 0;
final long start = System.currentTimeMillis();
for (int j = 1; j < 100; j++) {
final Random rnd = new Random(j);
for (int i = 0; i < 1000; i++) {
final MagicTable mt = new MagicTable();
final int v = MagicTable.size(rnd, mt);
if (v > max) {
Log.println("v="+v);
Log.println("mt="+mt.getAllUsed());
max = v;
}
}
}
final long duration = System.currentTimeMillis() - start;
Log.println("Duration = " + duration / 1000L / 60);
}
}
|
