On Tue, 6 Jul 2004, Bryan O'Donoghue wrote:
> What about declaring the function inline ?
> inline void LIST_LOOP(list_t * L, list_t ** N){
> assert(L);
> * N=L->head;
> for(; *N ;*N=*N->next)
> return;
> }
Isnt that kind of pointless? It'll spin through the list and return
with N in the caller pointing at the list tail. (to which this
particular list implementation already maintains a reference to
anyway. :) )
regards,
--
Paul Jakma paul at clubi.iepaul at jakma.org Key ID: 64A2FF6A
warning: do not ever send email to spam at dishone.st
Fortune:
Gumperson's Law:
The probability of a given event occurring is inversely
proportional to its desirability.
Maintained by the ILUG website team. The aim of Linux.ie is to
support and help commercial and private users of Linux in Ireland. You can
display ILUG news in your own webpages, read backend
information to find out how. Networking services kindly provided by HEAnet, server kindly donated by
Dell. Linux is a trademark of Linus Torvalds,
used with permission. No penguins were harmed in the production or maintenance
of this highly praised website. Looking for the
Indian Linux Users' Group? Try here. If you've read all this and aren't a lawyer: you should be!