sometsome 3.10.50 → 3.10.50.33

data/lib/proguard4.7/src/proguard/util/ConstantMatcher.java

@@ -1,48 +0,0 @@
-/*
- * ProGuard -- shrinking, optimization, obfuscation, and preverification
- *             of Java bytecode.
- *
- * Copyright (c) 2002-2011 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 matches any string or no string at all.
- *
- * @author Eric Lafortune
- */
-public class ConstantMatcher implements StringMatcher
-{
-    private boolean matches;
-
-
-    /**
-     * Creates a new ConstantMatcher that always returns the given result.
-     */
-    public ConstantMatcher(boolean matches)
-    {
-        this.matches = matches;
-    }
-
-
-    // Implementations for StringMatcher.
-
-    public boolean matches(String string)
-    {
-        return matches;
-    }
-}

data/lib/proguard4.7/src/proguard/util/EmptyStringMatcher.java

@@ -1,36 +0,0 @@
-/*
- * ProGuard -- shrinking, optimization, obfuscation, and preverification
- *             of Java bytecode.
- *
- * Copyright (c) 2002-2011 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 are empty.
- *
- * @author Eric Lafortune
- */
-public class EmptyStringMatcher implements StringMatcher
-{
-    // Implementations for StringMatcher.
-
-    public boolean matches(String string)
-    {
-        return string.length() == 0;
-    }
-}

data/lib/proguard4.7/src/proguard/util/ExtensionMatcher.java

@@ -1,63 +0,0 @@
-/*
- * ProGuard -- shrinking, optimization, obfuscation, and preverification
- *             of Java bytecode.
- *
- * Copyright (c) 2002-2011 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);
-    }
-}

data/lib/proguard4.7/src/proguard/util/FileNameParser.java

@@ -1,121 +0,0 @@
-/*
- * ProGuard -- shrinking, optimization, obfuscation, and preverification
- *             of Java bytecode.
- *
- * Copyright (c) 2002-2011 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;
-
-import java.io.File;
-
-/**
- * This StringParser can create StringMatcher instances for regular expressions
- * matching file names. The regular expressions can contain the following
- * wildcards:
- * '?'  for a single regular file name character,
- * '*'  for any number of regular file name characters, and
- * '**' for any number of regular file name characters or directory separator
- *      characters (always including '/').
- *
- * @author Eric Lafortune
- */
-public class FileNameParser implements StringParser
-{
-    // Implementations for StringParser.
-
-    public StringMatcher parse(String regularExpression)
-    {
-        int           index;
-        StringMatcher nextMatcher = new EmptyStringMatcher();
-
-        // Look for wildcards.
-        for (index = 0; index < regularExpression.length(); index++)
-        {
-            // Is there a '**' wildcard?
-            if (regularExpression.regionMatches(index, "**", 0, 2))
-            {
-                // Create a matcher for the wildcard and, recursively, for the
-                // remainder of the string.
-                nextMatcher =
-                    new VariableStringMatcher(null,
-                                              null,
-                                              0,
-                                              Integer.MAX_VALUE,
-                                              parse(regularExpression.substring(index + 2)));
-                break;
-            }
-
-            // Is there a '*' wildcard?
-            else if (regularExpression.charAt(index) == '*')
-            {
-                // Create a matcher for the wildcard and, recursively, for the
-                // remainder of the string.
-                nextMatcher =
-                    new VariableStringMatcher(null,
-                                              new char[] { File.pathSeparatorChar, '/' },
-                                              0,
-                                              Integer.MAX_VALUE,
-                                              parse(regularExpression.substring(index + 1)));
-                break;
-            }
-
-            // Is there a '?' wildcard?
-            else if (regularExpression.charAt(index) == '?')
-            {
-                // Create a matcher for the wildcard and, recursively, for the
-                // remainder of the string.
-                nextMatcher =
-                    new VariableStringMatcher(null,
-                                              new char[] { File.pathSeparatorChar, '/' },
-                                              1,
-                                              1,
-                                              parse(regularExpression.substring(index + 1)));
-                break;
-            }
-        }
-
-        // Return a matcher for the fixed first part of the regular expression,
-        // if any, and the remainder.
-        return index != 0 ?
-            (StringMatcher)new FixedStringMatcher(regularExpression.substring(0, index), nextMatcher) :
-            (StringMatcher)nextMatcher;
-    }
-
-
-    /**
-     * A main method for testing file name matching.
-     */
-    public static void main(String[] args)
-    {
-        try
-        {
-            System.out.println("Regular expression ["+args[0]+"]");
-            FileNameParser parser  = new FileNameParser();
-            StringMatcher  matcher = parser.parse(args[0]);
-            for (int index = 1; index < args.length; index++)
-            {
-                String string = args[index];
-                System.out.print("String             ["+string+"]");
-                System.out.println(" -> match = "+matcher.matches(args[index]));
-            }
-        }
-        catch (Exception ex)
-        {
-            ex.printStackTrace();
-        }
-    }
-}

data/lib/proguard4.7/src/proguard/util/FixedStringMatcher.java

@@ -1,56 +0,0 @@
-/*
- * ProGuard -- shrinking, optimization, obfuscation, and preverification
- *             of Java bytecode.
- *
- * Copyright (c) 2002-2011 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 start with a given fixed string
- * and then match another optional given StringMatcher.
- *
- * @author Eric Lafortune
- */
-public class FixedStringMatcher implements StringMatcher
-{
-    private final String        fixedString;
-    private final StringMatcher nextMatcher;
-
-
-    public FixedStringMatcher(String fixedString)
-    {
-        this(fixedString, null);
-    }
-
-
-    public FixedStringMatcher(String fixedString, StringMatcher nextMatcher)
-    {
-        this.fixedString = fixedString;
-        this.nextMatcher = nextMatcher;
-    }
-
-
-    // Implementations for StringMatcher.
-
-    public boolean matches(String string)
-    {
-        return string.startsWith(fixedString) &&
-               (nextMatcher == null ||
-                nextMatcher.matches(string.substring(fixedString.length())));
-    }
-}

