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
|
/* ========================================================================
* PlantUML : a free UML diagram generator
* ========================================================================
*
* (C) Copyright 2009-2020, 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.Collections;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.regex.Pattern;
import net.sourceforge.plantuml.StringLocated;
public class RegexLeaf implements IRegex {
private static final RegexLeaf END = new RegexLeaf("$");
private static final RegexLeaf START = new RegexLeaf("^");
private final String pattern;
private final String name;
private int count = -1;
public RegexLeaf(String regex) {
this(null, regex);
}
public static RegexLeaf spaceZeroOrMore() {
return new RegexLeaf("[%s]*");
}
public static RegexLeaf spaceOneOrMore() {
return new RegexLeaf("[%s]+");
}
public static RegexLeaf start() {
return START;
}
public static RegexLeaf end() {
return END;
}
public RegexLeaf(String name, String regex) {
this.pattern = regex;
this.name = name;
}
@Override
public String toString() {
return super.toString() + " " + name + " " + pattern;
}
public String getName() {
return name;
}
public String getPattern() {
return pattern;
}
public int count() {
if (count == -1) {
count = MyPattern.cmpile(pattern, Pattern.CASE_INSENSITIVE).matcher("").groupCount();
}
return count;
}
public Map<String, RegexPartialMatch> createPartialMatch(Iterator<String> it) {
final RegexPartialMatch m = new RegexPartialMatch(name);
for (int i = 0; i < count(); i++) {
final String group = it.next();
m.add(group);
}
if (name == null) {
return Collections.emptyMap();
}
return Collections.singletonMap(name, m);
}
public boolean match(StringLocated full) {
throw new UnsupportedOperationException();
}
public RegexResult matcher(String full) {
throw new UnsupportedOperationException();
}
static private final Set<String> UNKNOWN = new HashSet<String>();
static private final Pattern p1 = Pattern.compile("^[-0A-Za-z_!:@;/=,\"]+$");
static private final Pattern p2 = Pattern.compile("^[-0A-Za-z_!:@;/=,\"]+\\?$");
static private final Pattern p3 = Pattern
.compile("^\\(?[-0A-Za-z_!:@;/=\" ]+\\??(\\|[-0A-Za-z_!:@;/=,\" ]+\\??)+\\)?$");
private static long getSignatureP3(String s) {
long result = -1L;
for (StringTokenizer st = new StringTokenizer(s, "()|"); st.hasMoreTokens();) {
final String val = st.nextToken();
final long sig = FoxSignature.getFoxSignature(val.endsWith("?") ? val.substring(0, val.length() - 2) : val);
result = result & sig;
}
return result;
}
public long getFoxSignatureNone() {
return 0;
}
public long getFoxSignature() {
if (p1.matcher(pattern).matches()) {
return FoxSignature.getFoxSignature(pattern);
}
if (p2.matcher(pattern).matches()) {
return FoxSignature.getFoxSignature(pattern.substring(0, pattern.length() - 2));
}
if (p3.matcher(pattern).matches()) {
// System.err.println("special " + pattern);
// System.err.println("result " + FoxSignature.backToString(getSignatureP3(pattern)));
return getSignatureP3(pattern);
}
if (pattern.length() == 2 && pattern.startsWith("\\") && Character.isLetterOrDigit(pattern.charAt(1)) == false) {
return FoxSignature.getFoxSignature(pattern.substring(1));
}
if (pattern.equals("\\<\\>") || pattern.equals("(\\<\\<.*\\>\\>)")) {
return FoxSignature.getFoxSignature("<>");
}
if (pattern.equals("\\<-\\>")) {
return FoxSignature.getFoxSignature("<->");
}
if (pattern.equals("(-+)")) {
return FoxSignature.getFoxSignature("-");
}
if (pattern.equals("\\|+") || pattern.equals("\\|\\|")) {
return FoxSignature.getFoxSignature("|");
}
if (pattern.equals("([*]+)")) {
return FoxSignature.getFoxSignature("*");
}
if (pattern.equals("[%s]+") || pattern.equals("[%s]*")) {
return 0;
}
// synchronized (UNKNOWN) {
// final boolean changed = UNKNOWN.add(pattern);
// if (changed)
// System.err.println("unknow=" + pattern);
//
// }
return 0;
}
}
|
