luau/bench/gc/test_BinaryTree.lua

56 lines
1.3 KiB
Lua
Raw Normal View History

local bench = script and require(script.Parent.bench_support) or pcall(require, "bench_support") or require("../bench_support")
function test()
-- The Computer Language Benchmarks Game
-- http://benchmarksgame.alioth.debian.org/
-- contributed by Mike Pall
local function BottomUpTree(item, depth)
if depth > 0 then
local i = item + item
depth = depth - 1
local left, right = BottomUpTree(i-1, depth), BottomUpTree(i, depth)
return { item, left, right }
else
return { item }
end
end
local function ItemCheck(tree)
if tree[2] then
return tree[1] + ItemCheck(tree[2]) - ItemCheck(tree[3])
else
return tree[1]
end
end
local N = 10
local mindepth = 4
local maxdepth = mindepth + 2
if maxdepth < N then maxdepth = N end
local ts0 = os.clock()
do
local stretchdepth = maxdepth + 1
local stretchtree = BottomUpTree(0, stretchdepth)
end
local longlivedtree = BottomUpTree(0, maxdepth)
for depth=mindepth,maxdepth,2 do
local iterations = 2 ^ (maxdepth - depth + mindepth)
local check = 0
for i=1,iterations do
check = check + ItemCheck(BottomUpTree(1, depth)) +
ItemCheck(BottomUpTree(-1, depth))
end
end
local ts1 = os.clock()
return ts1 - ts0
end
bench.runCode(test, "BinaryTree")