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
|
/*
* ProGuard -- shrinking, optimization, obfuscation, and preverification
* of Java bytecode.
*
* Copyright (c) 2002-2014 Eric Lafortune (eric@graphics.cornell.edu)
*
* This program 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 2 of the License, or (at your option)
* any later version.
*
* This program 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 for
* more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
package proguard.util;
/**
* This StringMatcher tests whether strings end in a given extension, ignoring
* its case.
*
* @author Eric Lafortune
*/
public class ExtensionMatcher implements StringMatcher
{
private final String extension;
/**
* Creates a new StringMatcher.
* @param extension the extension against which strings will be matched.
*/
public ExtensionMatcher(String extension)
{
this.extension = extension;
}
// Implementations for StringMatcher.
public boolean matches(String string)
{
return endsWithIgnoreCase(string, extension);
}
/**
* Returns whether the given string ends with the given suffix, ignoring its
* case.
*/
private static boolean endsWithIgnoreCase(String string, String suffix)
{
int stringLength = string.length();
int suffixLength = suffix.length();
return string.regionMatches(true, stringLength - suffixLength, suffix, 0, suffixLength);
}
}
|
