Re: processing time & stack overflow!!!
Re: processing time & stack overflow!!!
- Subject: Re: processing time & stack overflow!!!
- From: Arthur J Knapp <email@hidden>
- Date: Fri, 31 Aug 2001 11:30:26 -0400
>
Date: Fri, 31 Aug 2001 08:03:05 -0400
>
From: Victor Yee <email@hidden>
>
Subject: Re: processing time & stack overflow!!!
>
On Fri, 31 Aug 2001 04:24:15 -0400, monk wrote,
>
>
> can you explain/share to/with us what you did to
>
> make the script go from an average of 12 minutes to (on my machine) 12
>
> seconds
>
I basically did what Arthur was telling us to do:
>
>
1. use his handler ;)
>
2. use a reference to the reallyBigList
Oh, do go on...
>
So, using Arthur's handler reduced that overhead from thousands of repetitions
>
to just one (he's a smart guy).
But what do you really think about me?
>
In any case, all thanks for the improved performance of the "cross cutting"
>
script should go to Arthur (hey, he really is a smart guy! ;)
Thank you, Victor, but I have a confession to make: it was all the
work of Ray Robertson...
(just trying to beat Shane and Nigel to the punch) ;-)
Actually, the AppleScript Language Guide, (version 1.3.7 ???),
discussed the speed improvements possible via use of the "a ref to"
operator:
<
http://developer.apple.com/techpubs/macos8/InterproCom/AppleScriptScripters
/AppleScriptLangGuide/>
The ASLG is highly recommended reading for everyone.
The randomizing routine is my "port" of an algorithm I found in Robert
Sedgwicks's "Algorithms in C". He was showing how to implement hash arrays,
and it occured to me that the hashing technique could easily be modified to
created "random" index positions.
Arthur J. Knapp
http://www.stellarvisions.com
mailto:email@hidden
Hey, check out:
http://www.seanet.com/~jonpugh/