Files in the top-level directory in any check-in
- .cvsignore
- .dact.c.swp
- autom4te.cache
- build
- CVS
- Docs
- registration
- work
- aclocal.m4
- algorithm-defs.h
- algorithms.h
- AUTHORS
- buffer.c
- buffer.h
- builtin-algorithms.c.in
- ChangeLog
- cipher_chaos.c
- cipher_chaos.h
- cipher_chaos.lnk
- cipher_psub.c
- cipher_psub.h
- cipher_psub.lnk
- cipher_serpent.c
- cipher_serpent.h
- cipher_serpent.lnk
- cipher_sub.c
- cipher_sub.h
- cipher_sub.lnk
- ciphers.h
- comp_bitsums.c
- comp_bitsums.h
- comp_bitsums.lnk
- comp_bzlib.c
- comp_bzlib.h
- comp_bzlib.lnk
- comp_delta.c
- comp_delta.h
- comp_delta.lnk
- comp_factor.c
- comp_factor.h
- comp_factor.lnk
- comp_fail.c
- comp_fail.h
- comp_lzoox.c
- comp_lzoox.h
- comp_lzoox.lnk
- comp_lzooy.c
- comp_lzooy.h
- comp_lzooy.lnk
- comp_lzota.c
- comp_lzota.h
- comp_lzota.lnk
- comp_mzlib.c
- comp_mzlib.h
- comp_mzlib.lnk
- comp_mzlib2.c
- comp_mzlib2.h
- comp_mzlib2.lnk
- comp_plain.c
- comp_plain.h
- comp_rle.c
- comp_rle.h
- comp_rle.lnk
- comp_snibble.c
- comp_snibble.h
- comp_snibble.lnk
- comp_text.c
- comp_text.h
- comp_text.lnk
- comp_textrle.c
- comp_textrle.h
- comp_textrle.lnk
- comp_zlib.c
- comp_zlib.h
- comp_zlib.lnk
- config.guess
- config.h.in
- config.sub
- configure
- configure.ac
- configure.in
- crc.c
- crc.h
- dact.c
- dact.conf
- dact.h
- dact_common.c
- dact_common.h
- dact_stdint.h
- dendian.c
- dendian.h
- getopt.c
- getopt.h
- getpass.c
- getpass.h
- HEADER
- header.c
- header.h
- INSTALL
- install-sh
- libdact.c
- libdact.h
- libdact.syms.in
- libdact_combined.c
- LICENSE
- Makefile.dep
- Makefile.in
- math.h
- mkstemp.c
- mkstemp.h
- module.c
- module.h
- net.c
- net.h
- parse.c
- parse.h
- patch-magic-file
- random.c
- random.h
- README
- rget.txt
- sfx.c
- sfx.h
- sort.c
- sort.h
- stdint.h
- strsep.c
- strsep.h
- TODO
- TODO.ideas
- ui.c
- ui.h
- uname.c
- uname.h
- win32.h
1. EXPLANATION:
Take file, compress each block with 1 of 256 algorithms (including
no compression) and use algorithm on a per block basis.
2. WARNING! You should never use an algorithm listed in algorithms.h under DEBUG for real data, they are subject to reordering, recoding, and removal.
3. FEEDBACK would be appreciated. Email me, dact@rkeene.org,
if you find a flaw in the code, or if you have a suggestion.
4. WRITING A COMPRESSION ALGORITHM FOR DACT:
a. You can use comp_plain.[ch] as an example for the interface.
b. Your function must take 5 parameters:
mode - DACT_MODE_COMPR or DACT_MODE_DECMP
Determine whether to compress or decompress.
prev_block - Previous (uncompressed) block.
curr_block - The data to be compressed.
out_block - Where to put data after compression.
blk_size - Size of prev_block and curr_block.
c. Add your function's header file to algorithms.h:
#include "comp_youralgorithm.h"
d. Add your function's call to algorithms[] in algorithms.h, before
the NULL:
comp_yourfunction_algo,
e. Add your function's code to the Makefile.in (if it has no depencies):
ALGO+=comp_yourfunction.o
5. Horror Stories:
a. Submit yours today!
6. Bugs:
a. Please submit all bugs to dact@rkeene.org