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
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
|
<?php
/*
* $Id: SelectorUtils.php,v 1.5 2005/05/26 13:10:53 mrook Exp $
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* This software consists of voluntary contributions made by many individuals
* and is licensed under the LGPL. For more information please see
* <http://phing.info>.
*/
include_once 'phing/util/StringHelper.php';
/**
* <p>This is a utility class used by selectors and DirectoryScanner. The
* functionality more properly belongs just to selectors, but unfortunately
* DirectoryScanner exposed these as protected methods. Thus we have to
* support any subclasses of DirectoryScanner that may access these methods.
* </p>
* <p>This is a Singleton.</p>
*
* @author Hans Lellelid, hans@xmpl.org (Phing)
* @author Arnout J. Kuiper, ajkuiper@wxs.nl (Ant)
* @author Magesh Umasankar
* @author Bruce Atherton, bruce@callenish.com (Ant)
* @package phing.types.selectors
*/
class SelectorUtils {
private static $instance;
/**
* Retrieves the instance of the Singleton.
*/
public function getInstance() {
if (!isset(self::$instance)) {
self::$instance = new SelectorUtils();
}
return self::$instance;
}
/**
* Tests whether or not a given path matches the start of a given
* pattern up to the first "**".
* <p>
* This is not a general purpose test and should only be used if you
* can live with false positives. For example, <code>pattern=**\a</code>
* and <code>str=b</code> will yield <code>true</code>.
*
* @param pattern The pattern to match against. Must not be
* <code>null</code>.
* @param str The path to match, as a String. Must not be
* <code>null</code>.
* @param isCaseSensitive Whether or not matching should be performed
* case sensitively.
*
* @return whether or not a given path matches the start of a given
* pattern up to the first "**".
*/
public function matchPatternStart($pattern, $str, $isCaseSensitive = true) {
// When str starts with a DIRECTORY_SEPARATOR, pattern has to start with a
// DIRECTORY_SEPARATOR.
// When pattern starts with a DIRECTORY_SEPARATOR, str has to start with a
// DIRECTORY_SEPARATOR.
if (StringHelper::startsWith(DIRECTORY_SEPARATOR, $str) !==
StringHelper::startsWith(DIRECTORY_SEPARATOR, $pattern)) {
return false;
}
$patDirs = explode(DIRECTORY_SEPARATOR, $pattern);
$strDirs = explode(DIRECTORY_SEPARATOR, $str);
$patIdxStart = 0;
$patIdxEnd = count($patDirs)-1;
$strIdxStart = 0;
$strIdxEnd = count($strDirs)-1;
// up to first '**'
while ($patIdxStart <= $patIdxEnd && $strIdxStart <= $strIdxEnd) {
$patDir = $patDirs[$patIdxStart];
if ($patDir == "**") {
break;
}
if (!self::match($patDir, $strDirs[$strIdxStart], $isCaseSensitive)) {
return false;
}
$patIdxStart++;
$strIdxStart++;
}
if ($strIdxStart > $strIdxEnd) {
// String is exhausted
return true;
} elseif ($patIdxStart > $patIdxEnd) {
// String not exhausted, but pattern is. Failure.
return false;
} else {
// pattern now holds ** while string is not exhausted
// this will generate false positives but we can live with that.
return true;
}
}
/**
* Tests whether or not a given path matches a given pattern.
*
* @param pattern The pattern to match against. Must not be
* <code>null</code>.
* @param str The path to match, as a String. Must not be
* <code>null</code>.
* @param isCaseSensitive Whether or not matching should be performed
* case sensitively.
*
* @return <code>true</code> if the pattern matches against the string,
* or <code>false</code> otherwise.
*/
public function matchPath($pattern, $str, $isCaseSensitive = true) {
// When str starts with a DIRECTORY_SEPARATOR, pattern has to start with a
// DIRECTORY_SEPARATOR.
// When pattern starts with a DIRECTORY_SEPARATOR, str has to start with a
// DIRECTORY_SEPARATOR.
if (StringHelper::startsWith(DIRECTORY_SEPARATOR, $str) !==
StringHelper::startsWith(DIRECTORY_SEPARATOR, $pattern)) {
return false;
}
$patDirs = explode(DIRECTORY_SEPARATOR, $pattern);
$strDirs = explode(DIRECTORY_SEPARATOR, $str);
$patIdxStart = 0;
$patIdxEnd = count($patDirs)-1;
$strIdxStart = 0;
$strIdxEnd = count($strDirs)-1;
// up to first '**'
while ($patIdxStart <= $patIdxEnd && $strIdxStart <= $strIdxEnd) {
$patDir = $patDirs[$patIdxStart];
if ($patDir == "**") {
break;
}
if (!self::match($patDir, $strDirs[$strIdxStart], $isCaseSensitive)) {
return false;
}
$patIdxStart++;
$strIdxStart++;
}
if ($strIdxStart > $strIdxEnd) {
// String is exhausted
for ($i=$patIdxStart; $i <= $patIdxEnd; $i++) {
if ($patDirs[$i] != "**") {
return false;
}
}
return true;
} elseif ($patIdxStart > $patIdxEnd) {
// String not exhausted, but pattern is. Failure.
return false;
}
// up to last '**'
while ($patIdxStart <= $patIdxEnd && $strIdxStart <= $strIdxEnd) {
$patDir = $patDirs[$patIdxEnd];
if ($patDir == "**") {
break;
}
if (!self::match($patDir, $strDirs[$strIdxEnd], $isCaseSensitive)) {
return false;
}
$patIdxEnd--;
$strIdxEnd--;
}
if ($strIdxStart > $strIdxEnd) {
// String is exhausted
for ($i = $patIdxStart; $i <= $patIdxEnd; $i++) {
if ($patDirs[$i] != "**") {
return false;
}
}
return true;
}
while ($patIdxStart != $patIdxEnd && $strIdxStart <= $strIdxEnd) {
$patIdxTmp = -1;
for ($i = $patIdxStart+1; $i <= $patIdxEnd; $i++) {
if ($patDirs[$i] == "**") {
$patIdxTmp = $i;
break;
}
}
if ($patIdxTmp == $patIdxStart+1) {
// '**/**' situation, so skip one
$patIdxStart++;
continue;
}
// Find the pattern between padIdxStart & padIdxTmp in str between
// strIdxStart & strIdxEnd
$patLength = ($patIdxTmp-$patIdxStart-1);
$strLength = ($strIdxEnd-$strIdxStart+1);
$foundIdx = -1;
//strLoop: (start of outer loop)
for ($i=0; $i <= $strLength - $patLength; $i++) {
for ($j = 0; $j < $patLength; $j++) {
$subPat = $patDirs[$patIdxStart+$j+1];
$subStr = $strDirs[$strIdxStart+$i+$j];
if (!self::match($subPat, $subStr, $isCaseSensitive)) {
continue 2; // continue up two levels (to strLoop:)
}
}
$foundIdx = $strIdxStart+$i; // only reached if all sub patterns matched
break;
}
if ($foundIdx == -1) {
return false;
}
$patIdxStart = $patIdxTmp;
$strIdxStart = $foundIdx + $patLength;
}
for ($i = $patIdxStart; $i <= $patIdxEnd; $i++) {
if ($patDirs[$i] != "**") {
return false;
}
}
return true;
}
/**
* Tests whether or not a string matches against a pattern.
* The pattern may contain two special characters:<br>
* '*' means zero or more characters<br>
* '?' means one and only one character
*
* @param pattern The pattern to match against.
* Must not be <code>null</code>.
* @param str The string which must be matched against the pattern.
* Must not be <code>null</code>.
* @param isCaseSensitive Whether or not matching should be performed
* case sensitively.
*
*
* @return <code>true</code> if the string matches against the pattern,
* or <code>false</code> otherwise.
*/
public function match($pattern, $str, $isCaseSensitive = true) {
$patArr = StringHelper::toCharArray($pattern);
$strArr = StringHelper::toCharArray($str);
$patIdxStart = 0;
$patIdxEnd = count($patArr)-1;
$strIdxStart = 0;
$strIdxEnd = count($strArr)-1;
$containsStar = false;
for ($i = 0, $size=count($patArr); $i < $size; $i++) {
if ($patArr[$i] == '*') {
$containsStar = true;
break;
}
}
if (!$containsStar) {
// No '*'s, so we make a shortcut
if ($patIdxEnd != $strIdxEnd) {
return false; // Pattern and string do not have the same size
}
for ($i = 0; $i <= $patIdxEnd; $i++) {
$ch = $patArr[$i];
if ($ch != '?') {
if ($isCaseSensitive && $ch !== $strArr[$i]) {
return false;// Character mismatch
}
if (!$isCaseSensitive && strtoupper($ch) !==
strtoupper($strArr[$i])) {
return false; // Character mismatch
}
}
}
return true; // String matches against pattern
}
if ($patIdxEnd == 0) {
return true; // Pattern contains only '*', which matches anything
}
// Process characters before first star
while(($ch = $patArr[$patIdxStart]) != '*' && $strIdxStart <= $strIdxEnd) {
if ($ch != '?') {
if ($isCaseSensitive && $ch !== $strArr[$strIdxStart]) {
return false;// Character mismatch
}
if (!$isCaseSensitive && strtoupper($ch) !==
strtoupper($strArr[$strIdxStart])) {
return false;// Character mismatch
}
}
$patIdxStart++;
$strIdxStart++;
}
if ($strIdxStart > $strIdxEnd) {
// All characters in the string are used. Check if only '*'s are
// left in the pattern. If so, we succeeded. Otherwise failure.
for ($i = $patIdxStart; $i <= $patIdxEnd; $i++) {
if ($patArr[$i] != '*') {
return false;
}
}
return true;
}
// Process characters after last star
while(($ch = $patArr[$patIdxEnd]) != '*' && $strIdxStart <= $strIdxEnd) {
if ($ch != '?') {
if ($isCaseSensitive && $ch !== $strArr[$strIdxEnd]) {
return false;// Character mismatch
}
if (!$isCaseSensitive && strtoupper($ch) !==
strtoupper($strArr[$strIdxEnd])) {
return false;// Character mismatch
}
}
$patIdxEnd--;
$strIdxEnd--;
}
if ($strIdxStart > $strIdxEnd) {
// All characters in the string are used. Check if only '*'s are
// left in the pattern. If so, we succeeded. Otherwise failure.
for ($i = $patIdxStart; $i <= $patIdxEnd; $i++) {
if ($patArr[$i] != '*') {
return false;
}
}
return true;
}
// process pattern between stars. padIdxStart and patIdxEnd point
// always to a '*'.
while ($patIdxStart !== $patIdxEnd && $strIdxStart <= $strIdxEnd) {
$patIdxTmp = -1;
for ($i = $patIdxStart+1; $i <= $patIdxEnd; $i++) {
if ($patArr[$i] == '*') {
$patIdxTmp = $i;
break;
}
}
if ($patIdxTmp === $patIdxStart + 1) {
// Two stars next to each other, skip the first one.
$patIdxStart++;
continue;
}
// Find the pattern between padIdxStart & padIdxTmp in str between
// strIdxStart & strIdxEnd
$patLength = ($patIdxTmp - $patIdxStart - 1);
$strLength = ($strIdxEnd - $strIdxStart + 1);
$foundIdx = -1;
//strLoop:
for ($i = 0; $i <= $strLength - $patLength; $i++) {
for ($j = 0; $j < $patLength; $j++) {
$ch = $patArr[$patIdxStart+$j+1];
if ($ch != '?') {
if ($isCaseSensitive && $ch !== $strArr[$strIdxStart+$i+$j]) {
continue 2; //continue to strLoop:
}
if (!$isCaseSensitive && strtoupper($ch) !==
strtoupper($strArr[$strIdxStart+$i+$j])) {
continue 2; //continue to strLoop:
}
}
}
// only reached if sub loop completed w/o invoking continue 2
$foundIdx = $strIdxStart + $i;
break;
}
if ($foundIdx == -1) {
return false;
}
$patIdxStart = $patIdxTmp;
$strIdxStart = $foundIdx + $patLength;
}
// All characters in the string are used. Check if only '*'s are left
// in the pattern. If so, we succeeded. Otherwise failure.
for ($i = $patIdxStart; $i <= $patIdxEnd; $i++) {
if ($patArr[$i] != '*') {
return false;
}
}
return true;
}
/**
* Returns dependency information on these two files. If src has been
* modified later than target, it returns true. If target doesn't exist,
* it likewise returns true. Otherwise, target is newer than src and
* is not out of date, thus the method returns false. It also returns
* false if the src file doesn't even exist, since how could the
* target then be out of date.
*
* @param PhingFile $src the original file
* @param PhingFile $target the file being compared against
* @param int $granularity the amount in seconds of slack we will give in
* determining out of dateness
* @return whether the target is out of date
*/
public function isOutOfDate(PhingFile $src, PhingFile $target, $granularity) {
if (!$src->exists()) {
return false;
}
if (!$target->exists()) {
return true;
}
if (($src->lastModified() - $granularity) > $target->lastModified()) {
return true;
}
return false;
}
}
|