Vadim Antonov's Grail
06 Jan 1999 09:44:51 +0100
>>>>> "David" == David Jeske <firstname.lastname@example.org> writes:
David> On Tue, Jan 05, 1999 at 09:45:54PM +0100, Laurent Martelli
>> This seems to be a consequence of the underlying physical
>> memory that is used. But anyway, since every access to data
>> structures are done via a function call, you can simulate
>> unordered collections even if they are implemented via ordered
David> Sure, you can simulate unordered collections to the
David> requesting software, however, if you have to based
David> unordered collections on ordered collections, then you will
David> never be able to have a code-optimizer/run-time which takes
David> advantage of the unordered nature of the collection.
I'm sorry, but I think that having an order does not prevent you from
applying optimizations that do not require any order.
ANyway, how would you implement an unordered collection on today's
hardware, without having any hidden order ?