If you want to accomplish that, either you must keep a journal file with your steps or you must use a different data structure, which keeps next to each element a sequence number on basis of which you can later retrieve and sort your steps.
Tie::HashHistory goes somewhat along that way, but I'm not sure if it can look into the anonymous arrays which are the values of your hash. At first glance it will only look one level deep.
CountZero
A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James
In reply to Re: retrieving hash keys
by CountZero
in thread retrieving hash keys
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |