retoor/wren
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

feat: remove JS benchmarks and reduce depth for faster binary_trees/fib runs

Browse Source 
Switch binary_trees max depth from 14 to 12 across all languages and reduce fib argument from 30 to 28, dropping JS entirely since its performance is incomparable. Update expected output patterns in run_bench script to match new tab-free format and use best-time comparison instead of mean.
This commit is contained in:
Bob Nystrom
2013-12-13 00:59:57 +00:00
parent 5e62b5856e
commit 8842efbab7
12 changed files with 82 additions and 175 deletions
Download Patch File Download Diff File Expand all files Collapse all files
benchmark/binary_trees.py
+4 -4
View File
@@ -18,11 +18,11 @@ def check_tree((item, left, right)):
return item + check_tree(left) - check_tree(right)
min_depth = 4
max_depth = max(min_depth + 2, 14)
max_depth = 12
stretch_depth = max_depth + 1
start = time.clock()
print "stretch tree of depth %d\t check:" % stretch_depth, check_tree(make_tree(0, stretch_depth))
print "stretch tree of depth %d check:" % stretch_depth, check_tree(make_tree(0, stretch_depth))
long_lived_tree = make_tree(0, max_depth)
@@ -33,8 +33,8 @@ for depth in xrange(min_depth, stretch_depth, 2):
for i in xrange(1, iterations + 1):
check += check_tree(make_tree(i, depth)) + check_tree(make_tree(-i, depth))
print "%d\t trees of depth %d\t check:" % (iterations * 2, depth), check
print "%d trees of depth %d check:" % (iterations * 2, depth), check
iterations /= 4
print "long lived tree of depth %d\t check:" % max_depth, check_tree(long_lived_tree)
print "long lived tree of depth %d check:" % max_depth, check_tree(long_lived_tree)
print("elapsed: " + str(time.clock() - start))