Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Sort::Key::Multi example

by benizi (Hermit)
on Dec 02, 2007 at 21:09 UTC ( #654449=note: print w/replies, xml ) Need Help??


in reply to Sort::Key::Multi example

In response to your surprise, see also:

In general, as re´terated in most "Why is the Schwartzian Transform slower?!" nodes, often by the man himself, the ST only saves time when the keys to be compared for sorting are expensive to compute. In this case, comparing two pairs of numerical array items is a very fast operation (compared to, say, fetching an item from a database or disk).

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (3)
As of 2022-08-12 03:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?