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

Re^5: structuring data: aka walk first, grok later

by BrowserUk (Pope)
on Jun 06, 2008 at 01:46 UTC ( #690578=note: print w/ replies, xml ) Need Help??


in reply to Re^4: structuring data: aka walk first, grok later
in thread structuring data: aka walk first, grok later

I was told that each (x, y) pair is s/t

Great. An "s/t"!. Sorry. Trying to understand your problem has defeated me.

I think that may be your problem too. You cannot hope to solve a problem until you understand it. And one usually sure way of checking your understanding is to try and describe it to someone unfamiliar with the field.


Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.


Comment on Re^5: structuring data: aka walk first, grok later

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (8)
As of 2014-11-26 09:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (165 votes), past polls