style: enable ModifierOrder
in checkstyle (#5132)
* style: enable `ModifierOrder` in checkstyle * style: remove redundant `final` Co-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com> --------- Co-authored-by: Maria Paszkiewicz SCC <maria.paszkiewicz@kit.edu> Co-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>
This commit is contained in:
parent
fd65892415
commit
06a284f811
@ -147,7 +147,7 @@
|
|||||||
|
|
||||||
<!-- Modifier Checks -->
|
<!-- Modifier Checks -->
|
||||||
<!-- See https://checkstyle.org/checks/modifier/index.html -->
|
<!-- See https://checkstyle.org/checks/modifier/index.html -->
|
||||||
<!-- TODO <module name="ModifierOrder"/> -->
|
<module name="ModifierOrder"/>
|
||||||
<!-- TODO <module name="RedundantModifier"/> -->
|
<!-- TODO <module name="RedundantModifier"/> -->
|
||||||
|
|
||||||
<!-- Checks for blocks. You know, those {}'s -->
|
<!-- Checks for blocks. You know, those {}'s -->
|
||||||
|
@ -12,7 +12,7 @@ public final class HighestSetBit {
|
|||||||
private HighestSetBit() {
|
private HighestSetBit() {
|
||||||
}
|
}
|
||||||
|
|
||||||
public final static Optional<Integer> findHighestSetBit(int num) {
|
public static Optional<Integer> findHighestSetBit(int num) {
|
||||||
if (num < 0) {
|
if (num < 0) {
|
||||||
throw new IllegalArgumentException("Input cannot be negative");
|
throw new IllegalArgumentException("Input cannot be negative");
|
||||||
}
|
}
|
||||||
|
@ -3,7 +3,7 @@ package com.thealgorithms.others;
|
|||||||
/**
|
/**
|
||||||
* @author Marcus
|
* @author Marcus
|
||||||
*/
|
*/
|
||||||
final public class CountWords {
|
public final class CountWords {
|
||||||
private CountWords() {
|
private CountWords() {
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -3,7 +3,7 @@ package com.thealgorithms.others;
|
|||||||
/**
|
/**
|
||||||
* @brief utility class for <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function">Euler's totient function</a>
|
* @brief utility class for <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function">Euler's totient function</a>
|
||||||
*/
|
*/
|
||||||
final public class EulersFunction {
|
public final class EulersFunction {
|
||||||
private EulersFunction() {
|
private EulersFunction() {
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -6,7 +6,7 @@ import java.util.ArrayList;
|
|||||||
* @brief Class for finding the lowest base in which a given integer is a palindrome.
|
* @brief Class for finding the lowest base in which a given integer is a palindrome.
|
||||||
cf. https://oeis.org/A016026
|
cf. https://oeis.org/A016026
|
||||||
*/
|
*/
|
||||||
final public class LowestBasePalindrome {
|
public final class LowestBasePalindrome {
|
||||||
private LowestBasePalindrome() {
|
private LowestBasePalindrome() {
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -5,7 +5,7 @@ import java.util.Arrays;
|
|||||||
/**
|
/**
|
||||||
* @brief utility class implementing <a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes">Sieve of Eratosthenes</a>
|
* @brief utility class implementing <a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes">Sieve of Eratosthenes</a>
|
||||||
*/
|
*/
|
||||||
final public class SieveOfEratosthenes {
|
public final class SieveOfEratosthenes {
|
||||||
private SieveOfEratosthenes() {
|
private SieveOfEratosthenes() {
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -1,6 +1,6 @@
|
|||||||
package com.thealgorithms.others.cn;
|
package com.thealgorithms.others.cn;
|
||||||
|
|
||||||
final public class HammingDistance {
|
public final class HammingDistance {
|
||||||
private HammingDistance() {
|
private HammingDistance() {
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user