-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy pathRegexp.java
More file actions
141 lines (133 loc) · 5.09 KB
/
Regexp.java
File metadata and controls
141 lines (133 loc) · 5.09 KB
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
/*
* Copyright (c) 1995, 2004, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is 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
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package sun.misc;
/**
* A class to represent a regular expression. Only handles '*'s.
* @author James Gosling
*/
public class Regexp {
/** if true then the matching process ignores case. */
public boolean ignoreCase;
/*
* regular expressions are carved into three regions: a constant string
* prefix, a constant string suffix, and a series of floating strings in
* between. In the input regular expression, they are separated by *s
*/
public String exp;
public String prefix, suffix;
public boolean exact;
public int prefixLen, suffixLen, totalLen;
public String mids[];
/** Create a new regular expression object. The regular expression
is a series of constant strings separated by *s. For example:
<dl>
<dt>*.gif <dd>Matches any string that ends in ".gif".
<dt>/tmp/* <dd>Matches any string that starts with "/tmp/".
<dt>/tmp/*.gif <dd>Matches any string that starts with "/tmp/" and ends
with ".gif".
<dt>/tmp/*new*.gif <dd>Matches any string that starts with "/tmp/"
and ends with ".gif" and has "new" somewhere in between.
</dl>
*/
public Regexp (String s) {
exp = s;
int firstst = s.indexOf('*');
int lastst = s.lastIndexOf('*');
if (firstst < 0) {
totalLen = s.length();
exact = true; // no * s
} else {
prefixLen = firstst;
if (firstst == 0)
prefix = null;
else
prefix = s.substring(0, firstst);
suffixLen = s.length() - lastst - 1;
if (suffixLen == 0)
suffix = null;
else
suffix = s.substring(lastst + 1);
int nmids = 0;
int pos = firstst;
while (pos < lastst && pos >= 0) {
nmids++;
pos = s.indexOf('*', pos + 1);
}
totalLen = prefixLen + suffixLen;
if (nmids > 0) {
mids = new String[nmids];
pos = firstst;
for (int i = 0; i < nmids; i++) {
pos++;
int npos = s.indexOf('*', pos);
if (pos < npos) {
mids[i] = s.substring(pos, npos);
totalLen += mids[i].length();
}
pos = npos;
}
}
}
}
/** Returns true iff the String s matches this regular expression. */
final boolean matches(String s) {
return matches(s, 0, s.length());
}
/** Returns true iff the substring of s from offset for len characters
matches this regular expression. */
boolean matches(String s, int offset, int len) {
if (exact)
return len == totalLen &&
exp.regionMatches(ignoreCase, 0, s, offset, len);
if (len < totalLen)
return false;
if (prefixLen > 0 &&
!prefix.regionMatches(ignoreCase,
0, s, offset, prefixLen)
||
suffixLen > 0 &&
!suffix.regionMatches(ignoreCase,
0, s, offset + len - suffixLen,
suffixLen))
return false;
if (mids == null)
return true;
int nmids = mids.length;
int spos = offset + prefixLen;
int limit = offset+len-suffixLen;
for (int i = 0; i<nmids; i++) {
String ms = mids[i];
int ml = ms.length();
while (spos+ml<=limit &&
!ms.regionMatches(ignoreCase,
0, s, spos, ml))
spos++;
if (spos+ml>limit)
return false;
spos+=ml;
}
return true;
}
}