/*

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * particular file as subject to the "Classpath" exception as provided

 *

 * This code 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

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 */

/**

 * @test

 * @summary tests RegExp framework

 * @author Mike McCloskey

 * @bug 4481568 4482696 4495089 4504687 4527731 4599621 4631553 4619345

 * 4630911 4672616 4711773 4727935 4750573 4792284 4803197 4757029 4808962

 * 4872664 4803179 4892980 4900747 4945394 4938995 4979006 4994840 4997476

 * 5013885 5003322 4988891 5098443 5110268 6173522 4829857 5027748 6376940

 * 6358731 6178785 6284152 6231989 6497148 6486934 6233084 6504326 6635133

 * 6350801 6676425 6878475 6919132 6931676

 */

import java.util.regex.*;

import java.util.Random;

import java.io.*;

import java.util.*;

import java.nio.CharBuffer;

/**

 * This is a test class created to check the operation of

 * the Pattern and Matcher classes.

 */

public class RegExTest {

    private static Random generator = new Random();

    private static boolean failure = false;

    private static int failCount = 0;

    /**

     * Main to interpret arguments and run several tests.

     *

     */

    public static void main(String[] args) throws Exception {

        // Most of the tests are in a file

        processFile("TestCases.txt");

        //processFile("PerlCases.txt");

        processFile("BMPTestCases.txt");

        processFile("SupplementaryTestCases.txt");

        // These test many randomly generated char patterns

        bm();

        slice();

        // These are hard to put into the file

        escapes();

        blankInput();

        // Substitition tests on randomly generated sequences

        globalSubstitute();

        stringbufferSubstitute();

        substitutionBasher();

        // Canonical Equivalence

        ceTest();

        // Anchors

        anchorTest();

        // boolean match calls

        matchesTest();

        lookingAtTest();

        // Pattern API

        patternMatchesTest();

        // Misc

        lookbehindTest();

        nullArgumentTest();

        backRefTest();

        groupCaptureTest();

        caretTest();

        charClassTest();

        emptyPatternTest();

        findIntTest();

        group0Test();

        longPatternTest();

        octalTest();

        ampersandTest();

        negationTest();

        splitTest();

        appendTest();

        caseFoldingTest();

        commentsTest();

        unixLinesTest();

        replaceFirstTest();

        gTest();

        zTest();

        serializeTest();

        reluctantRepetitionTest();

        multilineDollarTest();

        dollarAtEndTest();

        caretBetweenTerminatorsTest();

        // This RFE rejected in Tiger numOccurrencesTest();

        javaCharClassTest();

        nonCaptureRepetitionTest();

        notCapturedGroupCurlyMatchTest();

        escapedSegmentTest();

        literalPatternTest();

        literalReplacementTest();

        regionTest();

        toStringTest();

        negatedCharClassTest();

        findFromTest();

        boundsTest();

        unicodeWordBoundsTest();

        caretAtEndTest();

        wordSearchTest();

        hitEndTest();

        toMatchResultTest();

        surrogatesInClassTest();

        namedGroupCaptureTest();

        nonBmpClassComplementTest();

        if (failure)

            throw new RuntimeException("Failure in the RE handling.");

        else

            System.err.println("OKAY: All tests passed.");

    }

    // Utility functions

    private static String getRandomAlphaString(int length) {

        StringBuffer buf = new StringBuffer(length);

        for (int i=0; i<length; i++) {

            char randChar = (char)(97 + generator.nextInt(26));

            buf.append(randChar);

        }

        return buf.toString();

    }

    private static void check(Matcher m, String expected) {

        m.find();

        if (!m.group().equals(expected))

            failCount++;

    }

    private static void check(Matcher m, String result, boolean expected) {

        m.find();

        if (m.group().equals(result))

            failCount += (expected) ? 0 : 1;

        else

            failCount += (expected) ? 1 : 0;

    }

    private static void check(Pattern p, String s, boolean expected) {

        Matcher matcher = p.matcher(s);

        if (matcher.find())

            failCount += (expected) ? 0 : 1;

        else

            failCount += (expected) ? 1 : 0;

    }

