| iMatix home page | << | < | > | >>

SFL Version 2.11

Compression functions

Filename: sflcomp.h
Package: Standard Function Library (SFL)
Written: 1991/05/20 iMatix SFL project team sfl@imatix.com
Revised: 1997/09/08
Copyright: Copyright (c) 1996-2000 iMatix Corporation

Synopsis

Various compression/decompression functions. The LZ-type algorith (LZRW1/KH) was originally written by Kurt Haenen <ghgaea8@blekul11> and made portable by P. Hintjens. This is a reasonable LZ/RLE algorithm, very fast, but about 30% less efficient than a ZIP-type algorithm in terms of space. The RLE algorithms are better suited to compressing sparse data. The nulls variant is specifically tuned to data that consists mostly of binary zeroes. The bits variant is tuned for compressing sparse bitmaps.

List of Functions

• word compress block
  (const byte *source, byte *dest, word source_size);
• word expand block
  (const byte *source, byte *dest, word source_size);
• word compress rle
  ( byte *source, byte *dest, word source_size);
• word expand rle
  (const byte *source, byte *dest, word source_size);
• word compress nulls
  ( byte *source, byte *dest, word source_size);
• word expand nulls
  (const byte *source, byte *dest, word source_size);
• word compress bits
  ( byte *source, byte *dest, word source_size);
• word expand bits
  (const byte *source, byte *dest, word source_size);

List of Symbol Definitions

sflcomp.h defines these symbols, possibly conditionally:

Symbol:	Defined as:
SFLCOMP_INCLUDED	TRUE

| << | < | > | >>

Copyright © 1996-2000 iMatix Corporation