]> mj.ucw.cz Git - libucw.git/commit
Next version of the sorter -- both presorting and unifying works.
authorMartin Mares <mj@ucw.cz>
Sun, 4 Feb 2001 20:08:14 +0000 (20:08 +0000)
committerMartin Mares <mj@ucw.cz>
Sun, 4 Feb 2001 20:08:14 +0000 (20:08 +0000)
commit78d7afe64ca18c0cf679aec89d611641f5cbe872
tree0889eac61b6f4cc0b47f2d619f0ce6aca19251db
parentebc1b63c8776c87359714d75f44f4f7f3ac26161
Next version of the sorter -- both presorting and unifying works.

sort-test now does just `sort -u' and it's about 30% slower than its
GNU counterpart, probably due to extra copies of sorting keys by our
buffered I/O layer. Fortunately, a typical case will be long data with
short keys where we should be efficient as we can use bbcopy().
lib/sort-test.c
lib/sorter.h