In this implementation, to maximise performance, we consider each individual byte of the file separately, and look it up in π.
Oh, look, a compression ratio of 1! So performant!
It’s actually worse than that. It looks like it uses a short to store the index, which is normally 2 bytes. So it takes 2 bytes for every byte stored in the metadata!
I wonder if the index is even guaranteed to fit in a short in every case
A general programming discussion community.
Oh, look, a compression ratio of 1! So performant!
It’s actually worse than that. It looks like it uses a short to store the index, which is normally 2 bytes. So it takes 2 bytes for every byte stored in the metadata!
I wonder if the index is even guaranteed to fit in a short in every case