markjprice/cs11dotnet7
1
0
Fork 0
mirror of https://github.com/markjprice/cs11dotnet7.git synced 2026-01-05 07:39:57 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

Added out-of-bounds error and XML comment

Browse source
This commit is contained in:
Mark J Price 2022-05-10 08:15:18 +01:00
parent a87ece83a5
commit de7fb3c192
4 changed files with 58 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
vs4win/Chapter04/Ch04Ex02PrimeFactorsLib/Primes.cs
View file

@ -4,13 +4,13 @@
{
public static int[] PrimeNumbers = new[]
{
997, 991, 983, 977, 971, 967, 953,
997, 991, 983, 977, 971, 967, 953,
947, 941, 937, 929, 919, 911, 907, 887,
883, 881, 877, 863, 859, 857, 853, 839,
883, 881, 877, 863, 859, 857, 853, 839,
829, 827, 823, 821, 811, 809, 797, 787,
773, 769, 761, 757, 751, 743, 739, 733,
727, 719, 709, 701, 691, 683, 677, 673,
661, 659, 653, 647, 643, 641, 631, 619,
773, 769, 761, 757, 751, 743, 739, 733,
727, 719, 709, 701, 691, 683, 677, 673,
661, 659, 653, 647, 643, 641, 631, 619,
617, 613, 607, 601, 599, 593, 587, 577,
571, 569, 563, 557, 547, 541, 523, 521,
509, 503, 499, 491, 487, 479, 467, 463,
@ -27,8 +27,18 @@
11, 7, 5, 3, 2
};
/// <summary>
/// Calculates the prime factors of the input number between 1 and 1000.
/// </summary>
/// <param name="number">An integer between 1 and 1000.</param>
/// <returns>A string listing the prime factors of number, or an error message.</returns>
public static string PrimeFactors(int number)
{
if ((number < 1) || (number > 1000))
{
return $"{nameof(number)} must be between 1 and 1000.";
}
string factors = string.Empty;
foreach (int divisor in PrimeNumbers)

14
vs4win/Chapter04/Ch04Ex02PrimeFactorsTests/PrimeFactorsUnitTests.cs
View file

@ -73,5 +73,19 @@ namespace Ch04Ex02PrimeFactorsTests
// assert
Assert.Equal(expected, actual);
}
[Fact]
public void PrimeFactorsOf1001()
{
// arrange
int number = 1001;
string expected = "number must be between 1 and 1000.";
// act
string actual = Primes.PrimeFactors(number);
// assert
Assert.Equal(expected, actual);
}
}
}

20
vscode/Chapter04/Ch04Ex02PrimeFactorsLib/Primes.cs
View file

@ -4,13 +4,13 @@
{
public static int[] PrimeNumbers = new[]
{
997, 991, 983, 977, 971, 967, 953,
997, 991, 983, 977, 971, 967, 953,
947, 941, 937, 929, 919, 911, 907, 887,
883, 881, 877, 863, 859, 857, 853, 839,
883, 881, 877, 863, 859, 857, 853, 839,
829, 827, 823, 821, 811, 809, 797, 787,
773, 769, 761, 757, 751, 743, 739, 733,
727, 719, 709, 701, 691, 683, 677, 673,
661, 659, 653, 647, 643, 641, 631, 619,
773, 769, 761, 757, 751, 743, 739, 733,
727, 719, 709, 701, 691, 683, 677, 673,
661, 659, 653, 647, 643, 641, 631, 619,
617, 613, 607, 601, 599, 593, 587, 577,
571, 569, 563, 557, 547, 541, 523, 521,
509, 503, 499, 491, 487, 479, 467, 463,
@ -27,8 +27,18 @@
11, 7, 5, 3, 2
};
/// <summary>
/// Calculates the prime factors of the input number between 1 and 1000.
/// </summary>
/// <param name="number">An integer between 1 and 1000.</param>
/// <returns>A string listing the prime factors of number, or an error message.</returns>
public static string PrimeFactors(int number)
{
if ((number < 1) || (number > 1000))
{
return $"{nameof(number)} must be between 1 and 1000.";
}
string factors = string.Empty;
foreach (int divisor in PrimeNumbers)

14
vscode/Chapter04/Ch04Ex02PrimeFactorsTests/PrimeFactorsUnitTests.cs
View file

@ -73,5 +73,19 @@ namespace Ch04Ex02PrimeFactorsTests
// assert
Assert.Equal(expected, actual);
}
[Fact]
public void PrimeFactorsOf1001()
{
// arrange
int number = 1001;
string expected = "number must be between 1 and 1000.";
// act
string actual = Primes.PrimeFactors(number);
// assert
Assert.Equal(expected, actual);
}
}
}