59 references to One
System.Text.RegularExpressions (59)
System\Text\RegularExpressions\RegexCompiler.cs (6)
1467
case RegexNodeKind.Multi or RegexNodeKind.Notone or RegexNodeKind.
One
or RegexNodeKind.Set:
2033
case RegexNodeKind.
One
:
2045
case RegexNodeKind.Concatenate when child.Child(0) == startingLiteralNode && (startingLiteralNode.Kind is RegexNodeKind.
One
or RegexNodeKind.Set or RegexNodeKind.Multi):
2097
new(RegexNodeKind.
One
, multi.Options, multi.Str[1]) :
2988
case RegexNodeKind.
One
:
5608
if (root.Kind is RegexNodeKind.Multi or RegexNodeKind.
One
or RegexNodeKind.Notone or RegexNodeKind.Set)
System\Text\RegularExpressions\RegexNode.cs (39)
121
return new RegexNode(RegexNodeKind.
One
, options & ~RegexOptions.IgnoreCase, ch);
131
return new RegexNode(RegexNodeKind.
One
, options, ch);
152
Kind += kind - RegexNodeKind.
One
;
287
case RegexNodeKind.
One
:
907
case RegexNodeKind.
One
:
971
Kind == RegexNodeKind.Set ? RegexNodeKind.
One
:
1106
else if (at.Kind is RegexNodeKind.Set or RegexNodeKind.
One
)
1135
if (prev.Kind == RegexNodeKind.
One
)
1145
if (at.Kind == RegexNodeKind.
One
)
1208
case RegexNodeKind.
One
or RegexNodeKind.Notone or RegexNodeKind.Set:
1356
if (startingNode.Kind == RegexNodeKind.
One
)
1376
if (startingNode.Kind == RegexNodeKind.
One
)
1421
new RegexNode(RegexNodeKind.
One
, startingNodeOptions, startingSpan[0]) :
1435
if (node.Kind == RegexNodeKind.
One
)
1453
node.Kind = RegexNodeKind.
One
;
1493
return branch.Kind is RegexNodeKind.
One
or RegexNodeKind.Multi ? branch : null;
1499
Debug.Assert(Kind is RegexNodeKind.
One
or RegexNodeKind.Multi || (IsOneFamily && M > 0));
1584
case RegexNodeKind.
One
:
1619
case RegexNodeKind.
One
or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy:
1762
else if (at.Kind is RegexNodeKind.Multi or RegexNodeKind.
One
)
1776
if (prev.Kind == RegexNodeKind.
One
)
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);
1873
case RegexNodeKind.Oneloop or RegexNodeKind.Onelazy when nextNode.Kind == RegexNodeKind.
One
&& currentNode.Ch == nextNode.Ch:
1923
nextNode.Kind = RegexNodeKind.
One
;
1941
case RegexNodeKind.
One
when (nextNode.Kind is RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy) && currentNode.Ch == nextNode.Ch:
2101
RegexNodeKind.
One
or RegexNodeKind.Notone or RegexNodeKind.Set &&
2422
case RegexNodeKind.
One
when node.Ch != subsequent.Ch:
2452
case RegexNodeKind.
One
when node.Ch == subsequent.Ch:
2471
case RegexNodeKind.
One
when !RegexCharClass.CharInClass(subsequent.Ch, node.Str!):
2518
case RegexNodeKind.
One
when !CharInStartingOrEndingSet(subsequent.Ch):
2706
case RegexNodeKind.
One
:
2819
case RegexNodeKind.
One
:
2973
if (child.Kind is RegexNodeKind.
One
)
3065
RegexNodeKind.
One
or RegexNodeKind.Notone or RegexNodeKind.Set => true,
3117
case <= MultiVsRepeaterLimit when Kind == RegexNodeKind.
One
:
3132
case RegexNodeKind.
One
:
3265
public bool IsOneFamily => Kind is RegexNodeKind.
One
or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy;
3325
case RegexNodeKind.
One
:
System\Text\RegularExpressions\RegexNodeKind.cs (3)
26
/// <remarks>The characters are specified in <see cref="RegexNode.Str"/>. This is purely a representational optimization, equivalent to multiple <see cref="
One
"/> nodes concatenated together.</remarks>
32
/// This is purely a representational optimization, equivalent to a <see cref="Loop"/> wrapped around a <see cref="
One
"/>.
46
/// This is purely a representational optimization, equivalent to a <see cref="Lazyloop"/> wrapped around a <see cref="
One
"/>.
System\Text\RegularExpressions\RegexPrefixAnalyzer.cs (7)
112
case RegexNodeKind.
One
or RegexNodeKind.Oneloop or RegexNodeKind.Onelazy or RegexNodeKind.Oneloopatomic when !ignoreCase || !RegexCharClass.ParticipatesInCaseConversion(node.Ch):
114
int reps = node.Kind is RegexNodeKind.
One
? 1 : Math.Min(node.M, MaxPrefixLength);
119
return node.Kind is RegexNodeKind.
One
|| reps == node.N;
422
case RegexNodeKind.
One
:
600
case RegexNodeKind.
One
:
954
case RegexNodeKind.
One
or RegexNodeKind.Oneloop or RegexNodeKind.Onelazy or RegexNodeKind.Oneloopatomic:
959
return node.Kind is RegexNodeKind.
One
|| node.M > 0 ? true : null;
System\Text\RegularExpressions\RegexReplacement.cs (1)
54
case RegexNodeKind.
One
:
System\Text\RegularExpressions\RegexWriter.cs (1)
381
case RegexNodeKind.
One
:
System\Text\RegularExpressions\Symbolic\RegexNodeConverter.cs (1)
57
case RegexNodeKind.
One
:
System\Text\RegularExpressions\Symbolic\SymbolicRegexKind.cs (1)
11
/// <summary>A node that matches a single character (i.e. <see cref="RegexNodeKind.
One
"/>, <see cref="RegexNodeKind.Notone"/>, or <see cref="RegexNodeKind.Set"/>).</summary>