Date: Tue, 14 Mar 1995 16:49:09 -0800 (PST) From: Poul-Henning Kamp <phk@ref.tfs.com> To: joerg_wunsch@uriah.heep.sax.de Cc: freebsd-hackers@FreeBSD.org Subject: Re: SCSI ASC-ASCQ descriptions Message-ID: <199503150049.QAA05186@ref.tfs.com> In-Reply-To: <199503142355.AAA01220@uriah.heep.sax.de> from "J Wunsch" at Mar 15, 95 00:55:38 am
next in thread | previous in thread | raw e-mail | index | archive | help
> As Peter Dufault wrote: > > > > > I'm really tempted to make a program to do this... :) > > > > Yes, I thought of that too. I even went through the effort of seeing > > how many unique words there are (about 300). > > > > If you had a clever way of finding "good overlap" I think you > > could cut the size in half or more. > > Well, in this case, even a rather simple compression scheme will do > it. Find the most common words, and -- since they consist only of > ASCII characters -- assign them ``abbrevations'' in the range of 0x80 > and up. Why bother, gzip the thing in it's entirety and use the inflate() which is in the kernel to uncompress it into a malloc'ed area, get the string you want, and free again... -- Poul-Henning Kamp <phk@login.dknet.dk> -- TRW Financial Systems, Inc. 'All relevant people are pertinent' && 'All rude people are impertinent' => 'no rude people are relevant'
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199503150049.QAA05186>