Are there any compressors which do a lot of allocation, like new/delete or malloc(sizeof(struct)) and whose speed is restricted by those allocations?
For example anything involving trees... Like a binary-tree.
I wrote a new allocation library and I want to test if it can speed up any significant well-known(ish) compressor... seeing as I'm also interested in compression!
If not, thats fine. I already know that most systems use a hash-table, which obviously doesn't need any special allocation code.