From: Sam Smoot <ssmoot@...>
Date: 2006-12-08T23:50:10+09:00
Subject: Re: Rubinius interview with Evan Phoenix

Since we're kinda on the topic of implementation I've got a question:

Avi Bryant's article in response to JoelOnSoftware said you could get
method calls down to a jump and compare.

My impression is that MRI basically uses hashtables for method lookup.

Is it in the cards for Rubinius to receive the sort of optimizations
Avi was talking about? Is it reasonable to expect that an optimized
version of Rubinius could get method calls into the same performance
realm as c# or Java?

This way I suppose C-Extensions would be used more as bridges to
leverage existing libraries, and not for performance reasons.

Any thoughts?