On Fri, 14 Feb 2003 15:56:25 -0500, Dan Sugalski wrote:
> I got clarification. The sequence is:
>
> 1) Search for method of the matching name in inheritance tree
> 2) if #1 fails, search for an AUTOLOAD
> 3) if #2 fails (or all AUTOLOADs give up) then do MM dispatch
Shouldn't we be traversing the inheritance tree once, doing these three
steps at each node until one works, rather doing each step once for the
whole tree. MM dispatch probably complicates this, though.
If my derived class has an autoloaded method which overrides the base class'
method, I don't want the base class method to be called, just because parrot
does things in a peculiar order. Well, I know it's the same order that perl5
does things, but it's still peculiar.
--
Peter Haworth [EMAIL PROTECTED]
"I'm converting my data to 64-bit signed times, stored big-endian in 8 bytes,
followed by 8 bytes for nanoseconds and attoseconds just in case. This won't
last for more than a few hundred billion years, but neither will the Sun, and
in any case I plan to throw a big programming party on 1 January 2000000001
to upgrade to 128 bits." -- Dan J. Bernstein
