And the corresponding decompressor:
https://bugfix-66.com/d548f3abf6faa823a829e4c770a8babca648a5...
Does a simpler compressor/decompressor exist with comparable bits-per-byte performance?
https://bugfix-66.com/d548f3abf6faa823a829e4c770a8babca648a5...
Does a simpler compressor/decompressor exist with comparable bits-per-byte performance?
Is it related to: https://en.wikipedia.org/wiki/Prediction_by_partial_matching
Or, considering the web site title, is there a bug in this algorithm? Thanks!
All I know is the original author was probably a hacker from Finland and it was originally written in x86 assembly. This is my modernized implementation of his algorithm.
As for solving the BUGFIX-66 puzzles, to fix the bug in the compressor, add
to = append(to, 0)
loc = len(to)
To fix the decompressor, add
at++
ctrl := int(from[at])
Writing
to = append(to, ctrl)
In fact, it seems that any placeholder value should work - as it is always overwritten by the final value of ctrl for a given set of bytes at the end; however, the checker rejects this.
Go doesn't do integer type conversions implicitly, to avoid the implicit-type-casting bugs endemic to C. Go (thankfully) doesn't allow an implicit conversion from int to byte. You must do the cast explicitly.
So you would have to say
to = append(to, byte(ctrl))
The site builds and executes the code you submit, and any correct solution is accepted.