At 12:27 PM 10/3/00 -0500, Jarkko Hietaniemi wrote:
>Serializing an optree is rather tricky especially if one wants to
>deserialize it on a different platform. Because of icky things like
>structure padding one effectively really needs to go the way of
>*byte*codes which makes for one ssslllooowww VM.
Nah, it doesn't need to be that slow. There are a number of things we can
do to speed it up a bunch over the current way of doing things (which is
suboptimal). I don't see any reason why we shouldn't be able to
significantly speed up program loading, especially if we have async I/O
available.
Dan
--------------------------------------"it's like this"-------------------
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and even
teddy bears get drunk
- Re: data storage and representation when designing bytec... Dan Sugalski
- Re: data storage and representation when designing ... Nicholas Clark
- Re: data storage and representation when designing ... Jarkko Hietaniemi
- Re: data storage and representation when design... Dan Sugalski
- Re: data storage and representation when designing bytec... Nicholas Clark
- Re: data storage and representation when designing ... Jarkko Hietaniemi
- Re: data storage and representation when design... Nicholas Clark
- Re: data storage and representation when de... Dan Sugalski
- Re: data storage and representation whe... Nicholas Clark
- Re: data storage and representatio... Dan Sugalski
- Re: data storage and representation when design... Dan Sugalski
- Re: data storage and representation when de... Joshua N Pritikin
- Re: data storage and representation whe... Dan Sugalski
- Re: data storage and representation when designing ... Dan Sugalski
