Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: Foreach hash of array

by Fletch (Chancellor)
on Aug 05, 2008 at 15:19 UTC ( #702390=note: print w/replies, xml ) Need Help??


in reply to Foreach hash of array

Maybe if you post the same terribly worded question yet a third time then you'll get an answer. I mean don't bother reading How (Not) To Ask A Question or giving a cogent description of what you're actually trying to do, next time just post the data structure you've got followed by a "?" and you'll surely get help then. Third time's a charm, they say.

The cake is a lie.
The cake is a lie.
The cake is a lie.

Replies are listed 'Best First'.
Re^2: Foreach hash of array
by TGI (Parson) on Aug 05, 2008 at 17:30 UTC

    Ironically, the first post was better. It contained a statement of a goal, "to find the child keys of 'Orange'". The goal was not clearly defined however.

    A third post may be reminiscent of the final scene in the Vincent Price version of The Fly and consist of only the words "Help me".


    TGI says moo

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (7)
As of 2018-11-14 18:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My code is most likely broken because:
















    Results (176 votes). Check out past polls.

    Notices?