ZOMG Kid Beyond is on the program! Sorry @donttrythis I’m now your #2 fan… #w00tstock
alexch's almanac
Laundry day, see you there, underthings tumbling.
Stalk me: tumblr twitter reader facebook flickr friendfeed blabs
You should follow me on Twitter | Dustin Curtis
Making the phrase more direct and personal by adding the words “you should” increased the clickthrough rate by 38% to 10.09%.
Buy This: “Grammar Nerd Corrective Label Pack” by Dylan Meconis (of Bite Me!/Family Man fame).
Yes. It does matter.
[via.]
When webrat seems to be stuck on an old version, make sure to uninstall brynary-webrat, because B comes before W!
I don’t want you to use patterns. I don’t want you to believe in patterns. I don’t want you to make patterns into a religion. Rather I want you to be able to recognize them when they appear, and to regularize them in your code so that others can recognize them too.
Design Patterns have a huge benefit. They have names. If you are reading code, and you see the word “Composite”, and if the author took care to regularize the code to the accepted names and roles of the “Composite” pattern, then you will know what that part of the code is doing instantly. And that is powerful!
Uncle Bob, Echoes from the Stone AgeTDD may be a way to derive algorithmms from first principles (excerpt from Uncle Bob's Echoes From The Stone Age)
Here is a classic example. Imagine you were going to write a sort algorithm test first:
- Test 1: Sort an empty array. Solution: Return the input array.
- Test 2: Sort an array with one element. Solution: Return the input array.
- Test 3: Sort an array with two elements. Solution: Compare the two elements and swap if out of order. Return the result.
- Test 4: Sort an array with three elements. Solution: Compare the first two and swap if out of order. Compare the second two and swap if out of order. Compare the first two again and swap if out of order. Return the result.
- Test 5: Sort an array with four elements. Solution: Put the compare and swap operations into a nested loop. Return the result.
The end result is a bubble sort. The algorithm virtually self assembles. If you had never heard of a bubble sort before, this simple set of tests would have driven you to implement it naturally.
Problems like Bowling, Prime Factors, and Bubble Sort hold out the interesting promise that TDD may be a way to derive algorithmms from first principles!
“Regrettably, based on Microsoft/Danger’s latest recovery assessment of their systems, we must now inform you that personal information stored on your device - such as contacts, calendar entries, to-do lists or photos - that is no longer on your Sidekick almost certainly has been lost as a result of a server failure at Microsoft/Danger. “
Why Wouldn't You Use Erector?
No, seriously. Why wouldn’t you use Erector? Cause I think it’s a pretty awesome view framework, but for some reason it hasn’t caught fire yet. So if you think writing actual Ruby to emit HTML,…



