in reply to Re: Changing Perl's sort Default
in thread Changing Perl's sort Default
Can anybody ellaborate on this statement by Ovid. This small side note is interesting to me and i want to know more. I'm always interested in speeding up perl.
"As a small side note, be aware that providing a block or subroutine to the sort function will automatically slow down its performance as is will no longer be relying on straight C code to perform the sort. Naturally, I rarely feel it's necessary to consider this issue, but it's nice to know"
Why is it not straight C code? What is it?
Does this apply to any subroutine, or is 'sort' a special case?
Also, does the same issue hold true under mod_perl?
This reminds me of the rumor i heard that case non-sensitive pattern matching is particularly slow (/foo/i). Any ideas on how i could find out more about perl syntax and speed?
"As a small side note, be aware that providing a block or subroutine to the sort function will automatically slow down its performance as is will no longer be relying on straight C code to perform the sort. Naturally, I rarely feel it's necessary to consider this issue, but it's nice to know"
|
---|
Replies are listed 'Best First'. | |
---|---|
Re: Re: Re: Changing Perl's sort Default
by chromatic (Archbishop) on Oct 23, 2002 at 05:01 UTC |
In Section
Seekers of Perl Wisdom