Add more recursion test (#32)

uudashr · Sep 7, 2023 · 667cb69 · 667cb69
1 parent bc9ca12
commit 667cb69
Show file tree

Hide file tree

Showing 2 changed files with 32 additions and 0 deletions.
diff --git a/testdata/src/a/a.go b/testdata/src/a/a.go
@@ -160,6 +160,14 @@ OUT:
 	return total
 } // Cognitive complexity = 7
 
+func Fibonacci(n int) int { // want "cognitive complexity 3 of func Fibonacci is high \\(> 0\\)"
+	if n <= 1 { // +1
+		return n
+	}
+
+	return Fibonacci(n-1) + Fibonacci(n-2) // +1 and +1
+} // Cognitive complexity = 3
+
 func FactRec(n int) int { // want "cognitive complexity 3 of func FactRec is high \\(> 0\\)"
 	if n <= 1 { // +1
 		return 1
@@ -168,6 +176,14 @@ func FactRec(n int) int { // want "cognitive complexity 3 of func FactRec is hig
 	}
 } // total complexity = 3
 
+func FactRec_Simplified(n int) int { // want "cognitive complexity 2 of func FactRec_Simplified is high \\(> 0\\)"
+	if n <= 1 { // +1
+		return 1
+	}
+
+	return n * FactRec_Simplified(n-1) // +1
+} // total complexity = 2
+
 func FactLoop(n int) int { // want "cognitive complexity 1 of func FactLoop is high \\(> 0\\)"
 	total := 1
 	for n > 0 { // +1

diff --git a/testdata/src/b/b.go b/testdata/src/b/b.go
@@ -152,6 +152,14 @@ OUT:
 	return total
 } // Cognitive complexity = 7
 
+func Fibonacci(n int) int {
+	if n <= 1 { // +1
+		return n
+	}
+
+	return Fibonacci(n-1) + Fibonacci(n-2) // +1 and +1
+} // Cognitive complexity = 3
+
 func FactRec(n int) int {
 	if n <= 1 { // +1
 		return 1
@@ -160,6 +168,14 @@ func FactRec(n int) int {
 	}
 } // total complexity = 3
 
+func FactRec_Simplified(n int) int {
+	if n <= 1 { // +1
+		return 1
+	}
+
+	return n * FactRec_Simplified(n-1) // +1
+} // total complexity = 2
+
 func FactLoop(n int) int {
 	total := 1
 	for n > 0 { // +1