diff options
| author | slateny <46876382+slateny@users.noreply.github.com> | 2022-04-30 22:12:33 (GMT) |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-04-30 22:12:33 (GMT) |
| commit | efb87b1090a21e1be8f5f4928349eb742fd17f4c (patch) | |
| tree | d52934b92d90285a4766744f5c8ead3aa120347b /Doc/tutorial | |
| parent | 2b97d7f6dfb025c6ab8b522c26f07c621707731c (diff) | |
| download | cpython-efb87b1090a21e1be8f5f4928349eb742fd17f4c.zip cpython-efb87b1090a21e1be8f5f4928349eb742fd17f4c.tar.gz cpython-efb87b1090a21e1be8f5f4928349eb742fd17f4c.tar.bz2 | |
gh-85757: Change wording from nested to inner (GH-91811)
#85757
https://docs.python.org/3/tutorial/datastructures.html#nested-list-comprehensions
I do think this is clearer, but I wonder if 'nested' should be kept though to get the terminology out there more often. So perhaps it could be something like 'inner (nested) listcomp' or 'nested (inner) listcomp' despite sounding a bit redundant
Automerge-Triggered-By: GH:rhettinger
Diffstat (limited to 'Doc/tutorial')
| -rw-r--r-- | Doc/tutorial/datastructures.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst index 927a672..f847ee3 100644 --- a/Doc/tutorial/datastructures.rst +++ b/Doc/tutorial/datastructures.rst @@ -303,7 +303,7 @@ The following list comprehension will transpose rows and columns:: >>> [[row[i] for row in matrix] for i in range(4)] [[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]] -As we saw in the previous section, the nested listcomp is evaluated in +As we saw in the previous section, the inner list comprehension is evaluated in the context of the :keyword:`for` that follows it, so this example is equivalent to:: |