This is in response to wootest's post on finding the longest common prefix of an array of strings in Ruby.
files = ['/foo/bar/xyzzy_one', '/foo/bar/xyzzy_two', '/foo/bar/xyzzy_three/four']
No change here. For relative paths, use os.path.join(os.getcwd(), path) to convert each path to an absolute path.
We follow this up with:
import os lcp = os.path.commonprefix(files)
*bows*
*walks off*
It's finally here: The MWSF 2007 Edition of Keynote Bingo is out. Just in time for the start of the Expo!
It's very small — the whole disk image is about 57 K, using UDIF+bzip2 format. As you may guess from that, the disk image requires Tiger; there won't be a Panther version this time, because the app requires Tiger too (for PDFKit and NSError presenting). Instructions are included on the disk image, in the README file.
I would encourage you to download your copy now, or at least very soon. When I released the WWDC 2006 version, the vast majority of the downloads came within the half hour or so before the keynote started. At the time, I was on GeoCities, so that drove me straight into the hourly bandwidth limit. I don't have that problem anymore, being on TextDrive now; even so, you should get your copy now to help the server and its pipe not be swamped come the keynote.
Here's hoping you get a bingo!
PBS is looking at three science-show pilots, and can't decide which one to order as a full series. So they've made all three pilots available, for free, and ask your opinions on them (perhaps by iTunes commenting — I haven't watched the videos; there may be instructions within them or something). Each show is a full hour. They are:
Did you know that you don't have to initialize static variables? (If you've done any Cocoa programming, you know that statics are commonly treated as class ivars, most commonly to hold singleton instances.)
Quoth C99 (§6.7.8 paragraph 10):
… If an object that has static storage duration is not initialized explicitly, then:
- if it has pointer type, it is initialized to a null pointer;
- if it has arithmetic type, it is initialized to (positive or unsigned) zero;
- if it is an aggregate [array or structure —PRH], every member is initialized (recursively) according to these rules;
- if it is a union, the first named member is initialized (recursively) according to these rules.
And I've prepared a test app that shows that gcc 4.0.1 on OS X 10.4.8 does seem to comply with this handy part of the standard.
Happy not-initializing!
Here's what I have for MWSF 2007 Keynote Bingo. This is the entire list, including old strings from the WWDC 2006 edition (except for the ones that I pruned).
If you're still kicking around a string idea, or you think of one while flipping through this list, consider this the eleventh hour. This is the last call for new strings. ☺
UPDATE 2006-01-07: See also “Now, 4% more bingo!”, in which I announce version 1.0.1. Version 1.0.1 adds a net total of 8 strings.
The keynote looms ever closer, and so does the bingo! I've now posted the MWSF 2007 Edition page, complete with the sneak preview. (You can tell that seed numbers are now printed — this one is marked “Card #0”.)
It's still not too late to think of things to put into those cells. You can propose new strings either by commenting on my “Call for strings” post or by emailing me (my address is on my front page).