|
| |
Website :
https://github.com/FPT-Sokrates/compactor
Credits :
Download :
Look for downloads on external sites:
Pokefinder.org
User Comment
Submitted by Sokrates on 6 May 2021
| Sounds like a perfect use case :-) Thank you for sharing the numbers! |
User Comment
Submitted by Frostbyte on 5 May 2021
Well, this tool was just what the doctor ordered. With very little effort, it freed an extra 2k out of 40.5k of data, which was already compressed but had repeating patterns in the beginnings and ends of individual compressed data segments (of which there are hundreds), and I couldn't use "proper" compression as I couldn't afford the performance hit.
That 2k is a lot when memory is already almost full and you're getting desperate for bytes. :) Also with zero performance penalty, which is nice.
Thank you very much for sharing this! |
User Comment
Submitted by Sokrates on 4 May 2021
| Exactly, an optimized greedy approximate algorithm is used to solve this. Additionally data alignment is supported. |
User Comment
Submitted by Krill on 4 May 2021
| This is compression by finding the shortest common superstring, yes? |
User Comment
Submitted by Sokrates on 4 May 2021
| Data compression for read-only data arrays with zero time for decompression. I used this method in some of my tech-demos. Now I made a proper tool out of it hoping some of you might find it useful. Read "Summary" for more information. |
|
|
|
 | Search CSDb |
|
| Navigate | |
|
| Detailed Info | |
|
| Fun Stuff | |
· Goofs
· Hidden Parts
· Trivia
|
|
| Forum | |
|
| Support CSDb | |
|
 |  |
|
