X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fcom%2Fstevesoft%2Fpat%2FSkipped.java;h=7a957e88c76ea9e034b906ad3c9be1ec6f32d010;hb=57738a1f3c19b1c3a00bd3ac5108f8cd0af32f99;hp=9bf28372e4d14fb1616cfb4695a67d780e2fd764;hpb=7bc226b58110fa26d9dbd3f0c78095d06909ffc3;p=jalview.git

diff --git a/src/com/stevesoft/pat/Skipped.java b/src/com/stevesoft/pat/Skipped.java
index 9bf2837..7a957e8 100755
--- a/src/com/stevesoft/pat/Skipped.java
+++ b/src/com/stevesoft/pat/Skipped.java
@@ -1,54 +1,55 @@
-//
-// This software is now distributed according to
-// the Lesser Gnu Public License.  Please see
-// http://www.gnu.org/copyleft/lesser.txt for
-// the details.
-//    -- Happy Computing!
-//
-package com.stevesoft.pat;
-
-import java.util.*;
-
-/** Implements the (?<number) Pattern, where number is
- an integer telling us how far to back up in the Pattern.
- Not in perl 5. */
-class Skipped
-    extends Pattern
-{
-  String s;
-  Skipped(String s)
-  {
-    this.s = s;
-  }
-
-  public String toString()
-  {
-    return s + nextString();
-  }
-
-  public int matchInternal(int pos, Pthings pt)
-  {
-    //if(pt.no_check || s.regionMatches(pt.ignoreCase,0,pt.src,pos,s.length()))
-    if (pt.no_check ||
-        CaseMgr.regionMatches(s, pt.ignoreCase, 0, pt.src, pos, s.length()))
-    {
-      return nextMatch(pos + s.length(), pt);
-    }
-    return -1;
-  }
-
-  public patInt minChars()
-  {
-    return new patInt(s.length());
-  }
-
-  public patInt maxChars()
-  {
-    return new patInt(s.length());
-  }
-
-  Pattern clone1(Hashtable h)
-  {
-    return new Skipped(s);
-  }
-};
+//
+// This software is now distributed according to
+// the Lesser Gnu Public License.  Please see
+// http://www.gnu.org/copyleft/lesser.txt for
+// the details.
+//    -- Happy Computing!
+//
+package com.stevesoft.pat;
+
+import java.util.Hashtable;
+
+/**
+ * Implements the (?<number) Pattern, where number is an integer telling us
+ * how far to back up in the Pattern. Not in perl 5.
+ */
+class Skipped extends Pattern
+{
+  String s;
+
+  Skipped(String s)
+  {
+    this.s = s;
+  }
+
+  public String toString()
+  {
+    return s + nextString();
+  }
+
+  public int matchInternal(int pos, Pthings pt)
+  {
+    // if(pt.no_check || s.regionMatches(pt.ignoreCase,0,pt.src,pos,s.length()))
+    if (pt.no_check || CaseMgr.regionMatches(s, pt.ignoreCase, 0, pt.src,
+            pos, s.length()))
+    {
+      return nextMatch(pos + s.length(), pt);
+    }
+    return -1;
+  }
+
+  public patInt minChars()
+  {
+    return new patInt(s.length());
+  }
+
+  public patInt maxChars()
+  {
+    return new patInt(s.length());
+  }
+
+  Pattern clone1(Hashtable h)
+  {
+    return new Skipped(s);
+  }
+};