From: porton@ex-code.com (Victor Porton)
Subject: Re: fastest data structure
Date: Wed, 11 Dec 2002 03:12:33 +0500
Date: 2002-12-10T22:13:02+00:00 [thread overview]
Message-ID: <3df666ee$0$303$bed64819@news.gradwell.net> (raw)
In-Reply-To: at5kmf$3ia$1@news-reader12.wanadoo.fr
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).
next prev parent reply other threads:[~2002-12-10 22:12 UTC|newest]
Thread overview: 13+ messages / expand[flat|nested] mbox.gz Atom feed top
2002-12-10 21:01 fastest data structure Etienne Baudin
2002-12-10 22:12 ` Victor Porton [this message]
2002-12-11 1:14 ` Jeffrey Carter
2002-12-11 3:23 ` SteveD
2002-12-11 13:03 ` Marin David Condic
2002-12-11 15:02 ` Etienne Baudin
2002-12-11 15:11 ` Lutz Donnerhacke
2002-12-11 19:04 ` tmoran
2002-12-12 4:22 ` SteveD
2002-12-12 12:40 ` P R Keeble
2002-12-14 16:23 ` Simon Wright
2002-12-17 0:33 ` Randy Brukardt
-- strict thread matches above, loose matches on Subject: below --
2002-12-10 21:51 Gautier direct_replies_not_read
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox