In three separate discussions on the Python mailing lists this month, people have objected to some design because it leaks something into the enclosing scope. But "leaks into the enclosing scope" isn't a real problem. It's something that implies the actual problem they're complaining about—but it implies many different things.

Often, people are just worrying because what they're doing would be a problem in C or Lisp or whatever their first language is. Many of these problems aren't true in Python, or are in theory but are never or rarely relevant to most Python scripts or modules, in which case the solution is to just stop worrying.

Sometimes, there is a real problem. But it's worth knowing what the real problem is, so you can solve that.

Background

For example, consider the usual way of adding optional parameters:
    def spam(eggs=None):
        if eggs is not None:
The problem here is that None is a perfectly good value for many uses, and you may want to distinguish spam(None) from spam().

One possibility is:
    def spam(*args):
        if args:
            eggs, = *args
But this gives you a much less meaningful signature, and takes more code, and provides less useful error messages (e.g., if you pass two arguments, instead of a TypeError telling you that spam takes at most 1 positional argument, you get a ValueError telling you that there were too many values to unpack).

So, the idiomatic solution is this:
    sentinel = object()
    def spam(eggs=sentinel):
        if eggs is not sentinel:
That solves both problems—None may be a valid value for eggs, but sentinel surely isn't, because you just invented it here, and don't use it for any meaning except "not a valid value for eggs". And the signature makes it pretty clear that "eggs" is an optional parameter, and the errors are exactly what you'd expect, and so on.

But it means the sentinel is now available in the same scope as the function.

So what? Well, that's what this post is about.

It's public

Often, the scope in question is the global scope of some module. Putting sentinel in the global scope of a module means anyone who uses the module will see it. This means that from module import * imports it. And that the inspect module, and similar tools, will show it as a part of the module's interface—your IDE or REPL may offer it as a possible completion for module. and module.s, your automatic documentation generator may list it in the documentation of the module's public interface, etc.

But the problem here isn't that it's in the module's global scope; it's that it's public in the module's global scope. This is exactly what the private underscore convention is for: use the name _sentinel instead of sentinel, and it's no longer public. People can still find it if they go looking for it, but most tools will not offer it to them—and, even if they do find it, they'll know they're not supposed to use it.

Also, any module that you intend people to use with from module import * really should have an __all__, which of course shouldn't include _sentinel.

But private isn't really private

Some people object that Python private names aren't really private. A malicious user can still access module._sentinel and, e.g., put it in the middle of a list, causing some function in your module to stop checking the list halfway through so they can sneak some other data through your protection.

Nothing is private in Python. There's no way to hide anything. If they couldn't access module._sentinel, they could still access module.spam.__defaults__[0]. Or, if you somehow hid it in the constants, module.spam.__code__.co_consts[0].

This is inherent to any language that allows reflection. Even in languages that don't, like C++, people can still find the "hidden" values by reinterpret_cast<char *> and similar tricks. Unless your language is specifically designed to protect pieces of code from each other (as Java is), there's nothing you can do about this. If you don't worry about it in every other language, don't worry about it in Python.

It may collide with something else

It's exceedingly unlikely that you actually had something different in the module named _sentinel. But what if use this same idiom twice in the same module? For example:
    _sentinel = object()
    def spam(eggs=_sentinel):
        if eggs is _sentinel:

    # ...

    _sentinel = object()
    def cheese(ham=_sentinel):
Now, if you call spam(), the default value is the first _sentinel (because that gets bound at function creation time), but the if statement is checking it against the second one (because that gets looked up at function call time). Oops!

But really, is this ever a problem? Unless you're writing 10000-line modules, or writing your modules by blind copy-paste, it should never come up. (And if you are, don't do that!) If you need multiple functions with sentinels in the same module, you either use the same one for all of them, or use a different name for each one.

The one time this can come up is in auto-generated code. You need to make your code generator create a guaranteed-new name each time, in case it gets run twice on the same module.

It wastes space

Micro-optimizing space in a Python module is a mug's game. The value is already in the module. So is the name (for reflection, help, etc.). It does add one more entry to a dict that links the two together. That's 24 bytes on most 64-bit platforms. Even an empty dict is 288 bytes, and a module dict usually has at least __name__, __package__, __doc__, __all__, __loader__, __spec__, on top of your public and private names. This isn't a problem worth solving. If it were, you'd want to write a custom module loader that returned a different object that uses __slots__ (or C code) instead of a __dict__.

