JAL-1807 still testing

[jalviewjs.git] / unused / com / stevesoft / pat / Backup.java

diff --git a/unused/com/stevesoft/pat/Backup.java b/unused/com/stevesoft/pat/Backup.java
index 1986460..7aef29b 100644 (file)
--- a/unused/com/stevesoft/pat/Backup.java
+++ b/unused/com/stevesoft/pat/Backup.java
@@ -1,54 +1,54 @@
-//
-// 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. It also allows
- * (?>number).
- */
-class Backup extends Pattern
-{
-  int bk;
-
-  Backup(int ii)
-  {
-    bk = ii;
-  }
-
-  public String toString()
-  {
-    return "(?" + (bk < 0 ? ">" + (-bk) : "<" + bk) + ")" + nextString();
-  }
-
-  public int matchInternal(int pos, Pthings pt)
-  {
-    if (pos < bk)
-    {
-      return -1;
-    }
-    return nextMatch(pos - bk, pt);
-  }
-
-  public patInt minChars()
-  {
-    return new patInt(-bk);
-  }
-
-  public patInt maxChars()
-  {
-    return new patInt(-bk);
-  }
-
-  public Pattern clone1(Hashtable h)
-  {
-    return new Backup(bk);
-  }
-};
+//\r
+// This software is now distributed according to\r
+// the Lesser Gnu Public License.  Please see\r
+// http://www.gnu.org/copyleft/lesser.txt for\r
+// the details.\r
+//    -- Happy Computing!\r
+//\r
+package com.stevesoft.pat;\r
+\r
+import java.util.*;\r
+\r
+/**\r
+ * Implements the (?&lt;number) Pattern, where number is an integer telling us\r
+ * how far to back up in the Pattern. Not in perl 5. It also allows\r
+ * (?&gt;number).\r
+ */\r
+class Backup extends Pattern\r
+{\r
+  int bk;\r
+\r
+  Backup(int ii)\r
+  {\r
+    bk = ii;\r
+  }\r
+\r
+  public String toString()\r
+  {\r
+    return "(?" + (bk < 0 ? ">" + (-bk) : "<" + bk) + ")" + nextString();\r
+  }\r
+\r
+  public int matchInternal(int pos, Pthings pt)\r
+  {\r
+    if (pos < bk)\r
+    {\r
+      return -1;\r
+    }\r
+    return nextMatch(pos - bk, pt);\r
+  }\r
+\r
+  public patInt minChars()\r
+  {\r
+    return new patInt(-bk);\r
+  }\r
+\r
+  public patInt maxChars()\r
+  {\r
+    return new patInt(-bk);\r
+  }\r
+\r
+  public Pattern clone1(Hashtable h)\r
+  {\r
+    return new Backup(bk);\r
+  }\r
+};\r