Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: when a & is faster than a && ?

Author: Tom Kerrigan

Date: 18:12:58 09/22/01

Go up one level in this thread


On September 21, 2001 at 22:23:38, Dann Corbit wrote:

>On September 21, 2001 at 21:03:41, Tom Kerrigan wrote:
>
>>On September 20, 2001 at 18:24:07, Antonio Dieguez wrote:
>>
>>>can you tell me?
>>>
>>>thanks.
>>
>>Should give you the same performance for straightforward situations. Processors
>>and compilers are optimized so that these cute little tricks are not necessary
>>to get good performance.
>
>Ought to, perhaps.  But in real life, it does not always work out that way.
>
>But I have seen a program speed up by 1/3 by application of a chummy hack like
>that.

Do you still have the details about this 1/3 speedup? Might be interesting to
look at those. I'm sure whoever manufactured the compiler would find it
interesting, too. :)

-Tom



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.