in reply to Re^4: Re-orderable keyed access structure?
in thread Re-orderable keyed access structure?

OK, so if you need to be able to get from key to payload, but not from key to index, then how about:
------------ :Wq Not an editor command: Wq

Replies are listed 'Best First'.
Re^6: Re-orderable keyed access structure?
by BrowserUk (Patriarch) on Aug 14, 2004 at 04:39 UTC

    Yes. That will do it. And it's cheap to maintain. Thankyou.


    Examine what is said, not who speaks.
    "Efficiency is intelligent laziness." -David Dunham
    "Think for yourself!" - Abigail
    "Memory, processor, disk in that order on the hardware side. Algorithm, algorithm, algorithm on the code side." - tachyon
Re^6: Re-orderable keyed access structure?
by Aristotle (Chancellor) on Aug 14, 2004 at 05:09 UTC

    This is essentially the same as I proposed: a main data structure carrying the payload, and two auxiliary ones for bidirectionality — except you the bidirectionality in your setup is between the main and one auxiliary structure, while in mine it is between the two auxiliary structures. By doing it that there's no need for references at all.

    Makeshifts last the longest.

Re^6: Re-orderable keyed access structure?
by BrowserUk (Patriarch) on Aug 14, 2004 at 15:01 UTC

    I was premature in accepting this. Please see 382970 for the details.


    Examine what is said, not who speaks.
    "Efficiency is intelligent laziness." -David Dunham
    "Think for yourself!" - Abigail
    "Memory, processor, disk in that order on the hardware side. Algorithm, algorithm, algorithm on the code side." - tachyon