Factor out constant answer in a singleton to save lots of memory on start up.

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/codec/trunk@1154726 13f79535-47bb-0310-9956-ffa450edef68

Author: garydgregory

src/java/org/apache/commons/codec/language/bm/Rule.java

@@ -81,7 +81,7 @@
 public class Rule {
 
     private static class AppendableCharSeqeuence implements CharSequence {
-        
+
         private final CharSequence left;
         private final CharSequence right;
         private final int length;
@@ -213,6 +213,16 @@ public static interface RMatcher {
         boolean find();
     }
 
+    private static class TrueRMatcher implements RMatcher {
+
+        static TrueRMatcher INSTANCE = new TrueRMatcher();
+
+        public boolean find() {
+            return true;
+        }
+
+    }
+
     /**
      * A minimal wrapper around the functionality of Pattern that we use, to allow for alternate implementations.
      */
@@ -497,11 +507,7 @@ public boolean find() {
                 // matches every string
                 return new RPattern() {
                     public RMatcher matcher(CharSequence input) {
-                        return new RMatcher() {
-                            public boolean find() {
-                                return true;
-                            }
-                        };
+                        return TrueRMatcher.INSTANCE;
                     }
                 };
             } else if (startsWith) {
@@ -695,7 +701,7 @@ public boolean patternAndContextMatches(CharSequence input, int i) {
         if (i < 0) {
             throw new IndexOutOfBoundsException("Can not match pattern at negative indexes");
         }
-        
+
         int patternLength = this.pattern.length();
         int ipl = i + patternLength;