Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!iuvax!bsu-cs!dhesi From: dhesi@bsu-cs.bsu.edu (Rahul Dhesi) Newsgroups: comp.binaries.ibm.pc.d Subject: Re: lharc algorithm (was Re: Final Vote Tally/Summary) Message-ID: <6698@bsu-cs.bsu.edu> Date: 11 Apr 89 02:45:26 GMT References: <19456@iuvax.cs.indiana.edu> Reply-To: dhesi@bsu-cs.bsu.edu (Rahul Dhesi) Organization: CS Dept, Ball St U, Muncie, Indiana Lines: 23 In article <19456@iuvax.cs.indiana.edu> bobmon@iuvax.cs.indiana.edu (RAMontante) writes: >Rahul mentioned that the compression code in zoo was a couple of hundred >lines out of the total. I'd like to see a next-generation archiver with >zoo's versatility and lharc's compression (viewing it as the current >high-water mark). That should yield the portability "for free", as it were. (Actually about 600 lines out of 9000.) A steady stream of inquiries about this has begun to trickle in. To stall the deluge, I therefore hereby announce that lharc's lzhuff algorithm *will* be incorporated into zoo. The new zoo will create archives with lzhuff compression that will have a different filename suffix, but it will also optionally create archives (filename suffix .zoo) extractable by earlier versions of zoo. The change must come to all implementations of zoo (currently System V/4.xBSD/Xenix, VAX/VMS, Atari/ST, AmigaDOS, MS-DOS, OS-9, OS/2), so I need to handle this with great care. Please avoid speculating about the time frame, as I am not sure myself. -- Rahul Dhesi UUCP: ...!{iuvax,pur-ee}!bsu-cs!dhesi