🚀 go-pugleaf

I've been idly interested in Modula-2 for a little while, especially
since I admire the author of the decwrl compiler (Michael Powell) as
a fellow of fine judgement in these matters.  However, given the
length of discussion required to solve the rather trivial problem of
string comparison, I'm very concerned!  Perhaps I will delay the
plunge into strongly typed languages a little longer, and save some
wear and tear on my keyboard.

I'll close with a re-implementation of the UNIX(TM) library classic strcmp,
which assumes NUL-termination for every string, and does not attempt to
keep around a separate "length" field.

/*
 * Return greater than, equal to, or less than 0 depending on whether
 * s is greater than, equal to, or less than t.
 */
strcmp(s, t)
	register char *s, *t;
{
	while (*s++ == *t)
		if (*t++ == 0)
			return 0;
	return *--s - *t;
}


S.

(TM) UNIX is a trademark of my cat.