- Candlestick Patterns Quick Reference Cards Pdf To Word Format
- Candlestick Patterns Quick Reference Cards Pdf To Word Converter
This quick reference is a summary of all the regex syntax that is listed in the full reference tables, without any explanation. You can use this table if you’ve seen some syntax in somebody else’s regex and you have no idea what feature that syntax is for. Follow the link to learn more about the syntax in the tutorial. Since the full reference tables cover a variety of regex flavors, this quick reference may have multiple entries for the same syntax with links to different sections in the tutorial if different regex flavors use the same syntax for different features.
6 Candlestick Analysis Miscellaneous Thoughts on Candlesticks Attempting to define the accuracy of candle names or patterns without considering the trend, support and resistance is useless. There are a least 50 different candle patterns, bullish and bearish. Guidebook or reference, and for most, four cards is a digestible number to work with. The three-card spread can also be used for this purpose, but the four-card spread has the added benefit of training the student to read modified energies, i.e., what happens when one card blocks another (the Card 1 and Card 2 cross). Chart patterns form a key part of day trading. Candlestick and other charts produce frequent signals that cut through price action “noise”. The best patterns will be those that can form the backbone of a profitable day trading strategy, whether trading stocks, cryptocurrency of forex pairs. An engulfing pattern signals a reversal, and can be bullish or bearish. It comprises two candles. The body of the second must engulf the body of the first, and must be the opposite colour to the first. For a bullish engulfing candle, we have a smaller red candlestick, followed by a green candlestick, the body of.
Patterns, which helptraders make sense of market conditions and recognize advantageous times to enter trades. The ability to read candlesticks allows the price action trader to become a meta-strategist, taking into account the behaviors of other traders and large-scale market-movers. In other words, candlestick patterns help traders.
If you already know the feature you want but forgot which syntax to use, look up the feature in the regex reference table of contents instead.
| Syntax | Feature |
|---|---|
| Any character except [^$.|?*+() | Literal character |
| followed by any of [^$.|?*+(){} | Backslash escapes a metacharacter |
| . | Any character |
| | | Alternation |
| | | Alternation |
| ? | Greedy quantifier |
| ? | Greedy quantifier |
| ?? | Lazy quantifier |
| ?+ | Possessive quantifier |
| * | Greedy quantifier |
| *? | Lazy quantifier |
| *+ | Possessive quantifier |
| + | Greedy quantifier |
| + | Greedy quantifier |
| +? | Lazy quantifier |
| ++ | Possessive quantifier |
| { and } | Literal curly braces |
| {n} where n is an integer >= 1 | Fixed quantifier |
| {n,m} where n >= 0 and m >= n | Greedy quantifier |
| {n,} where n >= 0 | Greedy quantifier |
| {,m} where m >= 1 | Greedy quantifier |
| {n} where n is an integer >= 1 | Fixed quantifier |
| {n,m} where n >= 0 and m >= n | Greedy quantifier |
| {n,} where n >= 0 | Greedy quantifier |
| {,m} where m >= 1 | Greedy quantifier |
| {n,m}? where n >= 0 and m >= n | Lazy quantifier |
| {n,}? where n >= 0 | Lazy quantifier |
| {,m}? where m >= 1 | Lazy quantifier |
| {n,m}+ where n >= 0 and m >= n | Possessive quantifier |
| {n,}+ where n >= 0 | Possessive quantifier |
| ^ | String anchor |
| ^ | Line anchor |
| $ | String anchor |
| $ | Line anchor |
| a | Character escape |
| A | String anchor |
| A | Attempt anchor |
| b | Word boundary |
| b | Backspace character |
| B | Word non-boundary |
| B | Backslash character |
| c | XML shorthand |
| ca through cz | Control character escape |
| cA through cZ | Control character escape |
| C | XML shorthand |
| d | Digits shorthand |
| D | Non-digits shorthand |
| e | Escape character |
| f | Form feed character |
| g{name} | Named backreference |
| g-1, g-2, etc. | Relative Backreference |
| g{-1}, g{-2}, etc. | Relative Backreference |
| g1 through g99 | Backreference |
| g{1} through g{99} | Backreference |
| g<name> where “name” is the name of a capturing group | Named subroutine call |
| g<name> where “name” is the name of a capturing group | Named backreference |
| g'name' where “name” is the name of a capturing group | Named subroutine call |
| g'name' where “name” is the name of a capturing group | Named backreference |
| g<0> | Recursion |
| g'0' | Recursion |
| g<1> where 1 is the number of a capturing group | Subroutine call |
| g<1> where 1 is the number of a capturing group | Backreference |
| g'1' where 1 is the number of a capturing group | Subroutine call |
| g'1' where 1 is the number of a capturing group | Backreference |
| g<-1> where -1 is a negative integer | Relative subroutine call |
| g<-1> where -1 is a negative integer | Relative backreference |
| g'-1' where -1 is a negative integer | Relative subroutine call |
| g'-1' where -1 is a negative integer | Relative backreference |
| g<+1> where +1 is a positive integer | Forward subroutine call |
| g'+1' where +1 is a positive integer | Forward subroutine call |
| G | Attempt anchor |
| G | Match anchor |
| h | Hexadecimal digit shorthand |
| h | Horizontal whitespace shorthand |
| H | Non-hexadecimal digit shorthand |
| H | Non-horizontal whitespace shorthand |
| i | XML shorthand |
| I | XML shorthand |
| k<name> | Named backreference |
| k'name' through k'99' | Named backreference |
| k{name} | Named backreference |
| k<1> through k<99> | Backreference |
| k'1' through k'99' | Backreference |
| k<-1>, k<-2>, etc. | Relative Backreference |
| k'-1', k'-2', etc. | Relative Backreference |
| K | Keep text out of the regex match |
| l | Lowercase shorthand |
| L | Non-lowercase shorthand |
| m | Tcl start of word boundary |
| M | Tcl end of word boundary |
| n | Line feed character |
| N | Not a line break |
| Literal CRLF, LF, or CR line break | Line break |
| o{7777} where 7777 is any octal number | Octal escape |
| pL where L is a Unicode category | Unicode category |
| PL where L is a Unicode category | Unicode category |
| p{L} where L is a Unicode category | Unicode category |
| p{IsL} where L is a Unicode category | Unicode category |
| p{Category} | Unicode category |
| p{IsCategory} | Unicode category |
| p{Script} | Unicode script |
| p{IsScript} | Unicode script |
| p{Block} | Unicode block |
| p{InBlock} | Unicode block |
| p{IsBlock} | Unicode block |
| P{Property} | Negated Unicode property |
| p{^Property} | Negated Unicode property |
| P{^Property} | Unicode property |
| Q…E | Escape sequence |
| r | Carriage return character |
| R | Line break |
| s | Whitespace shorthand |
| S | Non-whitespace shorthand |
| t | Tab character |
| u | Uppercase shorthand |
| uFFFF where FFFF are 4 hexadecimal digits | Unicode code point |
| u{FFFF} where FFFF are 1 to 4 hexadecimal digits | Unicode code point |
| U | Non-uppercase shorthand |
| v | Vertical tab character |
| v | Vertical whitespace shorthand |
| V | Non-vertical whitespace shorthand |
| w | Word character shorthand |
| W | Non-word character shorthand |
| xFF where FF are 2 hexadecimal digits | Hexadecimal escape |
| xFFFF where FFFF are 4 hexadecimal digits | Unicode code point |
| x{FFFF} where FFFF are 1 to 4 hexadecimal digits | Unicode code point |
| X | Unicode grapheme |
| y | Tcl word boundary |
| Y | Tcl word non-boundary |
| Z | String anchor |
| z | String anchor |
| 0 | NULL escape |
| 1 through 7 | Octal escape |
| 1 through 9 | Backreference |
| 10 through 77 | Octal escape |
| 10 through 99 | Backreference |
| 100 through 377 | Octal escape |
| 01 through 0377 | Octal escape |
| ‘ | String anchor |
| ‘ | Attempt anchor |
| ' | String anchor |
| < | GNU word boundary |
| > | GNU word boundary |
| [[:<:]] | POSIX word boundary |
| [[:>:]] | POSIX word boundary |
| (regex) | Capturing group |
| (regex) | Capturing group |
| (?:regex) | Non-capturing group |
| (?<name>regex) | Named capturing group |
| (?'name'regex) | Named capturing group |
| (?#comment) | Comment |
| (?|regex) | Branch reset group |
| (?>regex) | Atomic group |
| (?=regex) | Positive lookahead |
| (?!regex) | Negative lookahead |
| (?<=regex) | Positive lookbehind |
| (?<!regex) | Negative lookbehind |
| (?(?=regex)then|else) where (?=regex) is any valid lookaround and then and else are any valid regexes | Lookaround conditional |
| (?(regex)then|else) where regex, then, and else are any valid regexes and regex is not the name of a capturing group | Implicit lookahead conditional |
| (?(name)then|else) where name is the name of a capturing group and then and else are any valid regexes | Named conditional |
| (?(<name>)then|else) where name is the name of a capturing group and then and else are any valid regexes | Named conditional |
| (?('name')then|else) where name is the name of a capturing group and then and else are any valid regexes | Named conditional |
| (?(1)then|else) where 1 is the number of a capturing group and then and else are any valid regexes | Conditional |
| (?(-1)then|else) where -1 is a negative integer and then and else are any valid regexes | Relative conditional |
| (?(+1)then|else) where +1 is a positive integer and then and else are any valid regexes | Forward conditional |
| (?(+1)then|else) where 1 is the number of a capturing group and then and else are any valid regexes | Conditional |
| (?<capture-subtract>regex) where “capture” and “subtract” are group names and “regex” is any regex | Balancing group |
| (?'capture-subtract'regex) where “capture” and “subtract” are group names and “regex” is any regex | Balancing group |
| (?&name) where “name” is the name of a capturing group | Named subroutine call |
| (?(DEFINE)regex) where “regex” is any regex | Subroutine definitions |
| (?P<name>regex) | Named capturing group |
| (?P=name) | Named backreference |
| (?P=1) through (?P=99) | Backreference |
| (?P>name) where “name” is the name of a capturing group | Named subroutine call |
| (?R) | Recursion |
| (?0) | Recursion |
| (?1) where 1 is the number of a capturing group | Subroutine call |
| (?-1) where -1 is a negative integer | Relative subroutine call |
| (?+1) where +1 is a positive integer | Forward subroutine call |
| Character Class Syntax | Feature |
|---|---|
| Any character except | Literal character |
| (backslash) followed by any of | Backslash escapes a metacharacter |
| Literal backslash | |
| - between two tokens that each specify a single character | Range |
| ^ immediately after the opening [ | Negated character class |
| [ | Literal opening bracket |
| [ | Nested character class |
| [base-[subtract]] | Character class subtraction |
| [base&&[intersect]] | Character class intersection |
| [base&&intersect] | Character class intersection |
| [:alpha:] | POSIX class |
| [:^alpha:] | Negated POSIX class |
| p{Alpha} | POSIX class |
| p{IsAlpha} | POSIX class |
| [.span-ll.] | POSIX collation sequence |
| [=x=] | POSIX character equivalence |
Make a Donation
Did this website just save you a trip to the bookstore? Please make a donation to support this site, and you'll get a lifetime of advertisement-free access to this site!
Page URL: https://www.regular-expressions.info/refquick.html
Page last updated: 26 April 2021
Site last updated: 11 August 2021
Copyright © 2003-2021 Jan Goyvaerts. All rights reserved.
A regular expression is a pattern that the regular expression engine attempts to match in input text. A pattern consists of one or more character literals, operators, or constructs. For a brief introduction, see .NET Regular Expressions.
Each section in this quick reference lists a particular category of characters, operators, and constructs that you can use to define regular expressions.
We've also provided this information in two formats that you can download and print for easy reference:
Character Escapes
Candlestick Patterns Quick Reference Cards Pdf To Word Format
The backslash character () in a regular expression indicates that the character that follows it either is a special character (as shown in the following table), or should be interpreted literally. For more information, see Character Escapes.
| Escaped character | Description | Pattern | Matches |
|---|---|---|---|
a | Matches a bell character, u0007. | a | 'u0007' in 'Error!' + 'u0007' |
b | In a character class, matches a backspace, u0008. | [b]{3,} | 'bbbb' in 'bbbb' |
t | Matches a tab, u0009. | (w+)t | 'item1t', 'item2t' in 'item1titem2t' |
r | Matches a carriage return, u000D. (r is not equivalent to the newline character, n.) | rn(w+) | 'rnThese' in 'rnThese arentwo lines.' |
v | Matches a vertical tab, u000B. | [v]{2,} | 'vvv' in 'vvv' |
f | Matches a form feed, u000C. | [f]{2,} | 'fff' in 'fff' |
n | Matches a new line, u000A. | rn(w+) | 'rnThese' in 'rnThese arentwo lines.' |
e | Matches an escape, u001B. | e | 'x001B' in 'x001B' |
| Uses octal representation to specify a character (nnn consists of two or three digits). | w040w | 'a b', 'c d' in 'a bc d' |
xnn | Uses hexadecimal representation to specify a character (nn consists of exactly two digits). | wx20w | 'a b', 'c d' in 'a bc d' |
cXcx | Matches the ASCII control character that is specified by X or x, where X or x is the letter of the control character. | cC | 'x0003' in 'x0003' (Ctrl-C) |
unnnn | Matches a Unicode character by using hexadecimal representation (exactly four digits, as represented by nnnn). | wu0020w | 'a b', 'c d' in 'a bc d' |
| When followed by a character that is not recognized as an escaped character in this and other tables in this topic, matches that character. For example, * is the same as x2A, and . is the same as x2E. This allows the regular expression engine to disambiguate language elements (such as * or ?) and character literals (represented by * or ?). | d+[+-x*]d+ | '2+2' and '3*9' in '(2+2) * 3*9' |
Character Classes
A character class matches any one of a set of characters. Character classes include the language elements listed in the following table. For more information, see Character Classes.
| Character class | Description | Pattern | Matches |
|---|---|---|---|
[character_group] | Matches any single character in character_group. By default, the match is case-sensitive. | [ae] | 'a' in 'gray''a', 'e' in 'lane' |
[^character_group] | Negation: Matches any single character that is not in character_group. By default, characters in character_group are case-sensitive. | [^aei] | 'r', 'g', 'n' in 'reign' |
[first-last] | Character range: Matches any single character in the range from first to last. | [A-Z] | 'A', 'B' in 'AB123' |
. | Wildcard: Matches any single character except n. To match a literal period character (. or u002E), you must precede it with the escape character (.). | a.e | 'ave' in 'nave''ate' in 'water' |
p{name} | Matches any single character in the Unicode general category or named block specified by name. | p{Lu}p{IsCyrillic} | 'C', 'L' in 'City Lights''Д', 'Ж' in 'ДЖem' |
P{name} | Matches any single character that is not in the Unicode general category or named block specified by name. | P{Lu}P{IsCyrillic} | 'i', 't', 'y' in 'City''e', 'm' in 'ДЖem' |
w | Matches any word character. | w | 'I', 'D', 'A', '1', '3' in 'ID A1.3' |
W | Matches any non-word character. | W | ' ', '.' in 'ID A1.3' |
s | Matches any white-space character. | ws | 'D ' in 'ID A1.3' |
S | Matches any non-white-space character. | sS | ' _' in 'int __ctr' |
d | Matches any decimal digit. | d | '4' in '4 = IV' |
D | Matches any character other than a decimal digit. | D | ' ', '=', ' ', 'I', 'V' in '4 = IV' |
Anchors
Anchors, or atomic zero-width assertions, cause a match to succeed or fail depending on the current position in the string, but they do not cause the engine to advance through the string or consume characters. The metacharacters listed in the following table are anchors. For more information, see Anchors.
| Assertion | Description | Pattern | Matches |
|---|---|---|---|
^ | By default, the match must start at the beginning of the string; in multiline mode, it must start at the beginning of the line. | ^d{3} | '901' in '901-333-' |
$ | By default, the match must occur at the end of the string or before n at the end of the string; in multiline mode, it must occur before the end of the line or before n at the end of the line. | -d{3}$ | '-333' in '-901-333' |
A | The match must occur at the start of the string. | Ad{3} | '901' in '901-333-' |
Z | The match must occur at the end of the string or before n at the end of the string. | -d{3}Z | '-333' in '-901-333' |
z | The match must occur at the end of the string. | -d{3}z | '-333' in '-901-333' |
G | The match must occur at the point where the previous match ended. | G(d) | '(1)', '(3)', '(5)' in '(1)(3)(5)[7](9)' |
b | The match must occur on a boundary between a w (alphanumeric) and a W (nonalphanumeric) character. | bw+sw+b | 'them theme', 'them them' in 'them theme them them' |
B | The match must not occur on a b boundary. | Bendw*b | 'ends', 'ender' in 'end sends endure lender' |
Grouping Constructs
Grouping constructs delineate subexpressions of a regular expression and typically capture substrings of an input string. Grouping constructs include the language elements listed in the following table. For more information, see Grouping Constructs.
| Grouping construct | Description | Pattern | Matches |
|---|---|---|---|
(subexpression) | Captures the matched subexpression and assigns it a one-based ordinal number. | (w)1 | 'ee' in 'deep' |
(?<name>subexpression)or (?'name'subexpression) | Captures the matched subexpression into a named group. | (?<double>w)k<double> | 'ee' in 'deep' |
(?<name1-name2>subexpression)or (?'name1-name2'subexpression) | Defines a balancing group definition. For more information, see the 'Balancing Group Definition' section in Grouping Constructs. | (((?'Open'()[^()]*)+((?'Close-Open'))[^()]*)+)*(?(Open)(?!))$ | '((1-3)*(3-1))' in '3+2^((1-3)*(3-1))' |
(?:subexpression) | Defines a noncapturing group. | Write(?:Line)? | 'WriteLine' in 'Console.WriteLine()''Write' in 'Console.Write(value)' |
(?imnsx-imnsx:subexpression) | Applies or disables the specified options within subexpression. For more information, see Regular Expression Options. | Ad{2}(?i:w+)b | 'A12xl', 'A12XL' in 'A12xl A12XL a12xl' |
(?=subexpression) | Zero-width positive lookahead assertion. | bw+b(?=.+and.+) | 'cats', 'dogs'in 'cats, dogs and some mice.' |
(?!subexpression) | Zero-width negative lookahead assertion. | bw+b(?!.+and.+) | 'and', 'some', 'mice'in 'cats, dogs and some mice.' |
(?<=subexpression) | Zero-width positive lookbehind assertion. | bw+b(?<=.+and.+)——————————— bw+b(?<=.+and.*) | 'some', 'mice'in 'cats, dogs and some mice.'———————————— 'and', 'some', 'mice'in 'cats, dogs and some mice.' |
(?<!subexpression) | Zero-width negative lookbehind assertion. | bw+b(?<!.+and.+)——————————— bw+b(?<!.+and.*) | 'cats', 'dogs', 'and'in 'cats, dogs and some mice.'———————————— 'cats', 'dogs'in 'cats, dogs and some mice.' |
(?>subexpression) | Atomic group. | (?>a|ab)c | 'ac' in'ac'nothing in 'abc' |
Lookarounds at a glance
Candlestick Patterns Quick Reference Cards Pdf To Word Converter
When the regular expression engine hits a lookaround expression, it takes a substring reaching from the current position to the start (lookbehind) or end (lookahead) of the original string, and then runsRegex.IsMatch on that substring using the lookaround pattern. Success of this subexpression's result is then determined by whether it's a positive or negative assertion.
| Lookaround | Name | Function |
|---|---|---|
(?=check) | Positive Lookahead | Asserts that what immediately follows the current position in the string is 'check' |
(?<=check) | Positive Lookbehind | Asserts that what immediately precedes the current position in the string is 'check' |
(?!check) | Negative Lookahead | Asserts that what immediately follows the current position in the string is not 'check' |
(?<!check) | Negative Lookbehind | Asserts that what immediately precedes the current position in the string is not 'check' |
Once they have matched, atomic groups won't be re-evaluated again, even when the remainder of the pattern fails due to the match. This can significantly improve performance when quantifiers occur within the atomic group or the remainder of the pattern.
Quantifiers
A quantifier specifies how many instances of the previous element (which can be a character, a group, or a character class) must be present in the input string for a match to occur. Quantifiers include the language elements listed in the following table. For more information, see Quantifiers.
| Quantifier | Description | Pattern | Matches |
|---|---|---|---|
* | Matches the previous element zero or more times. | d*.d | '.0', '19.9', '219.9' |
+ | Matches the previous element one or more times. | 'be+' | 'bee' in 'been', 'be' in 'bent' |
? | Matches the previous element zero or one time. | 'rai?n' | 'ran', 'rain' |
{n} | Matches the previous element exactly n times. | ',d{3}' | ',043' in '1,043.6', ',876', ',543', and ',210' in '9,876,543,210' |
{n,} | Matches the previous element at least n times. | 'd{2,}' | '166', '29', '1930' |
{n,m} | Matches the previous element at least n times, but no more than m times. | 'd{3,5}' | '166', '17668''19302' in '193024' |
*? | Matches the previous element zero or more times, but as few times as possible. | d*?.d | '.0', '19.9', '219.9' |
+? | Matches the previous element one or more times, but as few times as possible. | 'be+?' | 'be' in 'been', 'be' in 'bent' |
?? | Matches the previous element zero or one time, but as few times as possible. | 'rai??n' | 'ran', 'rain' |
{n}? | Matches the preceding element exactly n times. | ',d{3}?' | ',043' in '1,043.6', ',876', ',543', and ',210' in '9,876,543,210' |
{n,}? | Matches the previous element at least n times, but as few times as possible. | 'd{2,}?' | '166', '29', '1930' |
{n,m}? | Matches the previous element between n and m times, but as few times as possible. | 'd{3,5}?' | '166', '17668''193', '024' in '193024' |
Backreference Constructs
A backreference allows a previously matched subexpression to be identified subsequently in the same regular expression. The following table lists the backreference constructs supported by regular expressions in .NET. For more information, see Backreference Constructs.
| Backreference construct | Description | Pattern | Matches |
|---|---|---|---|
| Backreference. Matches the value of a numbered subexpression. | (w)1 | 'ee' in 'seek' |
k<name> | Named backreference. Matches the value of a named expression. | (?<char>w)k<char> | 'ee' in 'seek' |
Alternation Constructs
Alternation constructs modify a regular expression to enable either/or matching. These constructs include the language elements listed in the following table. For more information, see Alternation Constructs.
| Alternation construct | Description | Pattern | Matches |
|---|---|---|---|
| | Matches any one element separated by the vertical bar (|) character. | th(e|is|at) | 'the', 'this' in 'this is the day.' |
(?(expression)yes|no) | Matches yes if the regular expression pattern designated by expression matches; otherwise, matches the optional no part. expression is interpreted as a zero-width assertion. | (?(A)Ad{2}b|bd{3}b) | 'A10', '910' in 'A10 C103 910' |
(?(name)yes|no) | Matches yes if name, a named or numbered capturing group, has a match; otherwise, matches the optional no. | (?<quoted>')?(?(quoted).+?'|S+s) | 'Dogs.jpg ', 'Yiska playing.jpg' in 'Dogs.jpg 'Yiska playing.jpg' |
Substitutions
Substitutions are regular expression language elements that are supported in replacement patterns. For more information, see Substitutions. The metacharacters listed in the following table are atomic zero-width assertions.
| Character | Description | Pattern | Replacement pattern | Input string | Result string |
|---|---|---|---|---|---|
$number | Substitutes the substring matched by group number. | b(w+)(s)(w+)b | $3$2$1 | 'one two' | 'two one' |
${name} | Substitutes the substring matched by the named group name. | b(?<word1>w+)(s)(?<word2>w+)b | ${word2} ${word1} | 'one two' | 'two one' |
$$ | Substitutes a literal '$'. | b(d+)s?USD | $$$1 | '103 USD' | '$103' |
$& | Substitutes a copy of the whole match. | $?d*.?d+ | **$&** | '$1.30' | '**$1.30**' |
$` | Substitutes all the text of the input string before the match. | B+ | $` | 'AABBCC' | 'AAAACC' |
$' | Substitutes all the text of the input string after the match. | B+ | $' | 'AABBCC' | 'AACCCC' |
$+ | Substitutes the last group that was captured. | B+(C+) | $+ | 'AABBCCDD' | 'AACCDD' |
$_ | Substitutes the entire input string. | B+ | $_ | 'AABBCC' | 'AAAABBCCCC' |
Regular Expression Options
You can specify options that control how the regular expression engine interprets a regular expression pattern. Many of these options can be specified either inline (in the regular expression pattern) or as one or more RegexOptions constants. This quick reference lists only inline options. For more information about inline and RegexOptions options, see the article Regular Expression Options.
You can specify an inline option in two ways:
- By using the miscellaneous construct
(?imnsx-imnsx), where a minus sign (-) before an option or set of options turns those options off. For example,(?i-mn)turns case-insensitive matching (i) on, turns multiline mode (m) off, and turns unnamed group captures (n) off. The option applies to the regular expression pattern from the point at which the option is defined, and is effective either to the end of the pattern or to the point where another construct reverses the option. - By using the grouping construct
(?imnsx-imnsx:subexpression), which defines options for the specified group only.
The .NET regular expression engine supports the following inline options:
| Option | Description | Pattern | Matches |
|---|---|---|---|
i | Use case-insensitive matching. | b(?i)a(?-i)aw+b | 'aardvark', 'aaaAuto' in 'aardvark AAAuto aaaAuto Adam breakfast' |
m | Use multiline mode. ^ and $ match the beginning and end of a line, instead of the beginning and end of a string. | For an example, see the 'Multiline Mode' section in Regular Expression Options. | |
n | Do not capture unnamed groups. | For an example, see the 'Explicit Captures Only' section in Regular Expression Options. | |
s | Use single-line mode. | For an example, see the 'Single-line Mode' section in Regular Expression Options. | |
x | Ignore unescaped white space in the regular expression pattern. | b(?x) d+ s w+ | '1 aardvark', '2 cats' in '1 aardvark 2 cats IV centurions' |
Miscellaneous Constructs
Miscellaneous constructs either modify a regular expression pattern or provide information about it. The following table lists the miscellaneous constructs supported by .NET. For more information, see Miscellaneous Constructs.
| Construct | Definition | Example |
|---|---|---|
(?imnsx-imnsx) | Sets or disables options such as case insensitivity in the middle of a pattern.For more information, see Regular Expression Options. | bA(?i)bw+b matches 'ABA', 'Able' in 'ABA Able Act' |
(?#comment) | Inline comment. The comment ends at the first closing parenthesis. | bA(?#Matches words starting with A)w+b |
# [to end of line] | X-mode comment. The comment starts at an unescaped # and continues to the end of the line. | (?x)bAw+b#Matches words starting with A |