Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!unmvax!ncar!boulder!pikes!udenva!isis!nbires!maa
From: maa@nbires.nbi.com (Mark Armbrust)
Newsgroups: comp.arch
Subject: Re: Endian wars
Summary: Apology to the world
Message-ID: <219@nbires.nbi.com>
Date: 2 Feb 89 16:01:23 GMT
References: <6133@columbia.edu> <5124@aldebaran.UUCP> <7@microsoft.UUCP> <213@nbires.nbi.com> <38@microsoft.UUCP>
Reply-To: maa@nbires.UUCP (Mark Armbrust)
Distribution: na
Organization: NBI Inc, Boulder CO
Lines: 17

In article <38@microsoft.UUCP> w-colinp@microsoft.uucp (Colin Plumb) writes:
>maa@nbires.UUCP (Mark Armbrust) wrote:
>> Seems to me that the following would be a bit faster: 
>> 
>> [some blatently WRONG code deleted.]
>
>But won't work.  Consider "\1\2\4\8".

Like I said in the original posting; I should have learned by now not to post
when the brain is misfiring due to 'flu.

As for string length limits and count preceeded string, I prefer using two
one-word values: one that is fixed at allocation time and gives the maximum
size string that can be held by this string, and one that gives the current
size of the string.

Mark