net.sourceforge.plantuml.regex.Matcher2 Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml-mit Show documentation
Show all versions of plantuml-mit Show documentation
PlantUML is a component that allows to quickly write diagrams from text.
// 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 MIT License.
*
* See http://opensource.org/licenses/MIT
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
* IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* 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 MIT license.
*
* The generated images can then be used without any reference to the MIT 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.regex;
import java.util.HashMap;
import java.util.Map;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import net.sourceforge.plantuml.utils.Log;
public class Matcher2 {
private final static boolean INSTRUMENT = false;
private final Matcher matcher;
private final String id;
private Matcher2(Matcher matcher, String id) {
this.matcher = matcher;
this.id = id;
}
public static Matcher2 build(Pattern pattern, CharSequence input) {
final long now = System.currentTimeMillis();
final String id = pattern.pattern();
try {
final Matcher matcher2 = pattern.matcher(input);
return new Matcher2(matcher2, id);
} finally {
if (INSTRUMENT) {
addTime(id, System.currentTimeMillis() - now);
}
}
}
public boolean matches() {
final long now = System.currentTimeMillis();
try {
return matcher.matches();
} finally {
addTime(System.currentTimeMillis() - now);
}
}
private void addTime(long duration) {
if (INSTRUMENT == false) {
return;
}
addTime(id, duration);
}
private static final Map durations = new HashMap();
private static long printed;
private static synchronized void addTime(String id, long duration) {
Long total = durations.get(id);
if (total == null) {
total = 0L;
}
total += duration;
durations.put(id, total);
final String longest = getLongest();
if (longest == null) {
return;
}
if (durations.get(longest) > printed) {
Log.info("---------- Regex " + longest + " " + durations.get(longest) + "ms (" + durations.size() + ")");
printed = durations.get(longest);
}
}
private static String getLongest() {
long max = 0;
String result = null;
for (Map.Entry ent : durations.entrySet()) {
if (ent.getValue() > max) {
max = ent.getValue();
result = ent.getKey();
}
}
return result;
}
public String group(int n) {
final long now = System.currentTimeMillis();
try {
return matcher.group(n);
} finally {
addTime(System.currentTimeMillis() - now);
}
}
public String group() {
final long now = System.currentTimeMillis();
try {
return matcher.group();
} finally {
addTime(System.currentTimeMillis() - now);
}
}
public int groupCount() {
final long now = System.currentTimeMillis();
try {
return matcher.groupCount();
} finally {
addTime(System.currentTimeMillis() - now);
}
}
public boolean find() {
final long now = System.currentTimeMillis();
try {
return matcher.find();
} finally {
addTime(System.currentTimeMillis() - now);
}
}
public int end() {
final long now = System.currentTimeMillis();
try {
return matcher.end();
} finally {
addTime(System.currentTimeMillis() - now);
}
}
public int start() {
final long now = System.currentTimeMillis();
try {
return matcher.start();
} finally {
addTime(System.currentTimeMillis() - now);
}
}
}