9 writes to Ch
System.Text.RegularExpressions.Generator (9)
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexNode.cs (9)
61
Ch
= ch;
191
Ch
= '\0';
199
Ch
= '\0';
968
Ch
= RegexCharClass.SingletonChar(Str);
978
Ch
= RegexCharClass.SingletonChar(Str);
1440
node.
Ch
= '\0';
1454
node.
Ch
= node.Str[node.Str.Length - 1];
1924
nextNode.
Ch
= nextNode.Str[nextNode.Str.Length - 1];
3125
Ch
= '\0';
114 references to Ch
System.Text.RegularExpressions.Generator (114)
RegexGenerator.Emitter.cs (25)
3212
$"{expr} {(node.IsOneFamily ? "!=" : "==")} {Literal(node.
Ch
)}";
3644
(literal.Range.LowInclusive <= node.
Ch
&& node.
Ch
<= literal.Range.HighInclusive))) // for ranges, only allow when the range overlaps with the target, since there's no accelerated way to search for the union
3656
overlap = literal.String[0] == node.
Ch
;
3658
$"{startingPos} = {sliceSpan}.IndexOf({Literal(node.
Ch
)});" :
3659
$"{startingPos} = {sliceSpan}.IndexOfAny({Literal(node.
Ch
)}, {Literal(literal.String[0])});");
3663
overlap = literal.SetChars.Contains(node.
Ch
);
3670
(false, 2) => $"{startingPos} = {sliceSpan}.IndexOfAny({Literal(node.
Ch
)}, {Literal(literal.SetChars[0])}, {Literal(literal.SetChars[1])});",
3671
(false, _) => $"{startingPos} = {sliceSpan}.IndexOfAny({EmitSearchValuesOrLiteral($"{node.
Ch
}{literal.SetChars}".AsSpan(), requiredHelpers)});",
3676
overlap = literal.Range.LowInclusive == node.
Ch
;
3678
$"{startingPos} = {sliceSpan}.IndexOf({Literal(node.
Ch
)});" :
3679
$"{startingPos} = {sliceSpan}.IndexOfAny({Literal(node.
Ch
)}, {Literal(literal.Range.LowInclusive)});");
3696
$"if ((uint){startingPos} >= (uint){sliceSpan}.Length || {sliceSpan}[{startingPos}] == {Literal(node.
Ch
)})"))
4103
EmitMultiCharString(new string(node.
Ch
, iterations), emitLengthCheck, clauseOnly: false, rtl);
4243
$"{expr} {(node.IsOneFamily ? "==" : "!=")} {Literal(node.
Ch
)}";
4288
$"{expr} {(node.IsOneFamily ? "==" : "!=")} {Literal(node.
Ch
)}";
4351
$"{expr} {(node.IsOneFamily ? "==" : "!=")} {Literal(node.
Ch
)}";
5026
indexOfExpr = negate ? $"{last}IndexOfAnyExcept({Literal(node.
Ch
)})" : $"{last}IndexOf({Literal(node.
Ch
)})";
5033
indexOfExpr = negate ? $"{last}IndexOf({Literal(node.
Ch
)})" : $"{last}IndexOfAnyExcept({Literal(node.
Ch
)})";
5560
RegexNodeKind.Notone => $"Match any character other than {Literal(node.
Ch
)}{direction}.",
5561
RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Notonelazy => $"Match a character other than {Literal(node.
Ch
)} {DescribeLoop(node, rm)}{direction}.",
5562
RegexNodeKind.One => $"Match {Literal(node.
Ch
)}{direction}.",
5563
RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy => $"Match {Literal(node.
Ch
)} {DescribeLoop(node, rm)}{direction}.",
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexNode.cs (70)
96
new RegexNode(Kind, Options,
Ch
);
198
Str = new string(
Ch
, N);
1138
prevCharClass.AddChar(prev.
Ch
);
1147
prevCharClass.AddChar(at.
Ch
);
1231
required.
Ch
!= other.
Ch
||
1358
scratchChar[0] = startingNode.
Ch
;
1378
if (startingSpan[0] != startingNode.
Ch
)
1438
Debug.Assert(startingSpan[0] == node.
Ch
);
1501
return IsOneFamily ?
Ch
: Str![0];
1620
return new StartingLiteralData(range: (node.
Ch
, node.
Ch
), negated: false);
1623
return new StartingLiteralData(range: (node.
Ch
, node.
Ch
), negated: true);
1779
prev.Str = prev.
Ch
.ToString();
1783
((at.Kind == RegexNodeKind.One) ? $"{prev.Str}{at.
Ch
}" : prev.Str + at.Str) :
1784
((at.Kind == RegexNodeKind.One) ? $"{at.
Ch
}{prev.Str}" : at.Str + prev.Str);
1847
case RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Notonelazy when nextNode.Kind == currentNode.Kind && currentNode.
Ch
== nextNode.
Ch
:
1873
case RegexNodeKind.Oneloop or RegexNodeKind.Onelazy when nextNode.Kind == RegexNodeKind.One && currentNode.
Ch
== nextNode.
Ch
:
1874
case RegexNodeKind.Notoneloop or RegexNodeKind.Notonelazy when nextNode.Kind == RegexNodeKind.Notone && currentNode.
Ch
== nextNode.
Ch
:
1892
currentNode.
Ch
== nextNode.Str![0]:
1897
while (matchingCharsInMulti < nextNode.Str.Length && currentNode.
Ch
== nextNode.Str[matchingCharsInMulti])
1941
case RegexNodeKind.One when (nextNode.Kind is RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy) && currentNode.
Ch
== nextNode.
Ch
:
1942
case RegexNodeKind.Notone when (nextNode.Kind is RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Notonelazy) && currentNode.
Ch
== nextNode.
Ch
:
1956
case RegexNodeKind.Notone when nextNode.Kind == currentNode.Kind && currentNode.
Ch
== nextNode.
Ch
:
2422
case RegexNodeKind.One when node.
Ch
!= subsequent.
Ch
:
2423
case RegexNodeKind.Notone when node.
Ch
== subsequent.
Ch
:
2424
case RegexNodeKind.Set when !RegexCharClass.CharInClass(node.
Ch
, subsequent.Str!):
2425
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.M > 0 && node.
Ch
!= subsequent.
Ch
:
2426
case RegexNodeKind.Notonelazy or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic when subsequent.M > 0 && node.
Ch
== subsequent.
Ch
:
2427
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when subsequent.M > 0 && !RegexCharClass.CharInClass(node.
Ch
, subsequent.Str!):
2428
case RegexNodeKind.Multi when node.
Ch
!= subsequent.Str![0]:
2430
case RegexNodeKind.EndZ or RegexNodeKind.Eol when node.
Ch
!= '\n':
2431
case RegexNodeKind.Boundary when node.M > 0 && RegexCharClass.IsBoundaryWordChar(node.
Ch
):
2432
case RegexNodeKind.NonBoundary when node.M > 0 && !RegexCharClass.IsBoundaryWordChar(node.
Ch
):
2433
case RegexNodeKind.ECMABoundary when node.M > 0 && RegexCharClass.IsECMAWordChar(node.
Ch
):
2434
case RegexNodeKind.NonECMABoundary when node.M > 0 && !RegexCharClass.IsECMAWordChar(node.
Ch
):
2437
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.M == 0 && node.
Ch
!= subsequent.
Ch
:
2438
case RegexNodeKind.Notonelazy or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic when subsequent.M == 0 && node.
Ch
== subsequent.
Ch
:
2439
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when subsequent.M == 0 && !RegexCharClass.CharInClass(node.
Ch
, subsequent.Str!):
2452
case RegexNodeKind.One when node.
Ch
== subsequent.
Ch
:
2453
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.M > 0 && node.
Ch
== subsequent.
Ch
:
2454
case RegexNodeKind.Multi when node.
Ch
== subsequent.Str![0]:
2458
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.M == 0 && node.
Ch
== subsequent.
Ch
:
2471
case RegexNodeKind.One when !RegexCharClass.CharInClass(subsequent.
Ch
, node.Str!):
2473
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.M > 0 && !RegexCharClass.CharInClass(subsequent.
Ch
, node.Str!):
2484
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.M == 0 && !RegexCharClass.CharInClass(subsequent.
Ch
, node.Str!):
2518
case RegexNodeKind.One when !CharInStartingOrEndingSet(subsequent.
Ch
):
2520
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.M > 0 && !CharInStartingOrEndingSet(subsequent.
Ch
):
2531
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.M == 0 && !CharInStartingOrEndingSet(subsequent.
Ch
):
2978
if (child.
Ch
>= 128 ||
2979
RegexCharClass.ParticipatesInCaseConversion(child.
Ch
))
2984
vsb.Append(child.
Ch
);
3124
Str = new string(
Ch
, max);
3327
sb.Append(" '").Append(RegexCharClass.DescribeChar(
Ch
)).Append('\'');
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexNodeKind.cs (8)
16
/// <remarks>The character is specified in <see cref="RegexNode.
Ch
"/>.</remarks>
19
/// <remarks>The character is specified in <see cref="RegexNode.
Ch
"/>.</remarks>
31
/// The character is specified in <see cref="RegexNode.
Ch
"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.
36
/// <remarks>The character is specified in <see cref="RegexNode.
Ch
"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks>
45
/// <remarks>The character is specified in <see cref="RegexNode.
Ch
"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks>
49
/// <remarks>The character is specified in <see cref="RegexNode.
Ch
"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks>
59
/// The character is specified in <see cref="RegexNode.
Ch
"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.
65
/// The character is specified in <see cref="RegexNode.
Ch
"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexPrefixAnalyzer.cs (11)
112
case RegexNodeKind.One or RegexNodeKind.Oneloop or RegexNodeKind.Onelazy or RegexNodeKind.Oneloopatomic when !ignoreCase || !RegexCharClass.ParticipatesInCaseConversion(node.
Ch
):
117
sb.Append(node.
Ch
, reps);
423
vsb.Append(node.
Ch
);
435
vsb.Append(node.
Ch
, count);
603
string setString = RegexCharClass.OneToStringClass(node.
Ch
);
611
string setString = RegexCharClass.OneToStringClass(node.
Ch
);
958
cc.AddChar(node.
Ch
);
967
if (node.
Ch
> 0)
970
cc.AddRange((char)0, (char)(node.
Ch
- 1));
972
if (node.
Ch
< char.MaxValue)
975
cc.AddRange((char)(node.
Ch
+ 1), char.MaxValue);