mirror of
https://github.com/octoleo/plantuml.git
synced 2024-05-29 06:30:48 +00:00
107 lines
2.9 KiB
Java
107 lines
2.9 KiB
Java
/* ========================================================================
|
|
* PlantUML : a free UML diagram generator
|
|
* ========================================================================
|
|
*
|
|
* (C) Copyright 2009-2023, 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.command.regex;
|
|
|
|
import java.util.LinkedHashMap;
|
|
import java.util.Map;
|
|
import java.util.regex.Pattern;
|
|
|
|
class MaxSizeHashMap<K, V> extends LinkedHashMap<K, V> {
|
|
private final int maxSize;
|
|
|
|
public MaxSizeHashMap(int maxSize) {
|
|
this.maxSize = maxSize;
|
|
}
|
|
|
|
@Override
|
|
protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
|
|
return size() > maxSize;
|
|
}
|
|
}
|
|
|
|
// Splitter.java to be finished
|
|
public abstract class MyPattern {
|
|
|
|
private static final Map<String, Pattern2> cache = new MaxSizeHashMap<>(512);
|
|
|
|
private static final Pattern2 EMPTY = new Pattern2(Pattern.compile(""));
|
|
|
|
// static int CPT1;
|
|
// static int CPT2;
|
|
|
|
public static Pattern2 cmpile(final String p) {
|
|
if (p == null || p.length() == 0) {
|
|
return EMPTY;
|
|
}
|
|
// CPT1++;
|
|
Pattern2 result = null;
|
|
synchronized (cache) {
|
|
result = cache.get(p);
|
|
if (result != null) {
|
|
return result;
|
|
}
|
|
}
|
|
assert result == null;
|
|
result = new Pattern2(Pattern.compile(transform(p), Pattern.CASE_INSENSITIVE));
|
|
|
|
synchronized (cache) {
|
|
cache.put(p, result);
|
|
// CPT2++;
|
|
// System.err.println("CPT= " + CPT1 + " / " + CPT2 + " " + cache.size());
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
private static String transform(String p) {
|
|
// Replace ReadLineReader.java
|
|
p = p.replace("%pLN", "\\p{L}0-9"); // Unicode Letter, digit
|
|
p = p.replace("%s", "\\s\u00A0"); // space
|
|
p = p.replace("%q", "'\u2018\u2019"); // quote
|
|
p = p.replace("%g", "\"\u201c\u201d"); // double quote
|
|
return p;
|
|
}
|
|
|
|
public static boolean mtches(CharSequence input, String regex) {
|
|
return cmpile(regex).matcher(input).matches();
|
|
}
|
|
|
|
public static CharSequence removeAll(CharSequence src, String regex) {
|
|
return src.toString().replaceAll(transform(regex), "");
|
|
}
|
|
|
|
}
|