Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re^5: Is this the most elegant way to code directory lookup? (!unless)

by tye (Sage)
on Sep 29, 2006 at 17:13 UTC ( [id://575575]=note: print w/replies, xml ) Need Help??


in reply to Re^4: Is this the most elegant way to code directory lookup? (!unless)
in thread Is this the most elegant way to code directory lookup?

No, of course not. I was going back to the original code (obviously). I'm sure you know how to transform the made-up code in a similar manner (especially since you used the term for it) even though you didn't do it originally. But I didn't find that made-up code much good in illustrating whether something is easy to understand (since the code has no real point so how can I say I've understood it).

This is why I usually respond to you anonymously, because you seem to have a very hard time examining what I say instead of the fact that I am the one who said it. It certainly seems to work out better that way, in my experience, and is my best guess at explaining why you felt that "appeal to ridicule" was appropriate. I certainly had no intent to ridicule. But I'll not spend more time trying to convince you of this as previous such attempts have resulted in you feeling more ridiculed. I'll just continue to mostly avoid attaching my name to replies to you in order to avoid this particular problem. Cheers.

- tye        

  • Comment on Re^5: Is this the most elegant way to code directory lookup? (!unless)

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others goofing around in the Monastery: (1)
As of 2024-04-24 16:59 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found