Compiles a set of regular expressions in the same Universe, with the given flags.
Compiles a set of regular expressions in the same Universe, with the given flags. Scala version.
match flags, a bit mask that may include java.util.regex.Pattern.LITERAL
, and
java.util.regex.Pattern.COMMENTS
.
Compiles a set of regular expressions in the same Universe.
Compiles a set of regular expressions in the same Universe. Java version.
Compiles a set of regular expressions in the same Universe, with the given flags.
Compiles a set of regular expressions in the same Universe, with the given flags. Java version.
match flags, a bit mask that may include java.util.regex.Pattern.LITERAL
, and
java.util.regex.Pattern.COMMENTS
.
Compiles a set of regular expressions in the same Universe.
Compile a regex from a string, using it's own Universe, with the given flags.
Compile a regex from a string, using it's own Universe, with the given flags.
match flags, a bit mask that may include java.util.regex.Pattern.LITERAL
, and
java.util.regex.Pattern.COMMENTS
.
Compile a regex parsed using one of the parse
methods.
Compile a regex parsed using one of the parse
methods.
In general, this method is not necessary; a call to one of the compile
methods is simpler
and more direct. However, there are cases in which the intermediate ParsedRegexs are needed.
Most notably, when caching CompiledRegex instances (which are in general more expensive to
create).
Create a regular expression that does not match anything.
Create a regular expression that does not match anything. Note that that is different from matching the empty string. Despite the theoretical equivalence of automata and regular expressions, in practice there is no regular expression that does not match anything.
Parse a set of regular expressions from a string, with the given flags.
Parse a set of regular expressions from a string, with the given flags. Java version.
In general, this method is not necessary; a call to one of the compile
methods is simpler
and more direct. However, there are cases in which the intermediate ParsedRegexs are needed.
Most notably, when caching CompiledRegex instances (which are in general more expensive to
create).
match flags, a bit mask that may include java.util.regex.Pattern.LITERAL
, and
java.util.regex.Pattern.COMMENTS
.
Parse a set of regular expressions from a string, with the given flags.
Parse a set of regular expressions from a string, with the given flags. Scala version.
In general, this method is not necessary; a call to one of the compile
methods is simpler
and more direct. However, there are cases in which the intermediate ParsedRegexs are needed.
Most notably, when caching CompiledRegex instances (which are in general more expensive to
create).
match flags, a bit mask that may include java.util.regex.Pattern.LITERAL
, and
java.util.regex.Pattern.COMMENTS
.
Parse a regular expression from a string, with the given flags.
Parse a regular expression from a string, with the given flags.
In general, this method is not necessary; a call to one of the compile
methods is simpler
and more direct. However, there are cases in which the intermediate ParsedRegexs are needed.
Most notably, when caching CompiledRegex instances (which are in general more expensive to
create).
match flags, a bit mask that may include java.util.regex.Pattern.LITERAL
, and
java.util.regex.Pattern.COMMENTS
.
Parse a regular expression from a string.
Parse a regular expression from a string.
In general, this method is not necessary; a call to one of the compile
methods is simpler
and more direct. However, there are cases in which the intermediate ParsedRegexs are needed.
Most notably, when caching CompiledRegex instances (which are in general more expensive to
create).
(Since version ) see corresponding Javadoc for more information.