zune/Xune
0
0
Fork 0
mirror of https://github.com/ZuneDev/Xune.git synced 2026-07-27 13:13:10 -07:00
Code Issues Packages Projects Releases Wiki Activity

Simplified usages

Browse Source
This commit is contained in:
Yoshi Askharoun
2021-07-11 23:07:04 -05:00
parent f793c0c94f
commit dfb03d2ec5
242 changed files with 2240 additions and 2240 deletions
Download Patch File Download Diff File Expand all files Collapse all files
UIX.RenderApi.Skia/System/Collections/Generic/HashHelpers.cs
+76 -76
View File
@@ -10,85 +10,85 @@ namespace System.Collections.Generic
{
internal static readonly int[] s_primes = new int[72]
{
3,
7,
11,
17,
23,
29,
37,
47,
59,
71,
89,
107,
131,
163,
197,
239,
293,
353,
431,
521,
631,
761,
919,
1103,
1327,
1597,
1931,
2333,
2801,
3371,
4049,
4861,
5839,
7013,
8419,
10103,
12143,
14591,
17519,
21023,
25229,
30293,
36353,
43627,
52361,
62851,
75431,
90523,
108631,
130363,
156437,
187751,
225307,
270371,
324449,
389357,
467237,
560689,
672827,
807403,
968897,
1162687,
1395263,
1674319,
2009191,
2411033,
2893249,
3471899,
4166287,
4999559,
5999471,
7199369
3,
7,
11,
17,
23,
29,
37,
47,
59,
71,
89,
107,
131,
163,
197,
239,
293,
353,
431,
521,
631,
761,
919,
1103,
1327,
1597,
1931,
2333,
2801,
3371,
4049,
4861,
5839,
7013,
8419,
10103,
12143,
14591,
17519,
21023,
25229,
30293,
36353,
43627,
52361,
62851,
75431,
90523,
108631,
130363,
156437,
187751,
225307,
270371,
324449,
389357,
467237,
560689,
672827,
807403,
968897,
1162687,
1395263,
1674319,
2009191,
2411033,
2893249,
3471899,
4166287,
4999559,
5999471,
7199369
};
internal static bool IsPrime(int candidate)
{
if ((candidate & 1) == 0)
return candidate == 2;
int num = (int)Math.Sqrt((double)candidate);
int num = (int)Math.Sqrt(candidate);
for (int index = 3; index <= num; index += 2)
{
if (candidate % index == 0)
@@ -101,15 +101,15 @@ namespace System.Collections.Generic
{
if (min < 0)
throw new ArgumentException(nameof(min));
for (int index = 0; index < HashHelpers.s_primes.Length; ++index)
for (int index = 0; index < s_primes.Length; ++index)
{
int prime = HashHelpers.s_primes[index];
int prime = s_primes[index];
if (prime >= min)
return prime;
}
for (int candidate = min | 1; candidate < int.MaxValue; candidate += 2)
{
if (HashHelpers.IsPrime(candidate))
if (IsPrime(candidate))
return candidate;
}
return min;