|Just another Perl shrine|
Re: Re-orderable keyed access structure?by injunjoel (Priest)
|on Aug 15, 2004 at 00:20 UTC||Need Help??|
After much discussion with BrowserUK I realized I was barking up the wrong tree...
Of course I have not tested this (my BSD partition is mad at me presently). But I think the logic will satisfy your 3 requirements.
Just a quick note the my @ref_array illustrated above was meant to represent the original items mentioned in the original post. The [state,pointer] is in reference to another post in which the structure of the original items was explained...
my apologies for the confusion.
This is what I was talking about.
this way the key (0-2 in the example) is stored with the original data. that way you can always get the key of the index_hash from the element itself. The shuffling should not matter at that point.
"I do not feel obliged to believe that the same God who endowed us with sense, reason and intellect has intended us to forego their use." -Galileo