fastest data structure

["Etienne Baudin" <pfoxNO@SPAMfree.fr>]

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"

with these definitions
    A : array (integer range <>) of My_Type
vs
    type ptr is access cell
    type cell is record
        comp : My_Type;
        next : ptr;
    end record;

for i in A'range loop
    processing A(i)
end loop;

while (p != null) loop
    process p.comp;
    p := p.next;
end loop;

Which of the loops is supposed to be the fastest ? Each of the loop should
run between 1000 and 10_000 times (faces of a 3d object) many (60 expected)
times per sec, that's why I try to get the best performances.

Thanks
Etienne Baudin