| java.util.regex | 
 | 
| Java Source File Name | Type | Comment | 
| AbstractCharClass.java | Class |  This class represents character classes, i.e. | 
| AbstractLineTerminator.java | Class |  Line terminator factory
 author:     Nikolay A. | 
| AbstractSet.java | Class |  Basic class for nodes, representing given regular expression.
 Note: All the classes representing nodes has set prefix;
 author:     Nikolay A. | 
| AheadFSet.java | Class |  LookAhead FSet, always returns true;
 author:     Nikolay A. | 
| AltGroupQuantifierSet.java | Class |  Represents "?" quantifier over composite sets.
 author:     Nikolay A. | 
| AltQuantifierSet.java | Class |  Represents "?" quantifier over leaf sets.
 author:     Nikolay A. | 
| AtomicFSet.java | Class |  author:     Nikolay A. | 
| AtomicJointSet.java | Class |  This class represent atomic group (?>X), once X matches,
 this match become unchangeable till the end of the match.
 author:     Nikolay A. | 
| BackReferencedSingleSet.java | Class |  Group node over subexpression w/o alternations. | 
| BackReferenceSet.java | Class |  Back reference node, i.e. | 
| BehindFSet.java | Class |  FSet for lookbehind constructs. | 
| CanClasses.java | Class |  This class gives us a hashtable that contains canonical
 classes that are generated from
 http://www.unicode.org/Public/4.0-Update/UnicodeData-4.0.0.txt. | 
| CharClass.java | Class |  User defined character classes ([abef]). | 
| CharSet.java | Class |  Represents node accepting single character.
 author:     Nikolay A. | 
| CIBackReferenceSet.java | Class |  Case Insensitive back reference node;
 author:     Nikolay A. | 
| CICharSet.java | Class |  Represents node accepting single character in 
 case insensitive manner.
 author:     Nikolay A. | 
| CIDecomposedCharSet.java | Class |  Represents case insensitive 
 canonical decomposition of
 Unicode character. | 
| CISequenceSet.java | Class |  This class represents ASCII case insensitive character sequences.
 author:     Nikolay A. | 
