In which I complain about air travel

So I work in Atlantic Beach, FL and I live in Chicago. So that means I spend a bunch of time on a plane every week. But this week I was best man in a wedding… in Seattle, WA. You know, the exact opposite corner of the lower 48 and not so easy to get to, as it turns out. I had cleverly arranged to connect through Chicago so I could meet my wife at O’Hare and then fly together to the land of coffee. But, of course, my plane was delayed. I got off the plane at O’Hare at 5:12 pm to make a connection at 5:15. Now I’m a large man these days but I did manage to run from the C concourse to the B in about 6 minutes – about 2 minutes too late to get on that plane. And all the flights to Seattle that night? Full. So my lovely wife gets to spend a night alone in Seattle while I sleep alone in our bed in Chicago. Nice. Then it’s up at 4am to catch a 6am to Denver, to catch a flight to L.A., and then off to Seattle.

As I type this I’m sitting on a plane in Washington, D.C.. I’ve been on this plane for over 2 hours but we haven’t actually done anything except take a tour around the tarmac and then head back to the gate for more fuel. Awesome. We spent so much time waiting for “de-icing” that we had to go back. Everybody’s being pretty jackassian about it. The lady next too me said, with no warning, “Hey mister, your going to need to move that arm of yours!” My elbow was touching her, you see.

Here’s the breakdown of yesterday’s commute to work:

10:00am get in car to go to airport in Seattle, WA.

12:30pm get on plane.

8:30pm (EST) get off plane.

10:30pm get on plane that has been delayed for an hour.

2:00am plane actually leaves the ground.

3:40am plane lands in Jacksonville, FL.

4:30am I get to my hotel.


Tomorrow I’ll post some pictures of the wedding – I’m going to bed.

Comments

Post a Comment

Popular posts from this blog

What's a Good Flog Score?

I've been using Flog to measure the complexity of my Ruby code and I was wondering how others interpret Flog numbers. I'll go first with my opinions: Score of Means 0-10 Awesome 11-20 Good enough 21-40 Might need refactoring 41-60 Possible to justify 61-100 Danger 100-200 Whoop, whoop, whoop 200 + Someone please think of the children (note: these are scores for an individual method) The 20 - 60 range is interesting to me. Sometimes the complexity of what you're doing will justify the score and other times the method is in desperate need of refactoring. The highest Flog score I've seen in the wild was in the 300's. What's you're personal high and what do you think of my rankings? In other news, I've redesigned the look of my blog so if you only see my post through a reader you might want to stop on by, take a look, and tell me what you think.
Read more

SICP Wasn’t Written for You

The number of software luminaries who sing the praises of “ Structure and Interpretation of Computer Programs ” (referred to as SICP) is such a long list that you might think only a crazy person would take issue with it. However, to ignore SICP’s problems and continue to blindly recommend it seems just as crazy. SICP was the textbook for MIT’s introductory programming class and was a bit of a departure from other into to computer science textbooks at the time.  Wikipedia sums it up nicely:  “Before SICP, the introductory courses were almost always filled with learning the details of some programming language, while SICP focuses on finding general patterns from specific problems and building software tools that embody each pattern.”  Which sounds awesome, but does essentially say that abstract principles will be introduced before the nuts and bolts of a language.  If you think about that for a minute, you may see where the problems will be. When I was training to be a teacher I took a b
Read more

Point Inside a Polygon in Ruby

Recently my team needed to find out if a point was inside a given polygon and, as usual, we found some code on the internet that did what we wanted. And, as usual, there wasn't much explanation as to what it was doing. Here's the code (after we converted it to Ruby): 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 def contains_point? (point) c = false i = -1 j = self .size - 1 while (i += 1 ) < self .size if (( self [i].y <= point.y && point.y < self [j].y) || ( self [j].y <= point.y && point.y < self [i].y)) if (point.x < ( self [j].x - self [i].x) * (point.y - self [i].y) / ( self [j].y - self [i].y) + self [i].x) c = !c end end j = i end return c end end So, you know, it works and I'm grateful to somebody for posting it but we had no idea how it works. So we wrapped 2 tests around it (one where the point is not in the polygon and another where it is
Read more