X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fcom%2Fstevesoft%2Fpat%2FSkipped.java;fp=src%2Fcom%2Fstevesoft%2Fpat%2FSkipped.java;h=551166b3a89de5c7512a57c725f91b5c56a70997;hb=506d60f0e188723ddc91c26824b41ac7034df3fe;hp=9bf28372e4d14fb1616cfb4695a67d780e2fd764;hpb=60f2d6c034560415fd0139c8bc7df0c19cae1186;p=jalview.git diff --git a/src/com/stevesoft/pat/Skipped.java b/src/com/stevesoft/pat/Skipped.java index 9bf2837..551166b 100755 --- a/src/com/stevesoft/pat/Skipped.java +++ b/src/com/stevesoft/pat/Skipped.java @@ -1,54 +1,56 @@ -// -// 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.*; + +/** + * 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); + } +};