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-10 14:13:03 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!news.tele.dk!news.tele.dk!small.news.tele.dk!peer1.news.newnet.co.uk!news-peer.gradwell.net!not-for-mail
Newsgroups: comp.lang.ada
From: porton@ex-code.com (Victor Porton)
Date: Wed, 11 Dec 2002 03:12:33 +0500
References: <at5kmf$3ia$1@news-reader12.wanadoo.fr>
Organization: Extreme Code Software (http://ex-code.com)
Subject: Re: fastest data structure
Mime-Version: 1.0
X-Newsreader: knews 1.0b.1
Content-Type: text/plain; charset=us-ascii
X-URL: http://www.ex-code.com/
Message-ID: <3df666ee$0$303$bed64819@news.gradwell.net>
NNTP-Posting-Date: 10 Dec 2002 22:13:02 GMT
NNTP-Posting-Host: 195.149.39.13
X-Trace: 1039558382 news.gradwell.net 303 mail2news/195.149.39.13
X-Complaints-To: news-abuse@gradwell.net
Xref: archiver1.google.com comp.lang.ada:31657
Date: 2002-12-10T22:13:02+00:00
List-Id: <comp.lang.ada>

In article <at5kmf$3ia$1@news-reader12.wanadoo.fr>,
	"Etienne Baudin" <pfoxNO@SPAMfree.fr> writes:
> Hello,
> 
> I'd like to know which of these 2 data structures is the fastest to proceed
>:
> 
> an simple array of  "My_type" (My type is a record...)
> or a liked liste of  "My_Type"

[skip]

> for i in A'range loop
>     processing A(i)
> end loop;
> 
> while (p != null) loop
>     process p.comp;
>     p := p.next;
> end loop;

Depends on CPU and compiler.

IMO, the first is faster in most cases (may be in 95% of cases).