Beefy Boxes and Bandwidth Generously Provided by pair Networks Bob
We don't bite newbies here... much
 
PerlMonks  

Re: Re: Complex Sort - using varying numbers of parameters

by RMGir (Prior)
on Jul 04, 2002 at 08:46 UTC ( [id://179447]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to Re: Complex Sort - using varying numbers of parameters
in thread Complex Sort - using varying numbers of parameters

The problem with doing it this way is that you're going to be running "my_sort" many many times, introducing a lot of overhead.

That's what the Schwartzian Transform, GRT, or Orcish Maneuvre save you from; they only compute each key once.

George_Sherston's original solution also avoided recomputing keys unnecessarily, by storing them in ->{Sort} beforehand.
--
Mike

  • Comment on Re: Re: Complex Sort - using varying numbers of parameters

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://179447]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.