| public static IsPrime ( int candidate ) : bool | ||
| candidate | int | |
| return | bool | |
public static int GetPrime(int min)
{
if (min < 0)
{
throw new ArgumentException(Environment.GetResourceString("Arg_HTCapacityOverflow"));
}
for (int index = 0; index < HashHelpers.primes.Length; ++index)
{
int num = HashHelpers.primes[index];
if (num >= min)
{
return(num);
}
}
int candidate = min | 1;
while (candidate < int.MaxValue)
{
if (HashHelpers.IsPrime(candidate) && (candidate - 1) % 101 != 0)
{
return(candidate);
}
candidate += 2;
}
return(min);
}
public static int GetPrime(int min)
{
if (min < 0)
{
throw new ArgumentException(Environment.GetResourceString("Arg_HTCapacityOverflow"));
}
for (int i = 0; i < HashHelpers.primes.Length; i++)
{
int num = HashHelpers.primes[i];
if (num >= min)
{
return(num);
}
}
for (int j = min | 1; j < 2147483647; j += 2)
{
if (HashHelpers.IsPrime(j) && (j - 1) % 101 != 0)
{
return(j);
}
}
return(min);
}
