Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re^2: using hashes

by R56 (Acolyte)
on Sep 26, 2013 at 15:53 UTC ( #1055857=note: print w/ replies, xml ) Need Help??

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

Thanks Kenneth, I understand your code, but I may have more than one name in the same line, such as:





So we couldn't use that kind of cycling on the array positions, right? Or am I missing something?

Comment on Re^2: using hashes
Replies are listed 'Best First'.
Re^3: using hashes
by AnomalousMonk (Abbot) on Sep 26, 2013 at 16:17 UTC
    ... am I missing something?

    You're missing what BrowserUk said here, an approach that processes an entire line at a time.

    The next part to think about is what happens if you encounter a 'word' in a line that doesn't exist in your translation hash, e.g., the line
    (hints: exists, next, maybe  // (defined-or) or  ?: (ternary/conditional operator) – see perlop for the latter two).

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (11)
As of 2015-08-31 14:55 GMT
Find Nodes?
    Voting Booth?

    The oldest computer book still on my shelves (or on my digital media) is ...

    Results (358 votes), past polls