module CognitiveComplexityTest exposing (all) import CognitiveComplexity exposing (rule) import Elm.Syntax.Range exposing (Range) import Expect exposing (Expectation) import Review.Test import Test exposing (Test, describe, test) all : Test all = describe "CognitiveComplexity" [ test "should not report an error when the complexity is lower than the threshold" <| \() -> """module A exposing (..) a = 1 """ |> Review.Test.run (rule 1) |> Review.Test.expectNoErrors , test "should report an error when the complexity is higher than the threshold" <| \() -> """module A exposing (..) fun n = if cond then -- +1 if cond then -- +2 if cond then -- +3 if cond then -- +4 1 else 2 else 2 else 2 else 2 """ |> expect [ { name = "fun" , complexity = 10 , details = [ String.trim """ Line 3: +1 for the if expression Line 4: +2 for the if expression (including 1 for nesting) Line 5: +3 for the if expression (including 2 for nesting) Line 6: +4 for the if expression (including 3 for nesting) """ ] } ] , test "should count a simple value or operation as 0" <| \() -> """module A exposing (..) fun n = n + 1 """ |> expect [ { name = "fun", complexity = 0, details = [] } ] , test "should count if expression as 1" <| \() -> """module A exposing (..) fun n = if cond then 1 else 2 """ |> expect [ { name = "fun" , complexity = 1 , details = [ "Line 3: +1 for the if expression" ] } ] , test "should count if else expressions" <| \() -> """module A exposing (..) fun n = if cond then -- +1 1 else if cond then -- +1 2 else 2 """ |> expect [ { name = "fun" , complexity = 2 , details = [ String.trim """ Line 3: +1 for the if expression Line 5: +1 for the else if expression """ ] } ] , test "should properly decrement when exiting else expression" <| \() -> """module A exposing (..) fun n = let _ = if cond then -- +1 1 else if cond then -- +1 2 else 3 in if cond then -- +1 4 else 5 """ |> expect [ { name = "fun" , complexity = 3 , details = [ String.trim """ Line 5: +1 for the if expression Line 7: +1 for the else if expression Line 12: +1 for the if expression """ ] } ] , test "should increment nesting when inside a let function" <| \() -> """module A exposing (..) fun n = let fn n = if cond then -- +2 1 else 2 in fn n """ |> expect [ { name = "fun" , complexity = 2 , details = [ String.trim """ Line 5: +2 for the if expression (including 1 for nesting) """ ] } ] , test "should properly decrement nesting when exiting a let function" <| \() -> """module A exposing (..) fun n = let fn1 n = -- nesting increment 1 fn2 = if cond then -- +1 1 else 2 in 1 """ |> expect [ { name = "fun" , complexity = 1 , details = [ String.trim """ Line 8: +1 for the if expression """ ] } ] , test "should count case expression as 1" <| \() -> """module A exposing (..) fun n = case n of -- +1 1 -> () 2 -> () 3 -> () 4 -> () _ -> () """ |> expect [ { name = "fun" , complexity = 1 , details = [ "Line 3: +1 for the case expression" ] } ] , test "should count nesting of case expressions" <| \() -> """module A exposing (..) fun n = case n of -- +1 1 -> () 2 -> () 3 -> case n of -- +2 _ -> () 4 -> () _ -> () """ |> expect [ { name = "fun" , complexity = 3 , details = [ String.trim """ Line 3: +1 for the case expression Line 6: +2 for the case expression (including 1 for nesting) """ ] } ] , test "should decrement the nesting when leaving a nested structure" <| \() -> """module A exposing (..) fun n = if cond then -- +1 if cond then -- +2 if cond then -- +3 1 else 2 else 2 else case n of -- +2 () -> () """ |> expect [ { name = "fun" , complexity = 8 , details = [ String.trim """ Line 3: +1 for the if expression Line 4: +2 for the if expression (including 1 for nesting) Line 5: +3 for the if expression (including 2 for nesting) Line 12: +2 for the case expression (including 1 for nesting) """ ] } ] , test "should increment once when using the && boolean operator" <| \() -> """module A exposing (..) fun n = if -- +1 a && b && c && d -- +1 for the usage of && then 1 else 2 """ |> expect [ { name = "fun" , complexity = 2 , details = [ String.trim """ Line 3: +1 for the if expression Line 4: +1 for the use of `&&` """ ] } ] , test "should increment once when using the || boolean operator" <| \() -> """module A exposing (..) fun n = if -- +1 a || b || c || d -- +1 for the usage of || then 1 else 2 """ |> expect [ { name = "fun" , complexity = 2 , details = [ String.trim """ Line 3: +1 for the if expression Line 4: +1 for the use of `||` """ ] } ] , test "should increment when mixing boolean operators" <| \() -> """module A exposing (..) fun n = if -- +1 a && b && c -- +1 || d || e -- +1 && f -- +1 then 1 else 2 """ |> expect [ { name = "fun" , complexity = 4 , details = [ String.trim """ Line 3: +1 for the if expression Line 4: +1 for the use of `||` Line 4: +1 for the use of `&&` Line 5: +1 for the use of `&&` """ ] } ] , test "should not increment for anonymous functions" <| \() -> """module A exposing (..) fun n = List.map (\\m -> m + 1) n """ |> expect [ { name = "fun" , complexity = 0 , details = [] } ] , test "should increment the nesting inside anonymous functions" <| \() -> """module A exposing (..) fun n = List.map (\\m -> if cond then -- +2 1 else 2 ) n """ |> expect [ { name = "fun" , complexity = 2 , details = [ "Line 5: +2 for the if expression (including 1 for nesting)" ] } ] , test "should properly decrement the nesting when exiting an anonymous function" <| \() -> """module A exposing (..) fun n = let _ = List.map (\\m -> m + 1) n in if cond then -- +1 1 else 2 """ |> expect [ { name = "fun" , complexity = 1 , details = [ "Line 6: +1 for the if expression" ] } ] , test "should increment when finding a recursive call" <| \() -> """module A exposing (..) fun n = if n > 0 then -- +1 1 + fun (n - 1) -- +1 else 1 """ |> expectAtExactly [ { name = "fun" , complexity = 2 , atExactly = { start = { row = 2, column = 1 }, end = { row = 2, column = 4 } } , details = [ String.trim """ Line 3: +1 for the if expression Line 4: +1 for the recursive call """ ] } ] , test "should only increment once, even if there are multiple recursive calls" <| \() -> """module A exposing (..) fib n = if n > 0 then -- +1 fib (n - 1) -- +1 + fib (n - 2) -- +0 else 0 """ |> expectAtExactly [ { name = "fib" , complexity = 2 , atExactly = { start = { row = 2, column = 1 }, end = { row = 2, column = 4 } } , details = [ String.trim """ Line 3: +1 for the if expression Line 4: +1 for the recursive call """ ] } ] , test "should increment the complexity for every recursive call in a chain" <| \() -> """module A exposing (..) fun1 n = -- +1 fun2 n fun2 n = -- +1 fun1 n """ |> expectAtExactly [ { name = "fun1" , complexity = 1 , atExactly = { start = { row = 2, column = 1 }, end = { row = 2, column = 5 } } , details = [ String.trim """ Line 3: +1 for the indirect recursive call to fun2 """ ] } , { name = "fun2" , complexity = 1 , atExactly = { start = { row = 5, column = 1 }, end = { row = 5, column = 5 } } , details = [ String.trim """ Line 6: +1 for the indirect recursive call to fun1 """ ] } ] , test "should increment the complexity for every recursive call in a chain, for each different function call" <| \() -> """module A exposing (..) fun1 n = fun2 n -- +1 + fun2 n -- +0, already counted + fun1 n -- +1 fun2 n = fun1 n -- +1 """ |> expectAtExactly [ { name = "fun1" , complexity = 2 , atExactly = { start = { row = 2, column = 1 }, end = { row = 2, column = 5 } } , details = [ String.trim """ Line 3: +1 for the indirect recursive call to fun2 Line 5: +1 for the recursive call """ ] } , { name = "fun2" , complexity = 1 , atExactly = { start = { row = 7, column = 1 }, end = { row = 7, column = 5 } } , details = [ String.trim """ Line 8: +1 for the indirect recursive call to fun1 """ ] } ] , test "should increment the complexity for every recursive call in a chain, for long chains" <| \() -> """module A exposing (..) fun1 n = fun2 n -- +1 fun2 n = fun3 n -- +1 fun3 n = fun4 n -- +1 fun4 n = fun5 n -- +1 fun5 n = fun1 n -- +1 """ |> expectAtExactly [ { name = "fun1" , complexity = 1 , atExactly = { start = { row = 2, column = 1 }, end = { row = 2, column = 5 } } , details = [ "Line 3: +1 for the indirect recursive call to fun2" ] } , { name = "fun2" , complexity = 1 , atExactly = { start = { row = 4, column = 1 }, end = { row = 4, column = 5 } } , details = [ "Line 5: +1 for the indirect recursive call to fun3" ] } , { name = "fun3" , complexity = 1 , atExactly = { start = { row = 6, column = 1 }, end = { row = 6, column = 5 } } , details = [ "Line 7: +1 for the indirect recursive call to fun4" ] } , { name = "fun4" , complexity = 1 , atExactly = { start = { row = 8, column = 1 }, end = { row = 8, column = 5 } } , details = [ "Line 9: +1 for the indirect recursive call to fun5" ] } , { name = "fun5" , complexity = 1 , atExactly = { start = { row = 10, column = 1 }, end = { row = 10, column = 5 } } , details = [ "Line 11: +1 for the indirect recursive call to fun1" ] } ] , test "the complexity of a function should not affect another function's computed complexity" <| \() -> """module A exposing (..) simple n = 1 fun n = if cond then if cond then 1 else 2 else 2 alsoSimple n = if cond then 1 else 2 """ |> expect [ { name = "simple" , complexity = 0 , details = [] } , { name = "fun" , complexity = 3 , details = [ String.trim """ Line 5: +1 for the if expression Line 6: +2 for the if expression (including 1 for nesting) """ ] } , { name = "alsoSimple" , complexity = 1 , details = [ "Line 14: +1 for the if expression" ] } ] ] expect : List { name : String, complexity : Int, details : List String } -> String -> Expectation expect functionComplexities source = source |> Review.Test.run (rule -1) |> Review.Test.expectErrors (List.map (\{ name, complexity, details } -> Review.Test.error { message = name ++ " has a cognitive complexity of " ++ String.fromInt complexity ++ ", higher than the allowed -1" , details = explanation ++ details , under = name } ) functionComplexities ) expectAtExactly : List { name : String, complexity : Int, details : List String, atExactly : Range } -> String -> Expectation expectAtExactly functionComplexities source = source |> Review.Test.run (rule -1) |> Review.Test.expectErrors (List.map (\{ name, complexity, details, atExactly } -> Review.Test.error { message = name ++ " has a cognitive complexity of " ++ String.fromInt complexity ++ ", higher than the allowed -1" , details = explanation ++ details , under = name } |> Review.Test.atExactly atExactly ) functionComplexities ) explanation : List String explanation = [ "This metric is a heuristic to measure how easy to understand a piece of code is, primarily through increments for breaks in the linear flow and for nesting those breaks." , "The most common ways to reduce complexity is to extract sections into functions and to unnest control flow structures. Following is a breakdown of where complexity was found:" ]