Google I/O 2008 - Painless Python Part 2 of 2

[VondaFononono]

It was really painless.

[arngorf]

">>> from thisnameisfartoolong import blah" lol

[voltagedrop]

I wish I had scanned the comments, the audio glitch got me.

[manicqin83]

I always imagine Arnold Schwarzenegger lecturing...

[santiks]

that 6:58 sound gave me a shock!... keep it volume slightly lower when reaching 7 minutes.

[jethromayham]

Horse shit. Place the killer between two horses.

[alexaverbuch1]

real nice and useful presentation.

one complaint @ camera operator or editor: when there is something useful on the slides WHY do you focus on the speaker for so long, it would be nice to only focus on speaker when it is absolutely necessary as the real information is on the slides

[Zazimuth]

The example he gave @ 30:56 (7 most popular words) doesn't actually do that. It returns the values whose corresponding set of line numbers they occurred on is the largest (i.e. [2] is larger than [1, 1]). Any idea how to get the required functionality? We need the values that have the longest sets; however, setting key=len(indx.get) in the heapq.nlargest() method doesn't work (syntax err).

[wickedtubed]

Seriously glitch, man that made me flinch.

[shonzilla]

Turn the volume down at 6:58 - there's a (loud) glitch in the recording.

[filipemtx]

AHHHHHHHHHHHH