*** empty log message ***

diff --git a/TODO b/TODO
index 2cad83db50a5ff85491d4b61a72697ff48c74b2a..bf0a2c54665da5f7990303b640f3fa09f3bd7cd7 100644 (file)
--- a/TODO
+++ b/TODO
@@ -123,3 +123,8 @@ sort: Investigate better sorting algorithms; see Knuth vol. 3.
   algorithm to try next should be merge insertion.  See Knuth section
   5.3.1, who credits Lester Ford, Jr. and Selmer Johnson, American
   Mathematical Monthly 66 (1959), 387-389.
   algorithm to try next should be merge insertion.  See Knuth section
   5.3.1, who credits Lester Ford, Jr. and Selmer Johnson, American
   Mathematical Monthly 66 (1959), 387-389.

+
+Document the exit status of each and every program.
+  Suggestion from Dan Jacobson.
+  The sentence or two describing the common case must appear just once,
+  and then it must be made to appear in the 70+ places where it's needed.