Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re^8: using hashes

by R56 (Acolyte)
on Sep 27, 2013 at 17:48 UTC ( #1056050=note: print w/ replies, xml ) Need Help??

in reply to Re^7: using hashes
in thread iterating hash keys?

Imagine these values:

banana => 25

bana => 20

bana-na => 15

na => 10

For the translation to, let's say:


Currently the output is:


That's what made me thought the hyphens were a special case...

Comment on Re^8: using hashes
Replies are listed 'Best First'.
Re^9: using hashes
by kennethk (Abbot) on Sep 27, 2013 at 21:26 UTC

    No, but they are being marked as word boundaries, and so they pass the regex I gave before. For the situation you've described, the only obvious solution I can see is to traverse the key list from long to short as I've shown in Re^5: using hashes. Things get messy with replacement lists when your keys are not independent.

    #11929 First ask yourself `How would I do this without a computer?' Then have the computer do it the same way.

      I see... Thanks again!

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (11)
As of 2015-10-09 09:17 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (237 votes), past polls