Computer Chess Club Archives


Search

Terms

Messages

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

Author: Dann Corbit

Date: 19:23:38 09/21/01

Go up one level in this thread


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.

In general, it's a bad idea.  But if it happens to be a bottleneck, it can be a
big help.



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.