Sign upLogin

Kuangcp/JavaBase

View on GitHub
Star
algorithms/src/main/java/com/github/kuangcp/string/NumberMaxDiffIndex.java

Summary

Maintainability
C
1 day
Test Coverage

Method findDiffIndexPoint has a Cognitive Complexity of 19 (exceeds 5 allowed). Consider refactoring.
Open

    public static int findDiffIndexPoint(String a, String b) {
        if (StringUtils.equals(a, b)) {
            return 0;
        }
        if (Objects.isNull(a)) {
Severity: Minor
Found in algorithms/src/main/java/com/github/kuangcp/string/NumberMaxDiffIndex.java - About 2 hrs to fix

Cognitive Complexity

Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.

A method's cognitive complexity is based on a few simple rules:

  • Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
  • Code is considered more complex for each "break in the linear flow of the code"
  • Code is considered more complex when "flow breaking structures are nested"

Further reading

Method findDiffIndex has a Cognitive Complexity of 18 (exceeds 5 allowed). Consider refactoring.
Open

    public static int findDiffIndex(String a, String b) {
        if (StringUtils.equals(a, b)) {
            return 0;
        }
        if (Objects.isNull(a)) {
Severity: Minor
Found in algorithms/src/main/java/com/github/kuangcp/string/NumberMaxDiffIndex.java - About 2 hrs to fix

Cognitive Complexity

Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.

A method's cognitive complexity is based on a few simple rules:

  • Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
  • Code is considered more complex for each "break in the linear flow of the code"
  • Code is considered more complex when "flow breaking structures are nested"

Further reading

Method findDiffIndexPoint has 52 lines of code (exceeds 25 allowed). Consider refactoring.
Open

    public static int findDiffIndexPoint(String a, String b) {
        if (StringUtils.equals(a, b)) {
            return 0;
        }
        if (Objects.isNull(a)) {
Severity: Major
Found in algorithms/src/main/java/com/github/kuangcp/string/NumberMaxDiffIndex.java - About 2 hrs to fix

    Method findDiffIndex has 49 lines of code (exceeds 25 allowed). Consider refactoring.
    Open

        public static int findDiffIndex(String a, String b) {
        if (StringUtils.equals(a, b)) {
            return 0;
        }
        if (Objects.isNull(a)) {
    Severity: Minor
    Found in algorithms/src/main/java/com/github/kuangcp/string/NumberMaxDiffIndex.java - About 1 hr to fix

      Avoid too many return statements within this method.
      Open

              return 0;
      Severity: Major
      Found in algorithms/src/main/java/com/github/kuangcp/string/NumberMaxDiffIndex.java - About 30 mins to fix

        Avoid too many return statements within this method.
        Open

                return 0;
        Severity: Major
        Found in algorithms/src/main/java/com/github/kuangcp/string/NumberMaxDiffIndex.java - About 30 mins to fix

          There are no issues that match your filters.

          Category
          Status