APIdia Launch Partner
Top Description Inners Fields Constructors Methods
java.util.regex

public final Class Pattern

extends Object
implements Serializable
Class Inheritance
All Implemented Interfaces
java.io.Serializable
Imports
java.text.Normalizer, .Normalizer.Form, java.util.Locale, .Iterator, .Map, .ArrayList, .HashMap, .LinkedHashSet, .List, .Set, .Arrays, .NoSuchElementException, .Spliterator, .Spliterators, java.util.function.Predicate, java.util.stream.Stream, .StreamSupport, jdk.internal.lang.CaseFolding, jdk.internal.util.ArraysSupport, jdk.internal.util.regex.Grapheme

A compiled representation of a regular expression.

A regular expression, specified as a string, must first be compiled into an instance of this class. The resulting pattern can then be used to create a Matcher object that can match arbitrary character sequences against the regular expression. All of the state involved in performing a match resides in the matcher, so many matchers can share the same pattern.

A typical invocation sequence is thus

Pattern p = Pattern.compile("a*b");
Matcher m = p.matcher("aaaaab");
boolean b = m.matches();

A matches method is defined by this class as a convenience for when a regular expression is used just once. This method compiles an expression and matches an input sequence against it in a single invocation. The statement

boolean b = Pattern.matches("a*b", "aaaaab");
is equivalent to the three statements above, though for repeated matches it is less efficient since it does not allow the compiled pattern to be reused.

Instances of this class are immutable and are safe for use by multiple concurrent threads. Instances of the Matcher class are not safe for such use.

Summary of regular-expression constructs

