Ken Ray wrote:
On 2/8/05 1:31 PM, "Lynch, Jonathan" <[EMAIL PROTECTED]> wrote:
Is switch faster than if-then?
Is add 1 to X faster than put X+1 into X?
Jonathan, you should read up on the Scripting Tricks called "Increasing
Script Performance" by Wil Djikstra that I have posted on my site..
On Feb 8, 2005, at 12:49 PM, Frank D. Engel, Jr. wrote:
On Feb 8, 2005, at 2:31 PM, Lynch, Jonathan wrote:
Is add 1 to X faster than put X+1 into X?
Yes.
Over twice as fast.
And both are faster on 2.5 than 2.2.
Well, on my mac.
There is a subtle and exotic difference in meaning.
Dar
--
I will...
Thanks!
___
use-revolution mailing list
use-revolution@lists.runrev.com
http://lists.runrev.com/mailman/listinfo/use-revolution
On 2/8/05 1:31 PM, "Lynch, Jonathan" <[EMAIL PROTECTED]> wrote:
> Is switch faster than if-then?
> Is add 1 to X faster than put X+1 into X?
Jonathan, you should read up on the Scripting Tricks called "Increasing
Script Performance" by Wil Djikstra that I have posted on my site... they go
into th
Richard is too modest (or maybe just old and forgetful!) - he should
have mentioned '4W RevBench', his little gizmo that lets you compare
execution speeds of different coding approaches that produce the same
outcome.
Starting in the Rev menus and continuing in the stacks that will appear,
sele
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Feb 8, 2005, at 2:31 PM, Lynch, Jonathan wrote:
Is add 1 to X faster than put X+1 into X?
Yes.
- ---
Frank D. Engel, Jr. <[EMAIL PROTECTED]>
$ ln -s /usr/share/kjvbible /usr/manual
$ true | cat
Thanks Richard - it isn't really for a specific project, it is just for
learning good programming practices.
I was just thinking I would study up on those techniques that are best,
for situations where processing lots of information is required. We have
had a number of discussions about how to do
Lynch, Jonathan wrote:
Hello everyone,
What are the processes in Revolution that have been optimized to be very
fast? The following two examples are the ones that come to mind, but I
figure there must be quite a few of them.
- Match Text
- Repeat for each loop
MatchText is not necessarily fast, dep
Hello everyone,
What are the processes in Revolution that have been optimized to be very
fast? The following two examples are the ones that come to mind, but I
figure there must be quite a few of them.
- Match Text
- Repeat for each loop
Thanks,
Jonathan
___
