Skip to content

Commit 9eaa2bb

Browse files
vaibhav9t1vaibhavw-techp
vaibhav9t1
and
vaibhavw-techp
authored
style: enable MultipleVariableDeclarations in checkstyle (#5175)
Co-authored-by: vaibhav <vaibhav.waghmare@techprescient.com>
1 parent 44ce6e7 commit 9eaa2bb

File tree

82 files changed

+299
-121
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

82 files changed

+299
-121
lines changed

‎checkstyle.xml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -167,7 +167,7 @@
167167
<module name="InnerAssignment"/>
168168
<!-- TODO <module name="MagicNumber"/> -->
169169
<!-- TODO <module name="MissingSwitchDefault"/> -->
170-
<!-- TODO <module name="MultipleVariableDeclarations"/> -->
170+
<module name="MultipleVariableDeclarations"/>
171171
<module name="SimplifyBooleanExpression"/>
172172
<module name="SimplifyBooleanReturn"/>
173173

‎src/main/java/com/thealgorithms/backtracking/PowerSum.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,8 @@
88
*/
99
public class PowerSum {
1010

11-
private int count = 0, sum = 0;
11+
private int count = 0;
12+
private int sum = 0;
1213

1314
public int powSum(int N, int X) {
1415
Sum(N, X, 1);

‎src/main/java/com/thealgorithms/ciphers/Blowfish.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1175,7 +1175,8 @@ private void keyGenerate(String key) {
11751175

11761176
// round function
11771177
private String round(int time, String plainText) {
1178-
String left, right;
1178+
String left;
1179+
String right;
11791180
left = plainText.substring(0, 8);
11801181
right = plainText.substring(8, 16);
11811182
left = xor(left, P[time]);

‎src/main/java/com/thealgorithms/ciphers/DES.java‎

Lines changed: 16 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -74,13 +74,15 @@ public void setKey(String key) {
7474

7575
private String[] getSubkeys(String originalKey) {
7676
StringBuilder permutedKey = new StringBuilder(); // Initial permutation of keys via pc1
77-
int i, j;
77+
int i;
78+
int j;
7879
for (i = 0; i < 56; i++) {
7980
permutedKey.append(originalKey.charAt(PC1[i] - 1));
8081
}
8182
String[] subKeys = new String[16];
8283
String initialPermutedKey = permutedKey.toString();
83-
String C0 = initialPermutedKey.substring(0, 28), D0 = initialPermutedKey.substring(28);
84+
String C0 = initialPermutedKey.substring(0, 28);
85+
String D0 = initialPermutedKey.substring(28);
8486

8587
// We will now operate on the left and right halves of the permutedKey
8688
for (i = 0; i < 16; i++) {
@@ -105,7 +107,8 @@ private String[] getSubkeys(String originalKey) {
105107
}
106108

107109
private String XOR(String a, String b) {
108-
int i, l = a.length();
110+
int i;
111+
int l = a.length();
109112
StringBuilder xor = new StringBuilder();
110113
for (i = 0; i < l; i++) {
111114
int firstBit = a.charAt(i) - 48; // 48 is '0' in ascii
@@ -116,7 +119,8 @@ private String XOR(String a, String b) {
116119
}
117120

118121
private String createPaddedString(String s, int desiredLength, char pad) {
119-
int i, l = s.length();
122+
int i;
123+
int l = s.length();
120124
StringBuilder paddedString = new StringBuilder();
121125
int diff = desiredLength - l;
122126
for (i = 0; i < diff; i++) {
@@ -165,7 +169,8 @@ private String encryptBlock(String message, String[] keys) {
165169
for (i = 0; i < 64; i++) {
166170
permutedMessage.append(message.charAt(IP[i] - 1));
167171
}
168-
String L0 = permutedMessage.substring(0, 32), R0 = permutedMessage.substring(32);
172+
String L0 = permutedMessage.substring(0, 32);
173+
String R0 = permutedMessage.substring(32);
169174

170175
// Iterate 16 times
171176
for (i = 0; i < 16; i++) {
@@ -198,7 +203,9 @@ private String decryptBlock(String message, String[] keys) {
198203
*/
199204
public String encrypt(String message) {
200205
StringBuilder encryptedMessage = new StringBuilder();
201-
int l = message.length(), i, j;
206+
int l = message.length();
207+
int i;
208+
int j;
202209
if (l % 8 != 0) {
203210
int desiredLength = (l / 8 + 1) * 8;
204211
l = desiredLength;
@@ -223,7 +230,9 @@ public String encrypt(String message) {
223230
*/
224231
public String decrypt(String message) {
225232
StringBuilder decryptedMessage = new StringBuilder();
226-
int l = message.length(), i, j;
233+
int l = message.length();
234+
int i;
235+
int j;
227236
if (l % 64 != 0) {
228237
throw new IllegalArgumentException("Encrypted message should be a multiple of 64 characters in length");
229238
}

‎src/main/java/com/thealgorithms/ciphers/HillCipher.java‎

Lines changed: 8 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -48,7 +48,8 @@ static void encrypt(String message) {
4848
System.out.println(messageVector[i][0]);
4949
j++;
5050
}
51-
int x, i;
51+
int x;
52+
int i;
5253
for (i = 0; i < matrixSize; i++) {
5354
cipherMatrix[i][0] = 0;
5455

@@ -96,7 +97,8 @@ static void decrypt(String message) {
9697
System.out.println(messageVector[i][0]);
9798
j++;
9899
}
99-
int x, i;
100+
int x;
101+
int i;
100102
for (i = 0; i < n; i++) {
101103
plainMatrix[i][0] = 0;
102104

@@ -115,7 +117,10 @@ static void decrypt(String message) {
115117

116118
// Determinant calculator
117119
public static int determinant(int[][] a, int n) {
118-
int det = 0, sign = 1, p = 0, q = 0;
120+
int det = 0;
121+
int sign = 1;
122+
int p = 0;
123+
int q = 0;
119124

120125
if (n == 1) {
121126
det = a[0][0];

‎src/main/java/com/thealgorithms/conversions/AnyBaseToAnyBase.java‎

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,8 @@ private AnyBaseToAnyBase() {
2727
public static void main(String[] args) {
2828
Scanner in = new Scanner(System.in);
2929
String n;
30-
int b1, b2;
30+
int b1;
31+
int b2;
3132
while (true) {
3233
try {
3334
System.out.print("Enter number: ");
@@ -132,7 +133,8 @@ public static String base2base(String n, int b1, int b2) {
132133
// Declare variables: decimal value of n,
133134
// character of base b1, character of base b2,
134135
// and the string that will be returned.
135-
int decimalValue = 0, charB2;
136+
int decimalValue = 0;
137+
int charB2;
136138
char charB1;
137139
String output = "";
138140
// Go through every character of n

‎src/main/java/com/thealgorithms/conversions/AnytoAny.java‎

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,9 @@ public static void main(String[] args) {
1515
int sn = scn.nextInt();
1616
int sb = scn.nextInt();
1717
int db = scn.nextInt();
18-
int m = 1, dec = 0, dn = 0;
18+
int m = 1;
19+
int dec = 0;
20+
int dn = 0;
1921
while (sn != 0) {
2022
dec = dec + (sn % 10) * m;
2123
m *= sb;

‎src/main/java/com/thealgorithms/conversions/BinaryToDecimal.java‎

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,10 @@ private BinaryToDecimal() {
1010
}
1111

1212
public static long binaryToDecimal(long binNum) {
13-
long binCopy, d, s = 0, power = 0;
13+
long binCopy;
14+
long d;
15+
long s = 0;
16+
long power = 0;
1417
binCopy = binNum;
1518
while (binCopy != 0) {
1619
d = binCopy % 10;

‎src/main/java/com/thealgorithms/conversions/BinaryToOctal.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -32,7 +32,8 @@ public static void main(String[] args) {
3232
*/
3333
public static String convertBinaryToOctal(int binary) {
3434
String octal = "";
35-
int currBit = 0, j = 1;
35+
int currBit = 0;
36+
int j = 1;
3637
while (binary != 0) {
3738
int code3 = 0;
3839
for (int i = 0; i < 3; i++) {

‎src/main/java/com/thealgorithms/conversions/DecimalToBinary.java‎

Lines changed: 8 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,10 @@ public static void main(String[] args) {
2424
* conventional algorithm.
2525
*/
2626
public static void conventionalConversion() {
27-
int n, b = 0, c = 0, d;
27+
int n;
28+
int b = 0;
29+
int c = 0;
30+
int d;
2831
Scanner input = new Scanner(System.in);
2932
System.out.printf("Conventional conversion.%n Enter the decimal number: ");
3033
n = input.nextInt();
@@ -42,7 +45,10 @@ public static void conventionalConversion() {
4245
* algorithm
4346
*/
4447
public static void bitwiseConversion() {
45-
int n, b = 0, c = 0, d;
48+
int n;
49+
int b = 0;
50+
int c = 0;
51+
int d;
4652
Scanner input = new Scanner(System.in);
4753
System.out.printf("Bitwise conversion.%n Enter the decimal number: ");
4854
n = input.nextInt();

0 commit comments

Comments
 (0)