Vadim Antonov's Grail
Tue, 5 Jan 1999 14:35:02 -0800
On Tue, Jan 05, 1999 at 09:45:54PM +0100, Laurent Martelli wrote:
> 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 ones.
Sure, you can simulate unordered collections to the requesting
software, however, if you have to based unordered collections on
ordered collections, then you will never be able to have a
code-optimizer/run-time which takes advantage of the unordered nature
of the collection.
Only by allowing the low-level description to be 'implication free'
can you optimize based on the high-level requirements.
David Jeske (N9LCA) + http://www.chat.net/~jeske/ + firstname.lastname@example.org