| /* |
| * ProGuard -- shrinking, optimization, obfuscation, and preverification |
| * of Java bytecode. |
| * |
| * Copyright (c) 2002-2017 Eric Lafortune @ GuardSquare |
| * |
| * 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 matches both given StringMatcher |
| * instances. |
| * |
| * @author Eric Lafortune |
| */ |
| public class AndMatcher extends StringMatcher |
| { |
| private final StringMatcher matcher1; |
| private final StringMatcher matcher2; |
| |
| |
| public AndMatcher(StringMatcher matcher1, StringMatcher matcher2) |
| { |
| this.matcher1 = matcher1; |
| this.matcher2 = matcher2; |
| } |
| |
| |
| // Implementations for StringMatcher. |
| |
| protected boolean matches(String string, int offset, int length) |
| { |
| return matcher1.matches(string, offset, length) && |
| matcher2.matches(string, offset, length); |
| } |
| } |