Re: Method call optimization.

[Chaim Frenkel]

>>>>> "NI" == Nick Ing-Simmons <[EMAIL PROTECTED]> writes:

NI> If it has to be static then name => index has to be global across all classes
NI> as ISA tree adds leaves and reconverges.

Run this one by me again. Why isn't it enough to have the integers depend
only on the _current_ @ISA? So it would be per package.

NI> Op could have a static name and lookup in a hash ;-)

True. But a pointer+offset is probably a bit faster.

>> You seem to think that that's not feasible. 

NI> See my earlier summary - static index is possible if mapping is global,
NI> then vtable is sparse.

vtbl would be compact. The values can be precomputed.

How about for static @ISA and static ->method calls, compile time and
for really hairy Tk type systems, we stick with dynamic hash lookups
and a hash.

I'd imagine that the static case would be more prevelent. And making
the dynamic version take a hit.

<chaim>
-- 
Chaim Frenkel                                        Nonlinear Knowledge, Inc.
[EMAIL PROTECTED]                                               +1-718-236-0183