Regular expression constructs, and what they match
Construct Matches
Characters
x The character x
\\ The backslash character
\0n The character with octal value 0n (0 <= n <= 7)
\0nn The character with octal value 0nn (0 <= n <= 7)
\0mnn The character with octal value 0mnn (0 <= m <= 3, 0 <= n <= 7)
\xhh The character with hexadecimal value 0xhh
\uhhhh The character with hexadecimal value 0xhhhh
\x{h...h} The character with hexadecimal value 0xh...h (Character.MIN_CODE_POINT  <= 0xh...h <=  Character.MAX_CODE_POINT)
\N{name} The character with Unicode character name 'name'
\t The tab character ('\u0009')
\n The newline (line feed) character ('\u000A')
\r The carriage-return character ('\u000D')
\f The form-feed character ('\u000C')
\a The alert (bell) character ('\u0007')
\e The escape character ('\u001B')
\cx The control character corresponding to x
Character classes
[abc] a, b, or c (simple class)
[^abc] Any character except a, b, or c (negation)
[a-zA-Z] a through z or A through Z, inclusive (range)
[a-d[m-p]] a through d, or m through p: [a-dm-p] (union)
[a-z&&[def]] d, e, or f (intersection)
[a-z&&[^bc]] a through z, except for b and c: [ad-z] (subtraction)
[a-z&&[^m-p]] a through z, and not m through p: [a-lq-z](subtraction)
Predefined character classes
. Any character (may or may not match line terminators)
\d A digit: [0-9] if UNICODE_CHARACTER_CLASS is not set. See Unicode Support.
\D A non-digit: [^0-9]
\h A horizontal whitespace character: [ \t\xA0\u1680\u180e\u2000-\u200a\u202f\u205f\u3000]
\H A non-horizontal whitespace character: [^\h]
\s A whitespace character: [ \t\n\x0B\f\r] if UNICODE_CHARACTER_CLASS is not set. See Unicode Support.
\S A non-whitespace character: [^\s]
\v A vertical whitespace character: [\n\x0B\f\r\x85\u2028\u2029]
\V A non-vertical whitespace character: [^\v]
\w A word character: [a-zA-Z_0-9] if UNICODE_CHARACTER_CLASS is not set. See Unicode Support.
\W A non-word character: [^\w]
POSIX character classes (US-ASCII only)
\p{Lower} A lower-case alphabetic character: [a-z]
\p{Upper} An upper-case alphabetic character:[A-Z]
\p{ASCII} All ASCII:[\x00-\x7F]
\p{Alpha} An alphabetic character:[\p{Lower}\p{Upper}]
\p{Digit} A decimal digit: [0-9]
\p{Alnum} An alphanumeric character:[\p{Alpha}\p{Digit}]
\p{Punct} Punctuation: One of !"#$%&'()*+,-./:;<=>?@[\]^_`{|}~
\p{Graph} A visible character: [\p{Alnum}\p{Punct}]
\p{Print} A printable character: [\p{Graph}\x20]
\p{Blank} A space or a tab: [ \t]
\p{Cntrl} A control character: [\x00-\x1F\x7F]
\p{XDigit} A hexadecimal digit: [0-9a-fA-F]
\p{Space} A whitespace character: [ \t\n\x0B\f\r]
java.lang.Character classes (simple java character type)
\p{javaLowerCase} Equivalent to java.lang.Character.isLowerCase()
\p{javaUpperCase} Equivalent to java.lang.Character.isUpperCase()
\p{javaWhitespace} Equivalent to java.lang.Character.isWhitespace()
\p{javaMirrored} Equivalent to java.lang.Character.isMirrored()
Classes for Unicode scripts, blocks, categories and binary properties
\p{IsLatin} A Latin script character (script)
\p{InGreek} A character in the Greek block (block)
\p{Lu} An uppercase letter (category)
\p{IsAlphabetic} An alphabetic character (binary property)
\p{Sc} A currency symbol
\P{InGreek} Any character except one in the Greek block (negation)
[\p{L}&&[^\p{Lu}]] Any letter except an uppercase letter (subtraction)
Boundary matchers
^ The beginning of a line
$ The end of a line
\b A word boundary: at the beginning or at the end of a line if a word character (\w) appears there; or between a word (\w) and a non-word character (\W), in either order.
\b{g} A Unicode extended grapheme cluster boundary
\B A non-word boundary: [^\b]
\A The beginning of the input
\G The end of the previous match
\Z The end of the input but for the final terminator, if any
\z The end of the input
Linebreak matcher
\R Any Unicode linebreak sequence, is equivalent to \u000D\u000A|[\u000A\u000B\u000C\u000D\u0085\u2028\u2029]
Unicode Extended Grapheme matcher
\X Any Unicode extended grapheme cluster
Greedy quantifiers
X? X, once or not at all
X* X, zero or more times
X+ X, one or more times
X{n} X, exactly n times
X{n,} X, at least n times
X{n,m} X, at least n but not more than m times
Reluctant quantifiers
X?? X, once or not at all
X*? X, zero or more times
X+? X, one or more times
X{n}? X, exactly n times
X{n,}? X, at least n times
X{n,m}? X, at least n but not more than m times
Possessive quantifiers
X?+ X, once or not at all
X*+ X, zero or more times
X++ X, one or more times
X{n}+ X, exactly n times
X{n,}+ X, at least n times
X{n,m}+ X, at least n but not more than m times
Logical operators
XY X followed by Y
X|Y Either X or Y
(X) X, as a capturing group
Back references
\n Whatever the nth capturing group matched
\k<name> Whatever the named-capturing group "name" matched
Quotation
\ Nothing, but quotes the following character
\Q Nothing, but quotes all characters until \E
\E Nothing, but ends quoting started by \Q
Special constructs (named-capturing and non-capturing)
(?<name>X) X, as a named-capturing group
(?:X) X, as a non-capturing group
(?idmsuxU-idmsuxU)  Nothing, but turns match flags i d m s u x U on - off
(?idmsuxU-idmsuxU:X)   X, as a non-capturing group with the given flags i d m s u x U on - off
(?=X) X, via zero-width positive lookahead
(?!X) X, via zero-width negative lookahead
(?<=X) X, via zero-width positive lookbehind
(?<!X) X, via zero-width negative lookbehind
(?>X) X, as an independent, non-capturing group

Backslashes, escapes, and quoting

