[Date Prev][Date Next][Thread Prev][Thread Next]
- Subject: Re: New LuaJIT benchmark results (was Re: [ANN] LuaJIT-2.0.0-beta3)
- From: Peter Cawley <lua@...>
- Date: Tue, 9 Mar 2010 22:36:13 +0000
On Tue, Mar 9, 2010 at 10:02 PM, Mike Pall <firstname.lastname@example.org> wrote:
>> what's the story with the binary-trees benchmark? Is it a GC
>> thing, a recursive thing or is it a bad benchmark?
> It's mainly a GC benchmark and only incidentally uses recursion.
Is it acceptable to use to inside-out structures strategy for the
benchmark, and hence implement each object as entries in three tables,
rather than each object being a table containing three entries?