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

Re: Schwartzian Transform vs. Building Hash of Function Results, Then Sorting on Function Results

by merlyn (Sage)
on Oct 16, 2006 at 19:27 UTC ( #578578=note: print w/ replies, xml ) Need Help??


in reply to Schwartzian Transform vs. Building Hash of Function Results, Then Sorting on Function Results
in thread Schwartzian Transform

Consider sorting a list of objects that have a stringification overload and two of those objects stringify to the same string. With the ST, everything just works. With the hash method, the two objects collapse to the same hash entry.

-- Randal L. Schwartz, Perl hacker
Be sure to read my standard disclaimer if this is a reply.


Comment on Re: Schwartzian Transform vs. Building Hash of Function Results, Then Sorting on Function Results

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (8)
As of 2015-07-30 09:43 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (270 votes), past polls