    private static void check(String p, char c, boolean expected) {

        String propertyPattern = expected ? "\\p" + p : "\\P" + p;

        Pattern pattern = Pattern.compile(propertyPattern);

        char[] ca = new char[1]; ca[0] = c;

        Matcher matcher = pattern.matcher(new String(ca));

        if (!matcher.find())

            failCount++;

    }

    private static void check(String p, int codePoint, boolean expected) {

        String propertyPattern = expected ? "\\p" + p : "\\P" + p;

        Pattern pattern = Pattern.compile(propertyPattern);

        char[] ca = Character.toChars(codePoint);

        Matcher matcher = pattern.matcher(new String(ca));

        if (!matcher.find())

            failCount++;

    }

    private static void check(String p, int flag, String input, String s,

                              boolean expected)

    {

        Pattern pattern = Pattern.compile(p, flag);

        Matcher matcher = pattern.matcher(input);

        if (expected)

            check(matcher, s, expected);

        else

            check(pattern, input, false);

    }

    private static void report(String testName) {

        int spacesToAdd = 30 - testName.length();

        StringBuffer paddedNameBuffer = new StringBuffer(testName);

        for (int i=0; i<spacesToAdd; i++)

            paddedNameBuffer.append(" ");

        String paddedName = paddedNameBuffer.toString();

        System.err.println(paddedName + ": " +

                           (failCount==0 ? "Passed":"Failed("+failCount+")"));

        if (failCount > 0)

            failure = true;

        failCount = 0;

    }

    /**

     * Converts ASCII alphabet characters [A-Za-z] in the given 's' to

     * supplementary characters. This method does NOT fully take care

     * of the regex syntax.

     */

    private static String toSupplementaries(String s) {

        int length = s.length();

        StringBuffer sb = new StringBuffer(length * 2);

        for (int i = 0; i < length; ) {

            char c = s.charAt(i++);

            if (c == '\\') {

                sb.append(c);

                if (i < length) {

                    c = s.charAt(i++);

                    sb.append(c);

                    if (c == 'u') {

                        // assume no syntax error

                        sb.append(s.charAt(i++));

                        sb.append(s.charAt(i++));

                        sb.append(s.charAt(i++));

                        sb.append(s.charAt(i++));

                    }

                }

            } else if ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z')) {

                sb.append('\ud800').append((char)('\udc00'+c));

            } else {

                sb.append(c);

            }

        }

