Is it a problem on Regex or Static

I have met a problem, which will seriously cause JVM problem.

I try to build a class to solve String operation with Regular Expression (java.util.regex.*)

I define all the method as a static one, thus i can use the class to parse String without a instance. But when i use the method many times, just found the memory is quickly exhausted. ( i use java -verbose:gc to observe the status). finally , i focus on the return type of the method, i directly return the String with "m.group(1)" (m is a instance of java.util.regex.Matcher). Is it a problem of regex or static or both? i didn't know the answer.

The original code are:

    public static String getFirstGroup(String regex, String original) {
            Pattern p = Pattern.compile(regex, Pattern.CASE_INSENSITIVE);
            Matcher m = p.matcher(original);
            if (m.find()) {
                    String result = m.group(1);
                   m = null;
                   return result;
            } else {
                      return "";
             }
    }
The strange thing is when i use is to parse one same String for many times, on problem oclearcase/" target="_blank" >ccurs.

Then i make some change:

    public static String getFirstGroup(String regex, String original) {
            Pattern p = Pattern.compile(regex, Pattern.CASE_INSENSITIVE);
            Matcher m = p.matcher(original);
            if (m.find()) {
                    String result = new String(m.group(1));
                   m = null;
                   return result;
            } else {
                      return "";
             }
    }
The problem disappeared. So i confused with the problem.

May be it is a problem on static,  i will have a try later.  May be there still be a refernce in Matcher, i will try to read the code of regex. Anyway, if you know the answer, we may have a talk.

原文转自：http://www.ltesting.net