-
Notifications
You must be signed in to change notification settings - Fork 928
Expand file tree
/
Copy pathChallengesSet06Tests.cs
More file actions
executable file
·156 lines (141 loc) · 6.61 KB
/
Copy pathChallengesSet06Tests.cs
File metadata and controls
executable file
·156 lines (141 loc) · 6.61 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
using System;
using System.Collections.Generic;
using Xunit;
namespace ChallengesWithTestsMark8.Tests
{
public class ChallengesSet06Tests
{
[Theory]
[InlineData(new string[] { "alpha", "bravo", "charlie" }, "alpha", true, true)]
[InlineData(new string[] { "alpha", "bravo", "charlie" }, "alpha", false, true)]
[InlineData(new string[] { "alpha", "bravo", "charlie" }, "bravo", true, true)]
[InlineData(new string[] { "alpha", "bravo", "charlie" }, "charlie", true, true)]
[InlineData(new string[] { "Alpha", "bravo", "charlie" }, "alpha", true, true)]
[InlineData(new string[] { "Alpha", "braVo", "charlie" }, "bravo", true, true)]
[InlineData(new string[] { "Alpha", "bravo", "chArlie" }, "charlie", true, true)]
[InlineData(new string[] { "AlPha", "alpha", "bravo", "charlie" }, "alpha", false, true)]
[InlineData(new string[] { "AlPha", "bravo", "charlie" }, "alpha", false, false)]
[InlineData(new string[] { "alpha", "bravo", "charlie" }, "delta", true, false)]
[InlineData(new string[] { null, "bravo", "charlie" }, "braVo", false, false)]
[InlineData(new string[] { null, "bravo", "chArlie" }, "charliE", false, false)]
[InlineData(new string[] { null, null, "charlie" }, "bravo", true, false)]
[InlineData(null, "alpha", true, false)]
public void CollectionContainsWord(IEnumerable<string> words, string word, bool ignoreCase, bool expected)
{
// Arrange
ChallengesSet06 challenger = new ChallengesSet06();
// Act
bool actual = challenger.CollectionContainsWord(words, word, ignoreCase);
// Assert
Assert.Equal(expected, actual);
}
[Theory]
[InlineData(2, true)]
[InlineData(3, true)]
[InlineData(5, true)]
[InlineData(1523, true)]
[InlineData(26357, true)]
[InlineData(37117, true)]
[InlineData(83791, true)]
[InlineData(91199, true)]
[InlineData(91387, true)]
[InlineData(91909, true)]
[InlineData(99991, true)]
[InlineData(1, false)]
[InlineData(4, false)]
[InlineData(25, false)]
[InlineData(2000, false)]
[InlineData(10011, false)]
[InlineData(99561, false)]
[InlineData(99987, false)]
[InlineData(0, false)]
[InlineData(-1, false)]
[InlineData(-5, false)]
[InlineData(-101, false)]
[InlineData(-99991, false)]
public void IsPrimeNumber(int number, bool expected)
{
// Arrange
ChallengesSet06 challenger = new ChallengesSet06();
// Act
bool actual = challenger.IsPrimeNumber(number);
// Assert
Assert.Equal(expected, actual);
}
[Theory]
[InlineData("aaaa", -1)]
[InlineData("aaa", -1)]
[InlineData("aa", -1)]
[InlineData("a", 0)]
[InlineData("", -1)]
[InlineData("ab", 1)]
[InlineData("abb", 0)]
[InlineData("aba", 1)]
[InlineData("aab", 2)]
[InlineData("aabaa", 2)]
[InlineData("aabbc", 4)]
[InlineData("aabcc", 2)]
[InlineData("aabbcddee", 4)]
[InlineData("aaabbbcdddeee", 6)]
[InlineData("aaabbbcdddeeeffg", 15)]
[InlineData("abbbccdddeeeffgg", 0)]
public void LastUniqueIndex(string str, int expected)
{
// Arrange
ChallengesSet06 challenger = new ChallengesSet06();
// Act
int actual = challenger.IndexOfLastUniqueLetter(str);
// Assert
Assert.Equal(expected, actual);
}
[Theory]
[InlineData(new int[] { 1, 2, 2, 3, 4, 5 }, 2)]
[InlineData(new int[] { 10, 3, 1, 1, 1, 5, 1 }, 3)]
[InlineData(new int[] { 1, 2, 2, 3, 3, 3, 3, 2, 5 }, 4)]
[InlineData(new int[] { 1, 2, 2, 3, 3, 3, 3 }, 4)]
[InlineData(new int[] { 1, 2, 2, 3, 2 }, 2)]
[InlineData(new int[] { 3, 3, 3, 2, 2 }, 3)]
[InlineData(new int[] { 1, 3, 2, 3, 3, 3, 3 }, 4)]
public void MaxConsecutiveCount(int[] numbers, int expected)
{
// Arrange
ChallengesSet06 challenger = new ChallengesSet06();
// Act
int actual = challenger.MaxConsecutiveCount(numbers);
// Assert
Assert.Equal(expected, actual);
}
[Theory]
[InlineData(new[] { 1d, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 }, 4, new[] { 4d, 8, 12, 16 })]
[InlineData(new[] { 1d, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 }, 3, new[] { 3d, 6, 9, 12, 15 })]
[InlineData(new[] { 1d, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 }, 2, new[] { 2d, 4, 6, 8, 10, 12, 14, 16 })]
[InlineData(new[] { 1d, 2, 3, 4, 5 }, 1, new[] { 1d, 2, 3, 4, 5 })]
[InlineData(new[] { 1d, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 }, 8, new[] { 8d, 16 })]
[InlineData(new[] { 1d, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 }, 10, new[] { 10d })]
[InlineData(new[] { 1d, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 }, 20, new double[] { })]
[InlineData(new[] { 1d, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 }, -2, new double[] { })]
[InlineData(new[] { 1d, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 }, 4, new[] { 4d, 8, 12 })]
[InlineData(new[] { 1d, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 }, 4, new[] { 4d, 8 })]
[InlineData(new[] { 1d, 2, 3, 4, 5, 6, 7 }, 4, new[] { 4d })]
[InlineData(new[] { 1d }, 1, new[] { 1d })]
[InlineData(new[] { 1d }, -1, new double[] { })]
[InlineData(new double[] { }, 0, new double[] { })]
[InlineData(new double[] { }, 1, new double[] { })]
[InlineData(null, 0, new double[] { })]
[InlineData(null, 1, new double[] { })]
public void GetEveryNthElement_List(double[] numbers, int n, double[] expected)
{
// Arrange
ChallengesSet06 challenger = new ChallengesSet06();
List<double> numbersAsList = numbers == null ? null : new List<double>(numbers);
// Act
double[] actual = challenger.GetEveryNthElement(numbersAsList, n);
// Assert
Assert.Equal(expected.Length, actual.Length);
for (int i = 0; i < expected.Length; i++)
{
Assert.Equal(Math.Round(expected[i], 4), Math.Round(actual[i], 4));
}
}
}
}