We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 83e2748 commit a8b39cdCopy full SHA for a8b39cd
evaluator.go
@@ -7,7 +7,7 @@ import (
7
"strings"
8
)
9
10
-const MaxRecursionDepth = 1000 // Between 1000 and 2000 is considered to be a reasonable recursion depth for recursive functions
+const MaxRecursionDepth = 3000 // Between 1000 and 2000 is considered to be a reasonable recursion depth for recursive functions
11
12
type Evaluator struct {
13
// Keep track of file path that have been imported by the import statement.
example/test.rune
@@ -1,8 +1,13 @@
1
factorial = fun(n) {
2
- if n == 0 then 1
+ if n == 0 then return = 1
3
n * factorial(n - 1)
4
}
5
-println(factorial(5)) # Outputs 120
+
6
+timeBefore = millis()
+factorial(998)
+timeAfter = millis()
+time = timeAfter - timeBefore
+println(time)
fibonacci = fun(n) {
if n <= 1 then return = n
0 commit comments