How hard do you think it would be to impliment this for squeak (native I 
mean, not in the JIT)?


>From: Jon Hylands <jon at huv.com>
>Reply-To: The general-purpose Squeak developers 
>list<squeak-dev at lists.squeakfoundation.org>
>To: The general-purpose Squeak developers 
>list<squeak-dev at lists.squeakfoundation.org>
>Subject: Re: Performance figures [Re: Idea for a possibly better 
>CollectionoccurrencesOf method]
>Date: Wed, 13 Sep 2006 13:43:38 -0400
>
>On Wed, 13 Sep 2006 18:10:30 +0200, "Klaus D. Witzel"
><klaus.witzel at cobss.com> wrote:
>
> > I doubt that a primitive implementation would show a significantly 
>better
> > factor, because the VM already is fast! and because in practice the
> > #to:do: intervals are usually smaller than in the above. The only
> > difference I saw in the bytecodes was related to the #to:do: and #value:
> > message send.
>
>The point of the #apply... primitive is so that all the enumeration methods
>run as fast as #to:do:, so you don't have to worry about trading off code
>clarity and re-use for performance.
>
>Later,
>Jon
>
>--------------------------------------------------------------
>    Jon Hylands      Jon at huv.com      http://www.huv.com/jon
>
>   Project: Micro Seeker (Micro Autonomous Underwater Vehicle)
>            http://www.huv.com
>