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

Re: Re: Re: Why Doesn't each() DWIM?

by jepri (Parson)
on May 27, 2004 at 21:34 UTC ( [id://357064]=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Why Doesn't each() DWIM?
in thread Why Doesn't each() DWIM?

Is there a technical reason why that piece of DWIMmery would be considered harmful at some edge case?

I can think of one. Whether it is right or not is another matter :)

There would be times when you wanted to return to your position in the hash. If the iterator (or hashkey pointer) was reset everytime the program left a control loop, you would have to save it in a variable and then restore it each time you went into another control structure.

I don't see this as being a bad thing - other languages do it like this. I also don't know why it wasn't done this way rather than the way it currently is.

Having said that, I have found this to be a problem before, but some careful data structure design worked around it just fine.

____________________
Jeremy
I didn't believe in evil until I dated it.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others chilling in the Monastery: (2)
As of 2024-04-26 00:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found