i have notice to compress QByteArray is faster & smal -> http://liblzf.plan9.de/
i found this tip on KDE source...
// Lossless compression using LZF algorithm, this is faster on modern CPU than
// the original implementation in http://liblzf.plan9.de/
// compression data on cache to not fill to match ram buffer
/* search on kde source : *xml */
static int lzff_compress(const void* input, int length, void* output, int maxout)
static int lzff_decompress(const void* input, int length, void* output, int maxout)
// Lossless compression using LZF algorithm, this is faster on modern CPU than
// the original implementation in http://liblzf.plan9.de/
// compression data on cache to not fill to match ram buffer
/* search on kde source : *xml */
static int lzff_compress(const void* input, int length, void* output, int maxout)
static int lzff_decompress(const void* input, int length, void* output, int maxout)
To copy to clipboard, switch view to plain text mode
Bookmarks