Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re: count sort & output

by VSarkiss (Monsignor)
on Dec 19, 2002 at 03:30 UTC ( [id://221033]=note: print w/replies, xml ) Need Help??

in reply to count sort & output

Your questions are very vague, on the order of "How do I make my froboz do a wingle without linking the thingamabob?" It's impossible to do everything you ask for with just a hash, so please fill in the picture. Adding some details will go a long way -- look in the Tutorials section for How to ask a question.

As to the specific question you asked, hashes are not sorted, by nature, unless you impose a sort operation on the keys or values. You can use Tie::IxHash, for example, to do something like you're implying in your item 2. The other two items require code besides just the hash.

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://221033]
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others scrutinizing the Monastery: (3)
As of 2024-07-17 20:23 GMT
Find Nodes?
    Voting Booth?

    No recent polls found

    erzuuli‥ 🛈The London Perl and Raku Workshop takes place on 26th Oct 2024. If your company depends on Perl, please consider sponsoring and/or attending.