| java.lang.Object java.util.regex.AbstractSet java.util.regex.LeafSet java.util.regex.SequenceSet
SequenceSet | class SequenceSet extends LeafSet (Code) | | This class represents nodes constructed with character sequences. For
example, lets consider regular expression: ".*word.*". During regular
expression compilation phase character sequence w-o-r-d, will be represented
with single node for the entire word.
During the match phase, Moyer-Moore algorithm will be used for fast
searching.
Please follow the next link for more details about mentioned algorithm:
http://portal.acm.org/citation.cfm?id=359859
author: Nikolay A. Kuznetsov version: $Revision: 1.15.2.2 $ |
Inner Class :class IntHash | |
Method Summary | |
public int | accepts(int strIndex, CharSequence testString) | public int | find(int strIndex, CharSequence testString, MatchResultImpl matchResult) | public int | findBack(int strIndex, int lastIndex, CharSequence testString, MatchResultImpl matchResult) | public boolean | first(AbstractSet set) | public String | getName() | protected int | indexOf(CharSequence str, int from, int to) | protected int | lastIndexOf(CharSequence str, int to, int from) | protected boolean | startsWith(CharSequence str, int from) |
Fields inherited from java.util.regex.LeafSet | protected int charCount(Code)(Java Doc)
|
|
|