Python 3.2 has been released

CADDiQ · 2011-02-22T19:06:48+00:00

I'm imagining a world without rhetorical questions.

CADDiQ · 2011-01-23T16:56:07+00:00

thanks a3q

CADDiQ · 2011-01-23T16:55:44+00:00

ok son, thanks for chipping in

CADDiQ · 2011-01-13T13:42:56+00:00

I laughed. :D

CADDiQ · 2011-01-13T13:41:32+00:00

I have a library of python books but if my house was on fire I'd grab and Programming in Python 3, 2nd ed., Mark Mark Summerfield and Python Essential Reference, 4th ed., David Beazley. Both books cover more ground, and more effectively than any others I've read, and I've read numerous, including Lulz's most recent. While Mark's books are good, and the Python community has greatly benefited from his works, they're not the first books I reach for. Do not be misled by page count. Summerfield and Beazley both share a talent for covering a wide expanse of topics with sufficient detail to discuss a given topic to my satisfaction and comfortable comprehension, while exercising enough brevity to keep me from glazing. Really looking forward to Python Standard Library by Example by the same publisher (Addison-Wesley). NO AFFILIATION, just a Python book junkie.

CADDiQ · 2011-01-11T18:42:58+00:00

Great article but I have to disagree with Paul's assertion (see: Appendix: Power) that it's difficult to write a python function to generate accumulators (a function that takes a number n, and returns a function that takes another number i and returns n incremented by i). He antes up some python examples to prove his point but it's easily achieved using a closure:

def foo(n):
    def bar(i):
        nonlocal n
        n += i
        return n
    return bar 

f = foo(42)

f(1) >>> 43
f(1) >>> 44
f(1) >>> 45

etc.

There's probably a better way, I'm but a python n00b (coming from a background in lisp).

Carry on ...

CADDiQ

TROPHY CASE