| CompositeGroupQuantifierSet.java | Class |  Composite (i.e. | 
| CompositeQuantifierSet.java | Class |  Composite (i.e. | 
| CompositeRangeSet.java | Class |  This class is used to split the range that contains surrogate
 characters into two ranges: the first consisting of these surrogate
 characters and the second consisting of all others characters
 from the parent range. | 
| DecomposedCharSet.java | Class |  Represents canonical decomposition of
 Unicode character. | 
| DotAllQuantifierSet.java | Class |  Special node for ".*" construction for any character 
 including line terminators.
 author:     Nikolay A. | 
| DotAllSet.java | Class |  Node accepting any character including line terminators.
 author:     Nikolay A. | 
| DotQuantifierSet.java | Class |  Special node for ".*" construction.
 The main idea here is to find line terminator and try to find the rest of
 the construction from this point.
 author:     Nikolay A. | 
| DotSet.java | Class |  Node accepting any character except line terminators;
 author:     Nikolay A. | 
| EmptySet.java | Class |  Valid constant zero character match.
 author:     Nikolay A. | 
| EOISet.java | Class |  Represents end of input '\z', i.e. | 
| EOLSet.java | Class |  Represents node accepting single character.
 author:     Nikolay A. | 
| FinalSet.java | Class |  Special construction which marks end of pattern.
 author:     Nikolay A. | 
| FSet.java | Class |  The node which marks end of the particular group.
 author:     Nikolay A. | 
| GroupQuantifierSet.java | Class |  Default quantifier over groups, in fact this type of quantifier is
 generally used for constructions we cant identify number of characters they 
 consume.
 author:     Nikolay A. | 
| HangulDecomposedCharSet.java | Class |  Represents canonical decomposition of
 Hangul syllable. | 
| HashDecompositions.java | Class |  This class gives us a hashtable that contains canonical
 decomposition mappings that are generated from
 http://www.unicode.org/Public/4.0-Update/UnicodeData-4.0.0.txt. | 
| HighSurrogateCharSet.java | Class |  This class represents high surrogate character. | 
| I18n.java | Class |  Internationalization stub. | 
| IntArrHash.java | Class |  Hashtable implementation for int arrays. | 
| IntHash.java | Class |  Hashtable implementation for int values. | 
| JointSet.java | Class |  Represents group, which is alternation of other subexpression. | 
| LeafQuantifierSet.java | Class |  author:     Nikolay A. | 
| LeafSet.java | Class |  Base class for nodes representing leaf tokens of the RE, those who consumes
 fixed number of characters.
 author:     Nikolay A. | 
| Lexer.java | Class |  The purpose of this class is to break given pattern into RE tokens; 
 author:     Nikolay A. | 
| LowHighSurrogateRangeSet.java | Class |  | 
| LowSurrogateCharSet.java | Class |  This class represents low surrogate character. | 
| Matcher.java | Class |  Note: main functionality of this class is hidden into nodes match methods. | 
| MatchResult.java | Interface |  author:     Nikolay A. | 
| MatchResultImpl.java | Class |  Match result implementation
 Note: probably it might make sense to combine this class with Matcher.
 author:     Nikolay A. | 
| MultiLineEOLSet.java | Class |  Represents multiline version of the dollar sign.
 author:     Nikolay A. | 
| MultiLineSOLSet.java | Class |  Multiline version of the ^ sign.
 author:     Nikolay A. | 
| NegativeLookAhead.java | Class |  Negative look ahead node.
 author:     Nikolay A. | 
| NegativeLookBehind.java | Class |  Negative look behind node.
 author:     Nikolay A. | 
| NonCapFSet.java | Class |  Non-capturing group closing node.
 author:     Nikolay A. | 
| NonCapJointSet.java | Class |  Node representing non-capturing group
 author:     Nikolay A. | 
| Pattern.java | Class |  Pattern implements a compiler for regular expressions as defined by the J2SE
 specification. | 
| PatternSyntaxException.java | Class |  author:     Nikolay A. | 
| PosAltGroupQuantifierSet.java | Class |  Possessive quantifier over group, see java.util.regex.GroupQuantifierSet 
 for more details.
 author:     Nikolay A. | 
| PosCompositeGroupQuantifierSet.java | Class |  Possessive composite (i.e. | 
| PositiveLookAhead.java | Class |  Positive lookahead node.
 author:     Nikolay A. | 
| PositiveLookBehind.java | Class |  Positive lookbehind node.
 author:     Nikolay A. | 
| PosPlusGroupQuantifierSet.java | Class |  Possessive + quantifier node over groups.
 author:     Nikolay A. | 
| PossessiveAltQuantifierSet.java | Class |  Possessive ? quantifier node.
 author:     Nikolay A. | 
| PossessiveCompositeQuantifierSet.java | Class |  Possessive composite (i.e. | 
| PossessiveGroupQuantifierSet.java | Class |  Possessive quantifier set over groups.
 author:     Nikolay A. | 
| PossessiveQuantifierSet.java | Class |  Possessive quantifier set over LeafSet's
 author:     Nikolay A. | 
| PreviousMatch.java | Class |  Node representing previous match (\G).
 author:     Nikolay A. | 
| Quantifier.java | Class |  Represents RE quantifier; contains two fields responsible for min and max
 number of repetitions. | 
| QuantifierSet.java | Class |  Base class for quantifiers.
 author:     Nikolay A. | 
| RangeSet.java | Class |  Represents node accepting single character from the given char class.
 author:     Nikolay A. | 
| RelAltGroupQuantifierSet.java | Class |  Reluctant version of "?" quantifier set over group.
 author:     Nikolay A. | 
| RelCompositeGroupQuantifierSet.java | Class |  Reluctant version of composite (i.e. | 
| ReluctantAltQuantifierSet.java | Class |  This class represents ?? quantifier over leaf sets.
 author:     Nikolay A. | 
| ReluctantCompositeQuantifierSet.java | Class |  Reluctant version of composite(i.e. | 
| ReluctantGroupQuantifierSet.java | Class |  Relactant version of the group quantifier set.
 author:     Nikolay A. | 
| ReluctantQuantifierSet.java | Class |  This class represents [+*]? constructs over LeafSets.
 See Also:   java.util.regex.LeafSet author:     Nikolay A. | 
| SequenceSet.java | Class |  This class represents nodes constructed with character sequences. | 
| SingleDecompositions.java | Class |  This class gives us a hashtable that contains information about
 symbols that are one symbol decompositions that is 
 generated from
 http://www.unicode.org/Public/4.0-Update/UnicodeData-4.0.0.txt. | 
| SingleSet.java | Class |  Group node over subexpression w/o alternations.
 author:     Nikolay A. | 
| SOLSet.java | Class |  Represents node accepting single character.
 author:     Nikolay A. | 
| SpecialToken.java | Class |  This is base class for special tokens like character classes 
 and quantifiers.
 author:     Nikolay A. | 
| SupplCharSet.java | Class |  Represents node accepting single supplementary codepoint. | 
| SupplRangeSet.java | Class |  Represents node accepting single character from the given char class. | 
| UCIBackReferenceSet.java | Class |  Unicode case insensitive back reference (i.e. | 
| UCICharSet.java | Class |  Represents node accepting single character in unicode case 
 insensitive manner.
 author:     Nikolay A. | 
| UCIDecomposedCharSet.java | Class |  Represents Unicode case insensitive 
 canonical decomposition of
 Unicode character. | 
| UCIRangeSet.java | Class |  Represents node accepting single character from the given char class. | 
| UCISequenceSet.java | Class |  Node accepting substrings in unicode case insensitive manner.
 author:     Nikolay A. | 
| UCISupplCharSet.java | Class |  Represents node accepting single supplementary 
 codepoint in Unicode case insensitive manner. | 
| UCISupplRangeSet.java | Class |  Represents node accepting single character from the given char class
 in Unicode case insensitive manner. | 
| UEOLSet.java | Class |  Unix line terminator, accepting only \n.
 author:     Nikolay A. | 
| UMultiLineEOLSet.java | Class |  Unix style multiline end-of-line node.
 author:     Nikolay A. | 
| UnicodeCategory.java | Class |  Unicode category (i.e. | 
| UnicodeCategoryScope.java | Class |  Unicode category scope (i.e IsL, IsM, ...)
 author:     Nikolay A. | 
| UnifiedQuantifierSet.java | Class |  Greedy quantifier node for the case where there is no intersection with
 next node and normal quantifiers could be treated as greedy and possessive.
 author:     Nikolay A. | 
| WordBoundary.java | Class |  Represents word boundary, checks current character and previous one if
 different types returns true;
 author:     Nikolay A. |