OK, this one is socially funny and statistically cool – Stack Overflow question on how to exit Vim editor was viewed over a million times in the last few years. Now, there’s a breakdown of all sorts of statistics about who gets stuck in Vim the most. It’s pretty amazing the kind of questions and answers one can ponder at when having access to a lot of statistical data.
Slashdot links to “The Most Mentioned Books On StackOverflow“.
How we did it:
- We got database dump of all user-contributed content on the Stack Exchange network (can be downloaded here)
- Extracted questions and answers made on stackoverflow
- Found all amazon.com links and counted it
- Created tag-based search for your convenience
- Brought it to you
I’ve previously linked to a similar selection of “Top 29 books on Amazon from Hacker News comments“.
Geek and poke does it again … this time on the subject of copying code from StackOverflow:
Here’s an outage postmortem from the recent StackOverflow downtime. It just shows you how easy it is to break things, even they were built by some of the smartest people around. Programming is touch and there is no way around it.
The regular expression was: ^[\s\u200c]+|[\s\u200c]+$ Which is intended to trim unicode space from start and end of a line. A simplified version of the Regex that exposes the same issue would be \s+$ which to a human looks easy (“all the spaces at the end of the string”), but which means quite some work for a simple backtracking Regex engine. The malformed post contained roughly 20,000 consecutive characters of whitespace on a comment line that started with — play happy sound for player to enjoy. For us, the sound was not happy.
If the string to be matched against contains 20,000 space characters in a row, but not at the end, then the Regex engine will start at the first space, check that it belongs to the \s character class, move to the second space, make the same check, etc. After the 20,000th space, there is a different character, but the Regex engine expected a space or the end of the string. Realizing it cannot match like this it backtracks, and tries matching \s+$ starting from the second space, checking 19,999 characters. The match fails again, and it backtracks to start at the third space, etc.
So the Regex engine has to perform a “character belongs to a certain character class” check (plus some additional things) 20,000+19,999+19,998+…+3+2+1 = 199,990,000 times, and that takes a while. This is not classic catastrophic backtracking (talk on backtracking) (performance is O(n²), not exponential, in length), but it was enough. This regular expression has been replaced with a substring function.