Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^3: Schwartzian Transform and memory allocation.

by flounder99 (Friar)
on Jun 20, 2002 at 13:41 UTC ( #176009=note: print w/ replies, xml ) Need Help??


in reply to Re^2: Schwartzian Transform and memory allocation.
in thread Schwartzian Transform and memory allocation.

I think the

sort { $a->[$variable-1] cmp $b->[$variable-1] },

line should be

sort { $a->[$variable] cmp $b->[$variable] },

The -1 was added by abigail to skip over the $_ that was tacked on at the beginning of the anon array. You're no longer doing that.

--

flounder


Comment on Re^3: Schwartzian Transform and memory allocation.
Select or Download Code
Re^4: Schwartzian Transform and memory allocation.
by Aristotle (Chancellor) on Jun 20, 2002 at 22:53 UTC
    No, actually, Abigail added the -1 because there was no longer an extra element to skip over. It doesn't make sense to subtract 1 to skip over an extra element, does it? The same premise holds true in my snippet as well.

    Makeshifts last the longest.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (12)
As of 2014-07-29 18:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (226 votes), past polls