Skip to content

Commit f7f328c

Browse files
HardvanHardvan
committed
Fix lint
1 parent b153c84 commit f7f328c

File tree

1 file changed

+32
-43
lines changed

1 file changed

+32
-43
lines changed

‎src/test/java/com/thealgorithms/others/HuffmanTest.java‎

Lines changed: 32 additions & 43 deletions
Original file line numberDiff line numberDiff line change
@@ -13,8 +13,8 @@ class HuffmanTest {
1313

1414
@Test
1515
void testBuildHuffmanTreeWithBasicInput() {
16-
char[] charArray = { 'a', 'b', 'c', 'd', 'e', 'f' };
17-
int[] charFreq = { 5, 9, 12, 13, 16, 45 };
16+
char[] charArray = {'a', 'b', 'c', 'd', 'e', 'f'};
17+
int[] charFreq = {5, 9, 12, 13, 16, 45};
1818

1919
HuffmanNode root = Huffman.buildHuffmanTree(charArray, charFreq);
2020

@@ -24,8 +24,8 @@ void testBuildHuffmanTreeWithBasicInput() {
2424

2525
@Test
2626
void testGenerateCodesWithBasicInput() {
27-
char[] charArray = { 'a', 'b', 'c', 'd', 'e', 'f' };
28-
int[] charFreq = { 5, 9, 12, 13, 16, 45 };
27+
char[] charArray = {'a', 'b', 'c', 'd', 'e', 'f'};
28+
int[] charFreq = {5, 9, 12, 13, 16, 45};
2929

3030
HuffmanNode root = Huffman.buildHuffmanTree(charArray, charFreq);
3131
Map<Character, String> codes = Huffman.generateCodes(root);
@@ -47,8 +47,8 @@ void testGenerateCodesWithBasicInput() {
4747

4848
@Test
4949
void testSingleCharacter() {
50-
char[] charArray = { 'a' };
51-
int[] charFreq = { 10 };
50+
char[] charArray = {'a'};
51+
int[] charFreq = {10};
5252

5353
HuffmanNode root = Huffman.buildHuffmanTree(charArray, charFreq);
5454
Map<Character, String> codes = Huffman.generateCodes(root);
@@ -60,8 +60,8 @@ void testSingleCharacter() {
6060

6161
@Test
6262
void testTwoCharacters() {
63-
char[] charArray = { 'a', 'b' };
64-
int[] charFreq = { 3, 7 };
63+
char[] charArray = {'a', 'b'};
64+
int[] charFreq = {3, 7};
6565

6666
HuffmanNode root = Huffman.buildHuffmanTree(charArray, charFreq);
6767
Map<Character, String> codes = Huffman.generateCodes(root);
@@ -79,8 +79,8 @@ void testTwoCharacters() {
7979

8080
@Test
8181
void testEqualFrequencies() {
82-
char[] charArray = { 'a', 'b', 'c' };
83-
int[] charFreq = { 5, 5, 5 };
82+
char[] charArray = {'a', 'b', 'c'};
83+
int[] charFreq = {5, 5, 5};
8484

8585
HuffmanNode root = Huffman.buildHuffmanTree(charArray, charFreq);
8686
Map<Character, String> codes = Huffman.generateCodes(root);
@@ -96,8 +96,8 @@ void testEqualFrequencies() {
9696

9797
@Test
9898
void testLargeFrequencyDifference() {
99-
char[] charArray = { 'a', 'b', 'c' };
100-
int[] charFreq = { 1, 10, 100 };
99+
char[] charArray = {'a', 'b', 'c'};
100+
int[] charFreq = {1, 10, 100};
101101

102102
HuffmanNode root = Huffman.buildHuffmanTree(charArray, charFreq);
103103
Map<Character, String> codes = Huffman.generateCodes(root);
@@ -112,56 +112,46 @@ void testLargeFrequencyDifference() {
112112

113113
@Test
114114
void testNullCharacterArray() {
115-
int[] charFreq = { 5, 9, 12 };
115+
int[] charFreq = {5, 9, 12};
116116

117-
Assertions.assertThrows(IllegalArgumentException.class, () -> {
118-
Huffman.buildHuffmanTree(null, charFreq);
119-
});
117+
Assertions.assertThrows(IllegalArgumentException.class, () -> { Huffman.buildHuffmanTree(null, charFreq); });
120118
}
121119

122120
@Test
123121
void testNullFrequencyArray() {
124-
char[] charArray = { 'a', 'b', 'c' };
122+
char[] charArray = {'a', 'b', 'c'};
125123

126-
Assertions.assertThrows(IllegalArgumentException.class, () -> {
127-
Huffman.buildHuffmanTree(charArray, null);
128-
});
124+
Assertions.assertThrows(IllegalArgumentException.class, () -> { Huffman.buildHuffmanTree(charArray, null); });
129125
}
130126

131127
@Test
132128
void testEmptyArrays() {
133129
char[] charArray = {};
134130
int[] charFreq = {};
135131

136-
Assertions.assertThrows(IllegalArgumentException.class, () -> {
137-
Huffman.buildHuffmanTree(charArray, charFreq);
138-
});
132+
Assertions.assertThrows(IllegalArgumentException.class, () -> { Huffman.buildHuffmanTree(charArray, charFreq); });
139133
}
140134

141135
@Test
142136
void testMismatchedArrayLengths() {
143-
char[] charArray = { 'a', 'b', 'c' };
144-
int[] charFreq = { 5, 9 };
137+
char[] charArray = {'a', 'b', 'c'};
138+
int[] charFreq = {5, 9};
145139

146-
Assertions.assertThrows(IllegalArgumentException.class, () -> {
147-
Huffman.buildHuffmanTree(charArray, charFreq);
148-
});
140+
Assertions.assertThrows(IllegalArgumentException.class, () -> { Huffman.buildHuffmanTree(charArray, charFreq); });
149141
}
150142

151143
@Test
152144
void testNegativeFrequency() {
153-
char[] charArray = { 'a', 'b', 'c' };
154-
int[] charFreq = { 5, -9, 12 };
145+
char[] charArray = {'a', 'b', 'c'};
146+
int[] charFreq = {5, -9, 12};
155147

156-
Assertions.assertThrows(IllegalArgumentException.class, () -> {
157-
Huffman.buildHuffmanTree(charArray, charFreq);
158-
});
148+
Assertions.assertThrows(IllegalArgumentException.class, () -> { Huffman.buildHuffmanTree(charArray, charFreq); });
159149
}
160150

161151
@Test
162152
void testZeroFrequency() {
163-
char[] charArray = { 'a', 'b', 'c' };
164-
int[] charFreq = { 0, 5, 10 };
153+
char[] charArray = {'a', 'b', 'c'};
154+
int[] charFreq = {0, 5, 10};
165155

166156
HuffmanNode root = Huffman.buildHuffmanTree(charArray, charFreq);
167157
Map<Character, String> codes = Huffman.generateCodes(root);
@@ -182,8 +172,8 @@ void testGenerateCodesWithNullRoot() {
182172
@Test
183173
void testPrefixProperty() {
184174
// Verify that no code is a prefix of another (Huffman property)
185-
char[] charArray = { 'a', 'b', 'c', 'd', 'e' };
186-
int[] charFreq = { 5, 9, 12, 13, 16 };
175+
char[] charArray = {'a', 'b', 'c', 'd', 'e'};
176+
int[] charFreq = {5, 9, 12, 13, 16};
187177

188178
HuffmanNode root = Huffman.buildHuffmanTree(charArray, charFreq);
189179
Map<Character, String> codes = Huffman.generateCodes(root);
@@ -194,8 +184,7 @@ void testPrefixProperty() {
194184
if (!entry1.getKey().equals(entry2.getKey())) {
195185
String code1 = entry1.getValue();
196186
String code2 = entry2.getValue();
197-
Assertions.assertTrue(!code1.startsWith(code2) && !code2.startsWith(code1),
198-
"Code " + code1 + " is a prefix of " + code2);
187+
Assertions.assertTrue(!code1.startsWith(code2) && !code2.startsWith(code1), "Code " + code1 + " is a prefix of " + code2);
199188
}
200189
}
201190
}
@@ -204,8 +193,8 @@ void testPrefixProperty() {
204193
@Test
205194
void testBinaryCodesOnly() {
206195
// Verify that all codes contain only '0' and '1'
207-
char[] charArray = { 'a', 'b', 'c', 'd' };
208-
int[] charFreq = { 1, 2, 3, 4 };
196+
char[] charArray = {'a', 'b', 'c', 'd'};
197+
int[] charFreq = {1, 2, 3, 4};
209198

210199
HuffmanNode root = Huffman.buildHuffmanTree(charArray, charFreq);
211200
Map<Character, String> codes = Huffman.generateCodes(root);
@@ -217,8 +206,8 @@ void testBinaryCodesOnly() {
217206

218207
@Test
219208
void testMultipleCharactersWithLargeAlphabet() {
220-
char[] charArray = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j' };
221-
int[] charFreq = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 };
209+
char[] charArray = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j'};
210+
int[] charFreq = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
222211

223212
HuffmanNode root = Huffman.buildHuffmanTree(charArray, charFreq);
224213
Map<Character, String> codes = Huffman.generateCodes(root);

0 commit comments

Comments
 (0)