🚀 go-pugleaf

In article <486@danews.ATT.COM>, lvc@danews.ATT.COM (Larry Cipriani) writes:
> In article <15317@amdcad.UUCP>, rpw3@amdcad.UUCP (Rob Warnock) writes:
> > I find myself doing:
> > 	char *p = &buf[0];
> > 	int n;
> > 	strcpy(p, "piece");		p += strlen(p);
> > 	strcpy(p, "another piece");	p += strlen(p);
> > 	etc...
> It seems to me that the code would be far more readable and faster
> if it were written as:
> 	p = cat(p1, p2, ..., (char*)0);
> where all the p's are pointers to characters.  Cat will malloc
> enough space to store a concatenation of all the pn's and a '\0'.

Another possible solution would be:
	cat(p, n, p1, p2, ..., (char*)0);
Where p == destination string,  n == amount of space available,
p1 == the first pointer,  etc...

You might have two versions one with n, one without.  The debate is now
what it should return:
	1. pointer to the initial string.
	2. the number of characters cat()'ed.
	3. a pointer to the terminating null.