1/*
2 * ProGuard -- shrinking, optimization, obfuscation, and preverification
3 *             of Java bytecode.
4 *
5 * Copyright (c) 2002-2013 Eric Lafortune (eric@graphics.cornell.edu)
6 *
7 * This program is free software; you can redistribute it and/or modify it
8 * under the terms of the GNU General Public License as published by the Free
9 * Software Foundation; either version 2 of the License, or (at your option)
10 * any later version.
11 *
12 * This program is distributed in the hope that it will be useful, but WITHOUT
13 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
15 * more details.
16 *
17 * You should have received a copy of the GNU General Public License along
18 * with this program; if not, write to the Free Software Foundation, Inc.,
19 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 */
21package proguard.util;
22
23/**
24 * This StringMatcher tests whether strings match a given list of StringMatcher
25 * instances. The instances are considered sequentially. Each instance in the
26 * list can optionally be negated, meaning that a match makes the entire
27 * remaining match fail.
28 *
29 * @author Eric Lafortune
30 */
31public class ListMatcher implements StringMatcher
32{
33    private final StringMatcher[] matchers;
34    private final boolean[]       negate;
35
36
37    public ListMatcher(StringMatcher[] matchers)
38    {
39        this(matchers, null);
40    }
41
42
43    public ListMatcher(StringMatcher[] matchers, boolean[] negate)
44    {
45        this.matchers = matchers;
46        this.negate   = negate;
47    }
48
49
50    // Implementations for StringMatcher.
51
52    public boolean matches(String string)
53    {
54        // Check the list of matchers.
55        for (int index = 0; index < matchers.length; index++)
56        {
57            StringMatcher matcher = matchers[index];
58            if (matcher.matches(string))
59            {
60                return negate == null ||
61                       !negate[index];
62            }
63        }
64
65        return negate != null &&
66               negate[negate.length - 1];
67
68    }
69}
70