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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
|
//
// System.IO.SearchPattern2.cs: Filename glob support.
//
// Author:
// Dan Lewis (dihlewis@yahoo.co.uk)
//
// (C) 2002
//
//
// 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.
//
// Copied from corlib/System.IO/SearchPatter.cs
using System;
namespace System.IO {
// FIXME: there's a complication with this algorithm under windows.
// the pattern '*.*' matches all files (i think . matches the extension),
// whereas under UNIX it should only match files containing the '.' character.
class SearchPattern2 {
public SearchPattern2 (string pattern) : this (pattern, false) { }
public SearchPattern2 (string pattern, bool ignore)
{
this.ignore = ignore;
this.pattern = pattern;
Compile (pattern);
}
// OSX has a retarded case-insensitive yet case-aware filesystem
// so we need a overload in here for the Kqueue watcher
public bool IsMatch (string text, bool ignorecase)
{
if (!hasWildcard) {
bool match = String.Compare (pattern, text, ignorecase) == 0;
if (match)
return true;
// This is a special case for FSW. It needs to match e.g. subdir/file.txt
// when the pattern is "file.txt"
int idx = text.LastIndexOf ('/');
if (idx == -1)
return false;
idx++;
if (idx == text.Length)
return false;
return (String.Compare (pattern, text.Substring (idx), ignorecase) == 0);
}
return Match (ops, text, 0);
}
public bool IsMatch (string text)
{
return IsMatch (text, ignore);
}
public bool HasWildcard {
get { return hasWildcard; }
}
// private
Op ops; // the compiled pattern
bool ignore; // ignore case
bool hasWildcard;
string pattern;
private void Compile (string pattern)
{
if (pattern == null || pattern.IndexOfAny (InvalidChars) >= 0)
throw new ArgumentException ("Invalid search pattern: '" + pattern + "'");
if (pattern == "*") { // common case
ops = new Op (OpCode.True);
hasWildcard = true;
return;
}
ops = null;
int ptr = 0;
Op last_op = null;
while (ptr < pattern.Length) {
Op op;
switch (pattern [ptr]) {
case '?':
op = new Op (OpCode.AnyChar);
++ ptr;
hasWildcard = true;
break;
case '*':
op = new Op (OpCode.AnyString);
++ ptr;
hasWildcard = true;
break;
default:
op = new Op (OpCode.ExactString);
int end = pattern.IndexOfAny (WildcardChars, ptr);
if (end < 0)
end = pattern.Length;
op.Argument = pattern.Substring (ptr, end - ptr);
if (ignore)
op.Argument = op.Argument.ToLower ();
ptr = end;
break;
}
if (last_op == null)
ops = op;
else
last_op.Next = op;
last_op = op;
}
if (last_op == null)
ops = new Op (OpCode.End);
else
last_op.Next = new Op (OpCode.End);
}
private bool Match (Op op, string text, int ptr)
{
while (op != null) {
switch (op.Code) {
case OpCode.True:
return true;
case OpCode.End:
if (ptr == text.Length)
return true;
return false;
case OpCode.ExactString:
int length = op.Argument.Length;
if (ptr + length > text.Length)
return false;
string str = text.Substring (ptr, length);
if (ignore)
str = str.ToLower ();
if (str != op.Argument)
return false;
ptr += length;
break;
case OpCode.AnyChar:
if (++ ptr > text.Length)
return false;
break;
case OpCode.AnyString:
while (ptr <= text.Length) {
if (Match (op.Next, text, ptr))
return true;
++ ptr;
}
return false;
}
op = op.Next;
}
return true;
}
// private static
internal static readonly char [] WildcardChars = { '*', '?' };
internal static readonly char [] InvalidChars = { Path.DirectorySeparatorChar, Path.AltDirectorySeparatorChar };
private class Op {
public Op (OpCode code)
{
this.Code = code;
this.Argument = null;
this.Next = null;
}
public OpCode Code;
public string Argument;
public Op Next;
}
private enum OpCode {
ExactString, // literal
AnyChar, // ?
AnyString, // *
End, // end of pattern
True // always succeeds
};
}
}
|