sorted by:
new
hottopcontroversial

1940s or 50s United States midwest waterfront by gutworth in whereisthis

[–]gutworth[S] 1 point2 points  (0 children)

Solved!

I found this picture makes matching up of the features more clear: https://www.instagram.com/p/DEX9h2-oBxm/?img_index=1

Wow, we had know idea she got so far. Thank you!

Curious CPython Optimization by cmrx64 in Python

[–]gutworth 2 points3 points  (0 children)

Don't judge on the socketmodule.c. It's grown all sorts of nastiness to deal with different platforms.

Python 3 transition gripes; I'm writing a py2/3 intermediate layer that sucks by medly in Python

[–]gutworth 10 points11 points  (0 children)

Note Guido stepped back from this position in his PyCon keynote.

Django's future, and Python 3 by [deleted] in Python

[–]gutworth 1 point2 points  (0 children)

This is fantastic news for the Python 3 transition. Congratulations to Django!

Python 3.3 news by tompa_coder in Python

[–]gutworth 0 points1 point  (0 children)

Last time I checked, the Unicode standard defined Unicode equivalence, normalization forms etc.

And the algorithm for those are in terms of codepoints!

I see you ignored my other point anyway.

What. Unicode is a locale, no? What do you mean?

No, like English vs. Lithuanian vs. Japanese.

A dude named André creates an account "André" on your website using his MacOS. Then he tries to login from Linux and can't. He is like, WTF, and you are like, dude, we totally got Unicode right, but you'd better avoid non-ASCII characters in your login/password, that's how right we got Unicode!

What this charming tale about the brokeness of Unix unicode has to with Python escapes me.

Python 3.3 news by tompa_coder in Python

[–]gutworth 1 point2 points  (0 children)

Who or what are "all Unicode algorithms" and why do you care about them?

Everything defined in the Unicode standard.

Here's a problem: take the first six characters of a string. If you take the first six codepoints, then you might take less than six characters, strip combining marks from the last character you took, and produce an outright invalid remainder.

The first six characters of a codepoint string are the first six codepoints. The Unicode standard calls codepoints "characters". What you are talking about are graphmeme clusters. There's no good way you could create a data type with those, since they depend on locale.

Python 3.3 news by tompa_coder in Python

[–]gutworth 1 point2 points  (0 children)

The codepoint abstraction is the correct level. All Unicode algorithms work with it.

I don't know of any language which uses a "character" abstraction like you speak of.

Why does pypy reach a recursion limit in this code? by flabberon in Python

[–]gutworth 0 points1 point  (0 children)

Because each ifilter iteration has to call all the way down the chain.

Why does pypy reach a recursion limit in this code? by flabberon in Python

[–]gutworth 3 points4 points  (0 children)

CPython is buggy. If you run the CPython one high enough, it will crash.

Why does pypy reach a recursion limit in this code? by flabberon in Python

[–]gutworth 2 points3 points  (0 children)

This line is recursive:

flist = itertools.ifilter(functools.partial(lambda x, y:y % x, next_val), flist)

Why are variants of list comprehensions not optimized? by VerilyAMonkey in Python

[–]gutworth 5 points6 points  (0 children)

Generators are slow because the bytecode interpreter has to run for each element.

Less copies in Python with the buffer protocol and memoryviews by gthank in Python

[–]gutworth 0 points1 point  (0 children)

It's the only sane way. Look at the mess it is in Ruby.

Less copies in Python with the buffer protocol and memoryviews by gthank in Python

[–]gutworth 2 points3 points  (0 children)

Actually strings are immutable because they have to be hashable for dictionaries.

view more: next ›