I've just walked out of a written exam on Functional Programming in Haskell. Given my preference for keyboard and text editor over pen and paper I ran into more than a few issues.
Ampersands and pens don't mix.
I think nine out of every ten lines in my answer booklet contained crossings out. Paper and code don't mix. Consider
mutilate :: [(A,B)]-> [C]
mutilate x:xs = let (a,b) = frobnicate x
in mung a : mung b : mutilate xs
the above would probably have started out as
I don't think my bunny rabbit likes being decimated. I'm wondering whether I'm going to be OOM-Killed before it completes.
After about an hour the rabbit won.
Today I hit a milestone. And what a nice one. I can remove Beethoven's eyebrows. More importantly I have a big chunk of one of my test cases done and working: A very naive decimation algorithm (collapse shortest edge), and I've done it badly.
Ok, so I've been hacking with Haskell for a while now, and I want to share some of the wow factor:
I'm doing some graph-fu with meshes, something that is particularly problematic for reasons I won't go into today (watch this space). I extract the edges from a list of triangles, themselves extracted from a list of triangle strips, and immediately run into swearsville as both the extraction from triangles and the triangle strips introduce non-unique edges.
Except where otherwise noted, work is licensed under a Creative Commons Licence and is the work and opinion of the credited author(s).
