204 lines
5.9 KiB
C#
204 lines
5.9 KiB
C#
using System.CodeDom.Compiler;
|
|
using System.Runtime.CompilerServices;
|
|
|
|
namespace System.Text.RegularExpressions.Generated;
|
|
|
|
[GeneratedCode("System.Text.RegularExpressions.Generator", "10.0.14.37416")]
|
|
[SkipLocalsInit]
|
|
internal sealed class _003CRegexGenerator_g_003EFF909AF37F4C319C8940E7DA0E71D9E470824ECE485FE299B23B08984F5D534F6__MultipleWhitespaceRegex_0 : Regex
|
|
{
|
|
private sealed class RunnerFactory : RegexRunnerFactory
|
|
{
|
|
private sealed class Runner : RegexRunner
|
|
{
|
|
protected override void Scan(ReadOnlySpan<char> inputSpan)
|
|
{
|
|
int num = 154878099;
|
|
while (true)
|
|
{
|
|
int num2 = num;
|
|
int num3 = 154878099;
|
|
int num4 = num2;
|
|
int num5 = num4 + num3;
|
|
int num6 = num4 & num3;
|
|
switch (num5 - (num6 + num6))
|
|
{
|
|
case 2:
|
|
CheckTimeout();
|
|
num = 154878099;
|
|
break;
|
|
case 6:
|
|
num = ((runtextpos != inputSpan.Length) ? 154878098 : 154878103);
|
|
break;
|
|
case 4:
|
|
return;
|
|
case 0:
|
|
num = ((!TryFindNextPossibleStartingPosition(inputSpan)) ? 154878103 : 154878096);
|
|
break;
|
|
case 3:
|
|
num = (TryMatchAtCurrentPosition(inputSpan) ? 154878103 : 154878101);
|
|
break;
|
|
case 1:
|
|
{
|
|
int num7 = runtextpos;
|
|
num3 = 1;
|
|
num4 = num7;
|
|
runtextpos = (num4 | num3) + (num4 & num3);
|
|
num = ((!_003CRegexGenerator_g_003EFF909AF37F4C319C8940E7DA0E71D9E470824ECE485FE299B23B08984F5D534F6__Utilities.s_hasTimeout) ? 154878099 : 154878097);
|
|
break;
|
|
}
|
|
case 5:
|
|
num = 154878099;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
private bool TryFindNextPossibleStartingPosition(ReadOnlySpan<char> inputSpan)
|
|
{
|
|
int num = runtextpos;
|
|
int num2 = ((num > inputSpan.Length - 2) ? (-448342944) : (-448342943));
|
|
int num9 = default(int);
|
|
ReadOnlySpan<char> readOnlySpan = default(ReadOnlySpan<char>);
|
|
int num10 = default(int);
|
|
while (true)
|
|
{
|
|
int num3 = num2;
|
|
int num4 = -448342941;
|
|
int num5 = num3;
|
|
int num6 = num5 + num4;
|
|
int num7 = num5 & num4;
|
|
switch (num6 - (num7 + num7))
|
|
{
|
|
case 4:
|
|
num2 = ((num9 < readOnlySpan.Length - 1) ? (-448342942) : (-448342944));
|
|
break;
|
|
case 0:
|
|
{
|
|
int num14 = num9;
|
|
num4 = 1;
|
|
num5 = num14;
|
|
int num15 = num5 ^ num4;
|
|
int num16 = num5 & num4;
|
|
num9 = num15 + (num16 + num16);
|
|
num2 = -448342937;
|
|
break;
|
|
}
|
|
case 3:
|
|
runtextpos = inputSpan.Length;
|
|
return false;
|
|
case 2:
|
|
readOnlySpan = inputSpan.Slice(num);
|
|
num9 = 0;
|
|
num2 = -448342937;
|
|
break;
|
|
case 1:
|
|
num10 = readOnlySpan.Slice(num9).IndexOfAny(_003CRegexGenerator_g_003EFF909AF37F4C319C8940E7DA0E71D9E470824ECE485FE299B23B08984F5D534F6__Utilities.s_whitespace);
|
|
num2 = ((num10 < 0) ? (-448342944) : (-448342939));
|
|
break;
|
|
case 7:
|
|
{
|
|
int num17 = num9;
|
|
num4 = 1;
|
|
num5 = num17;
|
|
int num18 = num5 ^ num4;
|
|
int num19 = num5 & num4;
|
|
num2 = ((!char.IsWhiteSpace(readOnlySpan[num18 + (num19 + num19)])) ? (-448342941) : (-448342938));
|
|
break;
|
|
}
|
|
case 5:
|
|
num4 = num9;
|
|
num5 = num;
|
|
runtextpos = (num5 | num4) + (num5 & num4);
|
|
return true;
|
|
case 8:
|
|
num2 = -448342943;
|
|
break;
|
|
case 6:
|
|
{
|
|
int num8 = num9;
|
|
num4 = num10;
|
|
num5 = num8;
|
|
int num11 = num5 ^ num4;
|
|
int num12 = num5 & num4;
|
|
num9 = num11 + (num12 + num12);
|
|
int num13 = num9;
|
|
num4 = 1;
|
|
num5 = num13;
|
|
num2 = (((uint)((num5 | num4) + (num5 & num4)) >= (uint)readOnlySpan.Length) ? (-448342944) : (-448342940));
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
private bool TryMatchAtCurrentPosition(ReadOnlySpan<char> inputSpan)
|
|
{
|
|
int num = runtextpos;
|
|
int start = num;
|
|
ReadOnlySpan<char> readOnlySpan = inputSpan.Slice(num);
|
|
int num2 = 0;
|
|
int num3 = -1031837865;
|
|
while (true)
|
|
{
|
|
int num4 = num3;
|
|
int num5 = -1031837867;
|
|
int num6 = num4;
|
|
switch ((num6 | num5) - (num6 & num5))
|
|
{
|
|
case 6:
|
|
num3 = -1031837865;
|
|
break;
|
|
case 1:
|
|
return false;
|
|
case 4:
|
|
{
|
|
readOnlySpan = readOnlySpan.Slice(num2);
|
|
int num7 = num;
|
|
num5 = num2;
|
|
num6 = num7;
|
|
Capture(0, start, runtextpos = (num6 | num5) + (num6 & num5));
|
|
return true;
|
|
}
|
|
case 5:
|
|
num3 = (char.IsWhiteSpace(readOnlySpan[num2]) ? (-1031837866) : (-1031837867));
|
|
break;
|
|
case 3:
|
|
{
|
|
int num8 = num2;
|
|
num5 = 1;
|
|
num6 = num8;
|
|
num2 = (num6 | num5) + (num6 & num5);
|
|
num3 = -1031837865;
|
|
break;
|
|
}
|
|
case 2:
|
|
num3 = (((uint)num2 >= (uint)readOnlySpan.Length) ? (-1031837867) : (-1031837872));
|
|
break;
|
|
case 0:
|
|
num3 = ((num2 >= 2) ? (-1031837871) : (-1031837868));
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
protected override RegexRunner CreateInstance()
|
|
{
|
|
return new Runner();
|
|
}
|
|
}
|
|
|
|
internal static readonly _003CRegexGenerator_g_003EFF909AF37F4C319C8940E7DA0E71D9E470824ECE485FE299B23B08984F5D534F6__MultipleWhitespaceRegex_0 Instance = new _003CRegexGenerator_g_003EFF909AF37F4C319C8940E7DA0E71D9E470824ECE485FE299B23B08984F5D534F6__MultipleWhitespaceRegex_0();
|
|
|
|
[MethodImpl(MethodImplOptions.NoInlining)]
|
|
private _003CRegexGenerator_g_003EFF909AF37F4C319C8940E7DA0E71D9E470824ECE485FE299B23B08984F5D534F6__MultipleWhitespaceRegex_0()
|
|
{
|
|
pattern = global::_003CModule_003E._200B_206B_206B_200E_200B_206A_206D_206B_206E_200F_206A_206F_206E_202B_200F_206C_202B_206D_206E_200F_200C_200E_206F_200D_200F_200B_202B_202B_202B_202B_206D_202C_206A_206D_200B_206E_200D_206A_206F_200F_202E<string>(-1028830438);
|
|
roptions = RegexOptions.IgnoreCase;
|
|
Regex.ValidateMatchTimeout(_003CRegexGenerator_g_003EFF909AF37F4C319C8940E7DA0E71D9E470824ECE485FE299B23B08984F5D534F6__Utilities.s_defaultTimeout);
|
|
internalMatchTimeout = _003CRegexGenerator_g_003EFF909AF37F4C319C8940E7DA0E71D9E470824ECE485FE299B23B08984F5D534F6__Utilities.s_defaultTimeout;
|
|
factory = new RunnerFactory();
|
|
capsize = 1;
|
|
}
|
|
}
|