in reply to hash 2 array ?

If your hash is static, how about 
$hash{$_} = { content => $hash{$_}, position => $i++ } for sort keys %
+hash;

[download]
Hope it works for you. Cheers,
CombatSquirrel.
Entropy is the tendency of everything going to hell.

Replies are listed 'Best First'.
Re: Re: hash 2 array ?
by liz (Monsignor) on Sep 15, 2003 at 12:44 UTC
    That would use a lot of memory. If I would need something like: 
    $hash{$_} = { content => $hash{$_}, position => $i++ } for sort keys %
+hash;

    [download]
    I would do it like this: 
    $hash{$_} = pack( 'N',$i++).$hash{$_} for sort keys %hash;

    [download]
    in other words, prefix the ordinal number packed at the beginning of the string. Then, when you either need the linenumber and/or the original string, use unpack: 
    my ($line,$string) = unpack( 'Na*',$hash{$key} );

    [download]
    Liz
[reply]
[d/l]
[select]
      Wouldn't this kill any chance of using leading digits in keys ({ '34' => 'thirty four' })? And take a significant runtime hit to pack and unpack accordingly?

      Tie::IxHash is already done. Does this not serve the purposes required?

      --
      [ e d @ h a l l e y . c c ]

[reply]
[d/l]
        Eh... I added a packed ordinal number to the value of each hash entry. Doesn't have anything to do with keys. And yes, you will have a runtime hit, but only if you need to sort (when you need the ordinal number) and/or obtain the (real) value of the hash entry.

        Again, my solution optimizes for memory usage. Not CPU. YMMV.

        With regards to Tie::IxHash: that's a fine module, but may be doing (a lot) more than you want. And don't forget the inherit CPU hit for using a tied hash. Finally, TIMTOWTDI. ;-)

        Liz

[reply]

In Section Seekers of Perl Wisdom