|We don't bite newbies here... much|
Re^4: RFC:A brief tutorial on Perl's native sorting facilities.by BrowserUk (Pope)
|on Feb 06, 2007 at 17:46 UTC||Need Help??|
That's not always possible. Eg. if it's a list of objects ...
If the data is a list of objects to be sorted
And even if it's just a list of references to some data structures, by serialization and deserialization you end up with copies of the data structures.
I do not understand what you mean by this? In particular, the GRT never requires the keys to be "deserialised".
Whatever you put into the @keys array, has later to be compared using one of the standard comparison operators. With that being the case, using the GRT again avoids the need for callbacks and will be faster.
I realise that I am probably missing something here, but do you have any practical examples of when this indexed sort method with outperform a GRT?
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.