2 hours to go… I’ve been waiting for the men’s tennis US Open final to start. What should I do? In the end, I’ve been killing time listening to that Functional Geekery podcast episode which features Matthew Flatt talking about the Racket programming language. Realizing the irony, my thoughts went something like: “Racket, tennis?! Can’t be a coincidence! Still some time to burn, so I will programm something tennis-like in Racket!” So let’s open the Racket quickstart to somehow learn Racket and get an idea what the tennis-like thing should be.
Recently I’ve come across that fivethirtyeight article comparing the female tennis all-time greats by means of an Elo rating variant (originally known from chess). It concludes that Serena Williams does not have the highest rating in history, although she is frequently considered as the greatest player of all time nowadays. Obviously, I wondered what’s the situation like in the men’s tennis world. Have Roger Federer’s record 17 Grand Slam wins led to the highest Elo rating as well? What about players like Borg and McEnroe? Anyway, I have found surprising results.
Oh, it is Pi day! To be honest, I had not known about it until today but it somehow made it into my Twitter stream. Well, after some relaxed Saturday morning browsing I stumbled across the Wolfram Pi approximation demonstration. It looks like this:
Pi is approximated by computing the area of the inscribed polygon and by dividing that area by the square of the circle radius – after all, the area of a circle is r²π. Obviously, that idea is that beautiful and so simple that Pi has thus been approximated thousands of years ago (of course, there are many better and faster ways!), so I decided to implement it myself.
I’ve not been too exposed to statistics programming in the last few year, however, sometimes it couldn’t be avoided – and R couldn’t be avoided! (I still have too much self-esteem to think about falling back to Excel, even for the simplest things.)
I don’t hate R and I don’t like R; it just strikes me as very strange. Often, the syntax strikes me as odd and above all, the multitude of ways to express the same thing reminds of my little Perl experience. Anyway, I have subscribed to the Coursera R course for fun and in hope to somehow “get the better of R”, to grok in on a deep level or to at least get a more profound idea as to why I don’t like it ;)
Anyway, here is a language construct which is very strange and a little bit absurd, no whatever how often I think about it. It’s called partial matching. To put it bluntly, partial matching makes it possible to avoid spelling out the whole name of an element of a list in oder to access it. Let’s have a look.
Writing software documentation can be a pretty dull task and is neglected too often (at least by me). But what purpose does the best program serve if nobody knows how to use it? None.
Looking at Github, the Markdown formatted README.md is the front page of every repository and the first (and mostly only) source of documentation. Until recently, I have treated my README.md files rather shabbily; I would have thought that this lack of motivation originates from a general dislike of writing documentation, however, I might have changed my opinion. This blog post has opened my eyes to an alternative explanation: writing Github Markdown documentation is not trivial when you don’t have a chance to preview the resulting markdown before committing! In that case the output will look not as expected more often than not – which makes the committer angry as s/he needs to push another commit just for improving the Markdown. Anyway, I remember feeling annoyed quite frequently by that procedure in retrospective. It does not need a stretch of imagination to foresee the negative influence that annoyance has on my willingness to provide README.md documentation… ;)
The solution is obvious but not that trivial. Obviously, there surely are plugins for various IDEs which can parse Markdown and output HTML markup. I remember having once installed such an Eclipse plugin. But things get trickier as Github does not use vanilla Markdown but its own brand of Markdown – it is not that easy to find a way to display Github Markdown with good confidence in its conformity; in addition it shouldn’t force me to use any special IDE as I do most stuff in Emacs.
The script that I use now was mentioned in the referenced blog post above: flavor.rb. It is a ruby script which actually asks the Github API (!) to do the hard work, namely providing the HTML output! That looks stupid at first glance but it is actually the only way to be really sure of the preview’s congruence with the actual display on the Github page…
I guess everybody has a story or two in store about Nullpointer
exceptions in Java (or in any language with nullable values). Sooner or later you will make the acquaintance of the dreaded stacktrace line
denoting that you did something terribly wrong, demanding a value
where none exists, and you just wonder why, how the hell can that
object be null?! during an hour of painful debugging… you know
that? Good. Well, I won’t ponder over how to avoid it, how to apply
proper error handling etc. (that’s way too complicated, I’m tired) but I’d just like to point out my personal
else return null idiom.
I’ve been using XMonad for a few years now (lately in combination with GNOME) but just recently I have found a way to make it work in a useful way in the context of a presentation with a projector as a second screen.
In general, XMonad does have decent multi-screen support. Building on Xinerama, the default configuration provides key-binding support for three screens; how workspaces are mapped to the screens and how this mapping can change, respectively, can be pretty confusing at first, though – it is best explained in here. Whenever I want to use a projector things get pretty tricky, however.
When I first set up my Github pages Octopress blog I followed those instructions to set Google Analytics tracking up – and it worked. However, in May Google Analytics somehow decided to move my account to Universal Analytics – maybe I had approved it without really knowing what it meant…
It is not only not right, it is not even wrong.
Actually, my Analytics dashboard did show some visits and hits, that’s why I didn’t notice the problem for a long time, however, I guess it only mentioned 10% of them! Anyway, after a long debugging session with Google Tag Assistant and Google Analytics Debugger I figured out the necessity to change the code, finally.
Shortly, you just need to change your
source/_includes/google_analytics.html to this code:
1 2 3 4 5 6 7 8 9 10 11
Concerning Github pages, it’s not necessary to include a call to set your domain to github.io any longer. It just works out of the box – what a progress! It is not only right, it is not even wrong now!
Point-free code is ubiquitous in every well-polished Hackage library. It’s more concise than its pointed counterparts and feels more “hygienic” as function composition immediately translates to its mathematical background.
1 2 3
So far, so good. However, you get a problem in your chain of function composition when your right-most function “takes two parameters”.
1 2 3 4 5 6 7 8
coolSolution is not well-typed; this might drive you
nuts for some time: It’s obvious that composing those functions must
somehow work. You’d think: “Even GHCI must have understood what I
mean!” However, Haskell doesn’t care for what you mean as much as it
cares for type-safety ;) ! So you might fall back on
which is only half the fun as it’s not point-free… anyway, there IS
a way to compose those functions!
Yesterday I came across a post on the haskell reddit where somebody posted the following application of replicateM:
1 2 3
It obviously results in all three-character combinations of zeros and ones and in general, replicateM x “01” generates all x-character combinations of zeros and ones accordingly.
replicateM is a standard library function and its haddock
documentation says: “replicateM n act performs the action n times,
gathering the results” and its type actually is
replicateM :: Monad m
=> Int -> m a -> m [a]. So replicateM is not a function
explicitly crafted for the purpose of a “get me all x-ary combinations
of my string” task, it is actually defined for all monads. Just
imagine a more obvious application using the IO monad, which performs the action of
printing hello 3 times and gathers the result.
1 2 3 4 5
It is typical Haskell practice to use a function with such a general look to solve a rather special problem as our original one – to such a degree that it seems like magic to programmers with a different background. Actually, it might look like “dark” magic when you don’t grasp how/why the hell that result comes about in spite of looking at the source of replicateM, and you might start getting annoyed with Haskell altogether if that happens several times… anyway, there is no such thing as (dark) magic ;) so let’s demystify that interesting example!