Mercurial > libpst
view src/lzfu.h @ 360:26c48ea9d896
From Jeffrey Morlan:
pst_build_id_ptr reads the Block BTree into a linked list, which
pst_getID does a linear scan through. For large PSTs that have
millions of blocks, this is extremely slow - almost all time is spent
in pst_getID. Since the BTree entries must be in order, this can be
dramatically improved by reading into an array and using binary
search.
author | Carl Byington <carl@five-ten-sg.com> |
---|---|
date | Wed, 06 Jul 2016 10:21:08 -0700 |
parents | cf3df962f1e5 |
children |
line wrap: on
line source
#ifndef LZFU_H #define LZFU_H /** decompress lz compressed rtf data. The initial lz dictionary is preloaded with rtf specific data. * @param rtfcomp pointer to the rtf compressed data * @param compsize size of the compressed data buffer * @param size pointer to location to return size of the output buffer * @return pointer to the output buffer containing the decompressed data. * The caller must free this buffer. */ char* pst_lzfu_decompress (char* rtfcomp, uint32_t compsize, size_t *size); #endif