mirror of
https://github.com/wren-lang/wren.git
synced 2026-01-15 16:18:04 +01:00
9df6aa2f8a
This fixes the nasty case where "foo(bar)" is context-sensitive, and generally simplifies the compiler a lot since there is a clear distinction between lexical and dynamic scope. Also: - Remove the special handling of capitalized names since all names are lexical now. - Allow methods to close over local variables in enclosing functions. - Allow implicit definition of all lexical names.
52 lines
1.1 KiB
Plaintext
52 lines
1.1 KiB
Plaintext
// Ported from the Python version.
|
|
|
|
class Tree {
|
|
construct new(item, depth) {
|
|
_item = item
|
|
if (depth > 0) {
|
|
var item2 = item + item
|
|
depth = depth - 1
|
|
_left = Tree.new(item2 - 1, depth)
|
|
_right = Tree.new(item2, depth)
|
|
}
|
|
}
|
|
|
|
check() {
|
|
if (_left == null) return _item
|
|
return _item + _left.check() - _right.check()
|
|
}
|
|
}
|
|
|
|
var minDepth = 4
|
|
var maxDepth = 12
|
|
var stretchDepth = maxDepth + 1
|
|
|
|
var start = System.clock
|
|
|
|
System.print("stretch tree of depth %(stretchDepth) check: " +
|
|
"%(Tree.new(0, stretchDepth).check())")
|
|
|
|
var longLivedTree = Tree.new(0, maxDepth)
|
|
|
|
// iterations = 2 ** maxDepth
|
|
var iterations = 1
|
|
for (d in 0...maxDepth) {
|
|
iterations = iterations * 2
|
|
}
|
|
|
|
var depth = minDepth
|
|
while (depth < stretchDepth) {
|
|
var check = 0
|
|
for (i in 1..iterations) {
|
|
check = check + Tree.new(i, depth).check() + Tree.new(-i, depth).check()
|
|
}
|
|
|
|
System.print("%(iterations * 2) trees of depth %(depth) check: %(check)")
|
|
iterations = iterations / 4
|
|
depth = depth + 2
|
|
}
|
|
|
|
System.print(
|
|
"long lived tree of depth %(maxDepth) check: %(longLivedTree.check())")
|
|
System.print("elapsed: %(System.clock - start)")
|