51 references to One
System.Text.RegularExpressions (51)
System\Text\RegularExpressions\RegexNode.cs (37)
121return new RegexNode(RegexNodeKind.One, options & ~RegexOptions.IgnoreCase, ch); 131return new RegexNode(RegexNodeKind.One, options, ch); 152Kind += kind - RegexNodeKind.One; 247case RegexNodeKind.One: 849case RegexNodeKind.One: 889Kind == RegexNodeKind.Set ? RegexNodeKind.One : 997else if (at.Kind is RegexNodeKind.Set or RegexNodeKind.One) 1026if (prev.Kind == RegexNodeKind.One) 1036if (at.Kind == RegexNodeKind.One) 1107case RegexNodeKind.One or RegexNodeKind.Notone or RegexNodeKind.Set: 1242if (startingNode.Kind == RegexNodeKind.One) 1262if (startingNode.Kind == RegexNodeKind.One) 1307new RegexNode(RegexNodeKind.One, startingNodeOptions, startingSpan[0]) : 1321if (node.Kind == RegexNodeKind.One) 1339node.Kind = RegexNodeKind.One; 1379return branch.Kind is RegexNodeKind.One or RegexNodeKind.Multi ? branch : null; 1385Debug.Assert(Kind is RegexNodeKind.One or RegexNodeKind.Multi || (IsOneFamily && M > 0)); 1400case RegexNodeKind.One: 1435case RegexNodeKind.One or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy: 1578else if (at.Kind is RegexNodeKind.Multi or RegexNodeKind.One) 1592if (prev.Kind == RegexNodeKind.One) 1599((at.Kind == RegexNodeKind.One) ? $"{prev.Str}{at.Ch}" : prev.Str + at.Str) : 1600((at.Kind == RegexNodeKind.One) ? $"{at.Ch}{prev.Str}" : at.Str + prev.Str); 1689case RegexNodeKind.Oneloop or RegexNodeKind.Onelazy when nextNode.Kind == RegexNodeKind.One && currentNode.Ch == nextNode.Ch: 1736nextNode.Kind = RegexNodeKind.One; 1754case RegexNodeKind.One when (nextNode.Kind is RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy) && currentNode.Ch == nextNode.Ch: 2117case RegexNodeKind.One when node.Ch != subsequent.Ch: 2147case RegexNodeKind.One when node.Ch == subsequent.Ch: 2166case RegexNodeKind.One when !RegexCharClass.CharInClass(subsequent.Ch, node.Str!): 2259case RegexNodeKind.One: 2372case RegexNodeKind.One: 2526if (child.Kind is RegexNodeKind.One) 2633RegexNodeKind.One or RegexNodeKind.Notone or RegexNodeKind.Set => true, 2685case <= MultiVsRepeaterLimit when Kind == RegexNodeKind.One: 2700case RegexNodeKind.One: 2833public bool IsOneFamily => Kind is RegexNodeKind.One or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy; 2893case 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)
112case RegexNodeKind.One or RegexNodeKind.Oneloop or RegexNodeKind.Onelazy or RegexNodeKind.Oneloopatomic when !ignoreCase || !RegexCharClass.ParticipatesInCaseConversion(node.Ch): 114int reps = node.Kind is RegexNodeKind.One ? 1 : Math.Min(node.M, MaxPrefixLength); 119return node.Kind is RegexNodeKind.One || reps == node.N; 422case RegexNodeKind.One: 600case RegexNodeKind.One: 945case RegexNodeKind.One or RegexNodeKind.Oneloop or RegexNodeKind.Onelazy or RegexNodeKind.Oneloopatomic: 950return node.Kind is RegexNodeKind.One || node.M > 0 ? true : null;
System\Text\RegularExpressions\RegexReplacement.cs (1)
57case RegexNodeKind.One:
System\Text\RegularExpressions\RegexWriter.cs (1)
381case RegexNodeKind.One:
System\Text\RegularExpressions\Symbolic\RegexNodeConverter.cs (1)
57case 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>