Fast Haskell, Redux

In this post I’m going to incrementally optimise a simple base16 (hexadecimal) encoding routine and illustrate what sort of performance boost each optimisation yields. Hopefully it can be used to glean a bit about what tends to make Haskell code fast – especially code that deals with bytestrings. You can think of this as a kind of supplement to Chris Done’s Fast Haskell: Competing with C at…