Commit graph

11 commits

Author SHA1 Message Date
Edwin Groothuis
ba5e62bd93 SHA256ify
Approved by:	krion@
2006-01-22 06:58:31 +00:00
Marcus Alves Grando
b36e3063ca Update to 2.02
PR:		88380
Submitted by:	Matthias Andree <matthias.andree@gmx.de> (maintainer)
2005-11-02 01:39:34 +00:00
Jean-Yves Lefort
c1ec024edd - Update to 2.01 [1]
- Unsilence post-install

[1]
PR:		ports/82773
Submitted by:	Vsevolod Stakhov <vsevolod@highsecure.ru>
2005-06-29 19:31:48 +00:00
Florent Thoumie
a05984b2ea - Add lzo2, version 2.00 of archivers/lzo.
PR:		ports/81721
Submitted by:	Ports Fury
Repocopy by:	marcus
2005-06-06 21:46:49 +00:00
Florent Thoumie
ed71e2f70d - Backout latest commit, it needs a repocopy due to API change.
Noticed by:	Matthias Andree <matthias.andree@gmx.de>
2005-05-31 19:41:12 +00:00
Florent Thoumie
584a54b90d - Update to 2.0.
PR:		ports/81721
Submitted by:	Ports Fury
2005-05-31 17:55:48 +00:00
Trevor Johnson
e8d5605043 Add SIZE. 2004-01-27 20:51:07 +00:00
Anders Nordby
03341938ce Update to 1.08.
PR:		40547
Submitted by:	Oliver Braun <obraun@informatik.unibw-muenchen.de>
2002-07-14 10:44:08 +00:00
Kris Kennaway
ea23296290 Upgrade to lzo 1.07
Obtained from:	OpenBSD
2000-11-19 08:13:14 +00:00
Chris Piazza
6cb33ca6e0 Update to version 1.06
Submitted by:	Chris D. Faulhaber <jedgar@fxp.org>
PR:		15214
1999-12-04 23:40:27 +00:00
Bill Fumerola
7b0fb2d55b from pkg/DESCR
--------------
     LZO is a data compression library which is suitable for data
     de-/compression in real-time. This means it favours speed over
     compression ratio.

     LZO implements a number of algorithms with the following features:
        + Decompression is simple and *very* fast.
        + Requires no memory for decompression.
        + Compression is pretty fast.
        + Requires 64 kB of memory for compression.
        + Allows you to dial up extra compression at a speed cost in the
          compressor. The speed of the decompressor is not reduced.
        + Includes compression levels for generating pre-compressed data
          which achieve a quite competitive compression ratio.
        + There is also a compression level which needs only 8 kB for
          compression.
        + Algorithm is thread safe.
        + Algorithm is lossless.

 Author: Markus Franz Xaver Johannes Oberhumer
         markus.oberhumer@jk.uni-linz.ac.at
         http://www.infosys.tuwien.ac.at/Staff/lux/marco
----------
1998-12-01 23:11:12 +00:00