This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: PCH, and more generally C++ parser performance
- To: Mark Mitchell <mark at codesourcery dot com>
- Subject: Re: PCH, and more generally C++ parser performance
- From: Daniel Berlin <dan at cgsoftware dot com>
- Date: Thu, 24 Aug 2000 22:24:05 -0700 (PDT)
- cc: zack at wolery dot cumb dot org, gcc at gcc dot gnu dot org
> Zack> Obviously that was worse.
>
> I tried it too, using radix-sort (which has better asymptotic
> complexity that qsort, although not necessarily better wall-clock
> time), but I couldn't get a win, even on a case that was causing heavy
> paging. I think I just blew it somehow -- it should help.
Actually, since we are sorting integers, we can do it in n log log n with
nilsson's algorithm.
http://www.nada.kth.se/~snilsson/public/code/nloglogn.c
If you look on his page, and A. Andersson's, they have papers on
implementing radix sort well.
Andersson's page is at http://www.csd.uu.se/~arnea