From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,effb80d4bb7716dd X-Google-Attributes: gid103376,public From: robert_dewar@my-dejanews.com Subject: Re: Pointer Arithmetic (was: Wanted: Ada STL....) Date: 1999/02/03 Message-ID: <798e2m$d8e$1@nnrp1.dejanews.com>#1/1 X-Deja-AN: 440012190 References: <790f4q$3l@bgtnsc01.worldnet.att.net> <797na3$obg$1@nnrp1.dejanews.com> X-Http-Proxy: 1.0 x10.dejanews.com:80 (Squid/1.1.22) for client 205.232.38.14 Organization: Deja News - The Leader in Internet Discussion X-Article-Creation-Date: Wed Feb 03 02:59:39 1999 GMT Newsgroups: comp.lang.ada X-Http-User-Agent: Mozilla/4.04 [en] (OS/2; I) Date: 1999-02-03T00:00:00+00:00 List-Id: In article <797na3$obg$1@nnrp1.dejanews.com>, adam@irvine.com wrote: > Pointer arithmetic can be efficient when you're trying to > step through an array, since you don't have to keep > multiplying an index by a constant value to access the > array elements. Please don't guess at something like this without looking at generated code. Any half-way decent compiler will be able to strength reduce these multiplications in a typical loop and produce code that is EXACTLY as efficient as the low level encoding in C, if not more efficient, depending on the machine. -----------== Posted via Deja News, The Discussion Network ==---------- http://www.dejanews.com/ Search, Read, Discuss, or Start Your Own