Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^2: Foreach Loops

by spurperl (Priest)
on Mar 16, 2005 at 10:58 UTC ( #439901=note: print w/ replies, xml ) Need Help??


in reply to Re: Foreach Loops
in thread Foreach Loops

Such a get_index_of operator would be inefficient, hence it doesn't make much sense for Perl to have it.

Think about it - an array is a linear structure meant specifically for random-access of index->element. To find the index of some element you will either have to go through the array looking for the element - this is O(N). You can have more time-efficient algorithms at the cost of space, like having a "mirror" hash of element->index.

As for your original problem, I also sometimes feel a little itch when I have to give up foreach once access to elements other-than-the-current is required.


Comment on Re^2: Foreach Loops

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (4)
As of 2014-07-29 03:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (211 votes), past polls