Computer Chess Club Archives


Search

Terms

Messages

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

Author: Tom Kerrigan

Date: 18:03:41 09/21/01

Go up one level in this thread


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.

-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.