I assume we decided that BSD sort isn't fast enough to warrant replacing
the native qsort.
---------------------------------------------------------------------------
Mark Kirkwood wrote:
> Mike Castle wrote:
>
> >First I added a counter to the compare function, and the most cases, the
> >glibc implementation was called significantly less often than the BSD
> >compare function.
> >
> >
> Interesting - all examples I tried had glibc compare count higher, do
> you want to post one of yours?
>
> >In a simple test function, like comparing two ints, then yes, the BSD
> >implementation was faster. But in a more complex function, say comparing
> >strings, often times the glibc version was faster. Why? Because the
> >time spent in the compare function became the overwhelming factor.
> >
> >
> Considering strings is a good point - I went away and tried some
> examples, unfortunately I only managed to see BSD faster, but the
> difference was not as large as in the integer tests.
>
>
> regards
>
> Mark
>
>
> ---------------------------(end of broadcast)---------------------------
> TIP 6: Have you searched our list archives?
>
> http://archives.postgresql.org
>
--
Bruce Momjian | http://candle.pha.pa.us
pgman@candle.pha.pa.us | (610) 359-1001
+ If your life is a hard drive, | 13 Roberts Road
+ Christ can be your backup. | Newtown Square, Pennsylvania 19073
