document mingw linker fix and close associated bug

[debian/gzip] / TODO

diff --git a/TODO b/TODO
index b3eac977332d5704b6e1dc5a94027c3a0829d469..4ea88d83e768045783af7e19e29910cddfd61b4a 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,27 +1,11 @@
 TODO file for gzip.
 
-       Copyright (C) 1999, 2001 Free Software Foundation, Inc.
-       Copyright (C) 1992, 1993 Jean-loup Gailly
-
-       This file is part of gzip (GNU zip).
-
-       gzip is free software; you can redistribute it and/or modify
-       it under the terms of the GNU General Public License as published by
-       the Free Software Foundation; either version 2, or (at your option)
-       any later version.
-
-       gzip is distributed in the hope that it will be useful,
-       but WITHOUT ANY WARRANTY; without even the implied warranty of
-       MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-       GNU General Public License for more details.
-
-       You should have received a copy of the GNU General Public License
-       along with tar; see the file COPYING.  If not, write to
-       the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-       Boston, MA 02111-1307, USA.
+Some of the planned features include:
 
+- Remove some of the old porting cruft, since we no longer support it.
 
-Some of the planned features include:
+- Separate out the shell scripts like gzexe into a new little package;
+  these scripts are less used and less reliable and should be optional.
 
 - Internationalize by using gettext and setlocale.
 
@@ -47,16 +31,14 @@ Some of the planned features include:
   should be done in chunks to reduce memory usage.)
 
 - Add a super-fast compression method, suitable for implementing
-  file systems with transparent compression. One problem is that the
-  best candidate (lzrw1) is patented twice (Waterworth 4,701,745
-  and Gibson & Graybill 5,049,881). The lzrw series of algorithms
-  are available by ftp in ftp.adelaide.edu.au:/pub/compression/lzrw*.
+  file systems with transparent compression. The lzrw series of algorithms
+  are available at http://www.ross.net/compression/.
 
 - Add a super-tight (but slow) compression method, suitable for long
-  term archives.  One problem is that the best versions of arithmetic
-  coding are patented (4,286,256 4,295,125 4,463,342 4,467,317
-  4,633,490 4,652,856 4,891,643 4,905,297 4,935,882 4,973,961
-  5,023,611 5,025,258).
+  term archives.  See, for example, US Patents 4,286,256 4,295,125
+  4,463,342 4,467,317 4,633,490 4,652,856 4,891,643 4,905,297
+  4,935,882 4,973,961 5,023,611 5,025,258, which have all expired.
+  More recent patent-free techniques may also be available.
 
   Note: I will introduce new compression methods only if they are
   significantly better in either speed or compression ratio than the
@@ -75,11 +57,24 @@ Some of the planned features include:
 
   For one possible approach to this, please see:
 
-    http://www.samba.org/netfilter/diary/gzip.rsync.patch
+    https://ozlabs.org/~rusty/gzip.rsync.patch
 
 - Use a larger window size to deal with some large redundant files that
   'compress' currently handles better than gzip.
 
 - Implement the -e (encrypt) option.
-   
+
 Send comments to <bug-gzip@gnu.org>.
+
+
+========================================================================
+
+Copyright (C) 1999, 2001, 2006, 2009-2018 Free Software Foundation, Inc.
+Copyright (C) 1992, 1993 Jean-loup Gailly
+
+Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License, Version 1.3 or
+any later version published by the Free Software Foundation; with no
+Invariant Sections, with no Front-Cover Texts, and with no Back-Cover
+Texts.  A copy of the license is included in the ``GNU Free
+Documentation License'' file as part of this distribution.