Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ukma!husc6!cs.utexas.edu!bryan
From: bryan@cs.utexas.edu (Bryan Bayerdorffer @ Wit's End)
Newsgroups: comp.sys.amiga
Subject: Re: New version of Zoo for the Amiga
Message-ID: <325@mohawk.cs.utexas.edu>
Date: 5 Apr 89 06:37:41 GMT
References: <12312@louie.udel.EDU>
Reply-To: bryan@cs.utexas.edu
Organization: Spam Detection & Removal Squad, Austin, TX
Lines: 29
Spam-Content: Negligible

In article <12312@louie.udel.EDU> 451061%UOTTAWA.BITNET@cornellc.cit.cornell.edu (Valentin Pepelea) writes:
=-"J. Brian Waters" <jbwaters@bsu-cs.uucp> writes in message <6465@bsu-cs.UUCP>
=-
=-> The new release of zoo will be out in a few more days for the Amiga and will
=-> have some of the following features:
=->
=->  a) it will preserve the archive bit on all files at extraction
=->     (after all if it got into a zoo it must have been archived at one
=->     time)
=->
=->  b)  it features a much improved compression and decompression routine
=->      utilizing many new tricks I have learned such as using the
=->      upper 8 bits of an address register as a data tag,  and self
=->      modifying code.  The use of move ccr,<ea> also helps.
=-
=-No, no, no, no! You are definitely not allowed to use the upper 8 bits of an
=-address register to store data. 32-bit systems are using all 32 bits
=-to access memory. And don't used self-modifying code either, that will not work

	You know, what really scares me is that none of the people who have
fallen for this silliness have objected to a).  Think about it.

 ______________________________________________________________________________ 
/_____/_____/_____/_____/_____/_____/_____/_____/_____/_____/_____/_____/_____/
|_____|_____|_____|_____|_____|_____|_____|_____|_____|_____|_____|_____|_____|
_No dark sarcasm in the classroom|_____|_____|_____|_____|_____|_____|_____|___
|____Teachers leave the kids alone__|_____|_____|_____|_bryan@cs.utexas.edu___|
___|_____|_____|_____|_____|_____|_____|{vertebrae...}!cs.utexas.edu!bryan_|___
|_____|_____|_____|_____|_____|_____|_____|_____|_____|_____|_____|_____|_____|