43 references to Alternate
System.Text.RegularExpressions (43)
System\Text\RegularExpressions\RegexCompiler.cs (2)
1673
Debug.Assert(node.Kind is RegexNodeKind.
Alternate
, $"Unexpected type: {node.Kind}");
3020
case RegexNodeKind.
Alternate
:
System\Text\RegularExpressions\RegexNode.cs (26)
319
case RegexNodeKind.
Alternate
:
545
if ((existingChild.Kind is RegexNodeKind.
Alternate
or RegexNodeKind.BackreferenceConditional or RegexNodeKind.ExpressionConditional or RegexNodeKind.Loop or RegexNodeKind.Lazyloop) &&
558
case RegexNodeKind.
Alternate
:
638
RegexNodeKind.
Alternate
=> ReduceAlternation(),
659
Debug.Assert(Kind is RegexNodeKind.
Alternate
or RegexNodeKind.Concatenate);
662
0 => new RegexNode(Kind == RegexNodeKind.
Alternate
? RegexNodeKind.Nothing : RegexNodeKind.Empty, Options),
750
case RegexNodeKind.
Alternate
:
1073
Debug.Assert(Kind == RegexNodeKind.
Alternate
);
1086
if (node.Kind == RegexNodeKind.
Alternate
)
1089
if (node.Kind == RegexNodeKind.
Alternate
)
1092
if (node.Kind == RegexNodeKind.
Alternate
)
1100
if (node.Kind is RegexNodeKind.
Alternate
&& node.ChildCount() == 2)
1143
if (at.Kind == RegexNodeKind.
Alternate
)
1241
Debug.Assert(alternation.Kind == RegexNodeKind.
Alternate
);
1300
var newAlternate = new RegexNode(RegexNodeKind.
Alternate
, alternation.Options);
1341
Debug.Assert(node.Kind == RegexNodeKind.
Alternate
);
1384
Debug.Assert(alternation.Kind == RegexNodeKind.
Alternate
);
1481
var newAlternate = new RegexNode(RegexNodeKind.
Alternate
, startingNodeOptions);
1572
Debug.Assert(Kind is RegexNodeKind.
Alternate
);
2196
case RegexNodeKind.
Alternate
or RegexNodeKind.BackreferenceConditional or RegexNodeKind.ExpressionConditional:
2518
case RegexNodeKind.
Alternate
:
2704
case RegexNodeKind.
Alternate
:
2740
RegexNodeKind.
Alternate
=> true,
2802
case RegexNodeKind.
Alternate
:
2870
case RegexNodeKind.
Alternate
:
2987
case RegexNodeKind.
Alternate
:
System\Text\RegularExpressions\RegexParser.cs (4)
1780
var innerAlt = new RegexNode(RegexNodeKind.
Alternate
, lookaheadOpts);
1806
var innerAlt = new RegexNode(RegexNodeKind.
Alternate
, lookaheadOpts);
1832
var innerAlt = new RegexNode(RegexNodeKind.
Alternate
, lookbehindOpts);
2244
_alternation = new RegexNode(RegexNodeKind.
Alternate
, _options);
System\Text\RegularExpressions\RegexPrefixAnalyzer.cs (5)
242
case RegexNodeKind.
Alternate
:
377
case RegexNodeKind.
Alternate
when !rtl: // for RTL we'd need to be matching the suffixes of the alternation cases
709
case RegexNodeKind.
Alternate
when thorough:
1081
case RegexNodeKind.
Alternate
:
1477
case RegexNodeKind.
Alternate
:
System\Text\RegularExpressions\RegexTreeAnalyzer.cs (1)
94
RegexNodeKind.
Alternate
or RegexNodeKind.BackreferenceConditional or RegexNodeKind.ExpressionConditional => true,
System\Text\RegularExpressions\RegexWriter.cs (2)
220
case RegexNodeKind.
Alternate
| BeforeChild:
228
case RegexNodeKind.
Alternate
| AfterChild:
System\Text\RegularExpressions\Symbolic\RegexNodeConverter.cs (2)
85
case RegexNodeKind.
Alternate
:
221
case RegexNodeKind.
Alternate
:
System\Text\RegularExpressions\Symbolic\SymbolicRegexKind.cs (1)
17
/// <summary>A node that matches if any of its nodes match and that matches them in a fixed order that mirrors how the backtracking engines operate (e.g. <see cref="RegexNodeKind.
Alternate
"/>).</summary>