summaryrefslogtreecommitdiffstats
path: root/NEWS
diff options
context:
space:
mode:
authorGreg McGary <greg@mcgary.org>1997-04-18 06:32:28 +0000
committerGreg McGary <greg@mcgary.org>1997-04-18 06:32:28 +0000
commita0f7cb2db4c51a4a0fed37fde7f1992aec0cc9bb (patch)
tree71fa757f5a4f098864af027e41f3189b3613390f /NEWS
parent017635dde1deb6e6fb5b6ab83f0c73727f9eb49b (diff)
downloadidutils-a0f7cb2db4c51a4a0fed37fde7f1992aec0cc9bb.tar.gz
idutils-a0f7cb2db4c51a4a0fed37fde7f1992aec0cc9bb.tar.bz2
idutils-a0f7cb2db4c51a4a0fed37fde7f1992aec0cc9bb.zip
Initial revision
Diffstat (limited to 'NEWS')
-rw-r--r--NEWS25
1 files changed, 25 insertions, 0 deletions
diff --git a/NEWS b/NEWS
new file mode 100644
index 0000000..35f1200
--- /dev/null
+++ b/NEWS
@@ -0,0 +1,25 @@
+mkid NEWS - User visible changes.
+
+Version 3.0 - February 1995, by Greg McGary
+
+* mkid uses a new efficient algorithm for building the database. The old
+algorithm was O(n^2) for space and would exhaust memory or lead to page
+thrashing on very large programs. The new algorithm is linear with the
+size of the input for both time and space. It is now possible to build
+very large mkid databases covering many thousands of files totalling tens
+of megabytes and containing hundreds of thousands of unique tokens.
+
+* The database header is now byte-order and word-size independent. ID
+files may be shared across networks of dissimilar architectures.
+
+Version 2.0 - February 1991, by Tom Horsley
+
+
+Version 1.0 - September 1987, by Greg McGary
+
+* Initial release to comp.sources.unix
+
+Local Variables:
+mode: text
+fill-column: 75
+End: