Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
// THIS FILE HAS BEEN GENERATED BY A PREPROCESSOR.
/* +=======================================================================
* |
* | PlantUML : a free UML diagram generator
* |
* +=======================================================================
*
* (C) Copyright 2009-2024, Arnaud Roques
*
* Project Info: https://plantuml.com
*
* If you like this project or if you find it useful, you can support us at:
*
* https://plantuml.com/patreon (only 1$ per month!)
* https://plantuml.com/liberapay (only 1€ per month!)
* https://plantuml.com/paypal
*
*
* PlantUML is free software; you can redistribute it and/or modify it
* under the terms of the Revised BSD License.
*
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the University of California, Berkeley nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* PlantUML can occasionally display sponsored or advertising messages. Those
* messages are usually generated on welcome or error images and never on
* functional diagrams.
* See https://plantuml.com/professional if you want to remove them
*
* Images (whatever their format : PNG, SVG, EPS...) generated by running PlantUML
* are owned by the author of their corresponding sources code (that is, their
* textual description in PlantUML language). Those images are not covered by
* this BSD license.
*
* The generated images can then be used without any reference to the BSD license.
* It is not even necessary to stipulate that they have been generated with PlantUML,
* although this will be appreciated by the PlantUML team.
*
* There is an exception : if the textual description in PlantUML language is also covered
* by any license, then the generated images are logically covered
* by the very same license.
*
* This is the IGY distribution (Install GraphViz by Yourself).
* You have to install GraphViz and to setup the GRAPHVIZ_DOT environment variable
* (see https://plantuml.com/graphviz-dot )
*
* Icons provided by OpenIconic : https://useiconic.com/open
* Archimate sprites provided by Archi : http://www.archimatetool.com
* Stdlib AWS provided by https://github.com/milo-minderbinder/AWS-PlantUML
* Stdlib Icons provided https://github.com/tupadr3/plantuml-icon-font-sprites
* ASCIIMathML (c) Peter Jipsen http://www.chapman.edu/~jipsen
* ASCIIMathML (c) David Lippman http://www.pierce.ctc.edu/dlippman
* CafeUndZopfli ported by Eugene Klyuchnikov https://github.com/eustas/CafeUndZopfli
* Brotli (c) by the Brotli Authors https://github.com/google/brotli
* Themes (c) by Brett Schwarz https://github.com/bschwarz/puml-themes
* Twemoji (c) by Twitter at https://twemoji.twitter.com/
*
*/
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.utils.Log;
public class MagicTable {
// ::remove folder when __HAXE__
static enum Oc {
USED, NEAR
}
private final Oc number[] = new Oc[10000];
private static ArrayList neighbours;
static {
neighbours = new ArrayList();
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 getAllFree() {
final List result = new ArrayList<>(10000);
for (int i = 0; i < number.length; i++) {
if (number[i] == null) {
result.add(i);
}
}
return result;
}
public List getAllUsed() {
final List result = new ArrayList<>(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 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);
}
}
