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.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,229a77b902096176
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-12-11 11:04:02 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!arclight.uoregon.edu!wn13feed!wn11feed!worldnet.att.net!204.127.198.203!attbi_feed3!attbi.com!sccrnsc02.POSTED!not-for-mail
From: tmoran@acm.org
Newsgroups: comp.lang.ada
Subject: Re: fastest data structure
References: <at7k2o$9fb$1@news-reader10.wanadoo.fr>
X-Newsreader: Tom's custom newsreader
Message-ID: <B_LJ9.318906$QZ.47476@sccrnsc02>
NNTP-Posting-Host: 12.234.13.56
X-Complaints-To: abuse@attbi.com
X-Trace: sccrnsc02 1039633441 12.234.13.56 (Wed, 11 Dec 2002 19:04:01 GMT)
NNTP-Posting-Date: Wed, 11 Dec 2002 19:04:01 GMT
Organization: AT&T Broadband
Date: Wed, 11 Dec 2002 19:04:01 GMT
Xref: archiver1.google.com comp.lang.ada:31703
Date: 2002-12-11T19:04:01+00:00
List-Id: <comp.lang.ada>

> running time seems depend on the record size....??
Perhaps the single element record is passed by copy in a register while
the larger records are passed by reference?  What are the speeds of
your memory (cache?) and CPU - the array may need a multiply of some
sort, while the pointer may need a memory reference.
  If this is actually significant in your application, perhaps you should
re-examine your algorithm and then code in hand-optimized assembly.