// -- Happy Computing!\r
//\r
package com.stevesoft.pat;\r
-import java.util.Hashtable;\r
+\r
+import java.util.*;\r
\r
/** Implements the (?<number) Pattern, where number is\r
an integer telling us how far to back up in the Pattern.\r
Not in perl 5. */\r
-class Skipped extends Pattern {\r
- String s;\r
- Skipped(String s) { this.s = s; }\r
- public String toString() { return s+nextString(); }\r
- public int matchInternal(int pos,Pthings pt) {\r
- //if(pt.no_check || s.regionMatches(pt.ignoreCase,0,pt.src,pos,s.length()))\r
- if(pt.no_check || CaseMgr.regionMatches(s,pt.ignoreCase,0,pt.src,pos,s.length()))\r
- return nextMatch(pos+s.length(),pt);\r
- return -1;\r
+class Skipped\r
+ extends Pattern\r
+{\r
+ String s;\r
+ Skipped(String s)\r
+ {\r
+ this.s = s;\r
+ }\r
+\r
+ public String toString()\r
+ {\r
+ return s + nextString();\r
+ }\r
+\r
+ public int matchInternal(int pos, Pthings pt)\r
+ {\r
+ //if(pt.no_check || s.regionMatches(pt.ignoreCase,0,pt.src,pos,s.length()))\r
+ if (pt.no_check ||\r
+ CaseMgr.regionMatches(s, pt.ignoreCase, 0, pt.src, pos, s.length()))\r
+ {\r
+ return nextMatch(pos + s.length(), pt);\r
}\r
- public patInt minChars() { return new patInt(s.length()); }\r
- public patInt maxChars() { return new patInt(s.length()); }\r
- Pattern clone1(Hashtable h) { return new Skipped(s); }\r
+ return -1;\r
+ }\r
+\r
+ public patInt minChars()\r
+ {\r
+ return new patInt(s.length());\r
+ }\r
+\r
+ public patInt maxChars()\r
+ {\r
+ return new patInt(s.length());\r
+ }\r
+\r
+ Pattern clone1(Hashtable h)\r
+ {\r
+ return new Skipped(s);\r
+ }\r
};\r