The backslash character ('\') serves to introduce escaped constructs, as defined in the table above, as well as to quote characters that otherwise would be interpreted as unescaped constructs. Thus the expression \\ matches a single backslash and \{ matches a left brace.

It is an error to use a backslash prior to any alphabetic character that does not denote an escaped construct; these are reserved for future extensions to the regular-expression language. A backslash may be used prior to a non-alphabetic character regardless of whether that character is part of an unescaped construct.

Backslashes within string literals in Java source code are interpreted as required by The Java Language Specification as either Unicode escapes (section 3.3) or other character escapes (section 3.10.6). It is therefore necessary to double backslashes in string literals that represent regular expressions to protect them from interpretation by the Java bytecode compiler. The string literal "\b", for example, matches a single backspace character when interpreted as a regular expression, while "\\b" matches a word boundary. The string literal "\(hello\)" is illegal and leads to a compile-time error; in order to match the string (hello) the string literal "\\(hello\\)" must be used.

Character Classes

Character classes may appear within other character classes, and may be composed by the union operator (implicit) and the intersection operator (&&). The union operator denotes a class that contains every character that is in at least one of its operand classes. The intersection operator denotes a class that contains every character that is in both of its operand classes.

The precedence of character-class operators is as follows, from highest to lowest:

Precedence of character class operators.
PrecedenceNameExample
1 Literal escape     \x
2 Grouping [...]
3 Range a-z
4 Union [a-e][i-u]
5 Intersection [a-z&&[aeiou]]

Note that a different set of metacharacters are in effect inside a character class than outside a character class. For instance, the regular expression . loses its special meaning inside a character class, while the expression - becomes a range forming metacharacter.

Line terminators

A line terminator is a one- or two-character sequence that marks the end of a line of the input character sequence. The following are recognized as line terminators:

If UNIX_LINES mode is activated, then the only line terminators recognized are newline characters.

The regular expression . matches any character except a line terminator unless the DOTALL flag is specified.

If MULTILINE mode is not activated, the regular expression ^ ignores line terminators and only matches at the beginning of the entire input sequence. The regular expression $ matches at the end of the entire input sequence, but also matches just before the last line terminator if this is not followed by any other input character. Other line terminators are ignored, including the last one if it is followed by other input characters.

If MULTILINE mode is activated then ^ matches at the beginning of input and after any line terminator except at the end of input. When in MULTILINE mode $ matches just before a line terminator or the end of the input sequence.

Groups and capturing

Group number

Capturing groups are numbered by counting their opening parentheses from left to right. In the expression ((A)(B(C))), for example, there are four such groups:

  1. ((A)(B(C)))
  2. (A)
  3. (B(C))
  4. (C)

Group zero always stands for the entire expression.

Capturing groups are so named because, during a match, each subsequence of the input sequence that matches such a group is saved. The captured subsequence may be used later in the expression, via a back reference, and may also be retrieved from the matcher once the match operation is complete.

Group name

A capturing group can also be assigned a "name", a named-capturing group, and then be back-referenced later by the "name". Group names are composed of the following characters. The first character must be a letter.

A named-capturing group is still numbered as described in Group number.

The captured input associated with a group is always the subsequence that the group most recently matched. If a group is evaluated a second time because of quantification then its previously-captured value, if any, will be retained if the second evaluation fails. Matching the string "aba" against the expression (a(b)?)+, for example, leaves group two set to "b". All captured input is discarded at the beginning of each match.

Groups beginning with (? are either pure, non-capturing groups that do not capture text and do not count towards the group total, or named-capturing group.

Unicode support

This class is in conformance with Level 1 of Unicode Technical Standard #18: Unicode Regular Expressions, plus RL2.1 Canonical Equivalents and RL2.2 Extended Grapheme Clusters.

Unicode escape sequences such as \u2014 in Java source code are processed as described in section 3.3 of The Java Language Specification. Such escape sequences are also implemented directly by the regular-expression parser so that Unicode escapes can be used in expressions that are read from files or from the keyboard. Thus the strings "\u2014" and "\\u2014", while not equal, compile into the same pattern, which matches the character with hexadecimal value 0x2014.

A Unicode character can also be represented by using its Hex notation (hexadecimal code point value) directly as described in construct \x{...}, for example a supplementary character U+2011F can be specified as \x{2011F}, instead of two consecutive Unicode escape sequences of the surrogate pair \uD840\uDD1F.

Unicode character names are supported by the named character construct \N{...}, for example, \N{WHITE SMILING FACE} specifies character \u263A. The character names supported by this class are the valid Unicode character names matched by Character.codePointOf(name).

Unicode extended grapheme clusters are supported by the grapheme cluster matcher \X and the corresponding boundary matcher \b{g}.

Unicode scripts, blocks, categories and binary properties are written with the \p and \P constructs as in Perl. \p{prop} matches if the input has the property prop, while \P{prop} does not match if the input has that property.

Scripts, blocks, categories and binary properties can be used both inside and outside of a character class.

Scripts are specified either with the prefix Is, as in IsHiragana, or by using the script keyword (or its short form sc) as in script=Hiragana or sc=Hiragana.

The script names supported by Pattern are the valid script names accepted and defined by UnicodeScript.forName.

Blocks are specified with the prefix In, as in InMongolian, or by using the keyword block (or its short form blk) as in block=Mongolian or blk=Mongolian.

The block names supported by Pattern are the valid block names accepted and defined by UnicodeBlock.forName.

Categories may be specified with the optional prefix Is: Both \p{L} and \p{IsL} denote the category of Unicode letters. Same as scripts and blocks, categories can also be specified by using the keyword general_category (or its short form gc) as in general_category=Lu or gc=Lu.

The supported categories are those of The Unicode Standard in the version specified by the Character class. The category names are those defined in the Standard, both normative and informative.

Binary properties are specified with the prefix Is, as in IsAlphabetic. The supported binary properties by Pattern are

The following Predefined Character classes and POSIX character classes are in conformance with the recommendation of Annex C: Compatibility Properties of Unicode Technical Standard #18: Unicode Regular Expressions, when UNICODE_CHARACTER_CLASS flag is specified.

predefined and posix character classes in Unicode mode
Classes Matches
\p{Lower} A lowercase character:\p{IsLowercase}
\p{Upper} An uppercase character:\p{IsUppercase}
\p{ASCII} All ASCII:[\x00-\x7F]
\p{Alpha} An alphabetic character:\p{IsAlphabetic}
\p{Digit} A decimal digit character:\p{IsDigit}
\p{Alnum} An alphanumeric character:[\p{IsAlphabetic}\p{IsDigit}]
\p{Punct} A punctuation character:\p{IsPunctuation}
\p{Graph} A visible character: [^\p{IsWhite_Space}\p{gc=Cc}\p{gc=Cs}\p{gc=Cn}]
\p{Print} A printable character: [\p{Graph}\p{Blank}&&[^\p{Cntrl}]]
\p{Blank} A space or a tab: [\p{IsWhite_Space}&&[^\p{gc=Zl}\p{gc=Zp}\x0a\x0b\x0c\x0d\x85]]
\p{Cntrl} A control character: \p{gc=Cc}
\p{XDigit} A hexadecimal digit: [\p{gc=Nd}\p{IsHex_Digit}]
\p{Space} A whitespace character:\p{IsWhite_Space}
\d A digit: \p{IsDigit}
\D A non-digit: [^\d]
\s A whitespace character: \p{IsWhite_Space}
\S A non-whitespace character: [^\s]
\w A word character: [\p{Alpha}\p{gc=Mn}\p{gc=Me}\p{gc=Mc}\p{Digit}\p{gc=Pc}\p{IsJoin_Control}]
\W A non-word character: [^\w]

Categories that behave like the java.lang.Character boolean ismethodname methods (except for the deprecated ones) are available through the same \p{prop} syntax where the specified property has the name javamethodname.

Comparison to Perl 5

The Pattern engine performs traditional NFA-based matching with ordered alternation as occurs in Perl 5.

Perl constructs not supported by this class:

Constructs supported by this class but not by Perl:

Notable differences from Perl:

For a more precise description of the behavior of regular expression constructs, please see Mastering Regular Expressions, 3rd Edition, Jeffrey E. F. Friedl, O'Reilly and Associates, 2006.

Authors
Mike McCloskey, Mark Reinhold, JSR-51 Expert Group
Since
1.4
External Specification
https://www.unicode.org/reports/tr18
See Also
java.lang.String#split(String, int), java.lang.String#split(String)

Nested and Inner Type Summary

Modifier and TypeClass and Description
pack-priv static class
Pattern.BackRef

Refers to a group in the regular expression.

pack-priv static class
Pattern.Begin

Node to anchor at the beginning of input.

pack-priv static class
Pattern.Behind

Zero width positive lookbehind.

pack-priv static class
Pattern.BehindS

Zero width positive lookbehind, including supplementary characters or unpaired surrogates.

pack-priv static class
Pattern.BitClass

Creates a bit vector for matching Latin-1 values.

pack-priv static interface
private static class
Pattern.BmpCharProperty

Optimized version of CharProperty that works only for properties never satisfied by Supplementary characters.

pack-priv static class
pack-priv static class
Pattern.BnM

Attempts to match a slice in the input using the Boyer-Moore string matching algorithm.

pack-priv static class
Pattern.BnMS

Supplementary support version of BnM().

pack-priv static class
Pattern.Bound

Handles word boundaries.

pack-priv static class
Pattern.Branch

Handles the branching of alternations.

pack-priv static class
Pattern.BranchConn

A Guard node at the end of each atom node in a Branch.

pack-priv static class
Pattern.Caret

Node to anchor at the beginning of a line.

pack-priv static interface
pack-priv static class
Pattern.CharProperty

Abstract node class to match one character satisfying some boolean property.

pack-priv static class
Pattern.CharPropertyGreedy

Handles the greedy style repetition with the specified minimum and the maximum equal to MAX_REPS, for *, + and {N,} quantifiers.

pack-priv static class
pack-priv static class
Pattern.Curly

Handles the curly-brace style repetition with a specified minimum and maximum occurrences.

pack-priv static class
Pattern.Dollar

Node to anchor at the end of a line or the end of input based on the multiline mode.

pack-priv static class
Pattern.End

Node to anchor at the end of input.

pack-priv static class
Pattern.First

Searches until the next instance of its atom.

pack-priv static class
Pattern.GraphemeBound

Node class that handles grapheme boundaries

pack-priv static class
Pattern.GroupCurly

Handles the curly-brace style repetition with a specified minimum and maximum occurrences in deterministic cases.

pack-priv static class
Pattern.GroupHead

The GroupHead saves the location where the group begins in the locals and restores them when the match is done.

pack-priv static class
Pattern.GroupTail

The GroupTail handles the setting of group beginning and ending locations when groups are successfully matched.

pack-priv static class
Pattern.LastMatch

Node to match the location where the last match ended.

pack-priv static class
pack-priv static class
Pattern.LazyLoop

Handles the repetition count for a reluctant Curly.

pack-priv static class
Pattern.LineEnding

Node class that matches a Unicode line ending '\R'

pack-priv static class
Pattern.LookBehindEndNode

For use with lookbehinds; matches the position where the lookbehind was encountered.

pack-priv static class
Pattern.Loop

Handles the repetition count for a greedy Curly.

pack-priv static class
Pattern.Neg

Zero width negative lookahead.

private static class
pack-priv static class
Pattern.Node

Base class for all node classes.

pack-priv static class
Pattern.NotBehind

Zero width negative lookbehind.

pack-priv static class
Pattern.NotBehindS

Zero width negative lookbehind, including supplementary characters or unpaired surrogates.

pack-priv static class
Pattern.Pos

Zero width positive lookahead.

pack-priv static class
Pattern.Prolog

This sets up a loop to handle a recursive quantifier structure.

pack-priv static enum
pack-priv static class
Pattern.Ques

The 0 or 1 quantifier.

pack-priv static class
Pattern.Slice

Node class for a case sensitive/BMP-only sequence of literal characters.

pack-priv static class
Pattern.SliceI

Node class for a case_insensitive/BMP-only sequence of literal characters.

pack-priv static class
Pattern.SliceIS

Node class for a case insensitive sequence of literal characters including supplementary characters.

pack-priv static class
Pattern.SliceNode

Base class for all Slice nodes

pack-priv static class
Pattern.SliceS

Node class for a case sensitive sequence of literal characters including supplementary characters.

pack-priv static class
Pattern.SliceU

Node class for a unicode_case_insensitive/BMP-only sequence of literal characters.

pack-priv static class
Pattern.SliceUS

Node class for a case insensitive sequence of literal characters.

pack-priv static class
Pattern.Start

Used for REs that can start anywhere within the input string.

pack-priv static class
pack-priv static class
Pattern.TreeInfo

Used to accumulate information about a subtree of the object graph so that optimizations can be applied to the subtree.

pack-priv static class
Pattern.UnixCaret

Node to anchor at the beginning of a line when in unixdot mode.

pack-priv static class
Pattern.UnixDollar

Node to anchor at the end of a line or the end of input based on the multiline mode when in unix lines mode.

pack-priv static class
Pattern.XGrapheme

Node class that matches an unicode extended grapheme cluster

Field Summary

Modifier and TypeField and Description
pack-priv static final Pattern.Node
accept

This must be the very first initializer.

private static final int
ALL_FLAGS

Contains all possible flags for compile(regex, flags).

pack-priv transient int[]
buffer

Temporary storage used by parsing pattern slice.

public static final int
CANON_EQ

Enables canonical equivalence.

pack-priv transient int
capturingGroupCount

The number of capturing groups in this Pattern.

public static final int
CASE_INSENSITIVE

Enables case-insensitive matching.

public static final int
COMMENTS

Permits whitespace and comments in pattern.

private transient volatile boolean
compiled

Boolean indicating this Pattern is compiled; this is necessary in order to lazily compile deserialized Patterns.

private transient int
cursor

Index into the pattern string that keeps track of how much has been parsed.

public static final int
DOTALL

Enables dotall mode.

private int
flags

The original pattern flags.

private transient int
flags0

The temporary pattern flags used during compiling.

pack-priv transient Pattern.GroupHead[]
groupNodes

Temporary storage used while parsing group references.

pack-priv transient boolean
private transient boolean
hasSupplementary

If the Start node might possibly match supplementary or surrogate code points.

pack-priv static final Pattern.Node
public static final int
LITERAL

Enables literal parsing of the pattern.

pack-priv transient int
localCount

The local variable count used by parsing tree.

pack-priv transient int
localTCNCount

The number of top greedy closure nodes in this Pattern.

pack-priv transient Pattern.Node
matchRoot

The root of object tree for a match operation.

pack-priv static final int
public static final int
MULTILINE

Enables multiline mode.

pack-priv transient volatile Map<String, Integer>
namedGroups

Map the "name" of the "named capturing group" to its group id node.

private transient String
normalizedPattern

The normalized pattern string.

private String
pattern

The original regular-expression pattern string.

private transient int
patternLength

Holds the length of the pattern string.

pack-priv transient Pattern.CharPredicate
predicate

A temporary storage used for predicate for double return.

pack-priv transient Pattern.Node
root

The starting point of state machine for the find operation.

private static final long
serialVersionUID

use serialVersionUID from Merlin b59 for interoperability

private transient int[]
temp

Temporary null terminated code point array used by pattern compiling.

pack-priv transient List<Pattern.Node>
topClosureNodes

Temporary storage used to store the top level closure nodes.

public static final int
UNICODE_CASE

Enables Unicode-aware case folding.

public static final int
UNICODE_CHARACTER_CLASS

Enables the Unicode version of Predefined character classes and POSIX character classes.

public static final int
UNIX_LINES

Enables Unix lines mode.

Constructor Summary

AccessConstructor and Description
private
Pattern(String p, int f)

This private constructor is used to create all Patterns.

Method Summary

Modifier and TypeMethod and Description
private void
accept(int ch, String s)

Match next character, signal error if failed.

private void
addFlag()

Parses inlined match flags and set them appropriately.

pack-priv static Pattern.CharPredicate
ALL()

for the Unicode category ALL and the dot metacharacter when in dotall mode.

private static Pattern.CharPredicate
and(Pattern.CharPredicate p1, Pattern.CharPredicate p2, boolean bmpChar)

private void
append(int ch, int index)

public Predicate<String>

Returns:

The predicate which can be used for matching an input string against this pattern.
asMatchPredicate
()

Creates a predicate that tests if this pattern matches a given input string.

public Predicate<String>

Returns:

The predicate which can be used for finding a match on a subsequence of a string
asPredicate
()

Creates a predicate that tests if this pattern is found in a given input string.

private Pattern.Node
atom()

Parse and add a new Single or Slice.

private Pattern.CharPredicate
private int
c()

Utility method for parsing control escape sequences.

pack-priv static Pattern.CharPredicate
CIRange(int lower, int upper)

Characters within a explicit value range in a case insensitive manner.

pack-priv static Pattern.CharPredicate
CIRangeU(int lower, int upper)

private Pattern.CharPredicate
clazz(boolean consume)

Parse a character class, and return the node that matches it.

private Pattern.Node
closure(Pattern.Node prev)

Processes repetition.

public static Pattern

Returns:

the given regular expression compiled into a pattern
compile
(String
The expression to be compiled
regex
)

Compiles the given regular expression into a pattern.

public static Pattern

Returns:

the given regular expression compiled into a pattern with the given flags
compile
(String
The expression to be compiled
regex
,
int flags)

Compiles the given regular expression into a pattern with the given flags.

private void
compile()

Copies regular expression to an int array and invokes the parsing of the expression which will create the object tree.

private static String
composeOneStep(String input)

Attempts to compose input by combining the first character with the first combining mark following it.

private static final int
countChars(CharSequence seq, int index, int lengthInCodePoints)

private static final int
private Pattern.Node
createGroup(boolean anonymous)

Create group head and tail nodes using double return.

private Pattern.Node
curly(Pattern.Node prev, int cmin)

private int
cursor()

Utility method for parsing unicode escape sequences.

pack-priv static Pattern.CharPredicate
DOT()

for the dot metacharacter when dotall is not enabled.

private PatternSyntaxException
error(String s)

Internal method used for handling all syntax errors.

private int
escape(boolean inclass, boolean create, boolean isrange)

Parses an escape sequence to determine the actual value that needs to be matched.

private Pattern.Node
expr(Pattern.Node end)

The expression is parsed with branch nodes added for alternations.

private Pattern.CharPredicate
family(boolean singleLetter, boolean isComplement)

Parses a Unicode character family and returns its representative node.

private boolean
findSupplementary(int start, int end)

Determines if there is any supplementary character or unpaired surrogate in the specified range.

public int

Returns:

The match flags specified when this pattern was compiled
flags
()

Returns this pattern's match flags.

private static int
getClass(int c)

private Pattern.Node
group0()

Parses a group and returns the head node of a set of nodes that process the group.

private String
groupname(int ch)

Parses and returns the name of a "named capturing group", the trailing ">" is consumed after parsing.

private boolean
has(int f)

Indicates whether a particular flag is set or not.

private static boolean
hasBaseCharacter(Matcher matcher, int i, CharSequence seq)

Non spacing marks only count as word characters in bounds calculations if they have a base character.

pack-priv static Pattern.BmpCharPredicate
HorizWS()

matches a Perl horizontal whitespace

private static boolean
inRange(int lower, int ch, int upper)

private boolean
isLineSeparator(int ch)

Determines if character is a line separator in the current mode

private static final boolean
isSupplementary(int ch)

Determines if the specified code point is a supplementary character or unpaired surrogate.

private void
mark(int c)

Mark the end of pattern with a specific character.

public Matcher

Returns:

A new matcher for this pattern
matcher
(CharSequence
The character sequence to be matched
input
)

Creates a matcher that will match the given input against this pattern.

public static boolean

Returns:

whether or not the regular expression matches on the input
matches
(String
The expression to be compiled
regex
,
CharSequence
The character sequence to be matched
input
)

Compiles the given regular expression and attempts to match the given input against it.

private int
N()

public Map<String, Integer>

Returns:

an unmodifiable map from capturing group names to group numbers
namedGroups
()

Returns an unmodifiable map from capturing group names to group numbers.

private Map<String, Integer>
private static Pattern.CharPredicate
private Pattern.CharProperty
private Pattern.Node
newSlice(int[] buf, int count, boolean hasSupplementary)

Utility method for creating a string slice matcher.

private int
next()

Advance the cursor by one, and peek the next character.

private int
nextEscaped()

Advance the cursor by one, and peek the next character, ignoring the COMMENTS setting

private static String
normalize(String pattern)

The pattern is converted to normalized form (NFC, canonical decomposition, followed by canonical composition for the character class part, and NFD, canonical decomposition for the rest), and then a pure group is constructed to match canonical equivalences of the characters.

private static void
normalizeClazz(String src, int off, int limit, StringBuilder dst)

private static void
normalizeSlice(String src, int off, int limit, StringBuilder dst)

private int
o()

Utility method for parsing octal escape sequences.

private int
parsePastLine()

xmode parse past comment to end of line.

private int
parsePastWhitespace(int ch)

If in xmode parse past whitespace and comments.

public String

Returns:

The source of this pattern
pattern
()

Returns the regular expression from which this pattern was compiled.

private int
peek()

Peek the next character, and do not advance the cursor.

private int
peekPastLine()

xmode peek past comment to end of line.

private int
peekPastWhitespace(int ch)

If in xmode peek past whitespace and comments.

private static void
produceEquivalentAlternation(String src, Set<String> dst)

Given a specific sequence composed of a regular character and combining marks that follow it, produce the alternation that will match all canonical equivalences of that sequence.

private static String[]
producePermutations(String input)

Returns an array of strings that have all the possible permutations of the characters in the input string.

private Pattern.Qtype
public static String

Returns:

A literal string replacement
quote
(String
The string to be literalized
s
)

Returns a literal pattern String for the specified String.

private Pattern.CharPredicate
range(Pattern.BitClass bits)

Parse a single character or a character range in a character class and return its representative node.

pack-priv static Pattern.CharPredicate
Range(int lower, int upper)

Characters within a explicit value range

private int
read()

Read the next character, and advance the cursor by one.

private int
readEscaped()

Read the next character, and advance the cursor by one, ignoring the COMMENTS setting

private void
readObject(ObjectInputStream s)

Recompile the Pattern instance from a stream.

private Pattern.Node
ref(int refNum)

Parses a backref greedily, taking as many numbers as it can.

private void
RemoveQEQuoting()

Preprocess any \Q...\E sequences in `temp', meta-quoting them.

private Pattern.Node
sequence(Pattern.Node end)

Parsing of sequences between alternations.

private void
setcursor(int pos)

private Pattern.CharPredicate
single(final int ch)

Returns a suitably optimized, single character predicate

pack-priv static Pattern.BmpCharPredicate
Single(int c)

A bmp/optimized predicate of single

pack-priv static Pattern.BmpCharPredicate
SingleI(int lower, int upper)

Case insensitive matches a given BMP character

pack-priv static Pattern.CharPredicate
SingleS(int c)

Indicate that matches a Supplementary Unicode character

pack-priv static Pattern.CharPredicate
SingleU(int lower)

Unicode case insensitive matches a given Unicode character

private int
skip()

Read the character after the next one, and advance the cursor by two.

public String[]

Returns:

The array of strings computed by splitting the input around matches of this pattern
split
(CharSequence
The character sequence to be split
input
,
int
The result threshold, as described above
limit
)

Splits the given input sequence around matches of this pattern.

private String[]
split(CharSequence input, int limit, boolean withDelimiters)

public String[]

Returns:

The array of strings computed by splitting the input around matches of this pattern
split
(CharSequence
The character sequence to be split
input
)

Splits the given input sequence around matches of this pattern.

public Stream<String>

Returns:

The stream of strings computed by splitting the input around matches of this pattern
splitAsStream
(final CharSequence
The character sequence to be split
input
)

Creates a stream from the given input sequence around matches of this pattern.

public String[]

Returns:

The array of strings computed by splitting the input around matches of this pattern, alternating substrings and matching delimiters
splitWithDelimiters
(CharSequence
The character sequence to be split
input
,
int
The result threshold, as described above
limit
)

Splits the given input sequence around matches of this pattern and returns both the strings and the matching delimiters.

private void
subFlag()

Parses the second part of inlined match flags and turns off flags appropriately.

public String

Returns:

The string representation of this pattern
toString
()

Overrides java.lang.Object.toString.

Returns the string representation of this pattern.

private int
u()

private static Pattern.CharPredicate
union(Pattern.CharPredicate p1, Pattern.CharPredicate p2, boolean bmpChar)

private static Pattern.CharPredicate
pack-priv static Pattern.CharPredicate
UNIXDOT()

the dot metacharacter when dotall is not enabled but UNIX_LINES is enabled.

private void
unread()

Unread one next character, and retreat cursor by one.

private int
pack-priv static Pattern.BmpCharPredicate
VertWS()

matches a Perl vertical whitespace

private int
x()

Utility method for parsing hexadecimal escape sequences.

Inherited from java.lang.Object:
cloneequalsfinalizegetClasshashCodenotifynotifyAllwaitwaitwait