        return sb.toString();

    }

    // Regular expression tests

    // This is for bug 6178785

    // Test if an expected NPE gets thrown when passing in a null argument

    private static boolean check(Runnable test) {

        try {

            test.run();

            failCount++;

            return false;

        } catch (NullPointerException npe) {

            return true;

        }

    }

    private static void nullArgumentTest() {

        check(new Runnable() { public void run() { Pattern.compile(null); }});

        check(new Runnable() { public void run() { Pattern.matches(null, null); }});

        check(new Runnable() { public void run() { Pattern.matches("xyz", null);}});

        check(new Runnable() { public void run() { Pattern.quote(null);}});

        check(new Runnable() { public void run() { Pattern.compile("xyz").split(null);}});

        check(new Runnable() { public void run() { Pattern.compile("xyz").matcher(null);}});

        final Matcher m = Pattern.compile("xyz").matcher("xyz");

        m.matches();

        check(new Runnable() { public void run() { m.appendTail(null);}});

        check(new Runnable() { public void run() { m.replaceAll(null);}});

        check(new Runnable() { public void run() { m.replaceFirst(null);}});

        check(new Runnable() { public void run() { m.appendReplacement(null, null);}});

        check(new Runnable() { public void run() { m.reset(null);}});

        check(new Runnable() { public void run() { Matcher.quoteReplacement(null);}});

        //check(new Runnable() { public void run() { m.usePattern(null);}});

        report("Null Argument");

    }

    // This is for bug6635133

    // Test if surrogate pair in Unicode escapes can be handled correctly.

    private static void surrogatesInClassTest() throws Exception {

        Pattern pattern = Pattern.compile("[\\ud834\\udd21-\\ud834\\udd24]");

        Matcher matcher = pattern.matcher("\ud834\udd22");

        if (!matcher.find())

            failCount++;

    }

    // This is for bug 4988891

    // Test toMatchResult to see that it is a copy of the Matcher

    // that is not affected by subsequent operations on the original

    private static void toMatchResultTest() throws Exception {

        Pattern pattern = Pattern.compile("squid");

        Matcher matcher = pattern.matcher(

            "agiantsquidofdestinyasmallsquidoffate");

        matcher.find();

        int matcherStart1 = matcher.start();

        MatchResult mr = matcher.toMatchResult();

        if (mr == matcher)

            failCount++;

        int resultStart1 = mr.start();

        if (matcherStart1 != resultStart1)

            failCount++;

        matcher.find();

        int matcherStart2 = matcher.start();

        int resultStart2 = mr.start();

        if (matcherStart2 == resultStart2)

            failCount++;

        if (resultStart1 != resultStart2)

            failCount++;

        MatchResult mr2 = matcher.toMatchResult();

        if (mr == mr2)

            failCount++;

        if (mr2.start() != matcherStart2)

            failCount++;

        report("toMatchResult is a copy");

    }

    // This is for bug 5013885

    // Must test a slice to see if it reports hitEnd correctly

    private static void hitEndTest() throws Exception {

        // Basic test of Slice node

        Pattern p = Pattern.compile("^squidattack");

        Matcher m = p.matcher("squack");

        m.find();

        if (m.hitEnd())

            failCount++;

        m.reset("squid");

        m.find();

        if (!m.hitEnd())

            failCount++;

        // Test Slice, SliceA and SliceU nodes

        for (int i=0; i<3; i++) {

            int flags = 0;

            if (i==1) flags = Pattern.CASE_INSENSITIVE;

            if (i==2) flags = Pattern.UNICODE_CASE;

            p = Pattern.compile("^abc", flags);

            m = p.matcher("ad");

            m.find();

            if (m.hitEnd())

                failCount++;

            m.reset("ab");

            m.find();

            if (!m.hitEnd())

                failCount++;

        }

        // Test Boyer-Moore node

        p = Pattern.compile("catattack");

        m = p.matcher("attack");

        m.find();

        if (!m.hitEnd())

            failCount++;

        p = Pattern.compile("catattack");

        m = p.matcher("attackattackattackcatatta");

        m.find();

        if (!m.hitEnd())

            failCount++;

        report("hitEnd from a Slice");

    }

    // This is for bug 4997476

    // It is weird code submitted by customer demonstrating a regression

    private static void wordSearchTest() throws Exception {

        String testString = new String("word1 word2 word3");

        Pattern p = Pattern.compile("\\b");

        Matcher m = p.matcher(testString);

        int position = 0;

        int start = 0;

        while (m.find(position)) {

            start = m.start();

            if (start == testString.length())

                break;

            if (m.find(start+1)) {

                position = m.start();

            } else {

                position = testString.length();

            }

            if (testString.substring(start, position).equals(" "))

                continue;

            if (!testString.substring(start, position-1).startsWith("word"))

                failCount++;

        }

        report("Customer word search");

    }

    // This is for bug 4994840

    private static void caretAtEndTest() throws Exception {

        // Problem only occurs with multiline patterns

        // containing a beginning-of-line caret "^" followed

        // by an expression that also matches the empty string.

        Pattern pattern = Pattern.compile("^x?", Pattern.MULTILINE);

        Matcher matcher = pattern.matcher("\r");

        matcher.find();

        matcher.find();

        report("Caret at end");

    }

    // This test is for 4979006

    // Check to see if word boundary construct properly handles unicode

    // non spacing marks

    private static void unicodeWordBoundsTest() throws Exception {

        String spaces = "  ";

        String wordChar = "a";

        String nsm = "\u030a";

        assert (Character.getType('\u030a') == Character.NON_SPACING_MARK);

        Pattern pattern = Pattern.compile("\\b");

        Matcher matcher = pattern.matcher("");

        // S=other B=word character N=non spacing mark .=word boundary

        // SS.BB.SS

        String input = spaces + wordChar + wordChar + spaces;

        twoFindIndexes(input, matcher, 2, 4);

        // SS.BBN.SS

        input = spaces + wordChar +wordChar + nsm + spaces;

        twoFindIndexes(input, matcher, 2, 5);

        // SS.BN.SS

        input = spaces + wordChar + nsm + spaces;

        twoFindIndexes(input, matcher, 2, 4);

        // SS.BNN.SS

        input = spaces + wordChar + nsm + nsm + spaces;

        twoFindIndexes(input, matcher, 2, 5);

        // SSN.BB.SS

        input = spaces + nsm + wordChar + wordChar + spaces;

        twoFindIndexes(input, matcher, 3, 5);

        // SS.BNB.SS

        input = spaces + wordChar + nsm + wordChar + spaces;

        twoFindIndexes(input, matcher, 2, 5);

        // SSNNSS

        input = spaces + nsm + nsm + spaces;

        matcher.reset(input);

        if (matcher.find())

            failCount++;

        // SSN.BBN.SS

        input = spaces + nsm + wordChar + wordChar + nsm + spaces;

        twoFindIndexes(input, matcher, 3, 6);

        report("Unicode word boundary");

    }

    private static void twoFindIndexes(String input, Matcher matcher, int a,

                                       int b) throws Exception

    {

        matcher.reset(input);

        matcher.find();

        if (matcher.start() != a)

            failCount++;

        matcher.find();

        if (matcher.start() != b)

            failCount++;

    }

    // This test is for 6284152

    static void check(String regex, String input, String[] expected) {

        List<String> result = new ArrayList<String>();

        Pattern p = Pattern.compile(regex);

        Matcher m = p.matcher(input);

        while (m.find()) {

            result.add(m.group());

        }

        if (!Arrays.asList(expected).equals(result))

            failCount++;

    }

    private static void lookbehindTest() throws Exception {

        //Positive

        check("(?<=%.{0,5})foo\\d",

              "%foo1\n%bar foo2\n%bar  foo3\n%blahblah foo4\nfoo5",

              new String[]{"foo1", "foo2", "foo3"});

        //boundary at end of the lookbehind sub-regex should work consistently

        //with the boundary just after the lookbehind sub-regex

        check("(?<=.*\\b)foo", "abcd foo", new String[]{"foo"});

        check("(?<=.*)\\bfoo", "abcd foo", new String[]{"foo"});

        check("(?<!abc )\\bfoo", "abc foo", new String[0]);

        check("(?<!abc \\b)foo", "abc foo", new String[0]);

        //Negative

        check("(?<!%.{0,5})foo\\d",

              "%foo1\n%bar foo2\n%bar  foo3\n%blahblah foo4\nfoo5",

              new String[] {"foo4", "foo5"});

        //Positive greedy

        check("(?<=%b{1,4})foo", "%bbbbfoo", new String[] {"foo"});

        //Positive reluctant

        check("(?<=%b{1,4}?)foo", "%bbbbfoo", new String[] {"foo"});

        //supplementary

        check("(?<=%b{1,4})fo\ud800\udc00o", "%bbbbfo\ud800\udc00o",

              new String[] {"fo\ud800\udc00o"});

        check("(?<=%b{1,4}?)fo\ud800\udc00o", "%bbbbfo\ud800\udc00o",

              new String[] {"fo\ud800\udc00o"});

        check("(?<!%b{1,4})fo\ud800\udc00o", "%afo\ud800\udc00o",

              new String[] {"fo\ud800\udc00o"});

        check("(?<!%b{1,4}?)fo\ud800\udc00o", "%afo\ud800\udc00o",

              new String[] {"fo\ud800\udc00o"});

        report("Lookbehind");

    }

    // This test is for 4938995

    // Check to see if weak region boundaries are transparent to

    // lookahead and lookbehind constructs

    private static void boundsTest() throws Exception {

        String fullMessage = "catdogcat";

        Pattern pattern = Pattern.compile("(?<=cat)dog(?=cat)");

        Matcher matcher = pattern.matcher("catdogca");

        matcher.useTransparentBounds(true);

        if (matcher.find())

            failCount++;

        matcher.reset("atdogcat");

        if (matcher.find())

            failCount++;

        matcher.reset(fullMessage);

        if (!matcher.find())

            failCount++;