Jie
I was eavesdropping this conversation (I made the Haskell implementation). Thank you for spotting the bug, here is a possible fix: ```haskell decode :: (Ord a) => Tree a ->...
I think returning an empty sequence makes more sense, because the algorithm is all about compression. and `(Leaf 'a' 100, [])` is a heck of a lot more compressed than...
> To make sure I am following, we are thinking about returning either: > > "000...000" > ("c", n) where c is a character and n is the number of...
It would not be meant for users, just for us, we can run it once in a while. This way we wouldn't need to ask contributors to use spaces instead...
Agreed. But some things fall through the cracks sometimes, I've merged code with tabs before because I hadn't noticed.
Or maybe we could have linters for the languages we use. I don't need to format JS code if you know how to do that, and I'll handle Haskell.
I had in mind scripts would do thing in batch, say look for every `.cpp` files and re-format them. We could run it every 6 months, or for every spring...
True, it might very hard/impossible to get right. But it could also be fun :)
I'm all for the incremental change, I was thinking to implement a script for a Haskell linter and making it flexible enough so that other languages could use something similar....
I don't really mind if things like sample size is different, what I care about are the algorithms. Function names are a bit more important, but they will have to...