It's slow

Comparing to None is fast, because None is stored as a fast constant embedded in the compiled function, but comparing to _sentinel is slow, because it's stored as a global name lookup, which generally means a dict lookup on the module.

You <i>can</i> solve that:
    _sentinel = object()
    def spam(eggs=_sentinel, _sentinel=_sentinel):
        if eggs is _sentinel:
Now, you're comparing the first argument to the second argument, and they both default to the same reference stored in the function's fast locals, instead of the second one being a global lookup.

But is this really a problem that needs to be solved? Yes, global lookups are slow. But so are function calls. And whatever you're actually going to do in the function is almost surely a lot slower. And even if everything were blazingly fast, the branch prediction failure on half the calls to spam would probably be much more costly than an access that almost always hits the cache.

Accessing a global inside a loop over 1000000 elements may be worth optimizing away, but here?

This micro-optimization used to be fairly common in early large Python apps—the Zope framework uses it all over the place. People also used to do things like pushing unbound methods as default values and then passing the self explicitly to avoid the attribute lookup and descriptor call. But as people have actually learned to profile Python code over the past couple decades (and as Python has improved, and CPUs have gotten more complicated…), it's become a lot less common, because it almost never provides any measurable benefit. So it probably won't help you here.

This also solves the collision problem, and allows you to solve the visibility problem by just doing del _sentinel after the function definition. But neither of those is really a problem either, as explained above.

And the cost is that it's less clear that, while eggs is an optional parameter, _sentinel is a "never pass this" parameter. The underscore helps, but this idiom isn't as widely known by programmers, or as widely supported by tools, as the usual uses of the underscore.

Conclusion

When you're worried that a value leaks into the enclosing scope, all of the real problems can be solved by just underscore-prefixing the name and leaving it out of __all__, and the other problems rarely need to be solved.
2

View comments

It's been more than a decade since Typical Programmer Greg Jorgensen taught the word about Abject-Oriented Programming.

Much of what he said still applies, but other things have changed.

5

I haven't posted anything new in a couple years (partly because I attempted to move to a different blogging platform where I could write everything in markdown instead of HTML but got frustrated—which I may attempt again), but I've had a few private comments and emails on some of the old posts, so I

6

Looking before you leap

Python is a duck-typed language, and one where you usually trust EAFP ("Easier to Ask Forgiveness than Permission") over LBYL ("Look Before You Leap").

1

Background

Currently, CPython’s internal bytecode format stores instructions with no args as 1 byte, instructions with small args as 3 bytes, and instructions with large args as 6 bytes (actually, a 3-byte EXTENDED_ARG followed by a 3-byte real instruction).

6

If you want to skip all the tl;dr and cut to the chase, jump to Concrete Proposal.

8

Many people, when they first discover the heapq module, have two questions:

Why does it define a bunch of functions instead of a container type? Why don't those functions take a key or reverse parameter, like all the other sorting-related stuff in Python? Why not a type?

At the abstract level, it'

1

Currently, in CPython, if you want to process bytecode, either in C or in Python, it’s pretty complicated.

The built-in peephole optimizer has to do extra work fixing up jump targets and the line-number table, and just punts on many cases because they’re too hard to deal with.

3

One common "advanced question" on places like StackOverflow and python-list is "how do I dynamically create a function/method/class/whatever"? The standard answer is: first, some caveats about why you probably don't want to do that, and then an explanation of the various ways to do it when you reall

1

A few years ago, Cesare di Mauro created a project called WPython, a fork of CPython 2.6.4 that “brings many optimizations and refactorings”. The starting point of the project was replacing the bytecode with “wordcode”. However, there were a number of other changes on top of it.

1

Many languages have a for-each loop.

4

When the first betas for Swift came out, I was impressed by their collection design. In particular, the way it allows them to write map-style functions that are lazy (like Python 3), but still as full-featured as possible.

2

In a previous post, I explained in detail how lookup works in Python.

2

The documentation does a great job explaining how things normally get looked up, and how you can hook them.

But to understand how the hooking works, you need to go under the covers to see how that normal lookup actually happens.

When I say "Python" below, I'm mostly talking about CPython 3.5.

7

In Python (I'm mostly talking about CPython here, but other implementations do similar things), when you write the following:

def spam(x): return x+1 spam(3) What happens?

Really, it's not that complicated, but there's no documentation anywhere that puts it all together.

2

I've seen a number of people ask why, if you can have arbitrary-sized integers that do everything exactly, you can't do the same thing with floats, avoiding all the rounding problems that they keep running into.

2

In a recent thread on python-ideas, Stephan Sahm suggested, in effect, changing the method resolution order (MRO) from C3-linearization to a simple depth-first search a la old-school Python or C++.

1

Note: This post doesn't talk about Python that much, except as a point of comparison for JavaScript.

Most object-oriented languages out there, including Python, are class-based. But JavaScript is instead prototype-based.

1

About a year and a half ago, I wrote a blog post on the idea of adding pattern matching to Python.

I finally got around to playing with Scala semi-seriously, and I realized that they pretty much solved the same problem, in a pretty similar way to my straw man proposal, and it works great.

About a year ago, Jules Jacobs wrote a series (part 1 and part 2, with part 3 still forthcoming) on the best collections library design.

1

In three separate discussions on the Python mailing lists this month, people have objected to some design because it leaks something into the enclosing scope. But "leaks into the enclosing scope" isn't a real problem.

2

There's a lot of confusion about what the various kinds of things you can iterate over in Python. I'll attempt to collect definitions for all of the relevant terms, and provide examples, here, so I don't have to go over the same discussions in the same circles every time.

8

Python has a whole hierarchy of collection-related abstract types, described in the collections.abc module in the standard library. But there are two key, prototypical kinds. Iterators are one-shot, used for a single forward traversal, and usually lazy, generating each value on the fly as requested.

2

There are a lot of novice questions on optimizing NumPy code on StackOverflow, that make a lot of the same mistakes. I'll try to cover them all here.

What does NumPy speed up?

Let's look at some Python code that does some computation element-wise on two lists of lists.

2

When asyncio was first proposed, many people (not so much on python-ideas, where Guido first suggested it, but on external blogs) had the same reaction: Doing the core reactor loop in Python is going to be way too slow. Something based on libev, like gevent, is inherently going to be much faster.

Let's say you have a good idea for a change to Python.

1

There are hundreds of questions on StackOverflow that all ask variations of the same thing. Paraphrasing:

lst is a list of strings and numbers. I want to convert the numbers to int but leave the strings alone.

2

In Haskell, you can section infix operators. This is a simple form of partial evaluation. Using Python syntax, the following are equivalent:

(2*) lambda x: 2*x (*2) lambda x: x*2 (*) lambda x, y: x*y So, can we do the same in Python?

Grammar

The first form, (2*), is unambiguous.

1

Many people—especially people coming from Java—think that using try/except is "inelegant", or "inefficient". Or, slightly less meaninglessly, they think that "exceptions should only be for errors, not for normal flow control".

These people are not going to be happy with Python.

2

If you look at Python tutorials and sample code, proposals for new language features, blogs like this one, talks at PyCon, etc., you'll see spam, eggs, gouda, etc. all over the place.

Most control structures in most most programming languages, including Python, are subordinating conjunctions, like "if", "while", and "except", although "with" is a preposition, and "for" is a preposition used strangely (although not as strangely as in C…).

There are two ways that some Python programmers overuse lambda. Doing this almost always mkes your code less readable, and for no corresponding benefit.

1

Some languages have a very strong idiomatic style—in Python, Haskell, or Swift, the same code by two different programmers is likely to look a lot more similar than in Perl, Lisp, or C++.

There's an advantage to this—and, in particular, an advantage to you sticking to those idioms.

1

Python doesn't have a way to clone generators.

At least for a lot of simple cases, however, it's pretty obvious what cloning them should do, and being able to do so would be handy. But for a lot of other cases, it's not at all obvious.

5

Every time someone has a good idea, they believe it should be in the stdlib. After all, it's useful to many people, and what's the harm? But of course there is a harm.

3

This confuses every Python developer the first time they see it—even if they're pretty experienced by the time they see it:

>>> t = ([], []) >>> t[0] += [1] --------------------------------------------------------------------------- TypeError Traceback (most recent call last) <stdin> in <module>()

11
Blog Archive
About Me
About Me
Loading
Dynamic Views theme. Powered by Blogger. Report Abuse.