Getting to bed 2 hours earlier than the last night-before-class-project-is-due.

And yes, I may have overdone this one slightly as well... but I now can detect words that:
1) consist solely of equal numbers of A's and B's
2) consist solely of a number of A's followed by an equal number of B's
3) consist solely of a number of A's followed by twice as many B's
4) consist of a group of A's, followed by a group of B's, the whole grouping of which is repeated a number of times
5) are palindromic and consist of capital letters
6) consist of a group of A's followed by an equal number of B's followed by a group of A's with one more A than the previous group, followed by a group of B's with one more B than the previous group, followed by a group of A's with one more A than the previous group, ad infinitum (i.e. until I overflow the stack ^_^)

Today has been a very good day at work so far; I've rewritten a portion of code that used a bunch of cumbersome "if" checks to take advantage of the fact that JavaScript supports try/catch blocks. Now I just do what I want to do, and if it doesn't work then I fix it and move on. The fun part is that they're nested three levels deep, but in pretty much all cases I can actually recover from whatever broke it, fix the thing that caused it to break, and move on. No more shall I be at the mercy of (this particular aspect of this particular set of) data architecture!

( As it turns out, that was just an appetizer )