data/lib/proguard4.7/src/proguard/util/ListMatcher.java

@@ -1,69 +0,0 @@
-/*
- * ProGuard -- shrinking, optimization, obfuscation, and preverification
- *             of Java bytecode.
- *
- * Copyright (c) 2002-2011 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 match a given list of StringMatcher
- * instances. The instances are considered sequentially. Each instance in the
- * list can optionally be negated, meaning that a match makes the entire
- * remaining match fail.
- *
- * @author Eric Lafortune
- */
-public class ListMatcher implements StringMatcher
-{
-    private final StringMatcher[] matchers;
-    private final boolean[]       negate;
-
-
-    public ListMatcher(StringMatcher[] matchers)
-    {
-        this(matchers, null);
-    }
-
-
-    public ListMatcher(StringMatcher[] matchers, boolean[] negate)
-    {
-        this.matchers = matchers;
-        this.negate   = negate;
-    }
-
-
-    // Implementations for StringMatcher.
-
-    public boolean matches(String string)
-    {
-        // Check the list of matchers.
-        for (int index = 0; index < matchers.length; index++)
-        {
-            StringMatcher matcher = matchers[index];
-            if (matcher.matches(string))
-            {
-                return negate == null ||
-                       !negate[index];
-            }
-        }
-
-        return negate != null &&
-               negate[negate.length - 1];
-
-    }
-}

data/lib/proguard4.7/src/proguard/util/ListParser.java

@@ -1,137 +0,0 @@
-/*
- * ProGuard -- shrinking, optimization, obfuscation, and preverification
- *             of Java bytecode.
- *
- * Copyright (c) 2002-2011 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;
-
-import java.util.List;
-
-/**
- * This StringParser can create StringMatcher instances for regular expressions.
- * The regular expressions are either presented as a list, or they are
- * interpreted as comma-separated lists, optionally prefixed with '!' negators.
- * If an entry with a negator matches, a negative match is returned, without
- * considering any subsequent entries in the list. The creation of StringMatcher
- * instances  for the entries is delegated to the given StringParser.
- *
- * @author Eric Lafortune
- */
-public class ListParser implements StringParser
-{
-    private final StringParser stringParser;
-
-
-    /**
-     * Creates a new ListParser that parses individual elements in the
-     * comma-separated list with the given StringParser.
-     */
-    public ListParser(StringParser stringParser)
-    {
-        this.stringParser = stringParser;
-    }
-
-
-    // Implementations for StringParser.
-
-    public StringMatcher parse(String regularExpression)
-    {
-        // Does the regular expression contain a ',' list separator?
-        return parse(ListUtil.commaSeparatedList(regularExpression));
-    }
-
-
-    /**
-     * Creates a StringMatcher for the given regular expression, which can
-     * be a list of optionally negated simple entries.
-     * <p>
-     * An empty list results in a StringMatcher that matches any string.
-     */
-    public StringMatcher parse(List regularExpressions)
-    {
-        StringMatcher listMatcher = null;
-
-        // Loop over all simple regular expressions, backward, creating a
-        // linked list of matchers.
-        for (int index = regularExpressions.size()-1; index >=0; index--)
-        {
-            String regularExpression = (String)regularExpressions.get(index);
-
-            StringMatcher entryMatcher = parseEntry(regularExpression);
-
-            // Prepend the entry matcher.
-            listMatcher =
-                listMatcher == null ?
-                    (StringMatcher)entryMatcher :
-                isNegated(regularExpression) ?
-                    (StringMatcher)new AndMatcher(entryMatcher, listMatcher) :
-                    (StringMatcher)new OrMatcher(entryMatcher, listMatcher);
-        }
-
-        return listMatcher != null ? listMatcher : new ConstantMatcher(true);
-    }
-
-
-    // Small utility methods.
-
-    /**
-     * Creates a StringMatcher for the given regular expression, which is a
-     * an optionally negated simple expression.
-     */
-    private StringMatcher parseEntry(String regularExpression)
-    {
-        // Wrap the matcher if the regular expression starts with a '!' negator.
-        return isNegated(regularExpression) ?
-          new NotMatcher(stringParser.parse(regularExpression.substring(1))) :
-          stringParser.parse(regularExpression);
-    }
-
-
-    /**
-     * Returns whether the given simple regular expression is negated.
-     */
-    private boolean isNegated(String regularExpression)
-    {
-        return regularExpression.length() > 0 &&
-               regularExpression.charAt(0) == '!';
-    }
-
-
-    /**
-     * A main method for testing name matching.
-     */
-    public static void main(String[] args)
-    {
-        try
-        {
-            System.out.println("Regular expression ["+args[0]+"]");
-            ListParser parser  = new ListParser(new NameParser());
-            StringMatcher  matcher = parser.parse(args[0]);
-            for (int index = 1; index < args.length; index++)
-            {
-                String string = args[index];
-                System.out.print("String             ["+string+"]");
-                System.out.println(" -> match = "+matcher.matches(args[index]));
-            }
-        }
-        catch (Exception ex)
-        {
-            ex.printStackTrace();
-        }
-    }
-}