home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
OS/2 Spezial
/
SPEZIAL2_97.zip
/
SPEZIAL2_97.iso
/
ANWEND
/
PACKER
/
X1OS295A
/
x1discla.uk
< prev
next >
Wrap
Text File
|
1997-05-03
|
26KB
|
530 lines
-------------------------------------------------------------------------------
DOCUMENT TYPE : X1 DISCLAIMER
LANGUAGE : ENGLISH
TEXT TYPE : NON-FORMATTED ASCII
CHARACTER SET : LOWER 128 ASCII CHARACTERS
PROGRAM VERSION DESCRIBED : -
LAST UPDATE (YEAR MONTH DAY): 970503
LAST UPDATE NOTE : PRELIMINARY TEXT -- LATER CHANGES MAY OCCUR
TYPED BY : STIG VALENTINI
OTHER DOCUMENTS : X1 NEWS,
X1 USER MANUAL,
-------------------------------------------------------------------------------
==============
= OVERVIEW =
==============
1. Preface
2. Acknowledgements
3. Trademarks
4. Disclaimers
1. Preface
==========
This file contains the stuff, which you're encouraged to read before doing
anything else - but probably won't end up reading more than once. It has
little or none to do with the actual use of the program - but provides me
with the possibility to express my gratitude to people who has helped me
The disclaimer furthermore allows setting up legal safeguards to protect all
parties.
2. Acknowledgements
====================
A personal thanks to the following people:
------------------------------------------
Tycho Fruru (Belgium): tested the archiver intensively, suggested changes
and corrected the Dutch commandline messages. Thanks!
Sven Verdoolaege (Belgium): tested and did document proof reading.
Porting to Linux. Provided significantly help with bugfixes, enrolling
documentation into YODL/postscript - and made valuable suggestions about a
GUI solution.
Christophe Vallat: who has really made outstanding assembler optimizations
- which I have not yet integrated into the code - because I've been somewhat
occupied at other sides (excuse for being lazy:). You've been a real friend!
Thanks.
P. Lai: Thanks for bug-testing and encouragement. Turned spotlight on
compatibility with weird archives versions such as UNIX-LHA...
G.D.Flint: Testing of all methods - Investigating all methods with the same
energy - allowing location of errors in less efficient (boring) methods...
Thanks!
Jeff Gilchrist and Jonathan Burt
Who make archiver benchmark tests - providing increased competition among
the archivers - resulting in improved products for everybody. Their lists
attempt to measure true archiver performance - enabling people to find one,
which best fits individual requirements (putting aside the often repeated
"I'm the the best" statements from various sides). And with an ever
increasing number of archivers, this is a significant help. Keep up the good
work guys!!
Charles Bloom - who has been helping a lot of people on the internet.
Porting
-------
Linux port - maintained by Sven Verdoolaege (x1linux@breughel.ufsia.ac.be).
Language translators
---------------------
Tycho Fruru - translated msg_help.c (screen messages) into dutch
Juan Lupion - translated x1user,x1disclaim,msg_help.c into spanish
Charlie Negyesi - translated msg_help.c (screen messages) into Hungarian
Davide Moretti - translated x1user,x1disclaim,msg_help.c into italian
Babolin Daniele - translated x1user into italian (7bit ascii)
Heikki Paatela - translated x1user,x1disclaim,msg_help.c into finnish
Wolfgang Gurtler - translated x1user,x1disclaim into german
Sebastien Guilbaud translated x1user into french
A warm thanks to all these great guys, who really made an effort!!!
Others (including some which I have never had contact with)
------------------------------------------------------------
Charles Scheffold and Thomas Pytel - authors of "PMODE/W" (copyrighted (c)
1995, all rights reserved...e-mail: daredevi@dorsai.dorsai.org and
y28si@cunyvm.cuny.edu). As this project is strictly non-commercial, then
their DOS extender was used (freely) in this DOS executable.
Peter Gutmann - allowing me to use some multi-lingual messages from the
HPACK language module (my Polish was rather poor..).
John G. Cleary * Ian H. Witten * Alistair Moffat * J. Ziv * Paul G. Howard *
P. Elias * D. E. Knuth * G. G. Langdon * D. A. Huffman * Peter M. Fenwick *
Marcelo J. Weinberger * R. G. Gallager * W. B. Pennebaker * R. F. Rice *
A. Lempel * J. S. Vitter * Jorma J. Rissanen * Ronald B. Arps * W. J. Teahan
...who provided so many interesting articles - with hints to things that just
HAD! to implemented :-)
Haruhiko Okumura * Haruyasu Yoshizaki * Harri Hirvola * Rahul Dhesi *
Robert and Susan Jung * Kai Uwe Rommel * Serg Babitchew * Dean W. Cooper *
Mark Adler * J. Rollason * Harald Feldmann * Nico de Vries * P.Sawatzki *
John Ross * Kazuhiko Miki * Ken Masuyama * Klaus Peter Nischke * J. Y. Lim *
Richard B. Wales * Jean-Loup Gailly * Michael A. Kosior * Mike Davenport *
Andy McFadden * Jim Miller * Eugene Roshal * Milen Georgiev * Phil Katz *
Jonas I Hammarberg * Igor Mandrichenko * Alexander Shurna * Charles Bloom *
Sergio Leone * Sergio Corbucci * Ennio Morricone * Jerry Goldsmith
(did I forget somebody?) ...who provided valuable sources or inspired
(or something else).
3. Trademarks
=============
In the following, 'trademark' may mean either TM or (R).
Trademarks of other companies mentioned anywhere appear for identification
purposes only and are the property of their respective companies.
4DOS is copyrighted by JP Software
ARC is a trademark of System Enhancement Associates, Inc.
ARJ is a trademark of Robert K Jung and Susan Jung
(ARJ=(A)rchiver by (R)obert (J)ung)
ARX, ARX FAST! are trademarks of Michael A. Kosier
Amiga is a trademark of Commodore Business Machines (liquidated)
ArcMaster is a trademark of New-Ware
Archimedes is a trademark of Acorn Computers
Borland C, Turbo C, Borland C++, Turbo C++,
are trademarks of Borland Inc.
CP/M, CP/M-80 and CP/M 2.2
are trademarks of (Intergalactic) Digital Research
CompatiCard is a trademark of MicroSolutions, Inc.
GIF is a trademark of Compuserve Inc.
HA is a trademark of Harri Hirvola (HA=(H)irvola (A)rchiver)
Hamarsoft, Hap TM and Pah TM
are trademarks by Harald Feldmann
High-C is a trademark of Metaware
IBM, IBM PC, PC-XT, PC-AT, PC-DOS and OS/2
are trademarks of International Business Machines Corp.
Intel,Pentium are a trademark of Intel Corp.
MS-DOS is a trademark of Microsoft Corp.
Macintosh,PowerMac are trademarks of Apple Computer Inc.
Motorola is a trademark of Motorola Corp.
NDOS is a trademark of Symantec Corp.
Netware and Novell are trademarks of Novell, Inc.
RAR is a trademark of Eugene Roshal
PAK is a trademark of NoGate Consulting Inc.
PKWARE, PKZIP, PKUNZIP, and PKSFX
are trademarks of PKWARE, Inc. (PK=(P)hil (K)atz)
Prime, Primos are trademarks of Prime Computer Corp.
QNX is a trademark of <I don't know>
Rolemaster is a trademark of Iron Crown Enterprises Inc.
Stacker is a trademark of Stacker Electronics
StuffIt is a trademark of Raymond Lau and Aladdin Systems
StupenDOS is a trademark of Eclipse Technologies, Inc.
Sun is a trademark of Sun Microsystems Co.
Ultracompressor, UltraCompressor 2, Ultracrypt, UltraSafe
are trademarks of AIP-NL (Ad Infinitum Programs)
ThinkC is a trademark of Symantec Corporation
UNIX is both a trademark and a footnote of AT&T
Watcom C is a trademark of Watcom International Corp.
WEB is a trademark of WEB Technologies (Smyrna, GA)
Windows is a trademark of Microsoft Corp.
4. Disclaimers
==============
*DISCLAIMER OF INTERESTS*
ONLY THE HELP FROM DEVOTED INDIVIDIDUALS HAS BEEN ACCEPTED DURING THE
DEVELOPMENT OF THIS PROGRAM. NO DISCOUNTS TO PRODUCTS OR SERVICES ASSOCIATED
WITH A FEE HAS BEEN PROVIDED BY ANY BUSINESS, COMMERCIAL OR GOVERNMENT
INSTITUTIONS. THIS PROGRAM OWES NO OBLIGATIONS TO ENDORSE ANY PRODUCTS OR
CONCEPTS IN ANY RESPECT. SOME FRIENDLY PEOPLE HAVE PLAYED A VITAL PART IN THE
CREATION OF THIS PROGRAM AND RIGHTFULLY DESERVE A LOT OF CREDIT ON INDIVIDUAL
BASIS.
*DISCLAIMER OF OPINIONS*
ALL IDEAS AND OPINIONS, EITHER EXPRESSED OR IMPLIED, OCCURRING IN TEXT FORM
OR MANIFESTED BY ACTION, WHETHER ACTUALLY PRESENT OR EXPRESSED BY THEIR
ABSENCE, SHOULD ONLY BE ASSOCIATED WITH THE COPYRIGHT HOLDER. THEY REPRESENT
NO OFFICIAL ATTITUDE OR POLICY BY ANY BUSINESS, COMMERCIAL OR GOVERNMENT
INSTITUTION INCLUDING, BUT NOT LIMITED TO UNIVERSITIES.
*DISCLAIMER OF WARRANTY*
THE PROGRAM IS PROVIDED "AS IS" WITHOUT WARRANTY OF ANY KIND TO THE EXTENT
PERMITTED BY APPLICABLE LAW, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT
LIMITED TO THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
PURPOSE, FUNCTIONALITY OR DATA INTEGRITY.
*DISCLAIMER OF DAMAGE RESPONSABILITY*
THE ENTIRE RISK AS TO THE ACTIONS OF THE PROGRAM IS WITH THE USER. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE ENTIRE COST FOR ALL NECESSARY
SERVICING, REPAIR OR CORRECTION. IN NO EVENT WILL THE ORIGINAL COPYRIGHT
HOLDER BE LIABLE TO YOU FOR ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL
DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM WHETHER OR NOT
DUE TO ANY DEFECTS THEREIN, EVEN IF THE ORIGINAL COPYRIGHT HOLDER HAVE BEEN
ADVISED OF THE POSSIBILITY OF SUCH DAMAGES, INCLUDING, BUT NOT LIMITED TO,
LOST PROFITS, LOST SAVINGS, LOSSES SUSTAINED BY YOU THROUGH THIRD PARTIES,
LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR A FAILURE OF THE PROGRAM TO
OPERATE WITH ANY OTHER PROGRAMS OR ANY CLAIM BY ANY OTHER PARTY. THE USER
ALSO ASSUMES THE ENTIRE RESPONSIBILITY TO CHECK THAT THIS IS NOT A FAKED
RELEASE FROM A THIRD PARTY AND THAT IT DOES NOT CONTAIN ANY FORM OF VIRUS.
*COPYRIGHT*
THE PROGRAM AND ITS DOCUMENTATION ARE COPYRIGHTED BY THE ORIGINAL
PROGRAMMER/AUTHOR (COPYRIGHT HOLDER). ALL RIGHTS ARE RESERVED - ALSO
CONCERNING FUTURE CHANGES OF THE NAME AND CONTENTS OF THIS DISTRIBUTION
PACKAGE. NO CHANGES MUST BE MADE FOR ANY REASONS AT ANY TIME BY ANYBODY IN
ANY ASPECT, INCLUDING, BUT NOT LIMITED TO, MODIFICATION OF THE COPYRIGHT
NOTICE OR CHANGES OF THE COMPILED BINARIES HEREBY ALTERING THE ORIGINALLY
INTENDED PROGRAM EXECUTION FLOW.
*DISTRIBUTION CONDITIONS*
THE DISTRIBUTION OF THIS PACKAGE IS TO BE LIMITED IN THE WAY THAT IT MUST ONLY
BE DISTRIBUTED IN ITS WHOLE COMPLETE FORM AS ORIGINALLY SUBMITTED BY THE
COPYRIGHT HOLDER AND NO FEE MUST BE REQUESTED FOR THE PROGRAM FOR ANY REASONS
AT ANY TIME BY ANYBODY IN ANY ASPECT. THE ONLY CHARGE ALLOWED IN CONNECTION
WITH THIS PACKAGE SHOULD BE FOR TRANSMITTING SERVICES ONLY AND THE RECEIVER
MUST BE MADE FULLY AWARE OF THIS. IN NO WAY MAY THIS PROGRAM BE DISTRIBUTED
WITH A COMMERCIAL PROGRAM SO THAT IT MAY APPEAR TO BE MADE BY SOMEBODY OTHER
THAN THE COPYRIGHT HOLDER, USED AS A PROMOTION FOR ANY COMMERCIAL VENTURE OR
AS AN ENTICEMENT FOR THE USER TO PAY FOR ANY PROGRAM, PRODUCT, OR SERVICE
UNLESS EXPRESS (SIGNED) WRITTEN PERMISSION FROM THE COPYRIGHT HOLDER HAS BEEN
OBTAINED.
THIS PROGRAM MAY BE DISTRIBUTED ROYALTY-FREE WITH A COMMERCIAL PROGRAM
PROVIDED THAT THE TERMS ABOVE ARE FOLLOWED (ALL FILES PRESENT IN ORIGINAL
FORM, ETC.) AND THAT A CLEARLY VISIBLE NOTE STATES THAT:
(1) THE TERMS FOR THE COMMERCIAL PROGRAM DOESN'T APPLY TO THIS PROGRAM
(DOESN'T SUPERSEDE/INVALIDATE ANY TERMS STATED HERE FOR THIS PROGRAM).
(2) THE COPYRIGHT HOLDER OF THIS PROGRAM IS IN NO WAY ASSOCIATED WITH THE
COMMERCIAL PRODUCT OR THE COMPANY IN QUESTION.
(3) THE COPYRIGHT HOLDER OF THIS PROGRAM RECEIVED NO FORM OF PAYMENT OR
BENEFITS IN ANY WAY AS A RESULT OF THE CONNECTION.
THE LATTER REQUEST IS NECESSARY IN ORDER TO PREVENT POSSIBLE TAX DEMANDS FROM
AUTHORITIES.
*USER RESTRICTIONS*
TO USE THIS PACKAGE YOU MUST ACKNOWLEDGE TO HAVE READ THIS AGREEMENT,
UNDERSTAND IT, AND AGREE TO BE BOUND BY ITS TERMS AND CONDITIONS. YOU MUST
FURTHER ACCEPT THAT THIS SUPERSEDES ALL PROPOSALS OR PRIOR AGREEMENTS, ORAL
OR WRITTEN, AND ALL OTHER COMMUNICATIONS BETWEEN YOU AND THE ORIGINAL
COPYRIGHT HOLDER RELATING TO THE SUBJECT MATTER OF THIS AGREEMENT. ANY FUTURE
DEVIATIONS FROM THE STATED TERMS REQUIRES THE PRIOR (SIGNED) WRITTEN CONSENT
OF THE COPYRIGHT HOLDER. PLEASE NOTICE THAT THE TERMS HERE IS INTENDED FOR
THIS DISTRIBUTION PACKAGE ONLY. THEY DO NOT COVER FUTURE VERSIONS OF THIS
PROGRAM OR OTHER WORKS FROM THE COPYRIGHT HOLDER.
===============================================================================
>>>>> TRANSLATORS NOTICE: you need not translate the rest of this text. <<<<<
>>>>> Your efforts should rather be put into translating the user doc. <<<<<
>>>>> This section is likely to undergo further changes - and the <<<<<
>>>>> pointers often require knowledge of english if pursued further. <<<<<
===============================================================================
PPMZ DISCLAIMER
I, Stig Valentini, hereby declare publicly, that a program distributed by me,
refered to as "X1", contain parts of the source code in a package - known as
"PPMZ". The source parts was obtained in august, 1996 from the personal
homepage of mr. Charles Bloom:
http://wwwvms.utexas.edu/~cbloom/src/indexppm.html
with e-mail address:
cbloom@mail.utexas.edu
The source obtained was notified to be covered by the "BPL" licence. A
copy of that licence is appended at the end.
Use of the mentioned source parts comply with the licence in the following
points:
1) "PPMZ" is distributed as a copyrighted product by mr. Charles Bloom and
the terms stated are not over-ridden by any agreements between me and
mr. Charles Bloom.
2) By hereby informing the public ("recipient") about the use of the source,
I conform to point 2 in the licence.
3) "X1" is distributed under terms "Use and distribute freely in original
submitted form. No selling for profit". I (Stig Valentini) have not
received any payment or commercial benefits at any point as a result of my
engagement in the "X1" project. So "X1" should be covered by the category
3c in the "BPL" licence. Considering that "X1" is distributed as a "beta"
product with experimental status, it may also be covered by category 3b in
the licence.
4) "PPMZ" is distributed by mr. Charles Bloom and thus categorized as
"BPL code". By viewing disclosed ideas in the source code, I make
myself a "user". "X1" becomes a "user application", when I either use
source code or ideas from the licenced package.
5) Let it be known, that I haven't tried to sell "BPL" code at any point
- have absolute no intentions to do so - and have currently no knowledge
of anybody attempting such actions (in which case I'll immediately inform
mr. Charles Bloom).
6) I comply to this rule by requesting that this message is always distributed
with the binary executable files (above: "..freely in original submitted
form"). Mr. Charles Bloom did not explicitly specify that a notice had to
be issued one or more times during execution of the binary files - leading
me to conclude, that this text resolves the displaying requirements.
7) By stating the fact that "X1" is using a method "derived" from a subsection
of files in "PPMZ", it should be clear that the current implementation in
no way tries to represent "PPMZ".
8) No charge is required for the use of "X1" - as prevously explained.
Anybody showing up on my doorstep with an empty disk (now 3.5" format too
- thanks to Christophe Vallat, midraptor@infonie.fr !!! who read this) will
be issued a free version of "X1" !!! If I have to pay for the uploading, I
reserve the right to decline (though I usually e-mail people versions
anyway). So this should deal with part 8 of the licence.
9) I'm not associated to AmiNet - and should not be covered by the permission
to distribute any "BPL code". I certainly don't publish CD-ROMS either
- so this issue probably isn't relevant for me.
10) "X1" does not appear in my mind as a "for-sale user application".
Thus informing mr. Charles Bloom should be an act of courtesy rather than
a legal consequence of this licence.
11) I'm fully aware, that "Shareware" is different from "Freeware".
As described over and over again, "X1" should fall into the category of
"Freeware" rather than "Shareware".
12) I hereby write off all rights to complain about anything in the "PPMZ"
source code. I have completely accepted it "AS IS".
13) I accept that ".. publishing this code on a newsgroup, or on the web
constitutes a fully legal publication with all protections and rights
implied therein.". Mr. Charles Bloom should be credited as the originator
of "PPMZ" - and should not be held accountable for lacking performance
appearing in my modified version.
end of "BPL" validation.
>>>>>>>> "BPL" licence terms, from mr. Charles Bloom <<<<<<<<<<
The Bloom Public License (BPL)
1. the BPL applies to all software distributed by myself in
any way, unless explicitly over-ridden by another
agreement.
2. If you distribute code covered by the BPL you MUST notify
the recipient. All modified versions and re-distributions
of 'BPL code' are still covered by the BPL.
3. BRIEF :
A. usage which is legal under the GNU Public License is
also legal under the BPL
B. usage for academic or research or curiousity purposes
is allowed
C. usage in strictly Free programs is allowed
D. for usage which is in any way commercial, see below:
4. definitions :
"BPL code" is any source code covered by the BPL - i.e. all
source code distributed by Charles Bloom or any other
"user" is someone using software or source code covered by the BPL
"user application" is any program or source code or document
which contains (modified or not) BPL code. Note that this
also includes suites of programs, if any program in the suite
contains BPL code.
5. BPL code may not be sold in any form.
6. user applications must publicly display the fact that they
contain BPL code, and provide easily accessible reference
to the author of that code (name,email,etc.). Wherever
the full credits for the user application are shown, the
credits for the BPL code must also be shown.
7. user applications must in no way mis-represent the fact that
they are not doing the job which is done by the BPL code.
8. user applications must not charge for functionality contained
in BPL code used. For example, direct sale of BPL code is
prohibited by the above clause unless it is sold for $0.00
users may not charge "distribution fees" for BPL code.
9. AmiNet is explicitly permitted to distribute BPL code in
any way it chooses (i.e. CD-ROMs)
10. The author of the BPL code must be notified prior to using
any BPL code in a for-sale user application. The author
of the BPL code has veto power over any and everything in
this document.
11. Shareware is not Freeware
12. There are no warranties or anything like that. The author
has no responsiblity for the behavior of BPL code. Use As Is.
12. The author implies that publishing this code on a newsgroup, or
on the web constitutes a fully legal publication with all
protections and rights implied therein.
===============================================================================
PATENT DISCLAIMER
Let it be known, no deliberate attempt is being made to violate patented
material. I'm in no way on a crusade against the patent system - so don't get
me wrong - but...
The field of data compression algorithm patents is very unclear. Most court
cases deals with piracy of source code rather than piracy of theoretical
algorithms. To make matters worse, people keep patenting overlapping
algorithms and mathematical functions - over and over again - even though it
shouldn't be possible. All this makes it hard to pinpoint valid patents that
should hold up in courts (work according to the original intentions of the
patent system).
But as long as no money is involved here, I hope people will be patient if it
turns out after all, I've stepped on a toe somewhere.
===============================================================================
ASSOCIATIVE CODER DISCLAIMER
George M. Buynowski (george@acb.alma-ata.su) was the first person to launch
the term ``associative coder''. Although I disagree with claims that all the
underlying techniques were totally new, George combined them to a level
of perfection, that was really outstanding. Mr. Peter Fenwick
(peter-f@cs.auckland.ac.nz) supposedly put together a presentation paper.
My own modified algorithm should in no way represent the method as proposed
by George - or try to take any credit, rightfully deserved by George. I only
use the term ``associative coder'' in order to confine the implementaion to a
familier class of coders.
It should be known, that I've talked a lot with George on a personal level
and know him as an extremely intelligent and friendly person - indeed a
rare combination of qualities in our world:) He has been looking for an
attractive job opportunity for some time - possibly in the USA (he has tried
working in joint ventures). I really hope things work out for him, and that
he gets, what he's looking for - and certainly qualifies for!
===============================================================================
BLOCK CODER DISCLAIMER
I derived my block coder from a source 'bred.c' (unknown origin) - appearently
distributed by David Wheeler (e-mail address unknown to me). Used word-
sorting techniques. But if people would take a minute or two to actually
realize memory requirements and speed of my modified block coder, it should be
obvious - even from the *lowest* point of view - that I've made so many changes
to the algorithm itself, that it differs significantly from the 'word-sorting'
presented in 'bred.c'. It constitutes something - if not unique - then
atleast interesting enough to justify an independant existence.
Needless to say that I don't want to take any credit from M. Burrows, D.J
Wheeler or anybody else.
===============================================================================
PPM DISCLAIMER
I've learned a lot from looking at the ``HA'' source code by Harri Hirvola
(harri.hirvola@vaisala.infonet.com). Some of the tricks were really!
brilliant. Hirvola perhaps didn't always have in mind, how a compiler
translates ``C'' code to assembler and consequently didn't always lay out the
``C'' instructions with greatest effect. On the creative side, his work was
really outstanding.
I've never contacted Harri Hirvola, but might use this opportunity to
publicly express my gratitude for disclosing ``HA'' source code. This - and
Haruhiko Okumura releasing LZSS/AR002 source - and Haruyasu Yoshizaki
releasing the LHARC source - were equally significant occurrences in my point
of view. But I've looked at the Ashford compressor too - and it's not so bad
either.
The significance of these coders should not be underestimated. No matter
how many arcticles are made available, practical tricks like fx. scaling
cannot be ignored - and can be difficult to implement right. For PPM, it's
really THE SMALL DETAILS THAT MAKE THE DIFFERENCE!
The most important benefit from looking at these sources is probably the
why-didn't-they-do-that effect. Lacking sufficient comments in the source code,
the viewer is left guessing about some of the problematic spots. And when the
actual functionality becomes obvious, better alternatives are usually
present in the viewers mind. That's usually the case on all levels of
understanding (algorithm, data structures, probability estimators, efficient
calculations,..).
Source was also available for HPACK (Peter Gutmann) and played a significant
role for me (multi-language orientation). Somehow the archiver had all the
right ``moves'' - but still failed to gain broad attention from non-workstation
people. It was exceptionally portable - but still fairly traditional as far as
performance and command possiblities were concerned. Its crypto system was
very impressive at the time (Peter later accelerated into that direction). I
contaced Peter to make sure I could lean up at some of the translations - and
was allowed that. But by now, most of the messages have been changed by other
translators.
I'll never forget these guys - and it's probably not possible to credit them
to the extent they really deserves.
===============================================================================
Stig Valentini, x1develop@dk-online.dk
===============================================================================