File	Doc	Category	Size	Date	Package
BMPattern.java	API Doc	Java SE 6 API	8397	Tue Jun 10 00:22:44 BST 2008	com.sun.org.apache.xerces.internal.impl.xpath.regex

BMPattern

• java.lang.Object

Fields Summary
char[]	pattern
int[]	shiftTable
boolean	ignoreCase

Constructors Summary
public BMPattern(String pat, boolean ignoreCase) this(pat, 256, ignoreCase);
public BMPattern(String pat, int tableSize, boolean ignoreCase) this.pattern = pat.toCharArray(); this.shiftTable = new int[tableSize]; this.ignoreCase = ignoreCase; int length = pattern.length; for (int i = 0; i < this.shiftTable.length; i ++) this.shiftTable[i] = length; for (int i = 0; i < length; i ++) { char ch = this.pattern[i]; int diff = length-i-1; int index = ch % this.shiftTable.length; if (diff < this.shiftTable[index]) this.shiftTable[index] = diff; if (this.ignoreCase) { ch = Character.toUpperCase(ch); index = ch % this.shiftTable.length; if (diff < this.shiftTable[index]) this.shiftTable[index] = diff; ch = Character.toLowerCase(ch); index = ch % this.shiftTable.length; if (diff < this.shiftTable[index]) this.shiftTable[index] = diff; } }

Methods Summary
public int	matches(java.text.CharacterIterator iterator, int start, int limit) return -1 if iterator does not contain this pattern. if (this.ignoreCase) return this.matchesIgnoreCase(iterator, start, limit); int plength = this.pattern.length; if (plength == 0) return start; int index = start+plength; while (index <= limit) { int pindex = plength; int nindex = index+1; char ch; do { if ((ch = iterator.setIndex(--index)) != this.pattern[--pindex]) break; if (pindex == 0) return index; } while (pindex > 0); index += this.shiftTable[ch % this.shiftTable.length]+1; if (index < nindex) index = nindex; } return -1;
public int	matches(java.lang.String str, int start, int limit) return -1 if str does not contain this pattern. if (this.ignoreCase) return this.matchesIgnoreCase(str, start, limit); int plength = this.pattern.length; if (plength == 0) return start; int index = start+plength; while (index <= limit) { //System.err.println("Starts at "+index); int pindex = plength; int nindex = index+1; char ch; do { if ((ch = str.charAt(--index)) != this.pattern[--pindex]) break; if (pindex == 0) return index; } while (pindex > 0); index += this.shiftTable[ch % this.shiftTable.length]+1; if (index < nindex) index = nindex; } return -1;
public int	matches(char[] chars, int start, int limit) return -1 if chars does not contain this pattern. if (this.ignoreCase) return this.matchesIgnoreCase(chars, start, limit); int plength = this.pattern.length; if (plength == 0) return start; int index = start+plength; while (index <= limit) { //System.err.println("Starts at "+index); int pindex = plength; int nindex = index+1; char ch; do { if ((ch = chars[--index]) != this.pattern[--pindex]) break; if (pindex == 0) return index; } while (pindex > 0); index += this.shiftTable[ch % this.shiftTable.length]+1; if (index < nindex) index = nindex; } return -1;
int	matchesIgnoreCase(java.text.CharacterIterator iterator, int start, int limit) int plength = this.pattern.length; if (plength == 0) return start; int index = start+plength; while (index <= limit) { int pindex = plength; int nindex = index+1; char ch; do { char ch1 = ch = iterator.setIndex(--index); char ch2 = this.pattern[--pindex]; if (ch1 != ch2) { ch1 = Character.toUpperCase(ch1); ch2 = Character.toUpperCase(ch2); if (ch1 != ch2 && Character.toLowerCase(ch1) != Character.toLowerCase(ch2)) break; } if (pindex == 0) return index; } while (pindex > 0); index += this.shiftTable[ch % this.shiftTable.length]+1; if (index < nindex) index = nindex; } return -1;
int	matchesIgnoreCase(java.lang.String text, int start, int limit) int plength = this.pattern.length; if (plength == 0) return start; int index = start+plength; while (index <= limit) { int pindex = plength; int nindex = index+1; char ch; do { char ch1 = ch = text.charAt(--index); char ch2 = this.pattern[--pindex]; if (ch1 != ch2) { ch1 = Character.toUpperCase(ch1); ch2 = Character.toUpperCase(ch2); if (ch1 != ch2 && Character.toLowerCase(ch1) != Character.toLowerCase(ch2)) break; } if (pindex == 0) return index; } while (pindex > 0); index += this.shiftTable[ch % this.shiftTable.length]+1; if (index < nindex) index = nindex; } return -1;
int	matchesIgnoreCase(char[] chars, int start, int limit) int plength = this.pattern.length; if (plength == 0) return start; int index = start+plength; while (index <= limit) { int pindex = plength; int nindex = index+1; char ch; do { char ch1 = ch = chars[--index]; char ch2 = this.pattern[--pindex]; if (ch1 != ch2) { ch1 = Character.toUpperCase(ch1); ch2 = Character.toUpperCase(ch2); if (ch1 != ch2 && Character.toLowerCase(ch1) != Character.toLowerCase(ch2)) break; } if (pindex == 0) return index; } while (pindex > 0); index += this.shiftTable[ch % this.shiftTable.length]+1; if (index < nindex) index = nindex; } return -1;