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 Eclipse Public License.
*
* THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC
* LICENSE ("AGREEMENT"). [Eclipse Public License - v 1.0]
*
* ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES
* RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT.
*
* You may obtain a copy of the License at
*
* http://www.eclipse.org/legal/epl-v10.html
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* 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 EPL license.
*
* The generated images can then be used without any reference to the EPL 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 smetana.core.debug;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.lang.reflect.Method;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import gen.annotation.HasND_Rank;
import gen.annotation.Original;
import gen.annotation.Reviewed;
public final class Purify {
// ::remove file when __CORE__
private final Map methods = new LinkedHashMap<>();
private final File out2 = new File("../out-smetana", "smetana.txt");
private PrintWriter pw2;
private int currentLevel;
public Purify() {
try {
out2.getParentFile().mkdirs();
pw2 = new PrintWriter(out2);
System.err.println("CREATING " + out2.getAbsolutePath());
} catch (FileNotFoundException e) {
e.printStackTrace();
}
}
synchronized void logline(String s) {
System.err.println(s);
if (pw2 == null)
return;
pw2.println(s);
pw2.flush();
}
public synchronized void entering(String signature, String methodNameDeclared) {
if (methods.containsKey(signature) == false) {
try {
final Method method = recordMe(methodNameDeclared);
methods.put(signature, method);
final String key = getKey(method);
if (key.length() > 2 && key.equals(signature) == false) {
throw new IllegalStateException(signature);
}
} catch (Exception e) {
e.printStackTrace();
System.exit(0);
}
}
currentLevel++;
traceCall(pw2, signature, methodNameDeclared);
}
public synchronized void leaving(String signature, String methodName) {
currentLevel--;
}
private void traceCall(PrintWriter pw, String signature, String methodNameDeclared) {
final Method m = methods.get(signature);
final String line = String.format("(%02d) %-26.26s [%-10.10s] %s", currentLevel, signature, getReviewedWhen(m),
methodNameDeclared);
// if (SmetanaDebug.VERY_VERBOSE)
// System.err.println(line);
if (pw == null)
return;
pw.println(line);
pw.flush();
}
private synchronized Method recordMe(String methodNameDeclared) throws ClassNotFoundException {
final Throwable creationPoint = new Throwable();
creationPoint.fillInStackTrace();
final StackTraceElement ste3 = creationPoint.getStackTrace()[3];
final StackTraceElement ste4 = creationPoint.getStackTrace()[4];
final String className = ste3.getClassName();
final String methodName3 = ste3.getMethodName();
final String methodName4 = ste4.getMethodName();
final Class theClass = Class.forName(className);
final Method theMethod3 = getTheMethod(theClass, methodName3);
if (methodNameDeclared.equals(theMethod3.getName())) {
return theMethod3;
}
final Method theMethod4 = getTheMethod(theClass, methodName4);
if (checkWarning(methodNameDeclared, theMethod3) && methodNameDeclared.equals(theMethod4.getName())) {
return theMethod4;
}
creationPoint.printStackTrace();
System.exit(0);
throw new IllegalArgumentException();
}
private synchronized boolean checkWarning(String methodNameDeclared, final Method theMethod3) {
if ((methodNameDeclared + "_").equals(theMethod3.getName())) {
return true;
}
if ((methodNameDeclared + "_w_").equals(theMethod3.getName())) {
return true;
}
return false;
}
private synchronized Method getTheMethod(Class theClass, String methodName2) {
for (Method method : theClass.getDeclaredMethods()) {
if (method.getName().equals(methodName2)) {
return method;
}
}
final Throwable creationPoint = new Throwable();
creationPoint.fillInStackTrace();
creationPoint.printStackTrace();
System.exit(0);
throw new IllegalArgumentException();
}
public void reset() {
methods.clear();
}
public void printMe() {
final List> reverse = new ArrayList<>(methods.entrySet());
Collections.reverse(reverse);
for (Entry ent : reverse) {
final String signature = ent.getKey();
final Method m = ent.getValue();
final String reviewedWhen = getReviewedWhen(m);
final String version = getVersion(m);
final String path = getPath(m);
final String hasND_Rank = hasND_Rank(m) ? "*" : " ";
System.err.printf("%-8s %-26s %-12s %s %-30s %s%n", version, signature, reviewedWhen, hasND_Rank,
m.getName(), path);
}
}
private String getVersion(Method method) {
final Original original = method.getDeclaredAnnotation(Original.class);
if (original == null)
return "XX";
return original.version();
}
private String getPath(Method method) {
final Original original = method.getDeclaredAnnotation(Original.class);
if (original == null)
return "XX";
return original.path();
}
private String getReviewedWhen(Method method) {
final Reviewed reviewed = method.getDeclaredAnnotation(Reviewed.class);
if (reviewed == null) {
return "?";
}
return reviewed.when();
}
private boolean hasND_Rank(Method method) {
final HasND_Rank reviewed = method.getDeclaredAnnotation(HasND_Rank.class);
return reviewed != null;
}
private String getKey(Method method) {
final Original original = method.getDeclaredAnnotation(Original.class);
if (original == null) {
return "?";
}
return original.key();
}
}
