mirror of
https://github.com/python/cpython.git
synced 2025-12-15 21:44:50 +00:00
Typo fix; add clarifying word
This commit is contained in:
parent
3e3cb7904b
commit
e04fe8c62e
1 changed files with 2 additions and 2 deletions
|
|
@ -330,7 +330,7 @@ List comprehensions have the form:
|
|||
[ expression for expr in sequence1
|
||||
for expr2 in sequence2 ...
|
||||
for exprN in sequenceN
|
||||
if condition
|
||||
if condition ]
|
||||
\end{verbatim}
|
||||
|
||||
The \keyword{for}...\keyword{in} clauses contain the sequences to be
|
||||
|
|
@ -356,7 +356,7 @@ for expr1 in sequence1:
|
|||
# resulting list.
|
||||
\end{verbatim}
|
||||
|
||||
This means that when there are \keyword{for}...\keyword{in} clauses,
|
||||
This means that when there are multiple \keyword{for}...\keyword{in} clauses,
|
||||
the resulting list will be equal to the product of the lengths of all
|
||||
the sequences. If you have two lists of length 3, the output list is
|
||||
9 elements long:
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue