Python: Declarative programming
2026-02-21 02:53 Diff
https://hexlet.io/courses/python-declarative-programming/lessons/generator-expressions/theory_unit

Dictionaries and sets help a lot when the information about elements is complete. It makes sense with incomplete sets or dictionaries because we cannot check for values or keys in other ways.

The situation is different with lists. A list is a sequence of items, so we need only traverse it once. And sometimes, you don't even need to go to the end of the list, for example, if we're looking for one specific item. It's important to remember that map and filter don't generate lists but generate new iterators based on iterator arguments instead.

Iterator-based data pipelines are efficient because they do nothing until the receiver party needs their result at the pipeline output. It is especially true when we combine them with functions from the itertools module.

List generators have another important feature — they create the whole list one way or another, even if they do not need all items from the list. Usually, you can interrupt the loop using break but cannot interrupt the list generator. Besides, it wouldn't look declarative. However, Python knows how to use iterator laziness in declarative code.

Generator expressions

We said above that sometimes sequences don't need to be computed. We'll also add that you seldom need to get and keep finished lists.

In those rare cases where you need a list, you can use list generators. But most problems are solved with generator expressions. They look like list generators. The only difference is they use round brackets instead of square brackets:

As you can see, the result of calculating the second expression isn't a list but a generator object. We use it to postpone computing the elements of a sequence until we need them.

The generator objects are essentially iterators, so we cannot traverse them more than once:

Here __iter__ is called for the iterator each time, but the iterator returns itself instead of the new iterator. The program computes and uses elements but does not save them anywhere.

Brackets

You can often find a generator expression in a place in the code where the interpreter can unambiguously understand the boundaries of that expression.

The most common example is a generic expression as a single-function argument:

In these cases, we can omit the parentheses around expressions and tuples if it doesn't interfere with the code readability. This elimination of unnecessary brackets often makes the code even more concise:

We can translate this code as follows:

Is any X greater than a hundred among all Xs between zero and a million?

The program will compute this expression instantly and check the numbers one at a time. Suppose we used any([… for …]). In this case, Python would also look for the first True value in the list, but it would first build a list of a million elements in memory.

Generator expressions in coding

Try to use generator expressions wherever possible. Almost any function working with sequences in one form or another can use generator objects.

Even when calling a function for a bunch of arguments, it's better to use a generator expression:

And it is worth using generator expressions in the middle of list, set, and dict dict expressions, as well as among generator expressions and map or filter-based pipelines. Previously, Python only had list generators and generator expressions. We construct sets and dictionaries this way:

Here, the generator expression creates elements one at a time. The set() and dict() functions take iterator elements one at a time and insert them in the right places. It is already quite an effective method. We used separate syntax constructs for set and dictionary generators to increase the expressiveness of the code.